On the Expressive Completeness of the Propositional mu-Calculus with Respect to Monadic Second Order Logic
暂无分享,去创建一个
[1] Robin Milner,et al. Communication and concurrency , 1989, PHI Series in computer science.
[2] P. S. Thiagarajan,et al. A trace based extension of linear time temporal logic , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.
[3] Wolfgang Thomas,et al. Computation Tree Logic CTL* and Path Quantifiers in the Monadic Theory of the Binary Tree , 1987, ICALP.
[4] M. Rabin. Decidability of second-order theories and automata on infinite trees , 1968 .
[5] Howard Barringer,et al. Temporal Logic with Fixed Points , 1987, Temporal Logic in Specification.
[6] Jan A. Bergstra,et al. Logic of transition systems , 1994, J. Log. Lang. Inf..
[7] Colin Stirling,et al. Modal and temporal logics , 1993, LICS 1993.
[8] Amihood Amir. Separation in Nonlinear Time Models , 1985, Inf. Control..
[9] R. J. vanGlabbeek. The linear time - branching time spectrum , 1990 .
[10] Igor Walukiewicz,et al. Monadic Second Order Logic on Tree-Like Structures , 1996, STACS.
[11] David Janin,et al. Automata for the mu-calculus and Related Results , 1995 .
[12] Dov M. Gabbay,et al. EXPRESSIVE FUNCTIONAL COMPLETENESS IN TENSE LOGIC , 1981 .
[13] J.F.A.K. van Benthem,et al. Language in Action: Categories, Lambdas and Dynamic Logic , 1997 .
[14] H. Gaifman. On Local and Non-Local Properties , 1982 .
[15] Mads Dam,et al. CTL* and ECTL* as Fragments of the Modal µ-Calculus , 1992, CAAP.
[16] Damian Niwinski,et al. Fixed points vs. infinite generation , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.
[17] David Harel,et al. Deciding Properties of Nonregular Programs , 1993, SIAM J. Comput..
[18] Fred Kröger,et al. Temporal Logic of Programs , 1987, EATCS Monographs on Theoretical Computer Science.
[19] Mogens Nielsen,et al. Models for Concurrency , 1992 .
[20] M. Rabin. Decidability of second-order theories and automata on infinite trees. , 1969 .
[21] E. Muller David,et al. Alternating automata on infinite trees , 1987 .
[22] A. Bouajjani,et al. On the verification problem of nonregular properties for nonregular processes , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.
[23] Samson Abramsky,et al. Handbook of logic in computer science. , 1992 .
[24] Dexter Kozen,et al. RESULTS ON THE PROPOSITIONAL’p-CALCULUS , 2001 .
[25] Javier Esparza,et al. On the Model Checking Problem for Branching Time Logics and Basic Parallel Processes , 1995, CAV.
[26] Wojciech Penczek,et al. Model-checking of causality properties , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.
[27] E. Allen Emerson,et al. Temporal and Modal Logic , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.
[28] Igor Walukiewicz,et al. Automata for the-calculus and Related Results , 1995 .
[29] André Arnold,et al. Finite transition systems , 1994 .
[30] D. Gabbay. Expressive Functional Completeness in Tense Logic (Preliminary report) , 1981 .
[31] Johan Anthory Willem Kamp,et al. Tense logic and the theory of linear order , 1968 .
[32] Saharon Shelah,et al. On the temporal analysis of fairness , 1980, POPL '80.
[33] Ilaria Castellani. Bisimulations and Abstraction Homomorphisms , 1987, J. Comput. Syst. Sci..
[34] E. Allen Emerson,et al. Tree automata, mu-calculus and determinacy , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[35] Rob J. van Glabbeek,et al. The Linear Time - Branching Time Spectrum II , 1993, CONCUR.