Pages that link to "Item:Q801893"
From MaRDI portal
The following pages link to Results on the propositional \(\mu\)-calculus (Q801893):
Displaying 50 items.
- The \(\mu\)-calculus alternation depth hierarchy is infinite over finite planar graphs (Q1643142) (← links)
- An expansion of basic logic with fixed points (Q1699729) (← links)
- First-order \(\mu\)-calculus over generic transition systems and applications to the situation calculus (Q1706163) (← links)
- Completeness for \(\mu\)-calculi: a coalgebraic approach (Q1731842) (← links)
- Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 5--11, 2017 (Q1731963) (← links)
- Sublogics of a branching time logic of robustness (Q1740655) (← links)
- Completeness for the modal \(\mu\)-calculus: separating the combinatorics from the dynamics (Q1749477) (← links)
- Ambiguous classes in \(\mu\)-calculi hierarchies (Q1770419) (← links)
- On modal \(\mu\)-calculus and non-well-founded set theory (Q1771199) (← links)
- Compositionality for quantitative specifications (Q1797783) (← links)
- Intuitionistic Podelski-Rybalchenko theorem and equivalence between inductive definitions and cyclic proofs (Q1798782) (← links)
- Predicate liftings and functor presentations in coalgebraic expression languages (Q1798785) (← links)
- A linear-time model-checking algorithm for the alternation-free modal mu- calculus (Q1801498) (← links)
- An algebraic and algorithmic method for analysing transition systems (Q1822237) (← links)
- An algebraic characterization of transition system equivalences (Q1822989) (← links)
- Analysis of security protocols as open systems (Q1853583) (← links)
- Completeness of Kozen's axiomatisation of the propositional \(\mu\)-calculus. (Q1854336) (← links)
- Inductive synthesis of recursive processes from logical properties (Q1854392) (← links)
- On the formalization of the modal \(\mu\)-calculus in the calculus of inductive constructions (Q1854404) (← links)
- Module checking (Q1854407) (← links)
- Simulation preorder over simple process algebras (Q1854513) (← links)
- Tarskian set constraints (Q1854523) (← links)
- Is your model checker on time? On the complexity of model checking for timed modal logics (Q1858436) (← links)
- The finite graph problem for two-way alternating automata. (Q1874281) (← links)
- Sequent calculi for process verification: Hennessy-Milner logic for an arbitrary GSOS (Q1878715) (← links)
- Taming the complexity of biochemical models through bisimulation and collapsing: theory and practice (Q1884863) (← links)
- Verifying persistent security properties (Q1886452) (← links)
- A spatial logic for concurrency. I (Q1887152) (← links)
- DP lower bounds for equivalence-checking and model-checking of one-counter automata (Q1887159) (← links)
- Quantitative solution of omega-regular games (Q1887716) (← links)
- Entanglement and the complexity of directed graphs (Q1929212) (← links)
- Exponential improvement of time complexity of model checking for multiagent systems with perfect recall (Q1938921) (← links)
- Temporal-logic property preservation under Z refinement (Q1941860) (← links)
- Model-checking timed automata with deadlines with Uppaal (Q1941900) (← links)
- Bisimulation-invariant PTIME and higher-dimensional \(\mu\)-calculus (Q1960425) (← links)
- Model checking the full modal mu-calculus for infinite sequential processes (Q1960527) (← links)
- Selective mu-calculus and formula-based equivalence of transition systems (Q1970206) (← links)
- The complexity of identifying characteristic formulae (Q1987735) (← links)
- Producing explanations for rich logics (Q2024339) (← links)
- Improving parity games in practice (Q2043434) (← links)
- Quasipolynomial computation of nested fixpoints (Q2044189) (← links)
- Temporal logic with recursion (Q2051830) (← links)
- A study on team bisimulation and H-team bisimulation for BPP nets (Q2055961) (← links)
- Capturing constrained constructor patterns in matching logic (Q2096417) (← links)
- Bounded game-theoretic semantics for modal mu-calculus (Q2105468) (← links)
- Local higher-order fixpoint iteration (Q2105477) (← links)
- On bidirectional runtime enforcement (Q2117010) (← links)
- A focus system for the alternation-free \(\mu \)-calculus (Q2142090) (← links)
- Compositional verification of concurrent systems by combining bisimulations (Q2147689) (← links)
- Why there is no general solution to the problem of software verification (Q2151520) (← links)
