Symbolic Register Automata
Formal Languages and Automata Theory
2019-05-24 v2
Abstract
Symbolic Finite Automata and Register Automata are two orthogonal extensions of finite automata motivated by real-world problems where data may have unbounded domains. These automata address a demand for a model over large or infinite alphabets, respectively. Both automata models have interesting applications and have been successful in their own right. In this paper, we introduce Symbolic Register Automata, a new model that combines features from both symbolic and register automata, with a view on applications that were previously out of reach. We study their properties and provide algorithms for emptiness, inclusion and equivalence checking, together with experimental results.
Cite
@article{arxiv.1811.06968,
title = {Symbolic Register Automata},
author = {Loris D'Antoni and Tiago Ferreira and Matteo Sammartino and Alexandra Silva},
journal= {arXiv preprint arXiv:1811.06968},
year = {2019}
}