Expressibility results for linear-time and branching-time logics

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

Volumn 354 LNCS, Issue , 1989, Pages 428-437

  Clarke, E M ^a   Draghicescu, I A ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Branching time logic; Computation tree logics; Fairness; Linear time logic; Temporal logic

Indexed keywords

COMPUTATION THEORY; COMPUTER CIRCUITS; FORMAL LOGIC;

BRANCHING TIME; COMPUTATION TREE LOGIC; EXPRESSIBILITY; EXPRESSIVE POWER; FAIRNESS; LINEAR TIME; LINEAR TIME LOGIC; SIMPLE METHOD;

TEMPORAL LOGIC;

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

References (10)

1. E.M. Clarke A.P. Sistla. Complexity of propositional temporal logics. Journal of the Association for Computing Machinery, 32(3):733–749, July 1986.
2. M. Ben-Ari, Z. Manna, and A. Pneuli. The temporal logic of branching time. In 8th Annual ACM Symp. on Principles of Programming Languages, pages 164–177, 1981.
3. M. C. Browne, E. M. Clarke, and O. Grumberg. Characterizing Kripke structures in temporal logic. In 1987 Colloquium on Trees in Algebra and Programming, Pisa, Italy, March 1987.
4. E.M. Clarke and E.A. Emerson. Synthesis of synchronization skeletons for branching time temporal logic. In Proc. of the Workshop on Logic of Programs, Springer-Verlag, Yorktown Heights, NY, 1981.
5. 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.
6. E.A. Emerson and J.Y. Halpern. Decision procedures and expressiveness in the temporal logic of branching time. J. Comput. System Sci., 30(1):1–24, 1985.
7. E.A. Emerson and J.Y. Halpern. 'sometimes’ and ‘not never’ revisited: on branching versus linear time. In Proc. 10th ACM Symp. on Principles of Programming Languages, 1983.
8. G.E. Hughes and M.J. Creswell. An Introduction to Modal Logic. Methuen and Co., 1977.
9. L. Lamport. ‘sometimes’ is sometimes ‘not never’. In Seventh Annual ACM Symposium on Principles of Programming Languages, pages 174–185, Association for Computing Machinery, Las Vegas, January 1980.
10. D. E. Muller. Infinite sequences and finite machines. In Proc. 4th Annual IEEE Symposium of Switching Theory and Logical Design, pages 3–16, 1963.