ORCID Profile
0000-0002-7672-1643
Current Organisation
University of Melbourne
Does something not look right? The information on this page has been harvested from data sources that may not be up to date. We continue to work with information providers to improve coverage and quality. To report an issue, use the Feedback Form.
In Research Link Australia (RLA), "Research Topics" refer to ANZSRC FOR and SEO codes. These topics are either sourced from ANZSRC FOR and SEO codes listed in researchers' related grants or generated by a large language model (LLM) based on their publications.
Information Systems | Information Systems Development Methodologies | Simulation and Modelling | Artificial Intelligence and Image Processing | Information Engineering and Theory | Bioprocessing, Bioproduction and Bioproducts | Pattern Recognition and Data Mining | Computer System Security | Interorganisational Information Systems and Web Services
Computer Software and Services not elsewhere classified | Human Pharmaceutical Treatments (e.g. Antibiotics) | Application Software Packages (excl. Computer Games) | Application Tools and System Utilities | Expanding Knowledge in the Information and Computing Sciences | Human Biological Preventatives (e.g. Vaccines) |
Publisher: Springer International Publishing
Date: 2021
Publisher: Springer International Publishing
Date: 2021
Publisher: Springer International Publishing
Date: 2020
Publisher: Springer Berlin Heidelberg
Date: 2010
Publisher: Springer International Publishing
Date: 2016
Publisher: Elsevier BV
Date: 09-2012
Publisher: Elsevier BV
Date: 10-2023
Publisher: Springer Berlin Heidelberg
Date: 2010
Publisher: Elsevier BV
Date: 08-2012
Publisher: Springer Science and Business Media LLC
Date: 15-05-2018
Publisher: Springer Nature Switzerland
Date: 2023
Publisher: Springer International Publishing
Date: 2012
Publisher: Springer Berlin Heidelberg
Date: 2010
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2021
Publisher: Springer International Publishing
Date: 2019
Publisher: Springer Berlin Heidelberg
Date: 2010
Publisher: Springer International Publishing
Date: 2019
Publisher: Springer International Publishing
Date: 2019
Publisher: Association for Computing Machinery (ACM)
Date: 06-2020
DOI: 10.1145/3387909
Abstract: The behavioural comparison of systems is an important concern of software engineering research. For ex le, the areas of specification discovery and specification mining are concerned with measuring the consistency between a collection of execution traces and a program specification. This problem is also tackled in process mining with the help of measures that describe the quality of a process specification automatically discovered from execution logs. Though various measures have been proposed, it was recently demonstrated that they neither fulfil essential properties, such as monotonicity , nor can they handle infinite behaviour. In this article, we address this research problem by introducing a new framework for the definition of behavioural quotients. We prove that corresponding quotients guarantee desired properties that existing measures have failed to support. We demonstrate the application of the quotients for capturing precision and recall measures between a collection of recorded executions and a system specification. We use a prototypical implementation of these measures to contrast their monotonic assessment with measures that have been defined in prior research.
Publisher: Association for Computing Machinery (ACM)
Date: 07-2016
DOI: 10.1007/S00165-016-0372-4
Abstract: Behavioral profiles have been proposed as a behavioral abstraction of dynamic systems, specifically in the context of business process modeling. A behavioral profile can be seen as a complete graph over a set of task labels, where each edge is annotated with one relation from a given set of binary behavioral relations. Since their introduction, behavioral profiles were argued to provide a convenient way for comparing pairs of process models with respect to their behavior or computing behavioral similarity between process models. Still, as of today, there is little understanding of the expressive power of behavioral profiles. Via counter-ex les, several authors have shown that behavioral profiles over various sets of behavioral relations cannot distinguish certain systems up to trace equivalence, even for restricted classes of systems represented as safe workflow nets. This paper studies the expressive power of behavioral profiles from two angles. Firstly, the paper investigates the expressive power of behavioral profiles and systems captured as acyclic workflow nets. It is shown that for unlabeled acyclic workflow net systems, behavioral profiles over a simple set of behavioral relations are expressive up to configuration equivalence. When systems are labeled, this result does not hold for any of several previously proposed sets of behavioral relations. Secondly, the paper compares the expressive power of behavioral profiles and regular languages. It is shown that for any set of behavioral relations, behavioral profiles are strictly less expressive than regular languages, entailing that behavioral profiles cannot be used to decide trace equivalence of finite automata and thus Petri nets.
Publisher: Springer Berlin Heidelberg
Date: 2009
Publisher: Springer Berlin Heidelberg
Date: 2010
Publisher: Springer Berlin Heidelberg
Date: 2008
Publisher: Springer International Publishing
Date: 2020
Publisher: Elsevier BV
Date: 07-2022
Publisher: Elsevier BV
Date: 12-2021
Publisher: Association for Computing Machinery (ACM)
Date: 11-2015
DOI: 10.1007/S00165-014-0329-4
Abstract: Substantial research efforts have been expended to deal with the complexity of concurrent systems that is inherent to their analysis, e.g., works that tackle the well-known state space explosion problem. Approaches differ in the classes of properties that they are able to suitably check and this is largely a result of the way they balance the trade-off between analysis time and space employed to describe a concurrent system. One interesting class of properties is concerned with behavioral characteristics. These properties are conveniently expressed in terms of computations, or runs , in concurrent systems. This article introduces the theory of untanglings that exploits a particular representation of a collection of runs in a concurrent system. It is shown that a representative untangling of a bounded concurrent system can be constructed that captures all and only the behavior of the system. Representative untanglings strike a unique balance between time and space, yet provide a single model for the convenient extraction of various behavioral properties. Performance measurements in terms of construction time and size of representative untanglings with respect to the original specifications of concurrent systems, conducted on a collection of models from practice, confirm the scalability of the approach. Finally, this article demonstrates practical benefits of using representative untanglings when checking various behavioral properties of concurrent systems.
Publisher: Springer International Publishing
Date: 2016
Publisher: Elsevier BV
Date: 05-2022
Publisher: Springer International Publishing
Date: 2021
Publisher: Springer Berlin Heidelberg
Date: 2013
Publisher: Springer Science and Business Media LLC
Date: 29-06-2011
Publisher: Elsevier BV
Date: 11-2011
Publisher: Springer International Publishing
Date: 2014
Publisher: Springer US
Date: 2011
Publisher: IEEE
Date: 09-2008
DOI: 10.1109/EDOC.2008.17
Publisher: Springer Berlin Heidelberg
Date: 2012
Publisher: Springer International Publishing
Date: 2018
Publisher: Springer Berlin Heidelberg
Date: 2010
Publisher: Springer International Publishing
Date: 2020
Publisher: IEEE
Date: 09-2008
DOI: 10.1109/EDOC.2008.11
Publisher: Springer International Publishing
Date: 2018
Publisher: Springer Science and Business Media LLC
Date: 24-03-2020
DOI: 10.1007/S12599-020-00641-4
Abstract: Robotic process automation (RPA) is an emerging technology that allows organizations automating repetitive clerical tasks by executing scripts that encode sequences of fine-grained interactions with Web and desktop applications. Ex les of clerical tasks include opening a file, selecting a field in a Web form or a cell in a spreadsheet, and copy-pasting data across fields or cells. Given that RPA can automate a wide range of routines, this raises the question of which routines should be automated in the first place. This paper presents a vision towards a family of techniques, termed robotic process mining (RPM), aimed at filling this gap. The core idea of RPM is that repetitive routines amenable for automation can be discovered from logs of interactions between workers and Web and desktop applications, also known as user interactions (UI) logs. The paper defines a set of basic concepts underpinning RPM and presents a pipeline of processing steps that would allow an RPM tool to generate RPA scripts from UI logs. The paper also discusses research challenges to realize the envisioned pipeline.
Publisher: Elsevier BV
Date: 07-2022
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 08-2014
Publisher: Springer Berlin Heidelberg
Date: 2010
Publisher: Springer International Publishing
Date: 2020
Publisher: IEEE
Date: 06-2019
Publisher: Springer International Publishing
Date: 2018
Publisher: IEEE
Date: 10-2020
Publisher: Oxford University Press (OUP)
Date: 19-09-2012
Publisher: Springer International Publishing
Date: 2014
Publisher: Elsevier BV
Date: 08-2017
Publisher: Springer International Publishing
Date: 2020
Publisher: Elsevier BV
Date: 11-2020
Publisher: IEEE
Date: 10-2020
Publisher: Springer International Publishing
Date: 2020
Publisher: IEEE
Date: 10-2020
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2022
Publisher: Elsevier BV
Date: 10-2019
Publisher: Association for Computing Machinery (ACM)
Date: 12-10-2016
DOI: 10.1145/2980764
Abstract: The abundance of event data in today’s information systems makes it possible to “confront” process models with the actual observed behavior. Process mining techniques use event logs to discover process models that describe the observed behavior, and to check conformance of process models by diagnosing deviations between models and reality. In many situations, it is desirable to mediate between a preexisting model and observed behavior. Hence, we would like to repair the model while improving the correspondence between model and log as much as possible. The approach presented in this article assigns predefined costs to repair actions (allowing inserting or skipping of activities). Given a maximum degree of change, we search for models that are optimal in terms of fitness—that is, the fraction of behavior in the log not possible according to the model is minimized. To compute fitness, we need to align the model and log, which can be time consuming. Hence, finding an optimal repair may be intractable. We propose different alternative approaches to speed up repair. The number of alignment computations can be reduced dramatically while still returning near-optimal repairs. The different approaches have been implemented using the process mining framework ProM and evaluated using real-life logs.
Publisher: Springer International Publishing
Date: 2018
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 08-2022
Publisher: Springer Berlin Heidelberg
Date: 2009
Publisher: Elsevier BV
Date: 03-2020
Publisher: Springer Berlin Heidelberg
Date: 11-04-2014
Publisher: Springer International Publishing
Date: 2013
Publisher: Springer Berlin Heidelberg
Date: 2009
Publisher: Springer International Publishing
Date: 2019
Publisher: Springer Berlin Heidelberg
Date: 2011
Publisher: Elsevier BV
Date: 05-2023
Publisher: Springer Berlin Heidelberg
Date: 2011
Publisher: Springer International Publishing
Date: 2019
Publisher: Springer International Publishing
Date: 2022
Start Date: 2018
End Date: 2020
Funder: Australian Research Council
View Funded ActivityStart Date: 07-2022
End Date: 07-2027
Amount: $5,000,000.00
Funder: Australian Research Council
View Funded ActivityStart Date: 05-2018
End Date: 12-2023
Amount: $377,784.00
Funder: Australian Research Council
View Funded ActivityStart Date: 01-2023
End Date: 01-2026
Amount: $480,000.00
Funder: Australian Research Council
View Funded Activity