Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chin-Liang Chang and Richard Char-Tung Lee. Symbolic Logic and Mechanical Theorem Proving. Academic Press, New York, NY, USA, 1973.
Gianfranco Chiola, Giuliana Franceschinis and Rossano Gaeta. A symbolic simulation mechanism for well-formed coloured Petri nets. In Philip Wilsey, editor, Proceedings, 25th Annual Simulation Symposium, pages 192–201, Orlando, FL, USA, April 1992. IEEE Computer Society Press, Los Alamitos, CA, USA.
Edsger Wybe Dijkstra. Hierarchical ordering of sequential processes. Acta Informatica, 1:115–138, 1971.
Rossano Gaeta. Efficient discrete-event simulation of colored Petri nets. IEEE Transactions on Software Engineering, 22(9):629–639, September 1996.
Hartmann J. Genrich and Kurt Lautenbach. The analysis of distributed systems by means of Predicate/Transition-Nets. In Gilles Kahn, editor, Semantics of Concurrent Computation, volume 70 of Lecture Notes in Computer Science, pages 123–146, Evian, France, July 1979. Springer-Verlag, Berlin, Germany, 1979.
Torben Bisgaard Haagh and Tommy Rudmose Hansen. Optimising a Coloured Petri Net Simulator. Master’s thesis, University of Århus, Denmark, December 1994. http://www.daimi.au.dk/CPnets/publ/thesis/HanHaa1994.pdf.
Jean-Michel Ilié, Yasmina Maîzi and Denis Poitrenaud. Towards an efficient simulation based on well-formed Petri nets, extended with test and inhibitor arcs. In Tuncer I. Oren and Louis G. Birta, editors, 1995 Summer Computer Simulation Conference, pages 70–75, Ottawa, Canada, July 1995. Society for Computer Simulation International.
Jean-Michel Ilié and Omar Rojas. On well-formed nets and optimizations in enabling tests. In Marco Ajmone Marsan, editor, Application and Theory of Petri Nets 1993, volume 691 of Lecture Notes in Computer Science, pages 300–318, Chicago, IL, USA, June 1993. Springer-Verlag, Berlin, Germany.
Kurt Jensen. Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use: Volume 1, Basic Concepts. Monographs in Theoretical Computer Science. Springer-Verlag, Berlin, Germany, 1992.
Ekkart Kindler and Hagen Völzer. Flexibility in algebraic nets. In Jörg Desel and Manuel Silva, editors, Application and Theory of Petri Nets 1998: 19th International Conference, ICATPN’98, volume 1420 of Lecture Notes in Computer Science, pages 345–364, Lisbon, Portugal, June 1998. Springer-Verlag, Berlin, Germany.
Marko Mäkelä. Maria-Modular Reachability Analyser for Algebraic System Nets. On-line documentation, http://www.tcs.hut.fi/maria/.
Marko Mäkelä. A Reachability Analyser for Algebraic System Nets. Licentiate’s thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Espoo, Finland, March 2000.
Marko Mäkelä. Condensed storage of multi-set sequences. In Kurt Jensen, editor, Practical Use of High-Level Petri Nets, DAIMI report PB-547, pages 111–125. University of Århus, Denmark, June 2000.
Marko Mäkelä. Applying compiler techniques to reachability analysis of high-level models. In Hans-Dieter Burkhard, Ludwik Czaja, Andrzej Skowron and Peter Starke, editors, Workshopon Concurrency, Specification & Programming 2000, Informatik-Bericht 140, pages 129–142. Humboldt-Universität zu Berlin, Germany, October 2000.
Wolfgang Reisig. Petri Nets: An Introduction. Springer-Verlag, Berlin, Germany, 1985.
Michael J. Sanders. Efficient computation of enabled transition bindings in highlevel Petri nets. In 2000 IEEE International Conference on Systems, Man and Cybernetics, pages 3153–3158, Nashville, TN, USA, October 2000.
Karsten Schmidt. LoLA: a low level analyser. In Mogens Nielsen and Dan Simpson, editors, Application and Theory of Petri Nets 2000: 21st International Conference, ICATPN 2000, volume 1825 of Lecture Notes in Computer Science, pages 465–474, Århus, Denmark, June 2000. Springer-Verlag, Berlin, Germany.
Kimmo Varpaaniemi, Jaakko Halme, Kari Hiekkanen and Tino Pyssysalo. PROD reference manual. Technical Report B13, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, Espoo, Finland, August 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mäkelä, M. (2001). Optimising Enabling Tests and Unfoldings of Algebraic System Nets. In: Colom, JM., Koutny, M. (eds) Applications and Theory of Petri Nets 2001. ICATPN 2001. Lecture Notes in Computer Science, vol 2075. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45740-2_17
Download citation
DOI: https://doi.org/10.1007/3-540-45740-2_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42252-5
Online ISBN: 978-3-540-45740-4
eBook Packages: Springer Book Archive