Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata
From MaRDI portal
Publication:3602801
DOI10.1007/978-3-540-70844-5_7zbMATH Open1172.68493OpenAlexW1602317429MaRDI QIDQ3602801FDOQ3602801
Authors: Ahmed Bouajjani, Peter Habermehl, Lukáš Holik, Tayssir Touili, Tomáš Vojnar 
Publication date: 12 February 2009
Published in: Implementation and Applications of Automata (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-70844-5_7
Recommendations
- When simulation meets antichains. (On checking language inclusion of nondeterministic finite (tree) automata)
- Antichains: A New Algorithm for Checking Universality of Finite Automata
- Efficient inclusion checking on explicit and semi-symbolic tree automata
- Antichains for the Automata-Based Approach to Model-Checking
- Efficient Inclusion Checking for Deterministic Tree Automata and DTDs
Cited In (16)
- Nested antichains for WS1S
- Weak inclusion for XML types
- Symbolic Model Checking in Non-Boolean Domains
- Efficient Inclusion Checking for Deterministic Tree Automata and DTDs
- Fixpoint Guided Abstraction Refinement for Alternating Automata
- Antichains: A New Algorithm for Checking Universality of Finite Automata
- Automata terms in a lazy \(\mathrm{WS}k\mathrm{S}\) decision procedure
- Automata terms in a lazy \(\mathrm{WS}k\mathrm{S}\) decision procedure
- When simulation meets antichains. (On checking language inclusion of nondeterministic finite (tree) automata)
- Reasoning About Regular Properties: A Comparative Study
- Parametric random generation of deterministic tree automata
- Efficient inclusion checking on explicit and semi-symbolic tree automata
- Fixed point guided abstraction refinement for alternating automata
- Strategy construction for parity games with imperfect information
- Antichains algorithms for the inclusion problem between \(\omega\)-VPL
- Implementation and Application of Automata
This page was built for publication: Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3602801)
