Abstract
The propositional Μ-calculus as introduced by Kozen in [4] is considered. The notion of disjunctive formula is defined and it is shown that every formula is semantically equivalent to a disjunctive formula. For these formulas many difficulties encountered in the general case may be avoided. For instance, satisfiability checking is linear for disjunctive formulas. This kind of formula gives rise to a new notion of finite automaton which characterizes the expressive power of the Μ-calculus over all transition systems.
On leave from: Institute of Informatics, Warsaw University, Banacha 2, 02-097 Warsaw, POLAND.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
O. Bernholtz and O. Grumberg. Branching time temporal logic and amorphous tree automata. In Proc. 4th Conference on Concurrency Theory, volume 715 of Lecture Notes in Computer Science, pages 262–277. Springer-Verlag, 1993.
E.A. Emerson and C.S. Jutla. The complexity of tree automata and logics of programs. In 29th IEEE Symp. on Foundations of Computer Science, 1988.
E.A. Emerson and C.S. Jutla. Tree automata, mu calculus and determinacy. In Proc. FOCS 91, 1991.
D. Kozen. Results on the propositional mu-calculus. Theoretical Computer Science, 27:333–354, 1983.
D. Kozen. A finite model theorem for the propositional Μ-calculus. Studa Logica, 47(3):234–241, 1988.
A.W. Mostowski. Regular expressions for infinite trees and a standard form of automta. In A. Skowron, editor, Fith Symposium on Computation Theory, volume 208 of LNCS, pages 157–168, 1984.
D.E. Muller and P.E. Schupp. Alternating automata on infinite trees. Theoretical Computer Science, 54:267–276, 1987.
D. Niwiński. Fixed points vs. infinite generation. In Proc. 3rd. IEEE LICS, pages 402–409, 1988.
R.S. Street and E.A. Emerson. An automata theoretic procedure for the propositional mu-calculus. Information and Computation, 81:249–264, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Janin, D., Walukiewicz, I. (1995). Automata for the modal μ-calculus and related results. In: Wiedermann, J., Hájek, P. (eds) Mathematical Foundations of Computer Science 1995. MFCS 1995. Lecture Notes in Computer Science, vol 969. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60246-1_160
Download citation
DOI: https://doi.org/10.1007/3-540-60246-1_160
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60246-0
Online ISBN: 978-3-540-44768-9
eBook Packages: Springer Book Archive