Automata for the modal μ-calculus and related results
From MaRDI portal
Publication:3569045
DOI10.1007/3-540-60246-1_160zbMath1193.68163OpenAlexW1539385324MaRDI QIDQ3569045
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
Formal languages and automata (68Q45) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items
On the universal and existential fragments of the \(\mu\)-calculus, The mu-calculus and Model Checking, 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, Logic programming approach to automata-based decision procedures, Equivalence of probabilistic \(\mu\)-calculus and p-automata, Rough and Near: Modal History of Two Theories, Unnamed Item, On the \(\mu \)-calculus over transitive and finite transitive frames, Fixed point characterization of infinite behavior of finite-state systems, The succinctness of the cover modality, Proof systems for Moss' coalgebraic logic, Knowledge forgetting in propositional \(\mu\)-calculus, On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic, Improved model checking of hierarchical systems, Modalities in the Stone age: a comparison of coalgebraic logics, Computing sufficient and necessary conditions in CTL: a forgetting approach, The variable hierarchy for the games \(\mu \)-calculus, Completeness for flat modal fixpoint logics, Coalgebraic semantics of modal logics: an overview, A tableau proof system for a mazurkiewicz trace logic with fixpoints, Unnamed Item, Unnamed Item, Completions of \(\mu \)-algebras, Continuous Fragment of the mu-Calculus, Refinement modal logic, Completeness for \(\mu\)-calculi: a coalgebraic approach, A quantified coalgebraic van Benthem theorem, Canonical completeness of infinitary \(\mu \), Alternating-time temporal logics with linear past, Completeness for the modal \(\mu\)-calculus: separating the combinatorics from the dynamics, Comparing disjunctive modal transition systems with an one-selecting variant, Generalised powerlocales via relation lifting, Timed modal logics for real-time systems. Specification, verification and control, \(\varSigma^{\mu}_2\) is decidable for \(\varPi^{\mu}_2\), An Automata-Theoretic Approach to Infinite-State Systems, Ambiguous classes in \(\mu\)-calculi hierarchies, On reasoning about structural equality in XML: a description logic approach, Unnamed Item, An axiomatization of bisimulation quantifiers via the \(\mu\)-calculus, Automata and fixed point logic: a coalgebraic perspective, Fixpoint alternation: arithmetic, transition systems, and the binary tree, On modal \(\mu\)-calculus with explicit interpolants, Equational Coalgebraic Logic, Refinement Sensitive Formal Semantics of State Machines With Persistent Choice, Logical vs. behavioural specifications, Description Logics, A general multi-agent epistemic planner based on higher-order belief change, Unnamed Item, Forgetting in multi-agent modal logics, From liveness to promptness, Completeness of Kozen's axiomatisation of the propositional \(\mu\)-calculus., Process Algebra Having Inherent Choice: Revised Semantics for Concurrent Systems, Modular Games for Coalgebraic Fixed Point Logics, Monadic second-order logic on tree-like structures
