Linear vs. branching time: A complexity-Theoretic perspective

Proceedings - Symposium on Logic in Computer Science

Volumn 1998-June, Issue , 1998, Pages 394-405

  Vardi, Moshe Y ^a  

^a RICE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; MODEL CHECKING; SPECIFICATIONS;

BRANCHING TIME; EXPRESSIVE POWER; LINEAR TEMPORAL LOGIC; LINEAR TIME;

TEMPORAL LOGIC;

EID: 80054048580     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.1998.705674     Document Type: Conference Paper

References (61)

1. [AL91] M. Abadi and L. Lamport. The existence of refinement mappings. Theoretical Computer Science, 82(2):253-284, 1991.
2. [ASB+94] A. Aziz, V. Singhal, F. Balarin, R. Brayton, and A.L. Sangiovanni-Vincentelli. Equivalences for fair kripke structures. In Proc. 21st Int. Colloquium on Automata, Languages and Programming, Jerusalem, Israel, July 1994.
3. [BBG+94] 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, pages 182- 193, Stanford, June 1994.
4. [BBLS92] S. Bensalem, A. Bouajjani, C. Loiseaux, and J. Sifakis. Property preserving simulations. In Proc. 4th Conference on Computer Aided Verification, volume 663 of Lecture Notes in Computer Science, pages 260-273, Montreal, June 1992. Springer-Verlag.
5. [BCM+92] J.R. Burch, E.M. Clarke, K.L.McMillan, D.L. Dill, and L.J. Hwang. Symbolic model checking: 1020 states and beyond. Information and Computation, 98(2):142-170, June 1992.
6. [BGS92] J. Balcazar, J. Gabarro, and M. Santha. Deciding bisimilarity is P-complete. Formal Aspects of Computing, 4(6):638-648, 1992.
7. [BMP83] M. Ben-Ari, Z. Manna, and A. Pnueli. The temporal logic of branching time. Acta Informatica, 20:207-226, 1983.
8. [BVW94] O. Bernholtz, M.Y. Vardi, and P. Wolper. An automata-Theoretic approach to branchingtime model checking. In D. L. Dill, editor, Computer Aided Verification, Proc. 6th Int. Conference, volume 818 of Lecture Notes in Computer Science, pages 142-155, Stanford, June 1994. Springer-Verlag, Berlin.
9. [CD88] E.M. Clarke and I.A. Draghicescu. Expressibility results for linear-Time and branchingtime 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.
10. [CE81] 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.
11. [CES86] 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, January 1986.
12. [CK86] E.M. Clarke and R.P. Kurshan. Computer aided verification. IEEE Spectrum, 33:61-67, 1986.
13. [CLM89] E.M. Clarke, D.E. Long, and K.L. McMillan. Compositional model checking. In R. Parikh, editor, Proc. 4th IEEE Symposium on Logic in Computer Science, pages 353-362. IEEE Computer Society Press, 1989.
14. [DDGJ89] W. Damm, G. Döhmen, V. Gerstner, and B. Josko. Modular verification of Petri nets: The temporal logic approach. In Stepwise Refinement of Distributed Systems: Models, Formalisms, Correctness (Proceedings of REX Workshop), volume 430 of Lecture Notes in Computer Science, pages 180-207, Mook, The Netherlands, May/June 1989. Springer- Verlag.
15. [DGG93] D. Dams, O. Grumberg, and R. Gerth. Generation of reduced models for checking fragments of CTL. In Proc. 5th Conf. on Computer Aided Verification, volume 697 of Lecture Notes in Computer Science, pages 479- 490. Springer-Verlag, June 1993.
16. [EH85] E.A. Emerson and J.Y. Halpern. Decision procedures and expressiveness in the temporal logic of branching time. Journal of Computer and System Sciences, 30:1-24, 1985.
17. [EH86] 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.
18. [EJ88] E.A. Emerson and C. Jutla. The 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.
19. [EL85] 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.
20. [Eme90] E.A. Emerson. Temporal and modal logic. Handbook of Theoretical Computer Science, pages 997-1072, 1990.
21. [FL79] M.J. Fischer and R.E. Ladner. Propositional dynamic logic of regular programs. Journal of Computer and Systems Sciences, 18:194- 211, 1979.
22. [GL94] O. Grumberg and D.E. Long. Model checking and modular verification. ACM Trans. on Programming Languages and Systems, 16(3):843-871, 1994.
23. [Goe97] R. Goering. Model checking expands verification's scope. Electronic Engineering Today, February 1997.
24. [Hen85] M. Hennessy. Algebraic theory of Processes. MIT Press, Cambridge, 1985.
25. [Hoa85] C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.
26. [HP85] D. Harel and A. Pnueli. On the development of reactive systems. In K. Apt, editor, Logics and Models of Concurrent Systems, volume F-13 of NATO Advanced Summer Institutes, pages 477-498. Springer-Verlag, 1985.
27. [Jon83] C.B. Jones. Specification and design of (parallel) programs. In R.E.A. Mason, editor, Information Processing 83: Proc. IFIP 9th World Congress, pages 321-332. IFIP, North- Holland, 1983.
28. [Jos89] B. Josko. Verifying the correctness of AADL modules using model chekcing. In Stepwise Refinement of Distributed Systems: Models, Formalisms, Correctness (Proceedings of REX Workshop), volume 430 of Lecture Notes in Computer Science, pages 386-400, Mook, The Netherlands, May/June 1989. Springer- Verlag.
29. [KT90] D. Kozen and L. Tiuryn. Logics of programs. Handbook of Theoretical Computer Science, pages 789-840, 1990.
30. [Kup95] O. Kupferman. Model Checking for Branching-Time Temporal Logics. PhD thesis, The Technion, 1995.
31. [Kur94] R.P. Kurshan. Computer Aided Verification of Coordinating Processes. Princeton Univ. Press, 1994.
32. [Kur97] R.P. Kurshan. Formal verification in a commercial setting. The Verification Times, 1997.
33. [KV95] O. Kupferman and M.Y. Vardi. On the complexity of branchingmodularmodel checking. In Proc. 6th Conference on Concurrency Theory, volume 962 of Lecture Notes in Computer Science, pages 408-422, Philadelphia, August 1995. Springer-Verlag.
34. [KV96] 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.
35. [KV98] O. Kupferman and M.Y. Vardi. Verification of fair transition systems. Chicago Journal of Theoretical Computer Science, 1998(2), March 1998.
36. [KVW98] O. Kupferman, M.Y. Vardi, and P. Wolper. Module checking. to appear, 1998.
37. [Lam80] 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.
38. [Lam83] L. Lamport. Specifying concurrent program modules. ACM Trans. on Programming Languages and Systenms, 5:190-222, 1983.
39. [LP85] 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.
40. [LPS81] D. Lehman, A. Pnueli, and J. Stavi. Impartiality, justice, and fairness -The ethics of concurrent termination. In Proc. 8th Colloq. on Automata, Programming, and Languages (ICALP), volume 115 of Lecture Notes in Computer Science, pages 264-277. Springer- Verlag, July 1981.
41. [LS84] S.S. Lam and A.U. Shankar. Protocol verification via projection. IEEE Trans. on Software Engineering, 10:325-342, 1984.
42. [LT87] N. A. Lynch and M.R. Tuttle. Hierarchical correctness proofs for distributed algorithms. In Proc. 6th ACM Symp. on Principles of Distributed Computing, pages 137-151, 1987.
43. [MC81] B. Misra and K.M. Chandy. Proofs of networks of processes. IEEE Trans. on Software Engineering, 7:417-426, 1981.
44. [Mil71] 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.
45. [Mil80] R.Milner. A Calculus of Communicating Systems, volume 92 of Lecture Notes in Computer Science. Springer Verlag, Berlin, 1980.
46. [Mil89] R. Milner. Communication and Concurrecny. Prentice-Hall, Englewood Clifs, 1989.
47. [MP92a] Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer-Verlag, Berlin, January 1992.
48. [MP92b] Z. Manna and A. Pnueli. Temporal specification and verification of reactive modules. 1992.
49. [MP95] Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems: Safety. Springer-Verlag, New York, 1995.
50. [MS72] A.R. Meyer and L.J. Stockmeyer. The equivalence problem for regular expressions with squaring requires exponential time. In Proc. 13th IEEE Symp. on Switching and Automata Theory, pages 125-129, 1972.
51. [Pnu81] A. Pnueli. The temporal semantics of concurrent programs. Theoretical Computer Science, 13:45-60, 1981.
52. [Pnu85a] A. Pnueli. In transition from global to modular temporal reasoning about programs. In K. Apt, editor, Logics and Models of Concurrent Systems, volume F-13 of NATO Advanced Summer Institutes, pages 123-144. Springer- Verlag, 1985.
53. [Pnu85b] 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.
54. [QS81] 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- Verlag, Lecture Notes in Computer Science, 1981.
55. [SC85] A.P. Sistla and E.M. Clarke. The complexity of propositional linear temporal logic. Journal ACM, 32:733-749, 1985.
56. Sti87] C. Stirling. Comparing linear and branching time temporal logics. In B. Banieqbal, H. Barringer, and A. Pnueli, editors, Temporal Logic in Specification, volume 398, pages 1-20. Lecture Notes in Computer Science, Springer-Verlag, 1987.
57. [Sti92] C. Stirling. Modal and temporal logics. Handbook of Logic in Computer Science, Vol. 2, pages 477-563, 1992.
58. [Tho90] W. Thomas. Automata on infinite objects. Handbook of Theoretical Computer Science, pages 165-191, 1990.
59. [VS85] M.Y. Vardi and L. Stockmeyer. Improved upper and lower bounds for modal logics of programs. In Proc 17th ACM Symp. on Theory of Computing, pages 240-251, 1985.
60. [VW86] M.Y. Vardi and P. Wolper. An automatatheoretic approach to automatic program verification. In Proc. First Symposium on Logic in Computer Science, pages 322-331, Cambridge, June 1986.
61. [Wol82] P. Wolper. Synthesis of Communicating Processes from Temporal Logic Specifications. PhD thesis, Stanford University, 1982.