The following pages link to (Q2760241):
Displaying 49 items.
- Coinductive predicates and final sequences in a fibration (Q265811) (← links)
- Enhancing unsatisfiable cores for LTL with information on temporal relevance (Q507378) (← links)
- A saturation method for the modal \(\mu \)-calculus over pushdown systems (Q532393) (← links)
- Syntactic cut-elimination for a fragment of the modal mu-calculus (Q714717) (← links)
- Verification of reactive systems via instantiation of parameterised Boolean equation systems (Q716322) (← links)
- A clausal resolution method for branching-time logic \(\text{ECTL}^+\) (Q862827) (← links)
- Canonical completeness of infinitary \(\mu \) (Q941442) (← links)
- On the proof theory of the modal mu-calculus (Q1005937) (← links)
- On modal \(\mu \)-calculus and Gödel-Löb logic (Q1015480) (← links)
- The many faces of interpolation (Q1024113) (← links)
- Mu-calculus path checking (Q1045942) (← links)
- On temporal logic versus Datalog (Q1401358) (← links)
- Mathematical modal logic: A view of its evolution (Q1422628) (← links)
- A graphical \(\mu\)-calculus and local model checking. (Q1433941) (← links)
- On modal \(\mu\)-calculus and non-well-founded set theory (Q1771199) (← links)
- Predicate liftings and functor presentations in coalgebraic expression languages (Q1798785) (← links)
- An intensional fixed point theory over first order arithmetic (Q1877095) (← links)
- Branching time and orthogonal bisimulation equivalence (Q1884905) (← links)
- Temporal-logic property preservation under Z refinement (Q1941860) (← links)
- NP reasoning in the monotone \(\mu\)-calculus (Q2096471) (← links)
- A focus system for the alternation-free \(\mu \)-calculus (Q2142090) (← links)
- On the relation between reactive synthesis and supervisory control of non-terminating processes (Q2177781) (← links)
- Characteristic invariants in Hennessy-Milner logic (Q2182678) (← links)
- Computable fixpoints in well-structured symbolic model checking (Q2248074) (← links)
- On first-order logic and CPDA graphs (Q2254514) (← links)
- On qualitative route descriptions. Representation, agent models, and computational complexity (Q2341261) (← links)
- Compositional verification of asynchronous concurrent systems using CADP (Q2350492) (← links)
- Compositional analysis for verification of parameterized systems (Q2368952) (← links)
- A clausal resolution method for extended computation tree logic ECTL (Q2495388) (← links)
- A parametric analysis of the state-explosion problem in model checking (Q2495399) (← links)
- Parameterised Boolean equation systems (Q2571204) (← links)
- A Logical Process Calculus (Q2842601) (← links)
- Modal Logics for Cryptographic Processes (Q2842609) (← links)
- Local Model Checking in a Logic for True Concurrency (Q2988383) (← links)
- The Modal μ-Calculus Caught Off Guard (Q3010366) (← links)
- Model-Checking Games for Fixpoint Logics with Partial Order Models (Q3184685) (← links)
- Solving Linear Equations in *-continuous Action Lattices (Q3498422) (← links)
- Model Checking Contracts – A Case Study (Q3510789) (← links)
- General Models and Completeness of First-Order Modal -calculus (Q3520232) (← links)
- On Global Model Checking Trees Generated by Higher-Order Recursion Schemes (Q3617724) (← links)
- Formal Properties of Modularisation (Q3631354) (← links)
- Deciding the unguarded modal -calculus (Q4583323) (← links)
- (Q4603451) (← links)
- Coinductive predicates and final sequences in a fibration (Q4606703) (← links)
- Model Checking Games (Q4916199) (← links)
- (Q4972736) (← links)
- (Q5014446) (← links)
- Abstraction in Fixpoint Logic (Q5277894) (← links)
- A Multi-Core Solver for Parity Games (Q5415659) (← links)
