Petri nets: an introduction
Efficient Discrete-Event Simulation of Colored Petri Nets
IEEE Transactions on Software Engineering - Special issue: best papers of the sixth international workshop on Petri nets and performance models (PNPM'95)
A symbolic simulation mechanism for well-formed coloured Petri nets
ANSS '92 Proceedings of the 25th annual symposium on Simulation
Symbolic Logic and Mechanical Theorem Proving
Symbolic Logic and Mechanical Theorem Proving
The Analysis of Distributed Systems by Means of Predicate ? Transition-Nets
Proceedings of the International Sympoisum on Semantics of Concurrent Computation
ICATPN '98 Proceedings of the 19th International Conference on Application and Theory of Petri Nets
On Well-Formed Nets and Optimizations in Enabling Tests
Proceedings of the 14th International Conference on Application and Theory of Petri Nets
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
Maria: Modular Reachability Analyser for Algebraic System Nets
ICATPN '02 Proceedings of the 23rd International Conference on Applications and Theory of Petri Nets
Optimized colored nets unfolding
FORTE'06 Proceedings of the 26th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
High level petri nets analysis with helena
ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets
An efficient method for unfolding colored Petri nets
Proceedings of the Winter Simulation Conference
Hi-index | 0.00 |
Reachability analysis and simulation tools for high-level nets spend a significant amount of the computing time in performing enabling tests, determining the assignments under which transitions are enabled. Unlike the majority of earlier work on computing enabled transition bindings, the techniques presented in this paper are highly independent of the algebraic operations supported by the high-level net formalism. Performing enabling tests is viewed as a unification problem. A unification algorithm is presented and modifications to it are suggested. One variant of the algorithm constructs finite unfoldings for nets with unbounded domains. Some heuristics for optimising the enabling tests are discussed and their usefulness is evaluated based on experiments. The algorithms have been implemented in the reachability analyser MARIA.