On modal mu-calculus with explicit interpolants
暂无分享,去创建一个
[1] Igor Walukiewicz,et al. Automata for the-calculus and Related Results , 1995 .
[2] Julian C. Bradfield. The Modal µ-Calculus Alternation Hierarchy is Strict , 1998, Theor. Comput. Sci..
[3] Igor Walukiewicz,et al. Completeness of Kozen's Axiomatisation of the Propositional µ-Calculus , 2000, Inf. Comput..
[4] Marco Hollenberg,et al. Logical questions concerning the μ-calculus: Interpolation, Lyndon and Łoś-Tarski , 2000, Journal of Symbolic Logic.
[5] D. Kozen. Results on the Propositional µ-Calculus , 1982 .
[6] A. Visser. Bisimulations, model descriptions and propositional quantifiers , 1996 .
[7] Igor Walukiewicz,et al. On the Expressive Completeness of the Propositional mu-Calculus with Respect to Monadic Second Order Logic , 1996, CONCUR.
[8] Igor Walukiewicz,et al. Automata for the Modal mu-Calculus and related Results , 1995, MFCS.
[9] Marcin Jurdzinski,et al. Small Progress Measures for Solving Parity Games , 2000, STACS.
[10] Silvio Ghilardi,et al. A Sheaf Representation and Duality for Finitely Presenting Heyting Algebras , 1995, J. Symb. Log..
[11] Giacomo Lenzi,et al. An axiomatization of bisimulation quantifiers via the mu-calculus , 2005, Theor. Comput. Sci..
[12] Pierre Wolper,et al. An automata-theoretic approach to branching-time model checking , 2000, JACM.