On the Equivalence of Automaton-Based Representations of Time Granularities

Ugo Dal Lago (1) , Angelo Montanari (2) , Gabriele Puppis (3)

1 DISI - Dipartimento di Scienze dell'Informazione [Bologna]
2 DIMI - Dipartimento di Matematica e Informatica - Universita Udine
3 LaBRI - Laboratoire Bordelais de Recherche en Informatique

A time granularity can be viewed as the partitioning of a temporal domain in groups of elements, where each group is perceived as an indivisible unit. In this paper we explore an automaton-based approach to the management of time granularity that compactly represents time granularities as single-string automata with counters, that is, Buchi automata, extended with counters, that accept a single infinite word. We focus our attention on the equivalence problem for the class of restricted labeled single-string automata (RLA for short). The equivalence problem for RLA is the problem of establishing whether two given RLA represent the same time granularity. The main contribution of the paper is the reduction of the (non)equivalence problem for RLA to the satisfiability problem for linear diophantine equations with bounds on variables. Since the latter problem has been shown to be NP-complete, we have that the RLA equivalence problem is in co-NP.

Domaines: Théorie et langage formel [cs.FL]

Ugo Dal Lago, Angelo Montanari, Gabriele Puppis. On the Equivalence of Automaton-Based Representations of Time Granularities. 14th International Symposium on Temporal Representation and Reasoning (TIME), 2007, France. pp.82-93. ⟨hal-00878435⟩