Optimising enabling tests and unfoldings of algebraic system nets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2075, Issue , 2001, Pages 283-302

  Mäkelä, Marko ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

High level petri nets; Reachability analysis; Unfolding; Unification

Indexed keywords

COMPUTATION THEORY; OPTIMIZATION; PETRI NETS;

ALGEBRAIC OPERATIONS; HIGH-LEVEL PETRI NETS; REACHABILITY ANALYSIS; UNBOUNDED DOMAIN; UNFOLDING; UNIFICATION; UNIFICATION ALGORITHMS; UNIFICATION PROBLEM;

ALGEBRA;

EID: 84947290062     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45740-2_17     Document Type: Conference Paper

References (18)

1. Chin-Liang Chang and Richard Char-Tung Lee. Symbolic Logic and Mechanical Theorem Proving. Academic Press, New York, NY, USA, 1973.
2. 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.
3. Edsger Wybe Dijkstra. Hierarchical ordering of sequential processes. Acta Informatica, 1: 115-138, 1971.
4. Rossano Gaeta. Efficient discrete-event simulation of colored Petri nets. IEEE Transactions on Software Engineering, 22(9): 629-639, September 1996.
5. 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.
6. 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.
7. 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.
8. 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.
9. 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.
10. 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.
11. Marko Mäkelä. Maria-Modular Reachability Analyser for Algebraic System Nets. On-line documentation, http://www.tcs.hut.fi/maria/.
12. 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.
13. 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.
14. 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, Workshop on Concurrency, Specification & Programming 2000, Informatik-Bericht 140, pages 129-142. Humboldt-Universität zu Berlin, Germany, October 2000.
15. Wolfgang Reisig. Petri Nets: An Introduction. Springer-Verlag, Berlin, Germany, 1985.
16. Michael J. Sanders. Efficient computation of enabled transition bindings in high-level Petri nets. In 2000 IEEE International Conference on Systems, Man and Cybernetics, pages 3153-3158, Nashville, TN, USA, October 2000.
17. 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.
18. 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.