A Succinct Canonical Register Automaton Model

DOI10.1007/978-3-642-24372-1_26MaRDI QIDQ3172926zbMATH OpenOpenAlexFDO

Authors S. Cassel, Falk Howar, Maik Merten, 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

Mathematics Subject Classification ID

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

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
• Determinisation of finitely-ambiguous copyless cost register automata
• Model checking succinct and parametric one-counter automata

Cited in

(11)

• A robust class of data languages and an application to learning
• Never-stop context-free learning
• Generating models of infinite-state communication protocols using regular inference with abstraction
• Model checking, synthesis, and learning
• scientific article; zbMATH DE number 7361373 (Why is no real title available?)
• 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
• Inferring canonical register automata
• A succinct canonical register automaton model for data domains with binary relations

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)