On the Equivalence of Automaton-Based Representations of Time Granularities

Abstract

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… (More)
DOI: 10.1109/TIME.2007.56

Topics

4 Figures and Tables