Pages that link to "Item:Q801893"
From MaRDI portal
The following pages link to Results on the propositional \(\mu\)-calculus (Q801893):
Displaying 50 items.
- Enriched μ–Calculus Pushdown Module Checking (Q3498485) (← links)
- Model Checking Contracts – A Case Study (Q3510789) (← links)
- Latticed Simulation Relations and Games (Q3510804) (← links)
- The Birth of Model Checking (Q3512430) (← links)
- Correcting a Space-Efficient Simulation Algorithm (Q3512514) (← links)
- Computation Tree Regular Logic for Genetic Regulatory Networks (Q3540063) (← links)
- Inf-datalog, Modal Logic and Complexities (Q3549285) (← links)
- LATTICED SIMULATION RELATIONS AND GAMES (Q3552519) (← links)
- An Automata-Theoretic Approach to Infinite-State Systems (Q3587257) (← links)
- Model-Checking Strategic Ability and Knowledge of the Past of Communicating Coalitions (Q3601787) (← links)
- From Philosophical to Industrial Logics (Q3601803) (← links)
- Weighted versus Probabilistic Logics (Q3637211) (← links)
- A Weighted μ-Calculus on Words (Q3637241) (← links)
- EXPTIME Tableaux for the Coalgebraic μ-Calculus (Q3644748) (← links)
- SWITCHING GRAPHS (Q3646171) (← links)
- Computable CTL * for Discrete-Time and Continuous-Space Dynamic Systems (Q3646256) (← links)
- A Compositional Translation of Timed Automata with Deadlines to Uppaal Timed Automata (Q3648831) (← links)
- The modal<i>μ</i>-calculus hierarchy over restricted classes of transition systems (Q3655261) (← links)
- Domain mu-calculus (Q4460689) (← links)
- On global induction mechanisms in a<i>μ</i>-calculus with explicit approximations (Q4460690) (← links)
- Model checking the full modal mu-calculus for infinite sequential processes (Q4571973) (← links)
- Deciding the unguarded modal -calculus (Q4583323) (← links)
- A denotational semantics for equilibrium logic (Q4593002) (← links)
- (Q4603451) (← links)
- A tableau proof system for a mazurkiewicz trace logic with fixpoints (Q4610334) (← links)
- Temporal logic and categories of Petri nets (Q4630293) (← links)
- Local model checking for context-free processes (Q4630295) (← links)
- Beliefs supported by binary arguments (Q4685528) (← links)
- Model checking with probabilistic tabled logic programming (Q4911143) (← links)
- Monadic Second Order Logic And Its Fragments (Q4923546) (← links)
- Fixpoint alternation: arithmetic, transition systems, and the binary tree (Q4943547) (← links)
- Topologies, Continuity and Bisimulations (Q4943548) (← links)
- A Note on Negative Tagging for Least Fixed-Point Formulae (Q4943549) (← links)
- (Q4972730) (← links)
- $\aleph_1$ and the modal $\mu$-calculus (Q4972732) (← links)
- (Q4972736) (← links)
- Polynomial-Time Under-Approximation of Winning Regions in Parity Games (Q4982057) (← links)
- Switching Graphs (Q4982090) (← links)
- The Complexity of Model-Checking Tail-Recursive Higher-Order Fixpoint Logic (Q4989164) (← links)
- (Q5009452) (← links)
- On the Strength of the Uniform Fixed Point Principle in Intuitionistic Explicit Mathematics (Q5013911) (← links)
- (Q5014445) (← links)
- (Q5015268) (← links)
- (Q5020527) (← links)
- (Q5020529) (← links)
- (Q5020942) (← links)
- (Q5021004) (← links)
- (Q5021005) (← links)
- (Q5028436) (← links)
- (Q5028446) (← links)