Pages that link to "Item:Q4238502"
From MaRDI portal
The following pages link to Bisimulation, modal logic and model checking games (Q4238502):
Displaying 20 items.
- First-order reasoning for higher-order concurrency (Q456466) (← links)
- Proof and refutation in MALL as a game (Q636305) (← links)
- On the computational complexity of bisimulation, redux (Q703845) (← links)
- Undecidability of domino games and hhp-bisimilarity. (Q1401953) (← links)
- Parity game reductions (Q1656552) (← links)
- Entanglement and the complexity of directed graphs (Q1929212) (← links)
- Deciding probabilistic bisimilarity distance one for probabilistic automata (Q2306848) (← links)
- On the determinacy of concurrent games on event structures with infinite winning sets (Q2453582) (← links)
- ERRATUM: "RATIONAL DYNAMICS AND EPISTEMIC LOGIC IN GAMES" (Q3502827) (← links)
- On Global Model Checking Trees Generated by Higher-Order Recursion Schemes (Q3617724) (← links)
- (Q5009421) (← links)
- (Metric) Bisimulation Games and Real-Valued Modal Logics for Coalgebras (Q5009455) (← links)
- Deciding Parity Games in Quasi-polynomial Time (Q5073521) (← links)
- (Q5089267) (← links)
- (Q5090455) (← links)
- RATIONAL DYNAMICS AND EPISTEMIC LOGIC IN GAMES (Q5294339) (← links)
- Fixpoint Theory -- Upside Down (Q6135764) (← links)
- Characterizing contrasimilarity through games, modal logic, and complexity (Q6614880) (← links)
- A game characterization for contrasimilarity (Q6643746) (← links)
- Graded monads and behavioural equivalence games (Q6649498) (← links)
