Hüttel, Hans SnS can be modally characterized. (English) Zbl 0701.68064 Theor. Comput. Sci. 74, No. 2, 239-248 (1990). Summary: We show that a modal mu-calculus with label set \(\{\) 1,...,n\(\}\) can define the Rabin recognizable tree languages up to an equivalence similar to the observational equivalence of Milner. Cited in 2 Documents MSC: 68Q45 Formal languages and automata 03B45 Modal logic (including the logic of norms) 03C85 Second- and higher-order model theory Keywords:concurrent systems; transitions; second-order monadic theory of n successors; Rabin’s tree theorem; modal mu-calculus; tree languages PDFBibTeX XMLCite \textit{H. Hüttel}, Theor. Comput. Sci. 74, No. 2, 239--248 (1990; Zbl 0701.68064) Full Text: DOI References: [1] Amir, A.; Gabbay, D., Preservation of exprience completeness in temporal models, Inform. and Control, 72, 66-83 (1987) · Zbl 0621.03008 [2] Ben-Ari, M.; Manna, Z.; Pnueli, A., The temporal logic of branching time, Acata Inform., 20, 207-226 (1983) · Zbl 0533.68036 [3] Browne, M. C.; Clarke, E. M.; Grümberg, O., Characterizing Kripke structures in temporal logic, (Tech. Report CMU-CS-87-104 (1987), Carnegie-Mellon University) · Zbl 0626.03019 [4] Hafer, T.; Thomas, W., Computation tree logic \(CTL^∗\) and parth quantifiers in the monadic theory of the binary tree, (Proc. 11th Internat. Coll. on Automata Languages and Programming. Proc. 11th Internat. Coll. on Automata Languages and Programming, Lecture Notes in Computer Science, 267 (1984), Springer: Springer Berlin), 269-279 [5] Kozen, D., Results on the propositional μ-calculus, Theoret. Comput. Sci., 27, 333-354 (1983) · Zbl 0553.03007 [6] Milner, R., Communication and Concurrency (1989), Prentice-Hall: Prentice-Hall Englewood Cliff, NJ · Zbl 0683.68008 [7] Niwinski, D., Fixed points vs. infinite generation, Proc. 3rd Symp. on Logic in Comp. Sci. (1988), Edinburgh [8] Rabin, M. O., Decidability of second-order theories and automata on infinite trees, Trans. Amer. Math. Soc., 141, 1-35 (1969) · Zbl 0221.02031 [9] Street, R. S.; Emerson, E. A., The Propositional mu-calculus is elementary, (Proc. 11th Internat. Coll. on Automata Languages and Programming. Proc. 11th Internat. Coll. on Automata Languages and Programming, Lecture Notes in Computer Science, 67 (1984), Springer: Springer Berlin), 465-472 [10] Wolper, P., Temporal logic can be more expressive, Inform. and Control, 56, 72-99 (1983) · Zbl 0534.03009 [11] Wolper, P.; Vardi, M. Y.; Sistla, A. P., Reasoning about infinite computation paths, Proc. 24th IEEE Symp. on Found. of Comput. Sci., 185-194 (1983) This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.