A Succinct Canonical Register Automaton Model
From MaRDI portal
Publication:3172926
DOI10.1007/978-3-642-24372-1_26zbMath1348.68095OpenAlexW1992294445MaRDI QIDQ3172926
Falk Howar, Maik Merten, Sofia Cassel, Bernhard Steffen, Bengt Jonsson
Publication date: 7 October 2011
Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-24372-1_26
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (7)
Inferring Canonical Register Automata ⋮ Model checking, synthesis, and learning ⋮ Never-stop context-free learning ⋮ A taxonomy and reductions for common register automata formalisms ⋮ A succinct canonical register automaton model ⋮ Learning register automata: from languages to program structures ⋮ Generating models of infinite-state communication protocols using regular inference with abstraction
This page was built for publication: A Succinct Canonical Register Automaton Model
