The following pages link to (Q4535058):
Displaying 10 items.
- An invariant-based approach to the verification of asynchronous parameterized networks (Q604385) (← links)
- Experiments with deterministic \(\omega\)-automata for formulas of linear temporal logic (Q860862) (← links)
- Observations on determinization of Büchi automata (Q860867) (← links)
- Multi-buffer simulations: decidability and complexity (Q1784963) (← links)
- Applicability of fair simulation (Q1886036) (← links)
- Matching in security-by-contract for mobile code (Q2390033) (← links)
- Simulation Relations for Alternating Parity Automata and Parity Games (Q3617046) (← links)
- Topological Characterisation of Multi-Buffer Simulation (Q4989168) (← links)
- Multi-buffer simulations for trace language inclusion (Q5015280) (← links)
- Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata (Q5317190) (← links)