A Succinct Canonical Register Automaton Model
From MaRDI portal
Publication:3172926
DOI10.1007/978-3-642-24372-1_26zbMATH Open1348.68095OpenAlexW1992294445MaRDI QIDQ3172926FDOQ3172926
Falk Howar, Maik Merten, S. 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
Recommendations
- A succinct canonical register automaton model
- A succinct canonical register automaton model for data domains with binary relations
- Inferring canonical register automata
- scientific article; zbMATH DE number 7361373
- scientific article; zbMATH DE number 2053215
- A taxonomy and reductions for common register automata formalisms
- A canonical semi-deterministic transducer
- scientific article; zbMATH DE number 7561719
- Model checking succinct and parametric one-counter automata
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Cited In (9)
- Inferring Canonical Register Automata
- Never-stop context-free learning
- Generating models of infinite-state communication protocols using regular inference with abstraction
- Model checking, synthesis, and learning
- Title not available (Why is that?)
- A succinct canonical register automaton model
- Learning register automata: from languages to program structures
- $$\textsc {Reach}$$ on Register Automata via History Independence
- A taxonomy and reductions for common register automata formalisms
This page was built for publication: A Succinct Canonical Register Automaton Model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3172926)
