Canonical prefixes of petri net unfoldings

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

Volumn 2404, Issue , 2002, Pages 582-595

  Khomenko, Victor ^a   Koutny, Maciej ^a   Vogler, Walter ^b  

^a NEWCASTLE UNIVERSITY   (United Kingdom)

^b UNIVERSITY OF AUGSBURG   (Germany)

Author keywords

Canonical prefix; Model checking; Petri nets; Unfolding

Indexed keywords

COMPUTER AIDED ANALYSIS; MODEL CHECKING;

CANONICAL PREFIX; CORRECTNESS PROOFS; GENERALISATION; PETRI NET UNFOLDINGS; UNFOLDING; UPPER BOUND;

PETRI NETS;

EID: 35048820644     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45657-0_49     Document Type: Conference Paper

References (16)

1. E. M. Clarke, O. Grumberg, and D. Peled: Model Checking. MIT Press (1999).
2. P. M. Cohn: Universal Algebra. Reidel, 2nd edition (1981).
3. J. -M. Couvreur, S. Grivet and D. Poitrenaud: Unfolding of Products of Symmetrical Petri Nets. Proc. of ICATPN’ 2001. Springer LNCS 2075 (2001) 121–143.
4. J. Engelfriet: Branching processes of Petri Nets. Acta Inf. 28 (1991) 575–591.
5. J. Esparza, S. Römer and W. Vogler: An Improvement of McMillan’s Unfolding Algorithm. Proc. of TACAS’ 96. Springer LNCS 1055 (1996) 87–106.
6. K. Heljanko: Minimizing Finite Complete Prefixes. Proc. of CS&P’99, Warsaw, Poland (1999) 83–95.
7. K. Heljanko: Using Logic Programs with Stable Model Semantics to Solve Deadlock and Reachability Problems for 1-Safe Petri Nets. Fund. Inf. 37(3) (1999) 247–268.
8. K. Heljanko, V. Khomenko and M. Koutny: Parallelisation of the Petri Net Unfolding Algorithm. Proc. of TACAS’ 02. Springer LNCS 2280 (2002) 371–385.
9. V. Khomenko and M. Koutny: LP Deadlock Checking Using Partial Order Dependencies. Proc. of CONCUR’ 2000. Springer LNCS 1877 (2000) 410–425.
10. V. Khomenko, M. Koutny and W. Vogler: Canonical Prefixes of Petri Net Unfoldings. Techn. Rep. CS-TR-741, Dept. of Comp. Sci., Univ. of Newcastle (2001).
11. V. Khomenko, M. Koutny and A. Yakovlev: Detecting State Coding Conflicts in STGs Using Integer Programming. Proc. of DATE’ 02. IEEE (2002) 338–345.
12. D. König: Über eine Schlußweise aus dem Endlichen ins Unendliche. Acta Litt. ac. sci. Szeged 3 (1927) 121–130. Bibliography in: Theorie der endlichen und unendlichen Graphen. Teubner, Leipzig (1936, reprinted 1986)
13. K. L. McMillan: Using Unfoldings to Avoid State Explosion Problem in the Verification of Asynchronous Circuits. Proc. of CAV’ 92. LNCS 663 (1992) 164–174.
14. K. L. McMillan: Symbolic Model Checking. PhD thesis, CMU-CS-92-131 (1992).
15. S. Melzer and S. Römer: Deadlock Checking Using Net Unfoldings. Proc. of CAV’ 97. Springer LNCS 1254 (1997) 352–363.
16. A. Semenov: Verification and Synthesis of Asynchronous Control Circuits Using Petri Net Unfolding. PhD Thesis, University of Newcastle upon Tyne (1997).