Stutter-invariant languages, ω-automata, and temporal logic

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

Volumn 1633, Issue , 1999, Pages 236-248

  Etessami, Kousha ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTER AIDED ANALYSIS; COMPUTER CIRCUITS; MODEL CHECKING; SPECIFICATIONS;

DECISION PROCEDURE; INVARIANT PROPERTIES; MODEL CHECKING TOOLS; ORDER VERIFICATIONS; PARTIAL ORDER REDUCTIONS; REGULAR PROPERTIES; TEMPORAL FORMULAE; VERIFICATION TOOLS;

TEMPORAL LOGIC;

EID: 84894622420     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48683-6_22     Document Type: Conference Paper

References (23)

1. J. R. Büchi. On a decision method in restricted second-order arithmetic. In Proceedings of the International Congress on Logic, Methodology, and Philosophy of Science, 1960. Stanford University Press, 1962.
2. E. A. Emerson. Temporal and modal logics. In J. van Leeuwen, editor, Handbook of Theoret. Comput. Sci., volume B, pages 995-1072. Elsevier, Amsterdam, 1990.
3. K. Etessami. Stutter-invariant languages, ω-automata, and temporal logic. Technical Report BL011272-980611-07TM, Bell Laboratories, June 11 1998.
4. R. Gerth, D. Peled, M. Y. Vardi, and P. Wolper. Simple on-the-fly automatic verification of linear temporal logic. In PSTV95, Protocol Specification Testing and Verification, pages 3-18, 1995.
5. P. Godefroid and P. Wolper. A partial approach to model checking. In Proc. 6th Ann. IEEE Symp. on Logic in Computer Science, pages 406-415, 1991.
6. G. J. Holzmann. The model checker spin. IEEE Transactions on Software Engineering, 23(5):279-295, 1997.
7. G. J. Holzmann and D. Peled. An improvement in formal verification. In 7th International Conference on Formal Description Techniques, pages 177-194, 1994.
8. O. Kupferman. Augmenting branching temporal logics with existential quantification over atomic propositions. Journal of Logic and Computation, 7:1-14, 1997.
9. L. Lamport. What good is temporal logic. In R. E. A. Mason, editor, Information Processing '83: Proc. IFIP 9th World Computer Congress, pages 657-668, 1983.
10. L. Lamport. The temporal logic of actions. ACM Transactions on Programming Languages and Systems, pages 872-923, 1994.
11. Z. Manna and A. Pnueli. Specification and verification of concurrent programs by V-automata. In Proc. ï4th Ann. ACM Symp. on Principles of Programming Languages, pages 1-12, 1987.
12. K. McMillan, 1998. See http://www-cad.eecs.berkeley.edu/kenmcmil for recent versions of SMV and its documentation.
13. R. McNaughton. Testing and generating infinite sequences by a finite automaton. Information and Control, 9:521-530, 1966.
14. D. Peled. Combining partial order reductions with on-the-fly model checking. Formal Methods in System Design, 8:39-64, 1996.
15. D. Peled and T. Wilke. Stutter-invariant temporal properties are expressible without the next-time operator. Information Processing Letters, 63:243-246, 1997.
16. A. Pnueli. The temporal logic of programs. In Proc. 18th Symp. on Foundations of Computer Science, pages 46-57, 1977.
17. A. Rabinovich. Expressive completeness of temporal logic of actions. In Mathematical Foundations of Computer Science, pages 229-238, August 1998.
18. A. P. Sistla and E. M. Clarke. The complexity of propositional linear temporal logics. Journal of the ACM, 32(3):733-749, 1985.
19. A. P. Sistla, M. Y. Vardi, and P. Wolper. The complementation problem for büchi automata with applications to temporal logic. Theoretical Computer Science, 49:217-237, 1987.
20. Thomas, W. Classifying regular events in symbolic logic. Journal of Computer and System Sciences, 25:360-376, 1982.
21. A. Valmari. A stubborn attack on state explosion. Formal Methods in System Design, 1:297-322, 1992.
22. M. Y. Vardi and P. Wolper. Reasoning about infinite computation. Information and Computation, 115:1-37, 1994.
23. Pierre Wolper. Temporal logic can be more expressive. Information and Control, 56:72-99, 1983.