Automata for the modal -calculus and related results

Recommendations

Modal μ-Calculus and Alternating Tree Automata
A finite model theorem for the propositional $\mu$-calculus
An automata theoretic decision procedure for the propositional mu- calculus
Some model theory for the modal $\mu$-calculus: syntactic characterisations of semantic properties
Completeness for the modal $\mu$-calculus: separating the combinatorics from the dynamics

Cited in

(82)

From liveness to promptness
An automata theoretic decision procedure for the propositional mu- calculus
Fixed point characterization of infinite behavior of finite-state systems
Monadic second-order logic on tree-like structures
Some subsets of monadic first-order logic (MFO) used for the specification and synthesis of -automata
Completeness for $\mu$-calculi: a coalgebraic approach
Completeness for the modal $\mu$-calculus: separating the combinatorics from the dynamics
Ambiguous classes in $\mu$-calculi hierarchies
Completeness of Kozen's axiomatisation of the propositional $\mu$-calculus.
M-calculus -- a sequent method for automatic theorem proving
Alternating-time temporal logics with linear past
$\varSigma^{\mu}_2$ is decidable for $\varPi^{\mu}_2$
A general multi-agent epistemic planner based on higher-order belief change
Uniform interpolation from cyclic proofs: the case of modal mu-calculus
A focus system for the alternation-free $\mu $-calculus
Hennessy-Milner and van Benthem for instantial neighbourhood logic
Model theory of monadic predicate logic with the infinity quantifier
Mu-calculus satisfiability with arithmetic constraints
A quantified coalgebraic van Benthem theorem
Logical vs. behavioural specifications
Forgetting in multi-agent modal logics
On the universal and existential fragments of the $\mu$-calculus
Equivalence of probabilistic $\mu$-calculus and p-automata
Automata and fixed point logic: a coalgebraic perspective
On modal -calculus with explicit interpolants
Knowledge forgetting in propositional $\mu$-calculus
Equational coalgebraic logic
Refinement sensitive formal semantics of state machines with persistent choice
Characteristic -calculus formulas for underspecified transition systems
Process algebra having inherent choice: revised semantics for concurrent systems
Modular games for coalgebraic fixed point logics
The mu-calculus and Model Checking
The descriptive complexity of modal model-checking games
Logic programming approach to automata-based decision procedures
Continuous Fragment of the mu-Calculus
An automata-theoretic approach to infinite-state systems
Description Logics
Proof systems for Moss' coalgebraic logic
Improved model checking of hierarchical systems
Modalities in the Stone age: a comparison of coalgebraic logics
scientific article; zbMATH DE number 1215463 (Why is no real title available?)
scientific article; zbMATH DE number 1223729 (Why is no real title available?)
Modal μ-Calculus and Alternating Tree Automata
Domain mu-calculus
The succinctness of the cover modality
Some model theory for the modal $\mu$-calculus: syntactic characterisations of semantic properties
A tableau proof system for a Mazurkiewicz trace logic with fixpoints
PDL inside the -calculus: a syntactic and an automata-theoretic characterization
scientific article; zbMATH DE number 1929975 (Why is no real title available?)
Refinement modal logic
Generalised powerlocales via relation lifting
Counterpart semantics for a second-order -calculus
Fixpoint alternation: arithmetic, transition systems, and the binary tree
Disjunctive form and the modal alternation hierarchy
Results on alternating-time temporal logics with linear past
Rough and Near: Modal History of Two Theories
Modal -calculus with atoms
scientific article; zbMATH DE number 7104937 (Why is no real title available?)
A saturation method for the modal $\mu $-calculus over pushdown systems
Timed modal logics for real-time systems. Specification, verification and control
On reasoning about structural equality in XML: a description logic approach
An axiomatization of bisimulation quantifiers via the $\mu$-calculus
Rudiments of $\mu$-calculus
Alternating tree automata, parity games, and modal -calculus
On the $\mu $-calculus over transitive and finite transitive frames
On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic
Computing sufficient and necessary conditions in CTL: a forgetting approach
The variable hierarchy for the games -calculus
Completeness for flat modal fixpoint logics
Coalgebraic semantics of modal logics: an overview
Lyndon Interpolation for Modal $$\mu $$-Calculus
Characterising modal formulas with examples
Proof systems for the modal $\mu $-calculus obtained by determinizing automata
Size measures and alphabetic equivalence in the -calculus
Bouncing threads for circular and non-wellfounded proofs. Towards compositionality with circular proofs
On the size of disjunctive formulas in the $\mu$-calculus
Proof systems for two-way modal -calculus
Demystifying
Modal automata: analysing modal fixpoint logics, one step at a time (invited talk)
Completions of -algebras
Canonical completeness of infinitary $\mu $
Comparing disjunctive modal transition systems with an one-selecting variant

This page was built for publication: Automata for the modal $\mu $-calculus and related results

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569045)