Buchi automata augmented with spatial constraints: simulating an alternating with a nondeterministic and deciding the emptiness problem for the latter

02/22/2020
by   Amar Isli, et al.
0

The aim of this work is to thoroughly investigate Buchi automata augmented with spatial constraints. The input trees of such an automaton are infinite k-ary Sigma-trees, with the nodes standing for time points, and Sigma including, additionally to its uses in classical k-ary Sigma-trees, the description of the snapshot of an n-object spatial scene of interest. The constraints, from an RCC8-like spatial Relation Algebra (RA) x, are used to impose spatial constraints on objects of the spatial scene, eventually at different nodes of the input trees. We show that a Buchi alternating automaton augmented with spatial constraints can be simulated with a classical Buchi nondeterministic automaton of the same type, augmented with spatial constraints. We then provide a nondeterministic doubly depth-first polynomial space algorithm for the emptiness problem of the latter automaton. Our main motivation came from another work, also submitted to this conference, which defines a spatio-temporalisation of the well-known family ALC(D) of description logics with a concrete domain: together, the two works provide an effective solution to the satisfiability problem of a concept of the spatio-temporalisation with respect to a weakly cyclic TBox.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/22/2020

A spatio-temporalisation of ALC(D) and its translation into alternating automata augmented with spatial constraints

The aim of this work is to provide a family of qualitative theories for ...
research
02/10/2023

Constraint Automata on Infinite Data Trees: From CTL(Z)/CTL*(Z) To Decision Procedures

We introduce the class of tree constraint automata with data values in Z...
research
01/11/2021

Register Automata with Extrema Constraints, and an Application to Two-Variable Logic

We introduce a model of register automata over infinite trees with extre...
research
10/24/2017

Bottom-up automata on data trees and vertical XPath

A data tree is a finite tree whose every node carries a label from a fin...
research
10/13/2020

Collapsible Pushdown Parity Games

This paper studies a large class of two-player perfect-information turn-...
research
09/10/2018

On Computing the Measures of First-Order Definable Sets of Trees

We consider the problem of computing the measure of a regular language o...

Please sign up or login with your details

Forgot password? Click here to reset