Sometimes and not never re-revisited: On branching versus linear time

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

Volumn 1466, Issue , 1998, Pages 1-17

  Vardi, Moshe Y ^a  

^a Rice University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; DISTRIBUTED COMPUTER SYSTEMS; TEMPORAL LOGIC;

COMPUTATIONAL ADVANTAGES; CTL MODEL-CHECKING; LINEAR MODELING; LINEAR PROPERTIES; LTL MODEL-CHECKING; MODEL CHECKER; PATH QUANTIFIERS; TEMPORAL OPERATORS;

MODEL CHECKING;

EID: 84945906947     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055612     Document Type: Conference Paper

References (53)

1. M. Ben-Ari, A. Pnueli, and Z. Manna. The temporal logic of branching time. Acta lnformatica, 20: 207-226, 1983.
2. O. Bemholtz, M.Y. Vardi, and P. Wolper. An automata-theoretic approach to branching-time model checking. In D. L. Dill, editor, Computer Aided Verification, Prec. 6th int. Conference, volume 818 of Lecture Notes in Computer Science, pages 142-155, Stanford, June 1994. Springer-Verlag, Berlin.
3. R.K. Brayton, G.D. Hachtel, A. Sangiovanni-Vincentelli, E Somenzi, A. Aziz, S.-T. Cheng, S. Edwards, S. Khatri, T. Kukimoto, A. Pardo, S. Qadeer, R.K. Ranjan, S. Sarwary, T.R. Shiple, G. Swamy, and T. Villa. VIS: a system for verification and synthesis. In Computer Aided Verification, Proc. 8th Int. Conference, volume 1102 of Lecture Notes in Computer Science, pages 428-432. Springer-Verlag, 1996.
4. E. M. Clarke, I. A. Draghicescu, and R. E Kurshan. A unified approach for showing language containment and equivalence between various types of ω-automata. Information Processing Letters 46, pages 301-308, (1993).
5. E.M. Clarke and I.A. Draghicescu. Expressibility results for linear-time and branching-time logics. In Proc. Workshop on Linear Time, Branching Time, and Partial Order in Logics and Models for Concurrency, volume 354 of Lecture Notes in Computer Science, pages 428-437. Springer-Verlag, 1988.
6. 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, pages 52-71. Springer-Verlag, 1981.
7. E.M. Clarke, E.A. Emerson, and A.E Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems, 8(2): 244-263, January 1986.
8. E.M. Clarke, O. Gmmberg, and D. Long. Verification tools for finite-state concurrent systems. In J.W. de Bakker, W.-E de Roever, and G. Rozenberg, editors, Decade of Concurrency - Reflections and Perspectives (Proceedings of REX School), volume 803 of Lecture Notes in Computer Science, pages 124--175. Springer-Verlag, 1993.
9. R. Cleaveland. A linear-time model-checking algorithm for the alternation-free modal µ-calculus. Formal Methods in System Design, 2: 121-147, 1993.
10. E.A. Emerson. Temporal and modal logic. Handbook of Theoretical Computer Science, pages 997-1072, 1990.
11. E.A. Emerson and E.M. Clarke. Characterizing correctness properties of parallel programs using fixpoints. In Proc. 7th Int’l Colloq. on Automata, Languages and Programming, pages 169-181, 1980.
12. E.A. Emerson and J.Y. Halpern. Sometimcs 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. Tile complexity of tree automata and logics of programs. In Proc. 29th IEEE Symposium on Foundations of Computer Science, pages 368-377, White Plains, October 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, New Orleans, January 1985.
15. E.A. Emerson and C.-L. Lei. Efficient model checking in fragments of the proposoitional Mucalculus. In Proc. 1st Symposium on Logic in Computer Science, pages 267-278, Cambridge, June 1986.
16. K. Fislerand, M.Y. Vardi. Bisimulation minimization in an antomata-tbeoretic verification framework. Unpublished manuscript, 1998.
17. R. Gerth, D. Peled, M.Y. Vardi, and P. Wolper. A simple on-the-fly automatic verification for linear temporal logic. In Protocol Specification, Testing, and Verification, pages 3-18. Chapman & Hall, August 1995.
18. O. Grumberg and D.E. Long. Model checking and modular verification. ACM Trans. on Programming Languages and Systems, 16(3): 843-871, 1994.
19. Th. Hafer and W. Thomas. Computation tree logic CTL* and path quantifiers in the monodic theory of the binary tree. In Proc. 14th International Coll. on Automata, Languages, and Programming, volume 267 of Lecture Notes in Computer Science, pages 269-279. Springer-Verlag, 1987.
20. R.H. Hardin, Z. Har’el, and R.E Kurshan. COSPAN. In Computer Aided Verification, Proc. 8th Int. Conference, volume 1102 of Lecture Notes in Computer Science, pages 423--427. Springer-Verlag, 1996.
21. R.H. Hardin, R.P. Kurshan, S.K. Shukla, and M.Y. Vardi. A new heuristic for bad cycle detection using BDDs. In Computer Aided Verification, Proc. 9th Int. Conference, volume 1254 of Lecture Notes in Computer Science, pages 268-278. Springer-Verlag, 1997.
22. G.J. Holzmann. The model checker SPIN. IEEE Trans. on Software Engineering, 23(5): 279-295, May 1997. Special issue on Formal Methods in Software Practice.
23. D. Kozen. Results on the propositional µ-calculus. Theoretical Computer Science, 27: 333-354, 1983.
24. S.C. Krishnan, A. Puri, and R.K. Brayton. Deterministic ω-automata vis-a-vis deterministic Buchi automata. In Algorithms and Computations, volume 834 of Lecture Notes in Computer Science, pages 378-386. Springer-Verlag, 1994.
25. O. Kupferman and O. Grumberg. Buy one, get one free!!! Journal of Logic and Computation, 6(4): 523-539, 1996.
26. O. Kupferman, S. Safra, and M.Y. Vardi. Relating word and tree automata. In Proc. 11th IEEE Symposium on Logic in Computer Science, pages 322-333, DIMACS, June 1996.
27. 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, pages 408-422, Philadelphia, August 1995. Springer-Verlag.
28. O. Kupferman and M.Y. Vardi. Module checking. In Computer Aided Verification, Proc. 8th Int. Conference, volume 1102 of Lecture Notes in Computer Science, pages 75-86. Springer-Verlag, 1996.
29. O. Kupferman and M.Y. Vardi. Module checking revisited. In Computer Aided Verification, Proc. 9th Int. Conference, volume 1254 of Lecture Notes in Computer Science, pages 36-47. Springer-Verlag, 1997.
30. O. Kupferman and M.Y. Vardi. Freedom, weakness, and determinism: from linear-time to branching-time. In Proc. 13th IEEE Symposium on Logic in Computer Science, Indiana, June 1998.
31. O. Kupferman and M.Y. Vardi. Relating linear and branching model checking. In IFIP Working Conference on Programming Concepts and Methods, pages 304 - 326, New York, June 1998. Chapman & Hall.
32. O. Kupferman and M.Y. Vardi. Verification of fair transition systems. Chicago Journal of Theoretical Computer Science, 1998(2), March 1998.
33. R.P. Kurshan. Computer Aided Verification of Coordinating Processes. Princeton Univ. Press, 1994.
34. L. Lamport. Sometimes is sometimes "not never" - on the temporal logic of programs. In Proc. 7th ACM Symposium on Principles of Programming Languages, pages 174-185, January 1980.
35. 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, New Orleans, January 1985.
36. Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer-Verlag, Berlin, January 1992.
37. K.L. McMillan. Symbolic model checking. Kluwer Academic Publishers, 1993.
38. M. Michel. Complementation is more difficult with automata on infinite words. CNET, Paris, 1988.
39. R. Milner. An algebraic definition of simulation between programs. In Proc. 2nd International Joint Conference on Artificial Intelligence, pages 481--489. British Computer Society, September 1971.
40. D.E. Muller, A. Saoudi, and P.E. Schupp. Alternating automata, the weak monadic theory of the tree and its complexity. In Proc. 13th Int. Colloquium on Automata, Languages and Programming. Springer-Verlag, 1986.
41. D.E. Muller and P.E. Schupp. Alternating automata on infinite trees. Theoretical Computer Science, 54: 267-276, 1987.
42. A. Pnueli. Linear and branching structures in the semantics and logics of reactive systems. In Proc. 12th Int. Colloquium on Automata, Languages and Programming, pages 15-32. Lecture Notes in Computer Science, Springer-Verlag, 1985.
43. J.P. Queille and J. Sifakis. Specification and verification of concurrent systems in Cesar. In Proc. 5th International Symp. on Programming, volume 137, pages 337-351. Springer-Vedag, Lecture Notes in Computer Science, 1981.
44. M.O. Rabin. Weakly definable relations and special automata, in Proc. Syrup. Math. Logic and Foundations of Set Theory, pages 1-23. North Holland, 1970.
45. M.O. Rabin and D. Scott. Finite automata and their decision problems. IBM Journal of Research and Development, 3: 115-125, 1959.
46. S. Safra. On the complexity of ω-automata. In Proc. 29th IEEE Symposium on Foundations of Computer Science, pages 319-327, White Plains, October 1988.
47. K. Schneider. CTL and equivalent sublanguages of CTL*. In Proceedings of IFIP Coaference on Computer Hardware Description Languages and Applications, pages 40-59, Toledo, April 1997. Chapman and Hall.
48. A.P. Sistla and E.M. Clarke. The complexity of propositional linear temporal logic. Journal ACM, 32: 733-749, 1985.
49. M.Y. Vardi. On the complexity of modular model checking. In Proc. lOth IEEE Symposium on Logic in Computer Science, pages 101-111, June 1995.
50. M.Y. Vardi. Verifiation of open systems. In S. Ramesh and G. Sivakuma, editors, Proc. 17th Conf. on Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computers Science, pages 250-266. Springer-Verlag, 1997.
51. M.Y. Vardi. Linear vs. branching time: A complexity-theoretic perspective. In Proc. 13th IEEE S,m.. on Logic in Computer Science, 1998.
52. M.Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proc. First Symposium on Logic in Computer Science, pages 322-331, Cambridge, June 1986.
53. M.Y. Vardi and P. Woiper. Reasoning about infinite computations. Information and Computation, 115(1): 1-37, November 1994.