Finite unfoldings of unbounded petri nets

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

Volumn 3099, Issue , 2004, Pages 157-176

  Desel, Jörg ^a   Juhás, Gabriel ^a   Neumair, Christian ^a  

^a CATHOLIC UNIVERSITY OF EICHSTÄTT INGOLSTADT   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

COVERABILITY TREES; PARTIAL ORDER; PETRI NET UNFOLDINGS; UNFOLDINGS;

PETRI NETS;

EID: 34250318829     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27793-4_10     Document Type: Article

References (13)

1. P. A. Abdulla, S. P. Iyer and A. Nylen. Unfoldings of Unbounded Petri nets. In Proceedings of the 12th International Conference on Computer Aided Verification (CAV 2000), volume 1855 of Lecture Notes in Computer Science, pages 495-507. Springer-Verlag, Berlin, Germany.
2. E. Best, C. Fernande. Notations and Terminology on Petri Net Theory. In Arbeitspapiere der GMD, 1987.
3. E. Best, C. Fernandez. Nonsequential processes. In EATCS Monographs, volume 13. Springer-Verlag, Berlin, Germany, 1988.
4. J. Desel, W. Reisig. Place/Transition Petri Nets. In W. Reisig, G. Rozenberg (Eds.): Lectures on Petri Nets I: Basic Models, volume 1491 of Lecture Notes in Computer Science, pages 122-173. Springer-Verlag, Berlin, Germany, 1998.
5. Lecture Notes in Computer Science J. Desel, G. Juhas. What is a Petri Net? Informal Answers for the Informed Reader. In H. Ehrig, G. Juhas, J. Padberg, G. Rozenberg (Eds.): Unifying Petri Nets, volume 2128 of Lecture Notes in Computer Science, pages 1-25. Springer, Berlin, Germany, 2001.
6. J. Engelfriet. Branching Processes of Petri Nets. In Acta Informatica 28, pages. 575-591, 1991.
7. J. Esparza, S. Römer and W. Vogler. An Improvement of McMillan's Unfolding Algorithm. In Formal Methods in System Design, 20 pages 285-310, 2002.
8. A. Finkel. The minimal coverability graph for Petri Nets. In Advances in Petri Nets, volume 674 of Lecture Notes in Computer Science, pages 210-243. Springer-Verlag, Berin, Germany, 1993.
9. V. Khomenko, M. Koutny and W. Vogler. Canonical Prefixes of Petri Net Unfoldings. In Proceedings of the 14th International Conference on Computer Aided Verification (CAV 2002), volume 2404 of Lecture Notes in Computer Science, pages 582-595. Springer, Berlin, Germany, 2002.
10. K. L. McMillan. A Technique of State Space Search Based on Unfolding. In Formal Methods in System Design, 6(1), pages 45-65, 1995.
11. K. L. McMillan. Using Unfoldings to Avoid the State Explosion Problem in the Verification of Asynchronous Circuits. In 4th Workshop on Computer Aided Verification, volume 663 of Lecture Notes in Computer Science, pages 164-174. Springer, Berlin, Germany, 1992.
12. James L. Peterson. Petri Net Theory and the Modelling of Systems. Prentice-Hall, Englewood Cliffs, New Jersey, 1981.
13. A. Valmari. The State Explosion Problem. In W. Reisig, G. Rozenberg (Eds.): Lectures on Petri Nets I: Basic Models, volume 1491 of Lecture Notes in Computer Science, pages 429-528. Springer, Berlin, Germany, 1998.