Universality of R-automata with Value Copying

R-automata are finite state machines extended with counters which can be incremented or reset to zero along the transitions. The universality question asks whether there is a constant D such that all words are accepted by some run along which no counter exceeds D. It has been shown in [Parosh Abdull...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Electronic notes in theoretical computer science Jg. 239; S. 131 - 141
Hauptverfasser: Abdulla, Parosh Aziz, Krcal, Pavel, Yi, Wang
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier B.V 01.07.2009
Schlagworte:
Computer science
Datavetenskap
decidability
Distance automata with resets and copying
Information technology
Informationsteknik
TECHNOLOGY
TEKNIKVETENSKAP
universality
universality
Distance automata with resets and copying
decidability
ISSN:1571-0661, 1571-0661
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:R-automata are finite state machines extended with counters which can be incremented or reset to zero along the transitions. The universality question asks whether there is a constant D such that all words are accepted by some run along which no counter exceeds D. It has been shown in [Parosh Abdulla, Pavel Krcal, and Wang Yi. R-automata. In Proc. of CONCUR'08., volume 5201 of LNCS, pages 67–81. Springer, 2008] that this question is decidable. In this paper, we add one more operation to R-automata, namely the operation which can copy the value of a counter into another one. The result of this paper is a reduction of the universality problem for R-automata with value copying to universality of R-automata, thus rendering the problem decidable. The reduction replaces copy operations by non-deterministic resets together with a mechanism ensuring that the number of such replacements is bounded between each two resets of a value.
ISSN:1571-0661
1571-0661
DOI:10.1016/j.entcs.2009.05.035