Abstract
The relevance of the problem of managing periodic phenomena is widely recognized in different areas of computer science. One of the most effective attempts to manage periodic phenomena takes advantage of the notion of time granularity, which can be thought of as the partitioning of a subset of a temporal domain into groups of elements, where each group is perceived as an indivisible unit (a granule). This chapter provides a detailed account of various automaton-based formalisms that cope with the notion of periodicity and that of time granularity.
We first review the notion of single-string automaton [25], which is a very restricted form of Büchi automaton accepting a single infinite word. Single-string automata provide the first basic formalism for representing and reasoning on ultimately periodic time granularities, that is, temporal structures that, starting from a given point, periodically group instants of the underlying temporal domain.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Puppis, G. (2010). Word Automata and Time Granularities. In: Automata for Branching and Layered Temporal Structures. Lecture Notes in Computer Science(), vol 5955. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11881-4_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-11881-4_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11880-7
Online ISBN: 978-3-642-11881-4
eBook Packages: Computer ScienceComputer Science (R0)