Abstraction refinement for emptiness checking of alternating data automata

DOI10.1007/978-3-319-89963-3_6zbMath1423.68255OpenAlexW2797499459MaRDI QIDQ2324226

Radu Iosif, Xiao Xu

Publication date: 16 September 2019

Full work available at URL: https://doi.org/10.1007/978-3-319-89963-3_6

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

Set augmented finite automata over infinite alphabets, Abstraction refinement and antichains for trace inclusion of infinite state systems