Pages that link to "Item:Q5941205"
From MaRDI portal
The following pages link to On model checking for the \(\mu\)-calculus and its fragments (Q5941205):
Displaying 18 items.
- (Q4353562) (← links)
- (Q4472245) (← links)
- <i>μ</i>-Bicomplete Categories and Parity Games (Q4787834) (← links)
- Permissive strategies: from parity games to safety games (Q4800258) (← links)
- Switching Graphs (Q4982090) (← links)
- (Q5015267) (← links)
- (Q5020527) (← links)
- (Q5020529) (← links)
- (Q5028462) (← links)
- Deciding Parity Games in Quasi-polynomial Time (Q5073521) (← links)
- Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time (Q5092368) (← links)
- Three notes on the complexity of model checking fixpoint logic with chop (Q5441546) (← links)
- (Q5875397) (← links)
- Deterministic Graphical Games Revisited (Q5900106) (← links)
- On model checking for the \(\mu\)-calculus and its fragments (Q5941205) (← links)
- Incremental reasoning on monadic second-order logics with logic programming (Q5963088) (← links)
- Complexity results for modal logic with recursion via translations and tableaux (Q6597964) (← links)
- Priority promotion with Parysian flair (Q6627044) (← links)