Unfoldings of unbounded petri nets

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

Volumn 1855, Issue , 2000, Pages 495-507

  Abdulla, Parosh Aziz ^a   Purushothaman Iyer, S ^b   Nylèn, Aletta ^a  

^a UPPSALA UNIVERSITY   (Sweden)

^b North Carolina State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED ANALYSIS; PETRI NETS;

FINITE STATE SYSTEMS; INFINITE STATE SYSTEMS; SAFETY PROPERTY; STATE-SPACE EXPLOSION; SYMBOLIC ALGORITHMS; SYNCHRONOUS PRODUCTS; TRANSITION SYSTEM; UNFOLDINGS;

MODEL CHECKING;

EID: 84944389193     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10722167_37     Document Type: Conference Paper

References (16)

1. Parosh Aziz Abdulla, Karlis Cerans, Bengt Jonsson, and Tsay Yih-Kuen. General decidability theorems for infinite-state systems. In Proc. 11th IEEE Int. Symp. on Logic in Computer Science, pages 313-321, 1996.
2. Parosh Aziz Abdulla and Bengt Jonsson. Ensuring completeness of symbolic verification methods for infinite-state systems, 1998. To appear in the journal of Theoretical Computer Science.
3. Parosh Aziz Abdulla, Bengt Jonsson, Mats Kindahl, and Doron Peled. A general approach to partial order reductions in symbolic verification. In Proc. 10th Int. Conf. on Computer Aided Verification, volume 1427 of Lecture Notes in Computer Science, pages 379-390, 1998.
4. Parosh Aziz Abdulla, Mats Kindahl, and Doron Peled. An improved search strategy for Lossy Channel Systems. In Tadanori Mizuno, Nori Shiratori, Teruo Hegashino, and Atsushi Togashi, editors, FORTE X/PSTV XVII '97, pages 251-264. Chapman and Hall, 1997.
5. L. E. Dickson.: Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors. Amer. J. Math., 35:413-422, 1913.
6. J. Esparza and S. Römer. An unfolding algorithm for synchronous products of transition systems. In Proc. CONCUR '99, 9th Int. Conf. on Concurrency Theory, volume 1664 of Lecture Notes in Computer Science, pages 2-20. Springer Verlag, 1999.
7. J. Esparza, S. Romer, and W. Vogler. An improvement of McMillan's unfolding algorithm. In Proc. TACAS '96, 2th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems, volume 1055 of Lecture Notes in Computer Science, pages 87-106. Springer Verlag, 1996.
8. A. Finkel and Ph. Schnoebelen.: Well-structured transition systems everywhere. Technical Report LSV-98-4, Ecole Normale Supèrieure de Cachan, April 1998.
9. A. Nylèn P. Godefroid and P. Wolper. Using partial orders for the efficient veri- _cation of deadlock freedom and safety properties. Formal Methods in System Design, 2(2):149-164, 1993.
10. K. Heljanko. Using logic programs with stable model semantics to solve deadlock and reachability problems for 1-safe Petri nets. Fundamenta Informaticae, 37:247-268, 1999.
11. R. Langerak and E. Brinksma. A complete finite preffix for process algebra. In Proc. 11th Int. Conf. on Computer Aided Verification, volume 1633 of Lecture Notes in Computer Science, pages 184-195. Springer Verlag, 1999.
12. K.L. McMillan. A technique of a state space search based on unfolding. Formal Methods in System Design, 6(1):45-65, 1995.
13. S. Melzer and S. Römer. Deadlock checking using net unfoldings. In Proc. 9th Int. Conf. on Computer Aided Verification, 1997.
14. D. Peled. All from one, one for all, on model-checking using representatives. In Proc. 5th Int. Conf. on Computer Aided Verification, volume 697 of Lecture Notes in Computer Science, pages 409-423. Springer-Verlag, 1993.
15. A. Valmari. Stubborn sets for reduced state space generation. In Advances in Petri Nets, volume 483 of Lecture Notes in Computer Science, pages 491-515. Springer-Verlag, 1990.
16. M. Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proc. 1st IEEE Int. Symp. on Logic in Computer Science, pages 332-344, June 1986.