Larger automata and less work for LTL model checking

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

Volumn 3925 LNCS, Issue , 2006, Pages 53-70

  Geldenhuys, Jaco ^a   Hansen, Henri ^b  

^a STELLENBOSCH UNIVERSITY   (South Africa)

^b TAMPERE UNIVERSITY OF TECHNOLOGY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SOFTWARE; MATHEMATICAL MODELS; ONLINE SEARCHING;

ATOMIC PROPOSITION; CHI AUTOMATON; KRIPKE STRUCTURE; LTL-XFORMULA; MODEL CHECKING;

AUTOMATA THEORY;

EID: 33745783970     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11691617_4     Document Type: Conference Paper

References (39)

1. A. V. Aho, J. E. Hopcroft, & J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974.
2. L. Brim, I. Černá, M. Nečesal. Randomization helps in LTL model checking. In Proc. Joint Intl. Worksh. Process Alg. and Probabilistic Methods, Performance Modeling and Verif., LNCS #2165, pp. 105-119, Sept 2001.
3. J. R. Büchi. Weak second-order arithmetic and finite automata. Zeitschrift für mathematische Logik und Grundlagen der Math. 6, pp. 66-92, 1960.
4. J. R. Büchi. On a decision method in restricted second-order arithmetic. In Proc. 1960 Intl. Congr. Logic, Method and Philosophy of Science, pp. 1-11, Stanford Univ. Press, Jun 1962.
5. Y. Choueka. Theories of automata on ω-tapes: a simplified approach. Journal Computer and System Sciences 8, pp. 117-141, 1974.
6. C. Courcoubetis, M. Y. Vardi, P. Wolper, M. Yannakakis. Memory-efficient algorithms for the verification of temporal properties. In CAV'90, LNCS #531, pp. 233-242, Jun 1990.
7. Journal version: Formal Methods in System Design 1(2/3), pp. 275-288, Oct 1992.
8. J.-M. Couvreur. On-the-fly verification of linear temporal logic. In Proc. World Congr. Formal Methods in the Development of Computing Systems (FM'99), LNCS #1708, pp. 253-271, Sept 1999.
9. J.-M. Couvreur. On-the-fly emptiness checks for generalized Büchi automata. In Proc. 12th Intl. SPIN Worksh. on Model Checking Software, LNCS #1708, pp. 999-999, Aug 2005.
10. M. Daniele, F. Giunchiglia, M. Y. Vardi. Improved automata generation for linear time temporal logic. In CAV'99, LNCS #1633, pp. 249-260, Jul 1999.
11. M. B. Dwyer, G. S. Avrunin, & J. C. Corbett. Property specification patterns for finite-state verification. In Proc. 2nd ACM Worksh. Formal Methods in Software Practice, pp. 7-15, Mar 1998.
12. S. Edelkamp, S. Leue, A. Lluch Lafuente. Directed explicit-state model checking in the validation of communication protocols. Technical Report 161, Institut für Informatik, Albert-Ludwigs-Universität Freiburg, Oct 2001.
13. K. Etessami. A hierarchy of polinomial-time computable simulations for automata. In CONCUR'02, LNCS #2421, pp. 131-144, Aug 2002.
14. K. Etessami, G. J. Holzmann. Optimizing Büchi automata. In CONCUR'00, LNCS #1877, pp. 154-167, Aug 2000.
15. C. Fritz. Constructing Büchi automata from linear temporal logic using simulation relations for alternating Büchi automata. In Proc. 8th Intl. Conf. Implementations and Application of Automata, LNCS #2759, pp. 35-48, Jul 2003.
16. P. Gastin, P. Moro, M. Zeitoun. Minimization of counterexamples in SPIN. In Proc. 11th Intl. SPIN Worksh. Model Checking Software, LNCS #2989, pp. 92-108, Apr 2004.
17. P. Gastin, D. Oddoux. Fast LTL to Büchi automata translation. In CAV'01, LNCS #2102, pp. 53-65, Jul 2001.
18. J. Geldenhuys, A. Valmari. Tarjan's algorithm makes on-the-fly LTL verification more efficient. In TACAS'04, LNCS #2988, pp. 205-219, Mar-Apr 2004.
19. Journal version: Theor. Computer Science 345(1), pages 60-82, Nov 2005.
20. R. Gerth, D. Peled, M. Y. Vardi, P. Wolper. Simple on-the-fly automatic verification of linear temporal logic. In Proc. 15th IFIP Symp. Protocol Spec., Testing, and Verif., pp. 3-18, Jun 1995.
21. P. Godefroid, G. J. Holzmann. On the verification of temporal properties. In Proc. 13th IFIP Symp. Protocol Spec., Testing, and Verif., pp. 109-124, May 1993.
22. S. Gurumurthy, R. Bloem, F. Somenzi. Fair simulation minimization. In CAV'02, LNCS #2404, pp. 610-624, Jul 2004.
23. H. Hansen, W. Penczek, A. Valmari. Stuttering-insensitive automata for on-the-fly detection of livelock properties. In Proc. 7th Intl. ERCIM Worksh. Formal Methods for Industrial Critical Systems, pp. 185-200, Jul 2002.
24. Also published in Elec. Notes in Theor. Computer Science 66(2), Elsevier Science, Dec 2002.
25. G. J. Holzmann, D. Peled, M. Yannakakis. On nested depth first search. In Proc. 2nd SPIN Worksh., Held Aug 1996, DIMACS Series No. 32, pp. 23-32, 1997.
26. J. A. W. Kamp. Tense Logic and the Theory of Linear Order. PhD thesis, Univ. of California, 1968.
27. S. A. Kripke. Semantical analysis of modal logic I, normal prepositional calculi. Zeitschrift für mathematische Logik und Grundlagen der Math 9, pp. 67-96, 1963.
28. R. P. Kurshan. Computer-aided Verification of Coordinating Processes: The Automata-theoretic Approach. Princeton Univ. Press, 1994.
29. M. O. Rabin. Decidability of second-order theories and automata on infinite trees. Trans. of the American Mathematical Society 141, pp. 1-35, 1969.
30. S. Schwoon, J. Esparza. A note on on-the-fly verification algorithms. In TACAS'05, LNCS #3440, pp. 174-190, Mar 2005.
31. R. Sebastiani, S. Tonetta. "More Deterministic" vs "Smaller" Büchi Automata for Efficient LTL Model Checking Correct Hardware Design and Verif. Methods, LNCS #2860, pp. 126-140, 2003.
32. F. Somenzi, R. Bloem. Efficient Büchi automata from LTL formulae. In CAV'00, LNCS #1855, pp. 248-267, Jun 2000.
33. R. E. Tarjan. Depth-first search and linear graph algorithms. SIAM Journal of Computing 1(2), pp. 146-160, Jun 1972.
34. H. Tauriainen. A randomized testbench for algorithms translating linear temporal logic formulae In Proc. Worksh. Concurrency, Specifications, and Programming, pp. 251-262, Sept 1999.
35. H. Tauriainen. Nested emptiness search for generalized Büchi automata. Technical Report HUT-TCS-A79, Laboratory for Theoretical Computer Science, Helsinki Univ. of Technology, Jul 2003.
36. A. Valmari. On-the-fly verification with stubborn sets. In CAV'93, LNCS #697, pp. 397-308, Jun 1993.
37. M. Y. Vardi, P. Wolper. An automata-theoretic approach to automatic program verification. In Proc. 1st IEEE Symp. on Logic in Computer Science, pp. 332-344, Jun 1986.
38. P. Wolper. Temporal logic can be more expressive. Information and Computation 56, pp. 72-99, 1983.
39. P. Wolper, M. Y. Vardi, A. P. Sistla. Reasoning about infinite computation paths. In Proc. 24th IEEE Symp. on the Foundations of Computer Science, pp. 185-194, IEEE Computer Society Press, Nov 1983.