Branching processes of high-level Petri nets

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

Volumn 2619, Issue , 2003, Pages 458-472

  Khomenko, Victor ^a   Koutny, Maciej ^a  

^a NEWCASTLE UNIVERSITY   (United Kingdom)

Author keywords

High level Petri nets; Model checking; Unfolding; Verification

Indexed keywords

ALGORITHMS; MODEL CHECKING; PROBABILITY DISTRIBUTIONS; VERIFICATION;

BRANCHING PROCESS; EXPLICIT CONSTRUCTIONS; HIGH-LEVEL NETS; HIGH-LEVEL PETRI NETS; UNFOLDING; UNFOLDINGS; VERIFICATION TOOLS;

PETRI NETS;

EID: 21144455632     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36577-x_34     Document Type: Article

References (24)

1. E. Best, H. Fleischhack, W. Fraczak, R. Hopkins, H. Klaudel, and E. Pelz: A Class of Composable High Level Petri Nets. ICATPN'1995, LNCS 935 (1995) 103-120.
2. E. Best and B. Grahlmann: PEP - more than a Petri Net Tool. TACAS'96, LNCS 1055 (1996) 397-401.
3. A. Bystrov and A. Yakovlev: Asynchronous Circuit Synthesis by Direct Mapping: Interfacing to Environment. ASYNC'02, IEEE Comp. Soc. Press (2002) 127-136.
4. E.M. Clarke, O. Grumberg, and D. Peled: Model Checking. MIT Press (1999).
5. J.-M. Couvreur, S. Grivet, and Denis Poitrenaud: Unfolding of Products of Symmetrical Petri Nets. ICATPN'2001, LNCS 2075 (2001) 121-143.
6. J. Engelfriet: Branching processes of Petri Nets. Acta Inf. 28 (1991) 575-591.
7. J. Esparza and S. Römer: An Unfolding Algorithm for Synchronous Products of Transition Systems. CONCUR'99, LNCS 1664 (1999) 2-20.
8. J. Esparza, S. Römer and W. Vogler: An Improvement of McMillan's Unfolding Algorithm. TACAS'96, LNCS 1055 (1996) 87-106.
9. Full version: Formal Methods in System Design 20(3) (2002) 285-310.
10. 2 with Procedures. PDSE'97, IEEE Computer Society Press (1997) 15-27.
11. K. Heljanko: Minimizing Finite Complete Prefixes. CS&P'99, Workshop Concurrency, Specification and Programming (1999) 83-95.
12. 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.
13. K. Heljanko, V. Khomenko and M. Koutny: Parallelisation of the Petri Net Unfolding Algorithm. TACAS'02, LNCS 2280 (2002) 371-385.
14. K. Jensen: Colored Petri Nets. Basic Concepts, Analysis Methods and Practical Use. EATCS Monographs on Theoretical Computer Science (1992).
15. V. Khomenko and M. Koutny: LP Deadlock Checking Using Partial Order Dependencies. CONCUR'2000, LNCS 1877 (2000) 410-425.
16. V. Khomenko and M. Koutny: Towards An Efficient Algorithm for Unfolding Petri Nets. CONCUR'2001, LNCS 2154 (2001) 366-380.
17. V. Khomenko, M. Koutny, and V. Vogler: Canonical Prefixes of Petri Net Unfoldings. CAV'02, LNCS 2404 (2002) 582-595.
18. V. Khomenko and M. Koutny: Branching Processes of High-Level Petri Nets. Techn. Rep. CS-TR-763, Department of Computing Science, University of Newcastle (2002).
19. V.E. Kozura: Unfolding of Colored Petri Nets. Techn. Rep. 80, A.P. Ershov Institute of Informatics Systems (2000).
20. L. Lamport: A Fast Mutual Exclusion Algorithm. ACM Transactions on Computer Systems 5(1) (1987) 1-11.
21. K. L. McMillan: Using Unfoldings to Avoid State Explosion Problem in the Verification of Asynchronous Circuits. CAV'92, LNCS 663 (1992) 164-174.
22. K. L. McMillan: Symbolic Model Checking. PhD thesis, CMU-CS-92-131 (1992).
23. S. Römer: Entwicklung und Implementierung von Verifikationstechniken auf der Basis von Netzentfaltungen. PhD thesis, Technische Universitat Munchen (2000).
24. A. Semenov: Verification and Synthesis of Asynchronous Control Circuits Using Petri Net Unfolding. PhD Thesis, University of Newcastle upon Tyne (1997).