Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata

DOI10.1007/978-3-540-70844-5_7MaRDI QIDQ3602801zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Data structures (68P05) Formal languages and automata (68Q45)

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

(17)

• 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
• Efficient inclusion checking on explicit and semi-symbolic tree automata
• Symbolic model checking in non-Boolean domains
• Efficient Inclusion Checking for Deterministic Tree Automata and DTDs
• When simulation meets antichains. (On checking language inclusion of nondeterministic finite (tree) automata)
• Fixpoint Guided Abstraction Refinement for Alternating Automata
• Weak inclusion for XML types
• Antichains: A New Algorithm for Checking Universality of Finite Automata
• Implementation and Application of 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
• Reasoning About Regular Properties: A Comparative Study
• Antichains algorithms for the inclusion problem between \(\omega\)-VPL
• Antiprenexing for WSkS: a little goes a long way

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)