Advertisement

The propositional mu-calculus is elementary

  • Robert S. Streett
  • E. Allen Emerson
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 172)

Abstract

The propositional mu-calculus is a propositional logic of programs which incorporates a least fixpoint operator and subsumes the Propositional Dynamic Logic of Fischer and Ladner, the infinite looping construct of Streett, and the Game Logic of Parikh. We give an elementary time decision procedure, using a reduction to the emptiness problem for automata on infinite trees. A small model theorem is obtained as a corollary.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

5. References

  1. deBakker, J., and deRoever, W. P. (1973), A Calculus for Recursive Program Schemes, in "First International Colloquium on Automata, Languages, and Programming", 167–196.Google Scholar
  2. deRoever, W. P. (1974), "Recursive Program Schemes: Semantics and Proof Theory", Ph. D. thesis, Free University, Amsterdam.Google Scholar
  3. Emerson, E. A., and Clarke, E. C. (1980), Characterizing Correctness Properties of Parallel Programs Using Fixpoints, in "Seventh International Colloquium on Automata, Languages, and Programming", 169–181.Google Scholar
  4. Fischer, M. J., and Ladner, R. E. (1979), Propositional Dynamic Logic of Regular Programs, Journal of Computer System Science 18, 194–211.Google Scholar
  5. Hitchcock, P., and Park, D. M. R. (1973), Induction Rules and Termination Proofs, in "First International Colloquium on Automata, Languages, and Programming", 225–251.Google Scholar
  6. Hossley, R., and Rackoff, C. W. (1972), The Emptiness Problem for Automata on Infinite Trees, in "Thirteenth IEEE Symposium on Switching and Automata Theory", 121–124.Google Scholar
  7. Kfoury, A. J., and Park, D. M. R. (1975), On Termination of Program Schemes, Information and Control 29, 243–251.Google Scholar
  8. Kozen, D. (1982), Results on the Propositional Mu-Calculus, in "Ninth International Colloquium on Automata, Languages, and Programming", 348–359.Google Scholar
  9. Kozen, D., and Parikh, R. J. (1983), A Decision Procedure for the Propositional Mu-Calculus, to appear in "Second Workshop on Logics of Programs".Google Scholar
  10. Meyer, A. R. (1974), Weak Monadic Second Order Theory of Successor is not Elementary Recursive, Boston Logic Colloquium, Springer-Verlag Lecture Notes in Mathematics 453.Google Scholar
  11. Parikh, R. J. (1979), A Decidability Result for a Second Order Process Logic, in "Nineteenth IEEE Symposium on the Foundations of Computing", 177–183.Google Scholar
  12. Parikh, R. J. (1983a), Cake Cutting, Dynamic Logic, Games, and Fairness, to appear in "Second Workshop on Logics of Programs".Google Scholar
  13. Parikh, R. J. (1983b), Propositional Game Logic, to appear in "Twenty-third IEEE Symposium on the Foundations of Computer Science".Google Scholar
  14. Park, D. M. R. (1970), Fixpoint Induction and Proof of Program Semantics, Machine Intelligence 5, Edinburgh University Press.Google Scholar
  15. Park, D. M. R. (1976), Finiteness is Mu-Ineffable, Theoretical Computer Science 3, 173–181.Google Scholar
  16. Pratt, V. R. (1982), A Decidable Mu-Calculus: Preliminary Report, in "Twenty-second IEEE Symposium on the Foundations of Computer Science", 421–427.Google Scholar
  17. Rabin, M. O. (1969), Decidability of Second Order Theories and Automata on Infinite Trees", Transactions of the American Mathematical Society 141, 1–35.Google Scholar
  18. Streett, R. S. (1981), "Propositional Dynamic Logic of Looping and Converse", MIT LCS Technical Report TR-263.Google Scholar
  19. Streett, R. S. (1982), Propositional Dynamic Logic of Looping and Converse is Elementarily Decidable, Information and Control 54, 121–141.Google Scholar
  20. Vardi, M., and Wolper, P. (1984), Automata Theoretic Techniques for Modal Logics of Programs, to appear in "Sixteenth ACM Symposium on the Theory of Computing".Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • Robert S. Streett
    • 1
  • E. Allen Emerson
    • 2
  1. 1.Computer Science DepartmentBoston UniversityBostonUSA
  2. 2.Computer Sciences DepartmentUniversity of TexasAustinUSA

Personalised recommendations