This research was partially supported by NSF Grant MCS-82-16706. The third author, O. Grümberg, is currently on leave from Technion, Haifa and is partially supported by a Weizmann postdoctoral fellowship.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
M. Ben-Ari, A. Pneuli, Z. Manna. "The Temporal Logic of Branching Time". Acta Informatica 20 (1983), 207–226.
E.M. Clarke, E.A. Emerson. Design and Synthesis of Synchronization Skeletons using Branching Time Temporal Logic. Proceedings of the Workshop on Logic of Programs, Yorktown-Heights, NY, Lecture Notes in Computer Science #131, 1981.
E.M. Clarke, E.A. Emerson, A.P. Sistla. Automatic Verification of Finite-State Concurrent Systems using Temporal Logic Specifications: A Practical Approach. Tenth ACM Symposium on Principles of Programming Languages, Austin, Texas, 1983, pp. 117–126.
E.A. Emerson, J.Y. Halpern. "Sometimes" and "Not Never" Revisited: On Branching versus Linear Time Temporal Logic. Proceedings of the ACM Symposium on Principles of Programming Languages, Association for Computing Machinery, Austin, Texas, January, 1982. to appear in JACM.
E. A. Emerson and P. Sistla. Deciding Full Branching-time Logic. The Sixteenth Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, Washington, D.C., May, 1984.
S. Graf and J. Sifakis. From Synchronization Tree Logic to Acceptance Model Logic. LNCS Vol. 193, Logics of Programs, 1985.
M. Hennessy and R. Milner. On Observing Nondeterminism and Concurrency. LNCS Vol. 85, 7th ICALP, 1980.
G.E. Hughes and M.J. Creswell. An Introduction to Modal Logic. Methuen and Co., 1977.
L. Lamport. "Sometimes" is Sometimes "Not Never". Seventh Annual ACM Symposium on Principles of Programming Languages, Association for Computing Machinery, Las Vegas, January, 1980, pp. 174–185.
L. Lamport. What Good is Temporal Logic? Proceedings of the International Federation for Information Processing, 1983, pp. 657–668.
O. Lichtenstein and A. Pnucli. Checking that Finite State Concurrent Programs Satisfy Their Linear Specification. Conference Record of the Twelth Annual ACM Symposium on Principles of Programming Languages, New Orleans, La., January, 1985.
R. Milner. Lecture Notes in Computer Science. Volume 92: A Calculus of Communicating Systems. Springer-Verlag, 1979.
B. Mishra and E. Clarke. "Hierarchical Verification of Asynchronous Circuits using Temporal Logic", Theoretical Computer Science 38 (1985), 269–291.
Z. Manna, P. Wolper. "Synthesis of Communicating Processes from Temporal Logic Specifications". ACM Transactions on Programming Languages and Systems 6 (1984), 68–93.
A. Pnueli. Linear and Branching Structures in the Semantics and Logics of Reactive Systems. Proceedings of the 12th ICALP, 1985.
A.P. Sistla, E.M. Clarke, "Complexity of Propositional Linear Temporal Logics". Journal of the Association for Computing Machinery 32, 3 (July 1985), 733–749.
M.Y. Vardi, P. Wolper. An automata-theoretic approach to automatic program verification. Logic In Computer Science, Cambridge, Massachusetts, June, 1986.
P. Wolper. Specification and Synthesis of Communicating Processes Using an Extended Temporal Logic. Ninth Annual ACM Symposium on Principles of Programming Languages, Association for Computing Machinery, Albuquerque, New Mexico, January, 1982, pp. 20–33.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Browne, M.C., Clarke, E.M., Grümberg, O. (1987). Characterizing Kripke structures in temporal logic. In: Ehrig, H., Kowalski, R., Levi, G., Montanari, U. (eds) TAPSOFT '87. CAAP 1987. Lecture Notes in Computer Science, vol 249. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-17660-8_60
Download citation
DOI: https://doi.org/10.1007/3-540-17660-8_60
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-17660-2
Online ISBN: 978-3-540-47746-4
eBook Packages: Springer Book Archive