2026-07-24T17:39:24Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:3001 2024-03-06T10:33:42Z ddc:004 open_access

Automata based verification over linearly ordered data domains Segoufin, Luc Torunczyk, Szymon register automata data values linear order In this paper we work over linearly ordered data domains equipped with finitely many unary predicates and constants. We consider nondeterministic automata processing words and storing finitely many variables ranging over the domain. During a transition, these automata can compare the data values of the current configuration with those of the previous configuration using the linear order, the unary predicates and the constants. We show that emptiness for such automata is decidable, both over finite and infinite words, under reasonable computability assumptions on the linear order. Finally, we show how our automata model can be used for verifying properties of workflow specifications in the presence of an underlying database. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Luc Segoufin and Szymon Torunczyk 2011 Is Part Of LIPIcs, Volume 9, 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.STACS.2011.81 urn:nbn:de:0030-drops-30017 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.81 eng https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode