Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Bisimulation and action refinement
Selected papers of the 3rd workshop on Concurrency and compositionality
Handbook of logic in computer science (vol. 4)
Communication and Concurrency
Equivalence Notions for Concurrent Systems and Refinement of Actions (Extended Abstract)
MFCS '89 Proceedings on Mathematical Foundations of Computer Science 1989
ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
The box calculus: a new causal algebra with multi-label communication
Advances in Petri Nets 1992, The DEMON Project
Hi-index | 0.00 |
Workflow processes are represented as Petri nets with special entry and exit places and labeled transitions. The transition labels represent actions. We give a semantics for such nets in terms of transition systems. This allows us to describe and verify properties like termination: the guaranteed option to terminate successfully. We describe the composition of complex WF nets from simpler ones by means of certain operators. The simple operators preserve termination, giving correctness by design. Only the advanced communication operators are potentially dangerous. A strategy for verification of other properties is described.