Action versus state based logics for transition systems

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

Volumn 469 LNCS, Issue , 1990, Pages 407-419

  De Nicola, Rocco ^a   Vaandrager, Frits ^b  

^a CNR   (Italy)

^b CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTER CIRCUITS; MODEL CHECKING; SEMANTICS;

BRANCHING TIME; HENNESSY-MILNER LOGICS; KRIPKE STRUCTURE; LABELLED TRANSITION SYSTEMS; LIVENESS PROPERTIES; MODAL MU CALCULUS; TRANSFORMATION FUNCTIONS; TRANSITION SYSTEM;

TEMPORAL LOGIC;

EID: 84992284122     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-53479-2_17     Document Type: Conference Paper

References (16)

1. M.C. Browne, E.M. Clarke & O. Griimberg: Characterizing Finite Kripke Structures in Propositional Temporal Logic. Theoret. Comp. Sci., 59 (1,2), 1988, pp. 115-131.
2. E.M. Clarke, E.A. Emerson & A.P. Sistla: Automatic Verification of Finite State Concurrent Systems using Temporal Logic Specifications. ACM Toplas, 8 (2), 1986, pp. 244-263.
3. E.M. Clarke, D.E. Long & K.L Macmillan: Compositional Model Checking. In Proceedings 4th Annual Symposium on Logic in Computer Science (LICS), Asilomar, California, IEEE Computer Society Press, Washington, 1989, pp. 353-362.
4. Cleaveland, R., Parrow, J., Steffen, B. The Concurrency Workbench. In Automatic Verification Methods for Finite State Systems (J. Sifakis, ed.) Lecture Notes in Computer Science 407, Springer-Verlag, 1990, pp. 24-37.
5. R. De Nicola, & F.W. Vaandrager: Three Logics for Branching Bisimulatious (Extended Abstract) in Proc. of the 5th Annual Symposium on Logic in Computer Science (LICS "90), Philadelphia, USA, June 1990, IEEE Computer Society Press, Los Alamitos, CA, 1990, pp. 118-129.
6. R. De Nicola, & F.W. Vaandrager: Three Logics for Branching Bisimulations, CWI Report CSR9012, 1990.
7. E.A. Emerson & J.Y. Halpern: "Sometimes" and "Not Never" Revisited: on Branching Time versus Linear Time Temporal Logic. Journal of ACM, 33, 1, 1986, pp. 151-178.
8. E.A. Emerson & C.L. Lei: Modalities for Model Checking: Branching Time Strikes Back. Science of Computer Programming, 6, 1987.
9. E. A. Emerson & L Srinivasan: Branching Time Temporal Logic. In Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, (de Bakker, de Roever and Rozenberg, eds.) Lecture Notes in Computer Science 354, Springer-Verlag, 1989, pp. 123-172.
10. J.F. Groote & F.W. Vaandrager: An Efficient Algorithm for Branching Bisimulation and Stuttering Equivalence. In Proceedings ICALP '90, Warwick, Lecture Notes in Computer Science, Springer-Verlag, 1990.
11. R.J. van Glabbeek & W.P. Weijland: Branching Time and Abstraction in Bisimulation Semantics (extended abstract). In Information Processing "89 (G.X. Ritter, ed.), Elsevier Science Publishers B.V. (North Holland), 1989, pp. 613-618.
12. M. Hennessy & R. Milner: Algebraic Laws for Nondeterminism and Concurrency. Journal of ACM, 32, 1985, pp. 137-161.
13. B. Jonsson, A.H. Khan & J. Parrow: Implementing a model checking algorithm by adapting existing automated tools. In Automatic Verification Methods for Finite State Systems (J. Sifakis, ed.) Lecture Notes in Computer Science 407, Springer-Verlag, 1990, pp. 179-188.
14. L. Lamport: What Good Is Temporal Logic?, Information Processing '83 (R.E.A. Mason, ed.) Elsevier Science Publishers B.V. (North Holland), 1983, pp. 657-668.
15. K.G. Larsen: Proof Systems for Hennessy-Milner Logic with Recursion, in proceeding CAAP "88 (M. Dauchet & M. Nivat eds) Lecture Notes in Computer Science 299, Springer-Veflag, 1988.
16. C. Stirling: Temporal Logics for CCS, in Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, (de Bakker, de Roever and Rozenberg, eds.) Lecture Notes in Computer Science 354, Springer-Verlag, 1989, pp. 660-672.