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 40 items.
- Algorithms for Kleene algebra with converse (Q299194) (← links)
- Symbolic automata for representing big code (Q300407) (← links)
- Antichains and compositional algorithms for LTL synthesis (Q453498) (← links)
- Verification of STM on relaxed memory models (Q453508) (← links)
- Problems on finite automata and the exponential time hypothesis (Q1662614) (← links)
- Nested antichains for WS1S (Q1733101) (← 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)
- Nondeterministic syntactic complexity (Q2233426) (← links)
- A synchronous effects logic for temporal verification of pure Esterel (Q2234089) (← links)
- Strategy synthesis for multi-dimensional quantitative objectives (Q2249657) (← links)
- Multiprocessor schedulability of arbitrary-deadline sporadic tasks: complexity and antichain algorithm (Q2251369) (← links)
- A verification-driven framework for iterative design of controllers (Q2335947) (← links)
- Model checking transactional memories (Q2377134) (← links)
- Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes (Q2407982) (← links)
- Advanced Ramsey-Based Büchi Automata Inclusion Testing (Q3090830) (← links)
- Symbolic Model Checking in Non-Boolean Domains (Q3176389) (← links)
- Lazy Automata Techniques for WS1S (Q3303905) (← links)
- Up-To Techniques for Weighted Systems (Q3303913) (← 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)
- (Q4625701) (← links)
- (Q5009453) (← links)
- Domains for Higher-Order Games (Q5111275) (← links)
- Coinductive Algorithms for Büchi Automata (Q5158653) (← links)
- Random Models for Evaluating Efficient Büchi Universality Checking (Q5224494) (← links)
- Ramsey-Based Inclusion Checking for Visibly Pushdown Automata (Q5277899) (← links)
- Automata Learning: A Categorical Perspective (Q5418974) (← links)
- Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking (Q5458321) (← links)
- (Q5856411) (← links)
- From non-preemptive to preemptive scheduling using synchronization synthesis (Q5892421) (← links)
- Automata terms in a lazy \(\mathrm{WS}k\mathrm{S}\) decision procedure (Q5918382) (← links)
- Abstraction refinement and antichains for trace inclusion of infinite state systems (Q5919079) (← links)
- Automata terms in a lazy \(\mathrm{WS}k\mathrm{S}\) decision procedure (Q5919501) (← links)