Pages that link to "Item:Q801893"
From MaRDI portal
The following pages link to Results on the propositional \(\mu\)-calculus (Q801893):
Displaying 50 items.
- A compositional proof system on a category of labelled transition systems (Q2640340) (← links)
- When not losing is better than winning: abstraction and refinement for the full \(\mu\)-calculus (Q2643076) (← links)
- A tableau construction for finite linear-time temporal logic (Q2669249) (← links)
- Knowledge forgetting in propositional \(\mu\)-calculus (Q2679422) (← links)
- Negation-closure for JSON schema (Q2697439) (← links)
- Real-time verification techniques for untimed systems (Q2703729) (← links)
- Characteristic formulae for timed autoamta (Q2729632) (← links)
- On the complexity of semantic self-minimization (Q2810966) (← links)
- Refinement sensitive formal semantics of state machines with persistent choice (Q2810972) (← links)
- Fixed-Point Elimination in the Intuitionistic Propositional Calculus (Q2811336) (← links)
- Satisfiability of Linear Time Mu-Calculus on Finite Traces (Q2817904) (← links)
- Egalitarian State-Transition Systems (Q2827838) (← links)
- Solving Parity Games Using an Automata-Based Algorithm (Q2830208) (← links)
- A logic for rewriting strategies (Q2841238) (← links)
- Predicate abstraction for dense real-time systems (Q2842588) (← links)
- Alternating context-free languages and linear time \(\mu \)-calculus with sequential composition (Q2842604) (← links)
- Modal logics for cryptographic processes (Q2842609) (← links)
- Automated formal analysis and verification: an overview (Q2871577) (← links)
- Process algebra having inherent choice: revised semantics for concurrent systems (Q2871829) (← links)
- Modular games for coalgebraic fixed point logics (Q2873663) (← links)
- Characteristic formulae for fixed-point semantics: a general framework (Q2883115) (← links)
- On modal \(\mu \)-calculus over finite graphs with small components or small tree width (Q2909221) (← links)
- Measure Properties of Game Tree Languages (Q2922025) (← links)
- A Mechanized Theory of Regular Trees in Dependent Type Theory (Q2945653) (← links)
- Reasoning About Strategies (Q2946746) (← links)
- Efficiently Deciding μ-Calculus with Converse over Finite Trees (Q2957698) (← links)
- Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games (Q2961570) (← links)
- Canonicity results for mu-calculi: an algorithmic approach (Q2983395) (← links)
- The Modal μ-Calculus Caught Off Guard (Q3010366) (← links)
- Modular Markovian Logic (Q3012934) (← links)
- AN EXPRESSIVE EXTENSION OF TLC (Q3021958) (← links)
- Connection between logical and algebraic approaches to concurrent systems (Q3060196) (← links)
- Suitability of mCRL2 for Concurrent-System Design: A 2 × 2 Switch Case Study (Q3066124) (← links)
- CVPP: A Tool Set for Compositional Verification of Control–Flow Safety Properties (Q3067539) (← links)
- ProMoVer: Modular Verification of Temporal Safety Properties (Q3095249) (← links)
- On Characterization, Definability and ω-Saturated Models (Q3105745) (← links)
- Specification and Verification of Multi-Agent Systems (Q3166991) (← links)
- Introduction to Model Checking (Q3176359) (← links)
- Transfer of Model Checking to Industrial Practice (Q3176381) (← links)
- The mu-calculus and Model Checking (Q3176384) (← links)
- Symbolic Model Checking in Non-Boolean Domains (Q3176389) (← links)
- Process Algebra and Model Checking (Q3176390) (← links)
- Program Schemata Technique to Solve Propositional Program Logics Revised (Q3179178) (← links)
- From Parity and Payoff Games to Linear Programming (Q3182965) (← links)
- (Q3384164) (← links)
- A Formal Theory of Justifications (Q3449209) (← links)
- Symmetric Strategy Improvement (Q3449491) (← links)
- A Decision Procedure for (Co)datatypes in SMT Solvers (Q3454092) (← links)
- Changing a Semantics: Opportunism or Courage? (Q3454820) (← links)
- Compositional Reasoning for Multi-modal Logics (Q3455830) (← links)
