Results 1  10
of
32
Twovariable logic on data words
, 2007
"... In a data word each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been already considered in the realm of semistructured data, timed automata and extended temporal logics. It is shown that satisfiability for the twovariable firstorder ..."
Abstract

Cited by 36 (4 self)
 Add to MetaCart
In a data word each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been already considered in the realm of semistructured data, timed automata and extended temporal logics. It is shown that satisfiability for the twovariable firstorder logic FO 2 (∼,<,+1) is decidable over finite and over infinite data words, where ∼ is a binary predicate testing the data value equality and +1, < are the usual successor and order predicates. The complexity of the problem is at least as hard as Petri net reachability. Several extensions of the logic are considered, some remain decidable while some are undecidable.
An extension of data automata that captures XPath
, 2010
"... Abstract—We define a new kind of automata recognizing properties of data words or data trees and prove that the automata capture all queries definable in Regular XPath. We show that the automatatheoretic approach may be applied to answer decidability and expressibility questions for XPath. Finally, ..."
Abstract

Cited by 19 (2 self)
 Add to MetaCart
Abstract—We define a new kind of automata recognizing properties of data words or data trees and prove that the automata capture all queries definable in Regular XPath. We show that the automatatheoretic approach may be applied to answer decidability and expressibility questions for XPath. Finally, we use the newly introduced automata as a common framework to classify existing automata on data words and trees, including data automata, register automata and alternating register automata. KeywordsRegular XPath, data automata, register automata. I.
Temporal Logics on Words with Multiple Data Values
 In FSTTCS 2010
"... The paper proposes and studies temporal logics for attributed words, that is, data words with a (finite) set of (attribute,value)pairs at each position. It considers a basic logic which is a semantical fragment of the logic LTL ↓ 1 of Demri and Lazic with operators for navigation into the future an ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
(Show Context)
The paper proposes and studies temporal logics for attributed words, that is, data words with a (finite) set of (attribute,value)pairs at each position. It considers a basic logic which is a semantical fragment of the logic LTL ↓ 1 of Demri and Lazic with operators for navigation into the future and the past. By reduction to the emptiness problem for data automata it is shown that this basic logic is decidable. Whereas the basic logic only allows navigation to positions where a fixed data value occurs, extensions are studied that also allow navigation to positions with different data values. Besides some undecidable results it is shown that the extension by a certain UNTILoperator with an inequality target condition remains decidable.
A succinct canonical register automaton model
 In Tevfik Bultan and PaoAnn Hsiung, editors, Automated Technology for Verification and Analysis, 9th International Symposium, ATVA 2011
"... ..."
Graph reachability and pebble automata over infinite alphabets
 In LICS’09
"... Abstract—We study the graph reachability problem as a language over an infinite alphabet. Namely, we view a word of even length a0b0 ···anbn over an infinite alphabet as a directed graph with the symbols that appear in a0b0 ···anbn as the vertices and (a0,b0),...,(an,bn) as the edges. We prove that ..."
Abstract

Cited by 10 (6 self)
 Add to MetaCart
(Show Context)
Abstract—We study the graph reachability problem as a language over an infinite alphabet. Namely, we view a word of even length a0b0 ···anbn over an infinite alphabet as a directed graph with the symbols that appear in a0b0 ···anbn as the vertices and (a0,b0),...,(an,bn) as the edges. We prove that for any positive integer k, k pebbles are sufficient for recognizing the existence of a path of length 2 k − 1 from the vertex a0 to the vertex bn, but are not sufficient for recognizing the existence of a path of length 2 k+1 −2 from the vertex a0 to the vertex bn. Based on this result, we establish a number of relations among some classes of languages over infinite alphabets. KeywordsGraph reachability; pebble automata; infinite alphabets I.
Regular Functions, Cost Register Automata, and Generalized MinCost Problems
, 2012
"... Motivated by the successful application of the theory of regular languages to formal verification of finitestate systems, there is a renewed interest in developing a theory of analyzable functions from strings to numerical values that can provide a foundation for analyzing quantitative properties o ..."
Abstract

Cited by 9 (6 self)
 Add to MetaCart
(Show Context)
Motivated by the successful application of the theory of regular languages to formal verification of finitestate systems, there is a renewed interest in developing a theory of analyzable functions from strings to numerical values that can provide a foundation for analyzing quantitative properties of finitestate systems. In this paper, we propose a deterministic model for associating costs with strings that is parameterized by operations of interest (such as addition, scaling, and min), a notion of regularity that provides a yardstick to measure expressiveness, and study decision problems and theoretical properties of resulting classes of cost functions. Our definition of regularity relies on the theory of stringtotree transducers, and allows associating costs with events that are conditional upon regular properties of future events. Our model of cost register automata allows computation of regular functions using multiple “writeonly ” registers whose values can be combined using the allowed set of operations. We show that classical shortestpath algorithms as well as algorithms designed for computing discounted costs, can be adopted for solving the mincost problems for the more general classes of functions specified in our model. Cost register automata with min and increment give a deterministic model that is equivalent to weighted automata, an extensively studied nondeterministic model, and this 1.1
Automata for Data Words and Data Trees
"... Data words and data trees appear in verification and XML processing. The term “data” means that positions of the word, or tree, are decorated with elements of an infinite set of data values, such as natural numbers or ASCII strings. This talk is a survey of the various automaton models that have bee ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
Data words and data trees appear in verification and XML processing. The term “data” means that positions of the word, or tree, are decorated with elements of an infinite set of data values, such as natural numbers or ASCII strings. This talk is a survey of the various automaton models that have been developed for data words and data trees.
Algorithmic Analysis of ArrayAccessing Programs
"... For programs whose data variables range over Boolean or finite domains, program verification is decidable, and this forms the basis of recent tools for software model checking. In this paper, we consider algorithmic verification of programs that use Boolean variables, and in addition, access a singl ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
(Show Context)
For programs whose data variables range over Boolean or finite domains, program verification is decidable, and this forms the basis of recent tools for software model checking. In this paper, we consider algorithmic verification of programs that use Boolean variables, and in addition, access a single array whose length is potentially unbounded, and whose elements range over pairs from Σ × D, where Σ is a finite alphabet and D is a potentially unbounded data domain. We show that the reachability problem, while undecidable in general, is (1) PSPACEcomplete for programs in which the arrayaccessing forloops are not nested, (2) solvable in EXPSPACE for programs with arbitrarily nested loops if array elements range over a finite data domain, and (3) decidable for a restricted class of programs with doublynested loops. The third result establishes connections to automata and logics defining languages over data words.
Safety Alternating Automata on Data Words
"... A data word is a sequence of pairs of a letter from a finite alphabet and an element from an infinite set, where the latter can only be compared for equality. Safety oneway alternating automata with one register on infinite data words are considered, their nonemptiness is shown ExpSpacecomplete, a ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
A data word is a sequence of pairs of a letter from a finite alphabet and an element from an infinite set, where the latter can only be compared for equality. Safety oneway alternating automata with one register on infinite data words are considered, their nonemptiness is shown ExpSpacecomplete, and their inclusion decidable but not primitive recursive. The same complexity bounds are obtained for satisfiability and refinement, respectively, for the safety fragment of linear temporal logic with freeze quantification. Dropping the safety restriction, adding past temporal operators, or adding one more register, each causes undecidability.
On pebble automata for data languages with decidable emptiness problem
 Journal of Computer and Systems Sciences
"... Abstract. In this paper we study a subclass of pebble automata (PA) for data languages for which the emptiness problem is decidable. Namely, we show that the emptiness problem for weak 2pebble automata is decidable, while the same problem for weak 3pebble automata is undecidable. We also introduce ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
(Show Context)
Abstract. In this paper we study a subclass of pebble automata (PA) for data languages for which the emptiness problem is decidable. Namely, we show that the emptiness problem for weak 2pebble automata is decidable, while the same problem for weak 3pebble automata is undecidable. We also introduce the socalled top view weak PA. Roughly speaking, top view weak PA are weak PA where the equality test is performed only between the data values seen by the two most recently placed pebbles. The emptiness problem for this model is still decidable. 1