Preview
Unable to display preview. Download preview PDF.
References
Fischer, M.J. and R.E. Ladner, "Propositional Dynamic Logic of Regular Programs," J. Comput. Syst. Sci. 18:2 (1979), 194–211.
Kozen, D., "Results on the propositional μ-calculus," Proc. 9th Int. Colloq. on Automata, Languages, and Programming, 1982, Springer-Verlag, 348–359.
Pratt, V.R., "A Decidable μ-calculus (preliminary report)," Proc. 22nd IEEE Symp. on Foundations of Computer Science, 1981, 421–427.
Rabin, M.O., "Decidability of second-order theories and automata on infinite trees," Trans. Amer. Math. Soc. 141 (1969), 1–35.
Streett, R., "Propositional Dynamic Logic of looping and converse," Proc. 13th ACM Symp. on Theory of Computing, 1981, 375–383.
Scott, D. and J. de Bakker, "A theory of programs," unpublished, Vienna, 1969.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kozen, D., Parikh, R. (1984). A decision procedure for the propositional μ-calculus. In: Clarke, E., Kozen, D. (eds) Logics of Programs. Logic of Programs 1983. Lecture Notes in Computer Science, vol 164. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-12896-4_370
Download citation
DOI: https://doi.org/10.1007/3-540-12896-4_370
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12896-0
Online ISBN: 978-3-540-38775-6
eBook Packages: Springer Book Archive