Antichains: A New Algorithm for Checking Universality of Finite Automata
From MaRDI portal
Recommendations
- Antichains for the Automata-Based Approach to Model-Checking
- Antichain algorithms for finite automata
- When simulation meets antichains. (On checking language inclusion of nondeterministic finite (tree) automata)
- Improved Algorithms for the Automata-Based Approach to Model-Checking
- Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata
Cited in
(60)- Problems on finite automata and the exponential time hypothesis
- Nested antichains for WS1S
- Strategy construction for parity games with imperfect information
- Fixed point guided abstraction refinement for alternating automata
- Parametric random generation of deterministic tree automata
- Nondeterministic syntactic complexity
- A synchronous effects logic for temporal verification of pure Esterel
- Multiprocessor schedulability of arbitrary-deadline sporadic tasks: complexity and antichain algorithm
- A verification-driven framework for iterative design of controllers
- Model checking transactional memories
- Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes
- Algorithms for Kleene algebra with converse
- Symbolic automata for representing big code
- Advanced Ramsey-based Büchi automata inclusion testing
- Symbolic model checking in non-Boolean domains
- Lazy automata techniques for WS1S
- Up-To Techniques for Weighted Systems
- Model Checking the First-Order Fragment of Higher-Order Fixpoint Logic
- Completeness and Nondeterminism in Model Checking Transactional Memories
- Strategy Construction for Parity Games with Imperfect Information
- Antichain algorithms for finite automata
- When simulation meets antichains. (On checking language inclusion of nondeterministic finite (tree) automata)
- Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata
- Transactional Reduction of Component Compositions
- Computing Weakest Strategies for Safety Games of Imperfect Information
- Antichains for the Automata-Based Approach to Model-Checking
- Random Generation of Deterministic Tree (Walking) Automata
- Fixpoint Guided Abstraction Refinement for Alternating Automata
- Antichains and compositional algorithms for LTL synthesis
- Verification of STM on relaxed memory models
- Efficient reduction of nondeterministic automata with application to language inclusion testing
- Regular separability of well-structured transition systems
- Domains for Higher-Order Games
- Coinductive algorithms for Büchi automata
- Random models for evaluating efficient Büchi universality checking
- Ramsey-based inclusion checking for visibly pushdown automata
- Experimental Evaluation of Classical Automata Constructions
- Automata Learning: A Categorical Perspective
- Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking
- Improved Algorithms for the Automata-Based Approach to Model-Checking
- scientific article; zbMATH DE number 7327941 (Why is no real title available?)
- From non-preemptive to preemptive scheduling using synchronization synthesis
- Automata terms in a lazy \(\mathrm{WS}k\mathrm{S}\) decision procedure
- Abstraction refinement and antichains for trace inclusion of infinite state systems
- Automata terms in a lazy \(\mathrm{WS}k\mathrm{S}\) decision procedure
- FORQ-Based Language Inclusion Formal Testing
- Simplifying Alternating Automata for Emptiness Testing
- Reasoning About Regular Properties: A Comparative Study
- Antichains algorithms for the inclusion problem between \(\omega\)-VPL
- Language inclusion algorithms as complete abstract interpretations
- Theoretical computer science: computational complexity
- On complementation of nondeterministic finite automata without full determinization
- A finite state automaton for quantum computing
- Antichain with SAT and tries
- A close analysis of the subset construction
- Model-checking real-time systems: revisiting the alternating automaton route
- Improved randomized approximation of hard universality and emptiness problems
- On concurrent program algebra and demonic automata
- Incremental algorithms for solving regular expression intersection non-emptiness
- Antiprenexing for WSkS: a little goes a long way
This page was built for publication: Antichains: A New Algorithm for Checking Universality of Finite Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756729)
