Pages that link to "Item:Q3176384"
From MaRDI portal
The following pages link to The mu-calculus and Model Checking (Q3176384):
Displayed 19 items.
- Situation calculus for controller synthesis in manufacturing systems with first-order state representation (Q2060723) (← links)
- Bounded game-theoretic semantics for modal mu-calculus (Q2105468) (← links)
- Temporal refinements for guarded recursive types (Q2233479) (← links)
- Strategies, model checking and branching-time properties in Maude (Q2239275) (← links)
- Equivalence of probabilistic \(\mu\)-calculus and p-automata (Q2399249) (← links)
- Simulating and model checking membrane systems using strategies in Maude (Q2667188) (← links)
- Metalevel transformation of strategies (Q2667189) (← links)
- Knowledge forgetting in propositional \(\mu\)-calculus (Q2679422) (← links)
- Abstraction and Abstraction Refinement (Q3176371) (← links)
- Combining Model Checking and Deduction (Q3176378) (← links)
- Graph Games and Reactive Synthesis (Q3176385) (← links)
- $\aleph_1$ and the modal $\mu$-calculus (Q4972732) (← links)
- (Q4972736) (← links)
- (Q5020529) (← links)
- Family-Based SPL Model Checking Using Parity Games with Variability (Q5039535) (← links)
- (Q5089290) (← links)
- Universal algorithms for parity games and nested fixpoints (Q6113979) (← links)
- The alternation hierarchy of the \(\mu \)-calculus over weakly transitive frames (Q6160744) (← links)
- Computing sufficient and necessary conditions in CTL: a forgetting approach (Q6204992) (← links)