A Complete Deductive System for the µ-Calculus (1995)

by Igor Walukiewicz
Citations:13 - 0 self

Active Bibliography

5 Notes on the Propositional µ-calculus: Completeness and Related Results – Igor Walukiewicz, Igor Walukiewicz - 1995
52 Games for the µ-Calculus – Damian Niwinski, Igor Walukiewicz
A Polyadic Modal µ-Calculus – Henrik Reif Andersen - 1994
30 Modal mu-calculi – Julian Bradfield, Colin Stirling - 2007
129 Reasoning about The Past with Two-Way Automata – Moshe Y. Vardi - 1998
825 Dynamic Logic – David Harel, Dexter Kozen, Jerzy Tiuryn - 1984
2 Automata and Logic – Igor Walukiewicz - 2002
2407 Compositional Model Checking – E. M. Clarke, D. E. Long, K. L. Mcmillan - 1999
3 Reasoning About Games – Melvin Fitting
23 Completeness of Kozen's Axiomatisation of the Propositional µ-Calculus – Igor Walukiewicz - 1995
10 Decidable Properties of Tree Languages – Mikołaj Bojanczyk - 2004
136 Pushdown Processes: Games and Model Checking – Igor Walukiewicz - 1996
Generation of Witnesses for Global µ-Calculus Model Checking – Alexander Kick
11 Automata for the µ-calculus and Related Results – David Janin, Igor Walukiewicz - 1995
65 On the Expressive Completeness of the Propositional Mu-Calculus With Respect to Monadic Second Order Logic – David Janin, Igor Walukiewicz - 1996
23 From Verification to Control: Dynamic Programs for Omega-regular Objectives – Luca de Alfaro, Thomas A. Henzinger, Rupak Majumdar - 2001
13 Modal Logic: A Semantic Perspective – Patrick Blackburn, Johan van Benthem - 1988
39 Concept Language With Number Restrictions and Fixpoints, and Its Relationship With mu-Calculus – Giuseppe De Giacomo, Maurizio Lenzerini - 1994
298 An Automata-Theoretic Approach to Branching-Time Model Checking – Orna Kupferman, Moshe Y. Vardi, Pierre Wolper - 1998