Net reductions for LTL model-checking

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

Volumn 2144, Issue , 2001, Pages 310-324

  Esparza, Javier ^a   Schröter, Claus ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DESIGN; DISTRIBUTED COMPUTER SYSTEMS; FORMAL LOGIC; HARDWARE; LINEAR PROGRAMMING; PETRI NETS;

IMPLICIT PLACE; LINEAR PROGRAMMING TECHNIQUES; LOCAL NET; LTL MODEL-CHECKING; NET SYSTEMS; PETRI-NET TECHNIQUE; REDUCTION RULES; REDUCTION TECHNIQUES;

MODEL CHECKING;

EID: 84947212909     PISSN: 03029743     EISSN: 16113349     Source Type: Journal    
DOI: 10.1007/3-540-44798-9_25     Document Type: Article

References (20)

1. G. Berthelot. Checking properties of nets using transformations. In Advances in Petri Nets, LNCS 222, pages 19-40. Springer-Verlag, 1985.
2. J. C. Corbett. Evaluating Deadlock Detection Methods, 1994.
3. J. M. Colom and M. Silva. Improving the Linearly Based Characterization of P/T Nets. In Advances in Petri Nets, LNCS 483, pages 113-145. Springer-Verlag, 1990.
4. J. Desel and J. Esparza. Free Choice Petri Nets. Cambridge University Press, 1995.
5. J. Esparza and K. Heljanko. A new Unfolding Approach to LTL Model Checking. In ICALP’00, LNCS 1853, pages 475-486. Springer-Verlag, 2000.
6. J. Esparza and K. Heljanko. Implementing LTL Model Checking with Net Unfoldings. Accepted paper for SPIN’01, 2001.
7. J. Esparza and C. Schröter. Net Reductions for LTL Model-Checking. Full version, available at ftp://131.159.22.8/pub/theory/schroete/reduct.ps.gz, 2001.
8. M. Heiner and P. Deusen. Petri net based qualitative analysis - A case study. Technical report I-08/1995. Brandenburg Technische Universität Cottbus, 1995, 1995.
9. H. Hellwagner. Scalable Readers/Writers Synchronization on Shared- Memory Machines. Esprit P5404 (GP MIMD), Working Paper, 1993.
10. K. Heljanko. Unfsmodels 0.9. Available at http://www.tcs.hut.fi/˜kepa/experiments/spin2001/, 2001.
11. C. Lewerentz and T. Lindner. Formal Development of Reactive Systems: Case Study Production Cell. LNCS 891. Springer-Verlag, 1995.
12. A. J. Martin. Self-timed FIFO: An exercise in compiling programs into VLSI circuits. In From HDL Descriptions to Guruanteed Correct Circuit Designs, pages 133-153. Elsevier Science Publishers, 1986.
13. K. L. McMillan. Using Unfoldings to Avoid the State Explosion Problem in the Verification of Asynchronous Circuits. In CAV’92, LNCS 663, pages 164-174. Springer-Verlag, 1992.
14. D. Poitrenaud and J. F. Pradat-Peyre. Pre- and Post-agglomerations for LTL Model Checking. In ICATPN’00, LNCS 1825, pages 387-408. Springer-Verlag, 2000.
15. E. Pastor, O. Roig, J. Cortadella, and R. M. Badia. Petri Net Analysis Using Boolean Manipulation. In ATPN’94, LNCS 815, pages 416-435. Springer-Verlag, 1994.
16. O. Roig, J. Cortadella, and E. Pastor. Verification of Asynchronous Circuits by BDD-based Model Checking of Petri Nets. In ATPN’95, LNCS 935, pages 374-391. Springer-Verlag, 1995.
17. W. Reisig. Petri Nets. Volume 4 of the EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1985.
18. S. Römer. Theorie und Praxis der Netzentfaltungen als Grundlage für die Verifikation nebenläufiger Systeme. PhD thesis, Tech. Univ. München, 2000.
19. M. Y. Vardi. An automata theoretic approach to linear temporal logic. In Logics for Concurrency: Structure versus Automata, LNCS 1043, pages 238-265. Springer-Verlag, 1996.
20. F. Wallner. Model checking LTL using net unfoldings. In CAV’98, LNCS 1427, pages 207-218. Springer-Verlag, 1998.