The boundedness and zero isolation problems for weighted automata over nonnegative rationals - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2022

The boundedness and zero isolation problems for weighted automata over nonnegative rationals

Abstract

We consider linear cost-register automata (equivalent to weighted automata) over the semiring of nonnegative rationals, which generalise probabilistic automata. The two problems of boundedness and zero isolation ask whether there is a sequence of words that converge to infinity and to zero, respectively. In the general model both problems are undecidable so we focus on the copyless linear restriction. There, we show that the boundedness problem is decidable. As for the zero isolation problem we need to further restrict the class. We obtain a model, where zero isolation becomes equivalent to universal coverability of orthant vector addition systems (OVAS), a new model in the VAS family interesting on its own. In standard VAS runs are considered only in the positive orthant, while in OVAS every orthant has its own set of vectors that can be applied in that orthant. Assuming Schanuel's conjecture is true, we prove decidability of universal coverability for three-dimensional OVAS, which implies decidability of zero isolation in a model with at most three independent registers.
Fichier principal
Vignette du fichier
2205.13516.pdf (1.22 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03708876 , version 1 (29-06-2022)

Identifiers

Cite

Wojciech Czerwiński, Engel Lefaucheux, Filip Mazowiecki, David Purser, Markus A Whiteland. The boundedness and zero isolation problems for weighted automata over nonnegative rationals. LICS 2022 - 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Aug 2022, Haifa, Israel. ⟨10.1145/3531130⟩. ⟨hal-03708876⟩
44 View
77 Download

Altmetric

Share

Gmail Facebook X LinkedIn More