Safety alternating automata on data words

Lazić, Ranko

doi:10.1145/1877714.1877716

Cited by 14 publications

(13 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this paper we show that the satisfiability problem for Safety MTL is non-elementary by reduction from the termination problem for ICMETs. We note that in a similar vein, an EXPSPACE lower bound for the complexity of satisfiability of an extension of Linear Temporal Logic on data words was given in [Laz11] via a reduction from the termination problem for counter machines with incrementation errors.…”

Section: Introductionmentioning

confidence: 88%

On termination and invariance for faulty channel machines

et al. 2012

View full text Add to dashboard Cite

A channel machine consists of a finite controller together with several fifo channels; the controller can read messages from the head of a channel and write messages to the tail of a channel. In this paper we focus on channel machines with insertion errors, i.e., machines in whose channels messages can spontaneously appear. We consider the invariance problem: does a given insertion channel machine have an infinite computation all of whose configurations satisfy a given predicate? We show that this problem is primitive-recursive if the predicate is closed under message losses. We also give a non-elementary lower bound for the invariance problem under this restriction. Finally, using the previous result, we show that the satisfiability problem for the safety fragment of Metric Temporal Logic is non-elementary.

show abstract

Section: Introductionmentioning

confidence: 88%

On termination and invariance for faulty channel machines

et al. 2012

View full text Add to dashboard Cite

show abstract

“…A few works such as [31], [35], [36] are on words, while in most applications we need to consider trees. Moreover, these works are incomparable to some interesting existing formalisms [17], [6], [2], [12], [24], [14], [29] known to be able to capture various interesting scenarios common in practice. On top of that many useful techniques, notably those introduced in [17], [8], [6], [24], can deal only with data equality, and are highly dependent on specific combinatorial properties of the formalisms.…”

Section: Introductionmentioning

confidence: 98%

“…Adding one more register or past time operators, such as X −1 or U −1 , to LTL ↓ 1 (X, U) makes the satisfiability problem undecidable. In [29] a weaker version of alternating RA 1 , called safety alternating RA 1 , is considered, and the emptiness problem is shown to be EXPSPACE-complete.…”

Section: Introductionmentioning

confidence: 99%

An Automata Model for Trees with Ordered Data Values

Tan

2012

2012 27th Annual IEEE Symposium on Logic in Computer Science

View full text Add to dashboard Cite

Data trees are trees in which each node, besides carrying a label from a finite alphabet, also carries a data value from an infinite domain. They have been used as an abstraction model for reasoning tasks on XML and verification. However, most existing approaches consider the case where only equality test can be performed on the data values.In this paper we study data trees in which the data values come from a linearly ordered domain, and in addition to equality test, we can test whether the data value in a node is greater than the one in another node. We introduce an automata model for them which we call ordered-data tree automata (ODTA), provide its logical characterisation, and prove that its emptiness problem is decidable in 3-NEXPTIME. We also show that the twovariable logic on unranked trees, studied by Bojanczyk, Muscholl, Schwentick and Segoufin in 2009, corresponds precisely to a special subclass of this automata model.Then we define a slightly weaker version of ODTA, which we call weak ODTA, and provide its logical characterisation. The complexity of the emptiness problem drops to NP. However, a number of existing formalisms and models studied in the literature can be captured already by weak ODTA. We also show that the definition of ODTA can be easily modified, to the case where the data values come from a tree-like partially ordered domain, such as strings.

show abstract

“…Related work. Automata over infinite data words have been introduced to prove decidability of satisfiability for many kinds of logic: LTL with freeze quantifier [31]; safety fragment of LTL [32]; F O with two variables, successor, and equality and order predicates [33]; EMSO with two variables, successor and equality [34]; generic EMSO [35]; EMSO with two variables and LTL with additional operators for data words [36]. The main result for these papers is decidability of nonemptiness.…”

Section: Discussionmentioning

confidence: 99%

A Class of Automata for the Verification of Infinite, Resource-Allocating Behaviours

Ciancia

Sammartino

2014

Trustworthy Global Computing

View full text Add to dashboard Cite

Abstract. Process calculi for service-oriented computing often feature generation of fresh resources. So-called nominal automata have been studied both as semantic models for such calculi, and as acceptors of languages of finite words over infinite alphabets. In this paper we investigate nominal automata that accept infinite words. These automata are a generalisation of deterministic Muller automata to the setting of nominal sets. We prove decidability of complement, union, intersection, emptiness and equivalence, and determinacy by ultimately periodic words. The key to obtain such results is to use finite representations of the (otherwise infinite-state) defined class of automata. The definition of such operations enables model checking of process calculi featuring infinite behaviours, and resource allocation, to be implemented using classical automatatheoretic methods.

show abstract

Safety alternating automata on data words

Cited by 14 publications

References 22 publications

On termination and invariance for faulty channel machines

On termination and invariance for faulty channel machines

An Automata Model for Trees with Ordered Data Values

A Class of Automata for the Verification of Infinite, Resource-Allocating Behaviours

Contact Info

Product

Resources

About