Advertisement

Results on the propositional μ-calculus

  • Dexter Kozen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 140)

Abstract

We define a propositional version of the Μ-calculus, and give an exponential-time decision procedure, small model property, and complete deductive system. We also show that it is strictly more expressive than PDL. Finally, we give an algebraic semantics and prove a representation theorem.

Keywords

Priority Queue Deductive System Algebraic Semantic Reverse Operator Propositional Dynamic Logic 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

Copyright information

© Springer-Verlag Berlin Heidelberg 1982

Authors and Affiliations

  • Dexter Kozen
    • 1
  1. 1.Aarhus UniversityAarhusDenmark

Personalised recommendations