Pages that link to "Item:Q801893"
From MaRDI portal
The following pages link to Results on the propositional \(\mu\)-calculus (Q801893):
Displaying 50 items.
- Property-oriented expansion (Q5030184) (← links)
- Inference Systems with Corules for Combined Safety and Liveness Properties of Binary Session Types (Q5043586) (← links)
- Property preserving abstractions under parallel composition (Q5044770) (← links)
- Unifying models (Q5047155) (← links)
- (Q5079760) (← links)
- (Q5079761) (← links)
- (Q5089260) (← links)
- (Q5089290) (← links)
- (Q5094116) (← links)
- Data flow analysis as model checking (Q5096226) (← links)
- A CTL* Model Checker for Petri Nets (Q5100762) (← links)
- k-Bounded Petri Net Synthesis from Modal Transition Systems. (Q5111618) (← links)
- Divergence and unique solution of equations (Q5111619) (← links)
- Consistently-detecting monitors (Q5111620) (← links)
- Monitoring for Silent Actions (Q5136296) (← links)
- (Q5155663) (← links)
- Sharp Congruences Adequate with Temporal Logics Combining Weak and Strong Modalities (Q5164168) (← links)
- Partial-Order Reduction for Parity Games with an Application on Parameterised Boolean Equation Systems (Q5164176) (← links)
- A Rewriting-Based Model Checker for the Linear Temporal Logic of Rewriting (Q5166636) (← links)
- Meanings of Model Checking (Q5187832) (← links)
- (Q5214813) (← links)
- (Q5232902) (← links)
- Abstraction in Fixpoint Logic (Q5277894) (← links)
- Differential Game Logic (Q5277902) (← links)
- <i>μ</i>-definable sets of integers (Q5287693) (← links)
- Propositional Dynamic Logic with Program Quantifiers (Q5415640) (← links)
- A Multi-Core Solver for Parity Games (Q5415659) (← links)
- A Formal Language for Electronic Contracts (Q5428911) (← links)
- Three notes on the complexity of model checking fixpoint logic with chop (Q5441546) (← links)
- Types and trace effects of higher order programs (Q5451968) (← links)
- From Monadic Logic to PSL (Q5452203) (← links)
- More Precise Partition Abstractions (Q5452605) (← links)
- Model Checking for Action Abstraction (Q5452711) (← links)
- Solving Parity Games in Big Steps (Q5458856) (← links)
- Undirected Graphs of Entanglement 2 (Q5458861) (← links)
- Journeys in non-classical computation I: A grand challenge for computing research (Q5492115) (← links)
- A Note on the Completeness of Kozen's Axiomatisation of the Propositional μ-Calculus (Q5689266) (← links)
- Logic for Programming, Artificial Intelligence, and Reasoning (Q5705921) (← links)
- An operational domain-theoretic treatment of recursive types (Q5740347) (← links)
- (Q5856409) (← links)
- Coinduction in Flow: The Later Modality in Fibrations (Q5875348) (← links)
- (Q5875397) (← links)
- Axiomatising extended computation tree logic (Q5878903) (← links)
- Bidirectional Runtime Enforcement of First-Order Branching-Time Properties (Q5883741) (← links)
- Rudiments of \(\mu\)-calculus (Q5926539) (← links)
- On model checking for the \(\mu\)-calculus and its fragments (Q5941205) (← links)
- Free \(\mu\)-lattices (Q5960406) (← links)
- Modelling and analysing variability in product families: model checking of modal transition systems with variability constraints (Q5963087) (← links)
- European Summer Meeting of the Association for Symbolic Logic (Q5966661) (← links)
- Partial-order reduction in the weak modal mu-calculus (Q6044105) (← links)