Abstract
The present book aims at studying (different classes of) automata to model and reason on infinite complex systems. It focuses on two different notions of automata: word automata and tree automata.
The first class of automata reveals itself as a helpful tool for representing temporal information and for dealing with periodic phenomena. These tasks are widely recognized as relevant ones in a variety of application areas ranging from temporal database design and inter-operability to data conversion and data mining, to the specification and verification of reactive systems, to the synthesis, execution, and monitoring of timed workflow systems, to temporal constraint representation and reasoning, and to temporal abstraction [3]. One of the most effective attempts at dealing with these problems takes advantage of the notion of time granularity.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Puppis, G. (2010). Introduction. 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_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-11881-4_1
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)