论文信息 - EXPTIME Tableaux for the Coalgebraic µ-Calculus - 字舞流文

EXPTIME Tableaux for the Coalgebraic µ-Calculus

Corina Cîrstea | Dirk Pattinson | Clemens Kupke

[1] Kit Fine,et al. In so many possible worlds , 1972, Notre Dame J. Formal Log..

[2] Lutz Schröder. A Finite Model Construction for Coalgebraic Modal Logic , 2006, FoSSaCS.

[3] Marc Pauly,et al. A Modal Logic for Coalitional Power in Games , 2002, J. Log. Comput..

[4] Yde Venema. Automata and fixed point logic: A coalgebraic perspective , 2006, Inf. Comput..

[5] Pierre Wolper,et al. An automata-theoretic approach to branching-time model checking , 2000, JACM.

[6] Igor Walukiewicz,et al. Games for the mu-Calculus , 1996, Theor. Comput. Sci..

[7] E. Allen Emerson,et al. The Complexity of Tree Automata and Logics of Programs , 1999, SIAM J. Comput..

[8] Ulrike Sattler,et al. The Complexity of the Graded µ-Calculus , 2002, CADE.

[9] Julian C. Bradfield. On the Expressivity of the Modal Mu-Calculus , 1996, STACS.

[10] Marcin Jurdzinski,et al. Small Progress Measures for Solving Parity Games , 2000, STACS.

[11] Igor Walukiewicz,et al. Completeness of Kozen's Axiomatisation of the Propositional µ-Calculus , 2000, Inf. Comput..

[12] Dexter Kozen,et al. RESULTS ON THE PROPOSITIONAL’p-CALCULUS , 2001 .

[13] Dirk Pattinson,et al. PSPACE Bounds for Rank-1 Modal Logics , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).

[14] Corina Cîrstea,et al. Modular Games for Coalgebraic Fixed Point Logics , 2008, CMCS.