Model checking partial state spaces with 3-valued temporal logics (Extended abstract)

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

Volumn 1633, Issue , 1999, Pages 274-287

  Bruns, Glenn ^a   Godefroid, Patrice ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED ANALYSIS; COMPUTER CIRCUITS; TEMPORAL LOGIC;

CTL MODEL-CHECKING; EXTENDED ABSTRACTS; INTUITIONISTIC MODAL LOGIC; KRIPKE STRUCTURE; LABELED TRANSITION SYSTEMS; MODAL LOGIC; PARTIAL STATE; TRUTH VALUES;

MODEL CHECKING;

EID: 84957073398     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48683-6_25     Document Type: Conference Paper

References (21)

1. [BBLS92] S. Bensalem, A. Bouajjani, C. Loiseaux, and J. Sifakis. Property preserving simulations. In Proceedings of CAV '92, LNCS 663, pages 260-273, 1992.
2. 20 states and beyond. In Proceedings of the 5th Symposium on Logic in Computer Science, pages 428-439, Philadelphia, June 1990.
3. [CE81] E. M. Clarke and E. A. Emerson. Design and Synthesis of Synchronization Skeletons using Branching-Time Temporal Logic. In D. Kozen, editor, Proceedings of the Workshop on Logic of Programs, Yorktown Heights, volume 131 of Lecture Notes in Computer Science, pages 52-71. Springer-Verlag, 1981.
4. [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.
5. [CS90] Rance Cleaveland and Bernhard Steffen. When is "partial" adequate? A logic-based proof technique using partial specifications. In Proceedings of the 5th Annual Symposium on Logic in Computer Science. IEEE Computer Society Press, 1990.
6. [Eme90] E. A. Emerson. Temporal and modal logic. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science. Elsevier/MIT Press, Amsterdam/Cambridge, 1990.
7. [Fit92] Melvin Fitting. Many-valued modal logics II. Fundamenta Informaticae, 17:55-73, 1992.
8. [HM85] M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. Journal of the ACM, 32(1):137-161, 1985.
9. [Kle87] Stephen Cole Kleene. Introduction to Metamathematics. North Holland, 1987.
10. [Koz83] D. Kozen. Results on the Propositional Mu-Calculus. Theoretical Computer Science, 27:333-354, 1983.
11. [Mil81] R. Milner. A Modal Characterization of Observable Machine Behavior. In Proc. CAAP'81, volume 112 of Lecture Notes in Computer Science, pages 25-34. Springer-Verlag, 1981.
12. [Mil89] R. Milner. Communication and Concurrency. Prentice Hall, 1989.
13. [Mor89] Osamu Morikawa. Some modal logics based on a three-valued logic. Notre Dame Journal of Formal Logic, 30(1):130-137, 1989.
14. [MP92] Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer-Verlag, 1992.
15. th GI Conference, volume 104 of Lecture Notes in Computer Science, pages 167-183. Springer-Verlag, 1981.
16. [Sas97] T. Sasao. Ternary Decision Diagrams-A Survey. In Proc. IEEE International Symposium on Multiple-Valued Logic, pages 241-250, Nova Scotia, May 1997.
17. [Seg67] Krister Segerberg. Some modal logics based on a three-valued logic. Theo-ria, 33:53-71, 1967.
18. [Sti87] Colin Stirling. Modal logics for communicating systems. Theoretical Computer Science, 49:331-347, 1987.
19. [Var97] M.Y. Vardi. Why is modal logic so robustly decidable? In Proceedings of DIMACS Workshop on Descriptive Complexity and Finite Models. AMS, 1997.
20. [vB84] J. van Bentham. Correspondence theory. In D. Gabbay and F. Guenthner, editors, Handbook of Philosophical Logic Vol. II. Reidel, 1984.
21. [Wal90] D. J. Walker. Bisimulation and divergence. Information and Computation, 85(2):202-241, 1990.