FO2(<,+1,~) on data trees, data tree automata and branching vector addition systems. - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Logical Methods in Computer Science Year : 2016

FO2(<,+1,~) on data trees, data tree automata and branching vector addition systems.

Abstract

A data tree is an unranked ordered tree where each node carries a label from a finite alphabet and a datum from some infinite domain. We consider the two variable first order logic FO 2 (<, +1, ∼) over data trees. Here +1 refers to the child and the next sibling relations while < refers to the descendant and following sibling relations. Moreover, ∼ is a binary predicate testing data equality. We exhibit an automata model, denoted DTA # , that is more expressive than FO 2 (<, +1, ∼) but such that emptiness of DTA # and satisfiability of FO 2 (<, +1, ∼) are inter-reducible. This is proved via a model of counter tree automata, denoted EBVASS, that extends Branching Vector Addition Systems with States (BVASS) with extra features for merging counters. We show that, as decision problems, reachability for EBVASS, satisfiability of FO 2 (<, +1, ∼) and emptiness of DTA # are equivalent.
Fichier principal
Vignette du fichier
tdafo.pdf (468.93 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00769249 , version 1 (30-12-2012)
hal-00769249 , version 2 (05-01-2015)
hal-00769249 , version 3 (26-02-2016)

Licence

Attribution - NonCommercial

Identifiers

Cite

Florent Jacquemard, Luc Segoufin, Jérémie Dimino. FO2(<,+1,~) on data trees, data tree automata and branching vector addition systems.. Logical Methods in Computer Science, 2016, 12 (2), pp.32. ⟨10.2168/LMCS-12(2:3)2016⟩. ⟨hal-00769249v3⟩
633 View
315 Download

Altmetric

Share

Gmail Facebook X LinkedIn More