An axiomatization of bisimulation quantifiers via the µ-calculus

Authors:
Giovanna D'Agostino;Giacomo Lenzi
Affiliations:
University of Udine, Department of Mathematics and Computer Science, Viale delle Scienze 206, 33100 Udine, Italy;University of Pisa, Department of Mathematics, Via Buonarroti 2, 56127 Pisa, Italy
Venue:
Theoretical Computer Science
Year:
2005

Citing 5
Cited 3

Completeness of Kozen's axiomatisation of the propositional &mgr;-calculus

Information and Computation
An automata-theoretic approach to branching-time model checking

Journal of the ACM (JACM)
Automata for the Modal mu-Calculus and related Results

MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
Monadic Second Order Logic on Tree-Like Structures

STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
On the Expressive Completeness of the Propositional mu-Calculus with Respect to Monadic Second Order Logic

CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory

Uniform Interpolation, Bisimulation Quantifiers, and Fixed Points

Logic, Language, and Computation
Idempotent Transductions for Modal Logics

FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Mathematical Logic for Life Science Ontologies

WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation

Quantified Score

Hi-index	5.23

Visualization

Abstract

This paper deals with bisimulation quantifiers logic BQL, that is, the extension of propositional dynamic logic PDL with the so-called "bisimulation quantifiers". This logic is expressively equivalent to the µ-calculus (an extension of modal logic with extremal fixpoints), albeit its formulas are easier to understand. In this work we provide a complete axiomatization of BQL, based on certain normal form results for the µ-calculus obtained by Janin and Walukiewicz.