Pages that link to "Item:Q5756729"
From MaRDI portal
The following pages link to Antichains: A New Algorithm for Checking Universality of Finite Automata (Q5756729):
Displayed 14 items.
- Antichains and compositional algorithms for LTL synthesis (Q453498) (← links)
- Verification of STM on relaxed memory models (Q453508) (← links)
- Strategy construction for parity games with imperfect information (Q1959483) (← links)
- Fixed point guided abstraction refinement for alternating automata (Q1959653) (← links)
- Parametric random generation of deterministic tree automata (Q1959655) (← links)
- Advanced Ramsey-Based Büchi Automata Inclusion Testing (Q3090830) (← links)
- Model Checking the First-Order Fragment of Higher-Order Fixpoint Logic (Q3498457) (← links)
- Completeness and Nondeterminism in Model Checking Transactional Memories (Q3541009) (← links)
- Strategy Construction for Parity Games with Imperfect Information (Q3541028) (← links)
- Transactional Reduction of Component Compositions (Q3612363) (← links)
- Computing Weakest Strategies for Safety Games of Imperfect Information (Q3617754) (← links)
- Random Generation of Deterministic Tree (Walking) Automata (Q3637348) (← links)
- Fixpoint Guided Abstraction Refinement for Alternating Automata (Q3637352) (← links)
- Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking (Q5458321) (← links)