Truly on-the-fly LTL model checking

Lecture Notes in Computer Science

Volumn 3440, Issue , 2005, Pages 191-205

  Hammer, Moritz ^a   Knapp, Alexander ^a   Merz, Stephan ^b  

^a UNIVERSITY OF MUNICH   (Germany)

^b LORIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BENCHMARKING; MATHEMATICAL MODELS;

MODEL CHECKING; TARJAN ALGORITHMS; TRANSITION SYSTEMS;

AUTOMATA THEORY;

EID: 24644463881     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31980-1_13     Document Type: Conference Paper

References (23)

1. R. E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Trans. Computers, C-35(8):677-691, 1986.
2. C. Courcoubetis, M. Y. Vardi, P. Wolper, and M. Yannakakis. Memory-efficient algorithms for the verification of temporal properties. Formal methods in system design, 1:275-288, 1992.
3. M. Daniele, F. Giunchiglia, and M. Y. Vardi. Improved automata generation for linear temporal logic. In N. Halbwachs and D. Peled, editors, 11th Intl. Conf. Computer Aided Verification (CAV'99), volume 1633 of Lect. Notes in Comp. Sci., pages 249-260, Trento, Italy, 1999. Springer-Verlag.
4. K. Etessami and G. Holzmann. Optimizing Büchi automata. In C. Palamidessi, editor, CONCUR 2000 - Concurrency Theory: 11th International Conference, volume 1877 of Lect. Notes in Comp. Sci., pages 153-167, University Park, PA, 2000. Springer-Verlag.
5. C. Fritz. Constructing Büchi automata from linear temporal logic using simulation relations for alternating Büchi automata. In O. Ibarra and Z. Dang, editors, 8th Intl. Conf. Implementation and Application of Automata (CIAA 2003), volume 2759 of Lect. Notes in Comp. Sci., pages 35-48, Santa Barbara, CA, USA, 2003. Springer-Verlag.
6. C. Fritz and T. Wilke. State space reductions for alternating Büchi automata: Quotienting by simulation equivalences. In M. Agrawal and A. Seth, editors, 22nd Conf. Found. Software Tech. and Theor. Comp. Sci. (FSTTCS 2002), volume 2556 of Lect. Notes in Comp. Sci., pages 157-168, Kanpur, India, 2002. Springer-Verlag.
7. P. Gastin and D. Oddoux. Fast LTL to Büchi automata translation. In G. Berry, H. Comon, and A. Finkel, editors, 13th Intl. Conf. Computer Aided Verification (CAV'01), volume 2102 of Lect. Notes in Comp. Sci., pages 53-65, Paris, France, 2001. Springer-Verlag.
8. J. Geldenhuys and A. Valmari. Tarjan's algorithm makes LTL verification more efficient. In K. Jensen and A. Podelski, editors, 10th Intl. Conf. Tools and Algorithms for the Construction and Analysis of Systems (TACAS'04), volume 2988 of Lect. Notes in Comp. Sci., pages 205-219, Barcelona, Spain, 2004. Springer-Verlag.
9. R. Gerth, D. Peled, M. Y. Vardi, and P. Wolper. Simple on-the-fly automatic verification of linear temporal logic. In P. Dembinski and M. Sredniawa, editors, Protocol Specification, Testing, and Verification, pages 3-18, Warsaw, Poland, 1995. Chapman & Hall.
10. G. Holzmann. The Spin model checker. IEEE Trans, on Software Engineering, 23(5):279-295, 1997.
11. G. Holzmann. An analysis of bitstate hashing. Formal Methods in System Design, 13(3):289-307, 1998.
12. G. Holzmann. The SPIN Model Checker. Addison-Wesley, 2003.
13. Y. Kesten and A. Pnueli. Verifying liveness by augmented abstraction. In J. Flum and M. Rodrfguez-Artalejo, editors, Computer Science Logic (CSL'99), volume 1683 of Lect. Notes in Comp. Sci., pages 141-156, Madrid, Spain, 1999. Springer-Verlag.
14. C. Löding and W. Thomas. Alternating automata and logics over infinite words. In J. van Leeuwen et al., editor, IFIP Intl. Conf. Theor. Comp. Sci. (TCS 2000), volume 1872 of Lect. Notes in Comp. Sci., pages 521-535, Sendai, Japan, 2000.
15. D.E. Muller, A. Saoudi, and P.E. Schupp. Weak alternating automata give a simple explanation of why most temporal and dynamic logics are decidable in exponential time. In 3rd IEEE Symp. Logic in Computer Science (LICS'88), pages 422-427, Edinburgh, Scotland, 1988. IEEE Press.
16. S. Rohde. Alternating automata and the temporal logic of ordinals. PhD thesis, Dept. of Math., Univ. of Illinois, Urbana-Champaign, IL, 1997.
17. K. Schneider. Yet another look at LTL model checking. In L. Pierre and T. Kröpf, editors, IFIP Work. Conf. Correct Hardware Design and Verification Methods (CHARME'99), volume 1703 of Lect. Notes in Comp. Sci., pages 321-326, Bad Herrenalb, Germany, 1999. Springer-Verlag.
18. F. Somenzi and R. Bloem. Efficient Büchi automata from LTL formulae. In E.A. Emerson and A.P. Sistla, editors, 12th Intl. Conf. Computer Aided Verification (CAV 2000), volume 1633 of Lect. Notes in Comp. Sci., pages 257-263, Chicago, IL, 2000. Springer-Verlag.
19. R. E. Tarjan. Depth first search and linear graph algorithms. SIAM Journal of Computing, 1:146-160, 1972.
20. H. Tauriainen. On translating linear temporal logic into alternating and nondeterministic automata. Research Report A83, Helsinki Univ. of Technology, Lab. Theor. Comp. Sci., Espoo, Finland, December 2003.
21. H. Tauriainen. Nested emptiness search for generalized Büchi automata. In M. Kishnevsky and Ph. Darondeau, editors, 4th Intl. Conf. Application of Concurrency to System Design (ACSD 2004), pages 165-174, Hamilton, Ontario, 2004. IEEE Computer Society.
22. W. Thomas. Languages, automata, and logic. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Language Theory, volume III, pages 389-455. Springer-Verlag, 1997.
23. M. Y. Vardi. Alternating automata and program verification. In J. van Leeuwen, editor, Computer Science Today, volume 1000 of Lect. Notes in Comp. Sci., pages 471-485. Springer-Verlag, 1995.