Petri Nets–An Introduction [63] is a slim book that was published almost 30 years ago and was quickly translated into six languages and sold several thousand copies. For a long time …
This paper surveys various notions of equivalence for concurrent systems in the framework of Elementary Net Systems, a fundamental class in the family of Petri Net models. Two types …
Dynamic properties characterize the behaviour of individual CP-nets, eg, whether it is possible to reach a marking in which no step is enabled. It is often rather difficult to verify …
The notion of a branching process is introduced, as a formalization of an initial part of a run of a Petri net, including nondeterministic choices. This generalizes the notion of a process in …
F Leymann, D Roller, MT Schmidt - IBM systems Journal, 2002 - ieeexplore.ieee.org
Web services based on the service-oriented architecture framework provide a suitable technical foundation for making business processes accessible within enterprises and …
J Esparza, S Römer, W Vogler - Formal Methods in System Design, 2002 - Springer
McMillan has recently proposed a new technique to avoid the state explosion problem in the verification of systems modelled with finite-state Petri nets. The technique requires to …
Model checking is a prominent technique used in the hardware and software industries for automatic verification. While it is very successful in finding subtle bugs in distributed …
F Leymann, W Altenhuber - IBM systems journal, 1994 - ieeexplore.ieee.org
The relevance of business processes as a major asset of an enterprise is more and more accepted: Business processes prescribe the way in which the resources of an enterprise are …
We study the complexity of several standard problems for 1-safe Petri nets and some of its subclasses. We prove that reachability, liveness, and deadlock are all PSPACE-complete for …