Modeling concurrency with partial orders
International Journal of Parallel Programming
Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
Sequential and concurrent behaviour in Petri net theory
Theoretical Computer Science
On the interrelation between synchronized and non-synchronized behaviour of Petri Nets
Journal of Information Processing and Cybernetics
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Theoretical Computer Science
A technique of state space search based on unfolding
Formal Methods in System Design - Special issue on computer-aided verification (based on CAV'92 workshop)
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
An Improvement of McMillan's Unfolding Algorithm
Formal Methods in System Design
Processes of Place/Transition-Nets
Proceedings of the 10th Colloquium on Automata, Languages and Programming
Place or Transition Petri Nets
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Unifying Petri Nets, Advances in Petri Nets
Testing the executability of scenarios in general inhibitor nets
ACSD '07 Proceedings of the Seventh International Conference on Application of Concurrency to System Design
Faster Unfolding of General Petri Nets Based on Token Flows
PETRI NETS '08 Proceedings of the 29th international conference on Applications and Theory of Petri Nets
Synthesis of Petri Nets from Finite Partial Languages
Fundamenta Informaticae - Application of Concurrency to System Design, the Sixth Special Issue
Synthesis of Petri Nets from Term Based Representations of Infinite Partial Languages
Fundamenta Informaticae - Application of Concurrency to System Design
Unfolding Semantics of Petri Nets Based on Token Flows
Fundamenta Informaticae - Petri Nets 2008
Comparison of Different Algorithms to Synthesize a Petri Net from a Partial Language
Transactions on Petri Nets and Other Models of Concurrency III
Modelling and validation with VipTool
BPM'03 Proceedings of the 2003 international conference on Business process management
Hasse Diagram Generators and Petri Nets
Fundamenta Informaticae - Applications and Theory of Petri Nets and Other Models of Concurrency, 2009
Can i execute my scenario in your net? viptool tells you!
ICATPN'06 Proceedings of the 27th 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
Process mining from a basis of state regions
PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
| Hi-index | 0.00 |
In this paper we tackle the problem of verifying whether a labeled partial order (LPO) is executable in a Petri net. In contrast to sequentially ordered runs an LPO includes both, information about dependencies and independencies of events. Consequently an LPO allows a precise and intuitive specification of the behavior of a concurrent or distributed system. In this paper we consider Petri nets with arc weights, namely marked place/transition-nets (p/t-nets). Accordingly the question is whether a given LPO is an execution of a given p/t-net. Different approaches exist to define the partial language (i.e. the set of executions) of a p/t-net. Each definition yields a different verification algorithm, but in terms of runtime all these algorithms perform quite poorly for most examples. In this paper a new compact characterization of the partial language of a p/t-net will be introduced, optimized with respect to the verification problem. The goal is to develop an algorithm to efficiently decide the verification problem.