Abstract
In this chapter, we give basic mathematical definitions and notation that will be used as a foundation for our definitions of timed automata and timed I/O automata. These definitions involve functions, sequences, partial orders, and untimed automata. Many readers might prefer to skip directly to Chapter 4, referring back to Chapters 2 and 3 as needed.
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
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Kaynar, D.K., Lynch, N., Segala, R., Vaandrager, F. (2011). Mathematical Preliminaries. In: The Theory of Timed I/O Automata. Synthesis Lectures on Distributed Computing Theory. Springer, Cham. https://doi.org/10.1007/978-3-031-02003-2_2
Download citation
DOI: https://doi.org/10.1007/978-3-031-02003-2_2
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-00875-7
Online ISBN: 978-3-031-02003-2
eBook Packages: Synthesis Collection of Technology (R0)eBColl Synthesis Collection 1eBColl Synthesis Collection 3