History-register automata

DOI10.2168/LMCS-12(1:7)2016MaRDI QIDQ2800969zbMATH OpenOpenAlexFDO

Authors Radu Grigore, Nikos Tzevelekos

Publication date 19 April 2016

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1209.0680

zbMATH Keywords

register automatacounter automatafreshnessautomata over infinite alphabetsinfinite systems reachability

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Abstract: Programs with dynamic allocation are able to create and use an unbounded number of fresh resources, such as references, objects, files, etc. We propose History-Register Automata (HRA), a new automata-theoretic formalism for modelling such programs. HRAs extend the expressiveness of previous approaches and bring us to the limits of decidability for reachability checks. The distinctive feature of our machines is their use of unbounded memory sets (histories) where input symbols can be selectively stored and compared with symbols to follow. In addition, stored symbols can be consumed or deleted by reset. We show that the combination of consumption and reset capabilities renders the automata powerful enough to imitate counter machines, and yields closure under all regular operations apart from complementation. We moreover examine weaker notions of HRAs which strike different balances between expressiveness and effectiveness.

Recommendations

• History-register automata
• Verification of dynamic register automata
• $$\textsc {Reach}$$ on Register Automata via History Independence
• scientific article; zbMATH DE number 7361373
• Fresh-register automata

Cited in

(6)

• The Parametric Complexity of Lossy Counter Machines
• Verification of dynamic register automata
• Nominal automata with name binding
• Fast computations on ordered nominal sets
• History-register automata
• Layered memory automata: recognizers for quasi-regular languages with unbounded memory

This page was built for publication: History-register automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2800969)