Register Automata with Linear Arithmetic

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F17%3APU127273" target="_blank" >RIV/00216305:26230/17:PU127273 - isvavai.cz</a>

Výsledek na webu

<a href="https://www.fit.vut.cz/research/publication/11431/" target="_blank" >https://www.fit.vut.cz/research/publication/11431/</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1109/LICS.2017.8005111" target="_blank" >10.1109/LICS.2017.8005111</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Register Automata with Linear Arithmetic

Popis výsledku v původním jazyce

We propose a novel automata model over the alphabet of rational numbers, which we call register automata over the rationals (RAq). It reads a sequence of rational numbers and outputs another rational number. RAq is an extension of the well-known register automata (RA) over infinite alphabets, which are finite automata equipped with a finite number of registers/variables for storing values. Like in the standard RA, the RAq model allows both equality and ordering tests between values. It, moreover, allows to perform linear arithmetic between certain variables. The model is quite expressive: in addition to the standard RA, it also generalizes other well-known models such as affine programs and arithmetic circuits. The main feature of RA Q is that despite the use of linear arithmetic, the so-called invariant problem-a generalization of the standard non-emptiness problem-is decidable. We also investigate other natural decision problems, namely, commutativity, equivalence, and reachability. For deterministic RA Q , commutativity and equivalence are polynomial-time inter-reducible with the invariant problem.

Název v anglickém jazyce

Register Automata with Linear Arithmetic

Popis výsledku anglicky

We propose a novel automata model over the alphabet of rational numbers, which we call register automata over the rationals (RAq). It reads a sequence of rational numbers and outputs another rational number. RAq is an extension of the well-known register automata (RA) over infinite alphabets, which are finite automata equipped with a finite number of registers/variables for storing values. Like in the standard RA, the RAq model allows both equality and ordering tests between values. It, moreover, allows to perform linear arithmetic between certain variables. The model is quite expressive: in addition to the standard RA, it also generalizes other well-known models such as affine programs and arithmetic circuits. The main feature of RA Q is that despite the use of linear arithmetic, the so-called invariant problem-a generalization of the standard non-emptiness problem-is decidable. We also investigate other natural decision problems, namely, commutativity, equivalence, and reachability. For deterministic RA Q , commutativity and equivalence are polynomial-time inter-reducible with the invariant problem.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2017

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Proceedings of LICS'17

ISBN

978-1-5090-3018-7

ISSN

—

e-ISSN

—

Počet stran výsledku

12

Strana od-do

1-12

Název nakladatele

IEEE Computer Society

Místo vydání

Reykjavik

Místo konání akce

Reykjavik

Datum konání akce

20. 6. 2017

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

000425849500049