Modeling concurrency with partial orders
International Journal of Parallel Programming
On the interrelation between synchronized and non-synchronized behaviour of Petri Nets
Journal of Information Processing and Cybernetics
A new approach to the maximum-flow problem
Journal of the ACM (JACM)
Improved time bounds for the maximum flow problem
SIAM Journal on Computing
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Finding minimum-cost flows by double scaling
Mathematical Programming: Series A and B
Information and Computation
Beyond the flow decomposition barrier
Journal of the ACM (JACM)
Process semantics for place/transition nets with inhibitor and read arcs
Fundamenta Informaticae - Special issue prepared in tribute to Peter Ernst on the occasion of his retirement
Implementing LTL model checking with net unfoldings
SPIN '01 Proceedings of the 8th international SPIN workshop on Model checking of software
Workflow management: models, methods, and systems
Workflow management: models, methods, and systems
Petri Net Theory and the Modeling of Systems
Petri Net Theory and the Modeling of Systems
Modular Construction and Partial Order Semantics of Petri Nets
Modular Construction and Partial Order Semantics of Petri Nets
Invariants and Paradigms of Concurrency Theory
PARLE '91 Proceedings of Parallel Architectures and Languages - Volume II
Modelling and Analysis of Distributed Software Using GSPNs
Lectures on Petri Nets II: Applications, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Non Sequential Semantics for Contextual P/T Nets
Proceedings of the 17th International Conference on Application and Theory of Petri Nets
The semantics of capacities in P/T nets
Advances in Petri Nets 1989, covers the 9th European Workshop on Applications and Theory in Petri Nets-selected papers
Legal Firing Sequence and Related Problems of Petri Nets
PNPM '89 The Proceedings of the Third International Workshop on Petri Nets and Performance Models
Process semantics of general inhibitor nets
Information and Computation
Graphs, Networks and Algorithms (Algorithms and Computation in Mathematics)
Graphs, Networks and Algorithms (Algorithms and Computation in Mathematics)
Comparing Truly Concurrent Semantics for Contextual Place/Transition Nets
Fundamenta Informaticae
Testing the executability of scenarios in general inhibitor nets
ACSD '07 Proceedings of the Seventh International Conference on Application of Concurrency to System Design
Modeling and Model Checking Web Services
Electronic Notes in Theoretical Computer Science (ENTCS)
ICATPN'03 Proceedings of the 24th international conference on Applications and theory of Petri nets
Complete process semantics for inhibitor nets
ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
Can i execute my scenario in your net?
ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets
Unifying Petri Net Semantics with Token Flows
PETRI NETS '09 Proceedings of the 30th International Conference on Applications and Theory of Petri Nets
How much is worth to remember? a taxonomy based on petri nets unfoldings
PETRI NETS'11 Proceedings of the 32nd international conference on Applications and theory of Petri Nets
Canonizable partial order generators
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Hi-index | 5.23 |
In this paper, we show that it can be tested in polynomial time as to whether a scenario is an execution of a Petri net. This holds for a wide variety of Petri net classes, ranging from elementary nets to general inhibitor nets. Scenarios are given by causal structures expressing causal dependencies and concurrency among events. In the case of elementary nets and of place/transition nets, such causal structures are partial orders among transition occurrences. For several extended Petri net classes, the extension of partial orders to stratified order structures is considered. The algorithms are based on the representation of the non-sequential behavior of Petri nets by so-called token flow functions and a characterization of Petri net executions called token flow property. This property allows nontrivial transformations into flow optimization problems, which can be solved in polynomial time. The paper is a revised, consolidated and extended version of the conference papers [G. Juhas, R. Lorenz, J. Desel, Can I execute my scenario in your net?, in: G. Ciardo, P. Darondeau (Eds.), ICATPN, in: Lecture Notes in Computer Science, Springer, 2005, pp. 289-308; R. Lorenz, S. Mauser, R. Bergenthum, Testing the Executability of Scenarios in General Inhibitor Nets, in: ACSD, IEEE Computer Society, 2007, pp. 167-176] and includes parts of the habilitation thesis [R. Lorenz, Szenario-basierte Verifikation und Synthese von Perinetzen: Theorie und Anwendungen, Habilitation, 2006].