Automata for the modal -calculus and related results

DOI10.1007/3-540-60246-1_160zbMATH Open1193.68163OpenAlexW1539385324MaRDI QIDQ3569045FDOQ3569045

Publication date: 17 June 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60246-1_160

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

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70)

Cited In (72)

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

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)