Alternating-time temporal logic*

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

Volumn 1536, Issue , 1998, Pages 23-60

  Alur, Rajeev ^a   Henzinger, Thomas A ^c   Kupferman, Orna ^b  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b LUCENT TECHNOLOGIES   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; MODEL CHECKING; SPECIFICATION LANGUAGES; SPECIFICATIONS;

ALTERNATING TIME TEMPORAL LOGIC; ALTERNATING TRANSITION SYSTEM; ASYNCHRONOUS COMPOSITION; AUTOMATIC VERIFICATION; LINEAR TIME FORMULAS; LINEAR TIME TEMPORAL LOGIC; MODEL CHECKING PROBLEM; SYMBOLIC MODEL CHECKING;

TEMPORAL LOGIC;

EID: 84949185739     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49213-5_2     Document Type: Conference Paper

References (42)

1. R. Alur and T.A. Henzinger. Reactive modules. In Proc. 11th IEEE Symposium on Logic in Computer Science, pages 207-218, 1996.
2. M. Abadi and L. Lamport. Composing specifications. ACM Transactions on Programming Languages and Systems, 15(1):73-132, 1993.
3. M. Abadi, L. Lamport, and P. Wolper. Realizable and unrealizable concurrent program specifications. In Proc. 16th Int. Colloquium on Automata, Languages, and Programming, volume 372 of Lecture Notes in Computer Science, Springer-Verlag, pages 1-17, 1989.
4. I. Beer, S. Ben-David, D. Geist, R. Gewirtzman, and M. Yoeli. Methodology and system for practical formal verification of reactive hardware. In Proc. 6th Conference on Computer-aided Verification, volume 818 of Lecture Notes in Computer Science, Springer-Verlag, pages 182-193, 1994.
5. 20 states and beyond. In Proc. 5th Symposium on Logic in Computer Science, pages 428-439, 1990.
6. O. Bernholtz, M.Y. Vardi, and P. Wolper. An automata-theoretic approach to branching-time model checking. In Proc. 6th Conference on Computer-aided Verification, volume 818 of Lecture Notes in Computer Science, Springer-Verlag, pages 142-155, 1994.
7. E.M. Clarke and E.A. Emerson. Design and synthesis of synchronization skeletons using branching-time temporal logic. In Proc. Workshop on Logic of Programs, volume 131 of Lecture Notes in Computer Science, Springer-Verlag, pages 52-71, 1981.
8. E.M. Clarke, E.A. Emerson, and A.P. Sistla. Automatic verification of finite-state concurrent systems using temporal-logic specifications. ACM Transactions on Programming Languages and Systems, 8(2):244-263, 1986.
9. A.K. Chandra, D.C. Kozen, and L.J. Stockmeyer. Alternation. Journal of the ACM, 28(1):114-133, 1981.
10. R. Cleaveland. A linear-time model-checking algorithm for the alternation-free modal μ-calculus. Formal Methods in System Design, 2:121-147, 1993.
11. D.L. Dill. Trace Theory for Automatic Hierarchical Verification of Speed-independent Circuits. MIT Press, 1989.
12. E.A. Emerson and J.Y. Halpern. Sometimes and not never revisited: On branching versus linear time. Journal of the ACM, 33(1):151-178, 1986.
13. E.A. Emerson and C. Jutla. The complexity of tree automata and logics of programs. In Proc. 29th LEEE Symposium on Foundations of Computer Science, pages 368-377, 1988.
14. E.A. Emerson and C.-L. Lei. Modalities for model checking: Branching time logic strikes back. In Proc. 20th ACM Symposium on Principles of Programming Languages, pages 84-96, 1985.
15. E.A. Emerson and C.-L. Lei. Efficient model checking in fragments of the propositional /t-calculus. In Proc. 1st Symposium on Logic in Computer Science, pages 267-278, 1986.
16. E.A. Emerson and A.P. Sistla. Deciding branching-time logic. In Proc. 16th ACM Symposium on Theory of Computing, 1984.
17. M.J. Fischer and R.E. Ladner. Propositional dynamic logic of regular programs. Journal of Computer and Systems Sciences, 18:194-211, 1979.
18. R. Gawlick, R. Segala, J. Sogaard-Andersen, and N. Lynch. Liveness in timed and untimed systems. In Proc. 23rd Int. Colloquium on Automata, Languages, and Programming, volume 820 of Lecture Notes in Computer Science, Springer-Verlag, pages 166-177, 1994.
19. C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.
20. G.J. Holzmann. The model checker SPIN. LEEE Transactions on Software Engineering, 23(5):279-295, 1997.
21. N. Immerman. Number of quantifiers is better than number of tape cells. Journal of Computer and System Sciences, 22(3):384-406, 1981.
22. D. Kozen. Results on the propositional μ-calculus. Theoretical Computer Science, 27:333-354, 1983.
23. O. Kupferman and M.Y. Vardi. On the complexity of branching modular model checking. In Proc. 6th Conferance on Concurrency Theory, volume 962 of Lecture Notes in Computer Science, Springer-Verlag, pages 408-422, 1995.
24. O. Kupferman and M.Y. Vardi. Module checking. In Proc. 8th Conference on Computer-aided Verification, volume 1102 of Lecture Notes in Computer Science, Springer-Verlag, pages 75-86, 1996.
25. O. Lichtenstein and A. Pnueli. Checking that finite-state concurrent programs satisfy their linear specification. In Proc. 12th ACM Symposium on Principles of Programming Languages, pages 97-107, 1985.
26. N.A. Lynch. Distributed Algorithms. Morgan-Kaufmann, 1996.
27. K.L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, 1993.
28. R. Parikh. Propositional game logic. In Proc. 24th LEEE Symposium on Foundation of Computer Science, pages 195-200, 1983.
29. A. Pnueli. The temporal logic of programs. In Proc. 18th LEEE Symposium on Foundation of Computer Science, pages 46-57, 1977.
30. G.L. Peterson and J.H. Reif. Multiple-person alternation. In Proc. 20th LEEE Symposium on Foundation of Computer Science, pages 348-363, 1979.
31. A. Pnueli and R. Rosner. On the synthesis of a reactive module. In Proc. 16th ACM Symposium on Principles of Programming Languages, 1989.
32. A. Pnueli and R. Rosner. On the synthesis of an asynchronous reactive module. In Proc. 16th Lnt. Colloquium on Automata, Languages, and Programming, volume 372 of Lecture Notes in Computer Science, Springer-Verlag, pages 652-671, 1989.
33. A. Pnueli and R. Rosner. Distributed reactive systems are hard to synthesize. In Proc. 31st LEEE Symposium on Foundation of Computer Science, pages 746-757, 1990.
34. J.P. Queille and J. Sifakis. Specification and verification of concurrent systems in Cesar. In Proc. 5th Lnternational Symposium on Programming, volume 137 of Lecture Notes in Computer Science, Springer-Verlag, pages 337-351, 1981.
35. M.O. Rabin. Weakly definable relations and special automata. In Proc. Symposium on Mathematical Logic and Foundations of Set Theory, pages 1-23. North Holland, 1970.
36. J.H. Reif. The complexity of two-player games of incomplete information. Journal on Computer and System Sciences, 29:274-301, 1984.
37. R. Rosner. Modular Synthesis of Reactive Systems. PhD thesis, Weizmann Institute of Science, Rehovot, Israel, 1992.
38. P.J.G. Ramadge and W.M. Wonham. The control of descrete event systems. LEEE Transactions on Control Theory, 77:81-98, 1989.
39. W. Thomas. On the synthesis of strategies in infinite games. In Proc. 12th Symposium on Theoretical Aspects of Computer Science, volume 900 of Lecture Notes in Computer Science, Springer-Verlag, pages 1-13, 1995.
40. M.Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proc. 1st LEEE Symposium on Logic in Computer Science, pages 322-331, 1986.
41. M.Y. Vardi and P. Wolper. Automata-theoretic techniques for modal logics of programs. Journal of Computer and System Science, 32(2):182-221, 1986.
42. M. Yannakakis. Synchronous multi-player games with incomplete information are undecidable. Personal communication, 1997.