Petri Net Transformations for Business Processes – A Survey

Lohmann, Niels; Verbeek, Eric; Dijkman, Remco

doi:10.1007/978-3-642-00899-3_3

Cited by 131 publications

(50 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore, we utilize Petri nets [24], a well established formalism to verify various properties of process models [28]. Most existing process description languages can be transformed into Petri nets; [16] gives an overview. One such mapping was introduced by Dijkman et al [5] for BPMN 1.0 whose modeling constructs with respect to control flow are a superset of the ones presented in Definition 1 allowing to generalize that mapping.…”

Section: Mapping a Process Model With Data Constraints To A Petri Netmentioning

confidence: 99%

Weak Conformance between Process Models and Synchronized Object Life Cycles

Meyer

Weske

2014

Service-Oriented Computing

View full text Add to dashboard Cite

Bibliografische Information der Deutschen NationalbibliothekDie Deutsche Nationalbibliothek verzeichnet diese Publikation in der Deutschen Nationalbibliografie; detaillierte bibliografische Daten sind im Internet über http://dnb.dnb.de/ abrufbar. Process models specify behavioral execution constraints between activities as well as between activities and data objects. A data object is characterized by its states and state transitions represented as object life cycle. For process execution, all behavioral execution constraints must be correct. Correctness can be verified via soundness checking which currently only considers control flow information. For data correctness, conformance between a process model and its object life cycles is checked. Current approaches abstract from dependencies between multiple data objects and require fully specified process models although, in real-world process repositories, often underspecified models are found. Coping with these issues, we introduce the concept of synchronized object life cycles and we define a mapping of data constraints of a process model to Petri nets extending an existing mapping. Further, we apply the notion of weak conformance to process models to tell whether each time an activity needs to access a data object in a particular state, it is guaranteed that the data object is in or can reach the expected state. Then, we introduce an algorithm for an integrated verification of control flow correctness and weak data conformance using soundness checking. Universitätsverlag 5

show abstract

Section: Mapping a Process Model With Data Constraints To A Petri Netmentioning

confidence: 99%

Weak Conformance between Process Models and Synchronized Object Life Cycles

Meyer

Weske

2014

Service-Oriented Computing

View full text Add to dashboard Cite

show abstract

“…Business process modeling notation (BPMN) and Event-Driven process chains (EPCs), lack proper semantics which often leads to debates on how to interpret business process models (Lohmann et al, 2009). Such situations may result in misunderstanding an enterprise's business processes in relation to its different functions and cause potential internal control deficiencies.…”

Section: Unstructured Business Policies and Challenges For The Enterpmentioning

confidence: 99%

A Defeasible Logic Programming-Based Framework to Support Argumentation in Semantic Web Applications

Janjua¹

2014

Springer Theses

View full text Add to dashboard Cite

“…For many high-level process modeling languages, including WS-BPEL and BPMN, there exist mappings to the Petri net formalism [14]. The benefits of such mappings are twofold: (i) rigorous definition of an execution semantics of a high-level language, and (ii) reuse of the mathematical theory of Petri nets for analysis of process models.…”

Section: Petri Nets and Net Systemsmentioning

confidence: 99%

Indexing and Efficient Instance-Based Retrieval of Process Models Using Untanglings

Polyvyanyy

Rosa

Hofstede

2014

Advanced Information Systems Engineering

View full text Add to dashboard Cite

Abstract. Process-Aware Information Systems (PAISs) support executions of operational processes that involve people, resources, and software applications on the basis of process models. Process models describe vast, often infinite, amounts of process instances, i.e., workflows supported by the systems. With the increasing adoption of PAISs, large process model repositories emerged in companies and public organizations. These repositories constitute significant information resources. Accurate and efficient retrieval of process models and/or process instances from such repositories is interesting for multiple reasons, e.g., searching for similar models/instances, filtering, reuse, standardization, process compliance checking, verification of formal properties, etc. This paper proposes a technique for indexing process models that relies on their alternative representations, called untanglings. We show the use of untanglings for retrieval of process models based on process instances that they specify via a solution to the total executability problem. Experiments with industrial process models testify that the proposed retrieval approach is up to three orders of magnitude faster than the state of the art.

show abstract

Petri Net Transformations for Business Processes – A Survey

Cited by 131 publications

References 26 publications

Weak Conformance between Process Models and Synchronized Object Life Cycles

Weak Conformance between Process Models and Synchronized Object Life Cycles

A Defeasible Logic Programming-Based Framework to Support Argumentation in Semantic Web Applications

Indexing and Efficient Instance-Based Retrieval of Process Models Using Untanglings

Contact Info

Product

Resources

About