A new unfolding approach to LTL model checking

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

Volumn 1853, Issue , 2000, Pages 475-486

  Esparza, Javier ^a   Heljanko, Keijo ^b  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^b AALTO UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; DISTRIBUTED COMPUTER SYSTEMS;

FINITE PREFIX; LTL MODEL-CHECKING; MODEL CHECKING PROBLEM;

MODEL CHECKING;

EID: 84974588904     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45022-x_40     Document Type: Conference Paper

References (18)

1. Bibliography on the net unfolding method. Available on the Internet at http://wwwbrauer.in.tum.de/gruppen/theorie/pom/pom.shtml.
2. J. Esparza. Model checking using net unfoldings. Science of Computer Programming, 23:151-195, 1994.
3. J. Esparza and S. Römer. An unfolding algorithm for synchronous products of transition systems. In Proceedings of the 10th International Conference on Concurrency Theory (Concur'99), pages 2-20, 1999. LNCS 1055.
4. J. Esparza, S. Römer, and W. Vogler. An improvement of McMillan's unfolding algorithm. In Proceedings of 2nd International Workshop on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'96), pages 87-106, 1996. LNCS 1055.
5. Javier Esparza and Keijo Heljanko. A new unfolding approach to LTL model checking. Research Report A60, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, April 2000. Available at http://www.tcs.hut.fi/pub/reports/A60.ps.gz.
6. R. Gerth, D. Peled, M. Y. Vardi, and P. Wolper. Simple on-the-fly automatic verification of linear temporal logic. In Proceedings of 15th Workshop Protocol Specification, Testing, and Verification, pages 3-18, 1995.
7. B. Graves. Computing reachability properties hidden in finite net unfoldings. In Proceedings of 17th Foundations of Software Technology and Theoretical Computer Science Conference, pages 327-341, 1997. LNCS 1346.
8. K. Heljanko. Using logic programs with stable model semantics to solve deadlock and reachability problems for 1-safe Petri nets. In Proceedings of 5th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'99), pages 240-254, 1999. LNCS 1579.
9. R. Kaivola. Using compositional preorders in the verification of sliding window protocol. In Proceeding of 9th International Conference on Computer Aided Verification (CAV'97), pages 48-59, 1997. LNCS 1254.
10. R. Langerak and E. Brinksma. A complete finite prefix for process algebra. In Proceeding of 11th International Conference on Computer Aided Verification (CAV'99), pages 184-195, 1999. LNCS 1663.
11. K. L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, 1993.
12. S. Melzer and S. Römer. Deadlock checking using net unfoldings. In Proceedings of 9th International Conference on Computer-Aided Verification (CAV '97), pages 352-363, 1997. LNCS 1254.
13. P. Niebert. Personal communication, 1999.
14. C. Stirling and David Walker. Local model checking in the modal mu-calculus. Theoretical Computer Science, 89(1):161-177, 1991.
15. M. Y. Vardi. An automata-theoretic approach to linear temporal logic. In Logics for Concurrency: Structure versus Automata, pages 238-265, 1996. LNCS 1043.
16. F. Wallner. Model checking techniques using net unfoldings. PhD thesis, Technische Universität München, Germany, forthcoming.
17. F. Wallner. Model checking LTL using net unfoldings. In Proceeding of 10th International Conference on Computer Aided Verification (CAV'98), pages 207-218, 1998. LNCS 1427.
18. P. Wolper. Temporal logic can be more expressive. Information and Control, 56(1,2):72-93, 1983.