Name
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. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1007/978-3-030-25540-4_1 | COMPUTER AIDED VERIFICATION, CAV 2019, PT I |
DocType | Volume | ISSN |
Conference | 11561 | 0302-9743 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Loris D'Antoni | 1 | 377 | 25.00 |
| Tiago Ferreira | 2 | 0 | 0.34 |
| Matteo Sammartino | 3 | 15 | 6.79 |
| Alexandra Silva | 4 | 20 | 6.76 |