Advances in Petri nets 1986, part I on Petri nets: central models and their properties
Workflow management: models, methods, and systems
Workflow management: models, methods, and systems
Principles of High-Level Net Theory
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
An Introduction to the Theoretical Aspects of Coloured Petri Nets
A Decade of Concurrency, Reflections and Perspectives, REX School/Symposium
Proper termination of flow-of-control in programs involving concurrent processes
ACM SIGPLAN Notices - Special issue on control structures in programming languages
Translating unstructured workflow processes to readable BPEL: Theory and implementation
Information and Software Technology
A simplified framework for stochastic workflow networks
Computers & Mathematics with Applications
Complexity metrics for Workflow nets
Information and Software Technology
Safe distribution of declarative processes
SEFM'11 Proceedings of the 9th international conference on Software engineering and formal methods
Declarative modelling and safe distribution of healthcare workflows
FHIES'11 Proceedings of the First international conference on Foundations of Health Informatics Engineering and Systems
Business process architecture: use and correctness
BPM'12 Proceedings of the 10th international conference on Business Process Management
Analyzing business process architectures
CAiSE'13 Proceedings of the 25th international conference on Advanced Information Systems Engineering
| Hi-index | 0.00 |
We address cross-organizational workflows, such as document workflows, which consist of multiple workflow modules each of which can interact with others by sending and receiving messages. Our goal is to guarantee that the global workflow network has properties such as termination while merely requiring properties that can be checked locally in individual modules. The resulting query nets are based on predicate/transition Petri nets and implement formal constructs for business rules, thereby ensuring such global termination. Our method does not require the notion of a global specification, as employed by Kindler, Martens and Reisig.