Pages that link to "Item:Q3569045"

The following pages link to Automata for the modal μ-calculus and related results (Q3569045):

Displaying 50 items.

• Logic programming approach to automata-based decision procedures (Q347398) (← links)
• Proof systems for Moss' coalgebraic logic (Q402120) (← links)
• Improved model checking of hierarchical systems (Q418123) (← links)
• Modalities in the Stone age: a comparison of coalgebraic logics (Q418820) (← links)
• Refinement modal logic (Q476194) (← links)
• Timed modal logics for real-time systems. Specification, verification and control (Q548704) (← links)
• On reasoning about structural equality in XML: a description logic approach (Q555777) (← links)
• An axiomatization of bisimulation quantifiers via the \(\mu\)-calculus (Q557788) (← links)
• On the \(\mu \)-calculus over transitive and finite transitive frames (Q606994) (← links)
• The variable hierarchy for the games \(\mu \)-calculus (Q636308) (← links)
• Completeness for flat modal fixpoint logics (Q638475) (← links)
• Coalgebraic semantics of modal logics: an overview (Q639647) (← links)
• Completions of \(\mu \)-algebras (Q925850) (← links)
• Canonical completeness of infinitary \(\mu \) (Q941442) (← links)
• Comparing disjunctive modal transition systems with an one-selecting variant (Q953529) (← links)
• From liveness to promptness (Q1039845) (← links)
• Fixed point characterization of infinite behavior of finite-state systems (Q1389678) (← links)
• Monadic second-order logic on tree-like structures (Q1606130) (← links)
• Some subsets of monadic first-order logic (MFO) used for the specification and synthesis of \(\Sigma\)-automata (Q1709455) (← links)
• Completeness for \(\mu\)-calculi: a coalgebraic approach (Q1731842) (← links)
• Completeness for the modal \(\mu\)-calculus: separating the combinatorics from the dynamics (Q1749477) (← links)
• Ambiguous classes in \(\mu\)-calculi hierarchies (Q1770419) (← links)
• Completeness of Kozen's axiomatisation of the propositional \(\mu\)-calculus. (Q1854336) (← links)
• \(M\)-calculus -- a sequent method for automatic theorem proving (Q1899898) (← links)
• Alternating-time temporal logics with linear past (Q1989330) (← links)
• \(\varSigma^{\mu}_2\) is decidable for \(\varPi^{\mu}_2\) (Q2011666) (← links)
• A general multi-agent epistemic planner based on higher-order belief change (Q2060686) (← links)
• Uniform interpolation from cyclic proofs: the case of modal mu-calculus (Q2142087) (← links)
• A focus system for the alternation-free \(\mu \)-calculus (Q2142090) (← links)
• Hennessy-Milner and van Benthem for instantial neighbourhood logic (Q2144186) (← links)
• Model theory of monadic predicate logic with the infinity quantifier (Q2144617) (← links)
• A quantified coalgebraic van Benthem theorem (Q2233433) (← links)
• Logical vs. behavioural specifications (Q2304534) (← links)
• Forgetting in multi-agent modal logics (Q2321251) (← links)
• On the universal and existential fragments of the \(\mu\)-calculus (Q2368950) (← links)
• Equivalence of probabilistic \(\mu\)-calculus and p-automata (Q2399249) (← links)
• Automata and fixed point logic: a coalgebraic perspective (Q2495648) (← links)
• On modal \(\mu\)-calculus with explicit interpolants (Q2506827) (← links)
• Knowledge forgetting in propositional \(\mu\)-calculus (Q2679422) (← links)
• Equational coalgebraic logic (Q2805164) (← links)
• Refinement sensitive formal semantics of state machines with persistent choice (Q2810972) (← links)
• Process algebra having inherent choice: revised semantics for concurrent systems (Q2871829) (← links)
• Modular games for coalgebraic fixed point logics (Q2873663) (← links)
• The mu-calculus and Model Checking (Q3176384) (← links)
• (Q3384164) (← links)
• Continuous Fragment of the mu-Calculus (Q3540176) (← links)
• An Automata-Theoretic Approach to Infinite-State Systems (Q3587257) (← links)
• Description Logics (Q3638996) (← links)
• (Q4215595) (← links)
• The succinctness of the cover modality (Q4586149) (← links)