An unfolding algorithm for synchronous products of transition systems

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

Volumn 1664 LNCS, Issue , 1999, Pages 2-20

  Esparza, Javier ^a   Römer, Stefan ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

PETRI NETS;

PRODUCT STRUCTURE; SYNCHRONOUS PRODUCTS; TRANSITION SYSTEM; UNFOLDING METHOD; UNFOLDING PROCEDURES;

BENCHMARKING;

EID: 84888221301     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48320-9_2     Document Type: Conference Paper

References (7)

1. Bibliography on net unfoldings. Accessible at http://wwwbrauer. informatik.tu-muenchen.de/~esparza.
2. A. Arnold. Finite Transition Systems. Prentice-Hall, 1992.
3. J.C. Corbett. Evaluating Deadlock Detection Methods for Concurrent Software. In T. Ostrand, editor, Proceedings of the 1994 International Symposium on Software Testing and Analysis, 204-215, 1994.
4. J. Esparza, S. Römer und W. Vogler: An Improvement of McMillan's Unfolding Algorithm. In T. Margaria und B. Steffen, editors, Proceedings of TACAS'96, LNCS 1055, 87-106, 1996.
5. R. Langerak and E. Brinksma. A Complete Finite Prefix for Process Algebra. To appear in Proceedings of CAV '99, 1999.
6. K. McMillan. Symbolic Model Checking: An Approach to the State Explosion Problem. Kluwer, 1993.
7. S. Melzer. Verification of Distributed Systems Using Linear and Constraint Programming. Ph. D. Thesis, Technical University of Munich, 1998 (in German).