Results on the propositional μ-calculus

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

Volumn 140 LNCS, Issue , 1982, Pages 348-359

  Kozen, Dexter ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; CALCULATIONS; SEMANTICS;

ALGEBRAIC SEMANTIC; DECISION PROCEDURE; DEDUCTIVE SYSTEMS; EXPONENTIAL TIME; MODEL PROPERTIES; MU-CALCULUS; REPRESENTATION THEOREM;

TEMPORAL LOGIC;

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

References (17)

1. P. Hitchcock and D.M.R. Park, Induction Rules and Termination Proofs, PROC. 1st ICALP, 1973, 225-251.
2. D. Kozen and R. Parikh, An Elementary Proof of the Completeness of PDL, TCS 14 (1981), 113-118.
3. D. Kozen, A Representation Theorem for Models of *-free PDL, ProC. 7 th ICALP, Springer LNCS 85 (1980), 352-362.
4. D. Kozen, On the Duality of Dynamic Algebras and Kripke Models, PROC. Workshop on Logic of Programs, Springer LNCS 125, 1-11.
5. D. Kozen, On Induction vs. *-continuity, PROC. Workshop on Logics of Programs, Springer LNCS 131 (1982), 167-176.
6. D.M.R. Park, Fixpoint Induction and proof of program semantics, Mach. Int. 5, ed. Meltzer and Michie, Edinburgh Univ. Press, 1970, 59-78.
7. V.R. Pratt, A Decidable μ-calculus (Preliminary Report), PROC. 22nd FOCS, Oct. 1981, 421-427.
8. V.R. Pratt, A near optimal method for reasoning about action, JCSS 20 (1980), 231-254.
9. D. Scott and J. deBakker, A Theory of Programs, unpublished, IBM, Vienna, 1969.
10. R. Streett, Propositional Dynamic Logic of Looping and Converse, Proc. 13th STOC, May 1981, 375-383.
11. A. Chandra, D. Kozen, L. Stockmeyer, Alternation, JACM, Jan. 1981.
12. J. deBakker, Mathematical Theory of Program Correctness, Prentice-Hall, 1980.
13. J. deBakker and W. deRoever, A Calculus for Recursive Program Schemes, Proc. 1st ICALP, 1973, 167-196.
14. W.P. deRoever, Recursive Program Schemes: Semantics and Proof Theory, Ph.D. Thesis, Free University, Amsterdam, 1974.
15. E.A. Emerson and E.M. Clarke, Design and Synthesis of Synchro¬nization Skeletons using Branching-Time Temporal Logic, Proc. Workshop on Logics of Programs, Springer LNCS 131 (1982), 52-71.
16. M. Fischer and R. Ladner, Propositional Dynamic Logic of Regular Programs, JCSS 18:2 (79).
17. J. Halpern and J. Reif, The Propositional Dynamic Logic of Deterministic, Well-Structured Programs, (extended abstract), Proc. 2nd FOCS, Oct. 1981, 322-334.