Sciweavers

JAPLL
2006

Definability and decidability of binary predicates for time granularity

13 years 4 months ago
Definability and decidability of binary predicates for time granularity
In this paper we study the definability and decidability of binary predicates for time granularity in monadic languages interpreted over finitely and infinitely layered structures. We focus our attention on the equi-level (resp. equi-column) predicate constraining two time points to belong to the same layer (resp. column) and on the horizontal (resp. vertical) successor predicate relating a time point to its successor within a given layer (resp. column). We give a number of positive and negative results by reduction to/from a wide spectrum of decidable/undecidable problems. Key words: time granularity, monadic theories, definability, decidability
Massimo Franceschet, Angelo Montanari, Adriano Per
Added 13 Dec 2010
Updated 13 Dec 2010
Type Journal
Year 2006
Where JAPLL
Authors Massimo Franceschet, Angelo Montanari, Adriano Peron, Guido Sciavicco
Comments (0)