Proof systems for Hennessy-Milner Logic with recursion

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

Volumn 299 LNCS, Issue , 1988, Pages 215-230

  Larsen, Kim G ^a  

^a AALBORG UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; FORESTRY;

DECISION PROCEDURE; FINITE STATE PROCESS; HENNESSY-MILNER LOGICS; LIVENESS PROPERTIES; PROOF SYSTEM; SAFETY PROPERTY; SOUND AND COMPLETE; STANDARD INTERPRETATION;

COMPUTER CIRCUITS;

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

References (26)

1. Aczel, P.: An Introduction to Inductive Definitions, North-Holland, in the Handbook of Mathematical Logic, 1983.
2. Ben-Ari, M., Pnueli, A. and Manna, Z.: The Temporal Logic of Branching Time, Acta Informatica, 20, pp 207-226, 1983.
3. Bloom and Troeger: A Logical Characterization of Observation Equivalence, TCS, vol 35, no 1, 1985
4. Brookes, S. and Rounds, R.: Behavioural Equivalence Relations Induced by Programming Logics, LNCS 154, 1983
5. Clarke, E.M. and Emerson, E.A.: Design and Synthesis of Synchronization Skeletons using Branching Time Temporal Logic, in: Logics of Programs, LNCS 131, 52-71, 1981.
6. Clarke, E.M, Emerson, E.A, Sistia, A.P.: Automatic Verification of Finite State Concurrent Systems Using Temporal Logic Specifications: A Practical Approach, Proc 10th ACM POPL, 117-126, 1983.
7. Graf, S. and Sifakis, J.: A modal Characterization of observational congruence on finite terms of CCS, LNCS 172, 1984.
8. Graf, S. and Sifakis, J.: A Logic for the Specification and Proof of Regular Controllable Processes of CCS, Acta Informatica, 23, pp 507-527, 1986.
9. Graf, S. Sifakis, J.: A Logic for the Description of Non-deterministic Programs and Their Properties, Information and Control, vol. 68, nor 1-3, 1986.
10. Hennessy, M. and Milner, R.: Algebraic Laws for Nondeterminism and Concurrency, Journal of the Association for Computing Machinery, 1985.
11. Kozen, D.: Results on the Propositional Ms-Calculus, 9th ICALP, LNCS 140, 1982.
12. Larsen, K.G.: Proof Systems for Hennessy-Milner Logic with Recursion, Aalborg University, Department of Mathematics and Computer Science, R 87-20, 1987.
13. Manna, Z. and Wolper, P. Synthesis of Communicating Processes from Temporal Logic Specifications, LNCS 131, 1981.
14. Milner, R.: A Calculus of Communicating Systems, LNCS 92, 1980.
15. Milner, R.: A Modal Characterization of Observable Machine-behaviour, LNCS 112, 1981.
16. Milner, R.: Calculi for Synchrony and Asynchrony, TCS 25, pp 267-310, 1983.
17. Park, D.: Concurrency and automata on infinite sequences, LNCS 84, 1980.
18. Plotkin, G.: A Structural Approach to Operational Semantics, DAIMI-FN-19, Aarhus University, Computer Science Department, Denmark, 1981.
19. Pnueli, A.: Linear and Branching Structures in the Semantics and Logics of Reactive Systems, 12th ICALP, LNCS 194, 1985.
20. Stirling, C.: A Proof Theoretic Characterization of Observationl Equivalence, FCT-TCS Bangalore, To appear in TCS, 1983.
21. Stirring, C.: A Complete Proof System for a Subset of SCCS, LNCS 185, to appear in CAAP'85, 1985.
22. Stirring, C.: A Compositional Modal Proof Systern for a Subset of CCS, 12th ICALP, LNCS 194, full version to appear in TCS., 1985.
23. Stifling, C.: Modal Logics for Communicating Systems, to appear in TCS., 1986.
24. Tarski, A.: A Lattice-Theoretical Fixpoint Theorem and its Applications, Pacific Journal of Math. 5, 1955.
25. Winskel, G.: On the Composition and Decomposition of Assertions, LNCS 197, 1984.
26. Winskel, G.: A Complete Proof System for SCCS with Modal Assertions, Technical Report, Computer Laboratory, University of Cambridge, 1985.