Abstract
In this chapter, we define the notion of a property for hybrid sequences and define some common types of properties, in particular, safety and liveness properties. We define what it means for a timed automaton to satisfy a property, and present results that capture common proof methods for showing that automata satisfy properties.
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
Preview
Unable to display preview. Download preview PDF.
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). Properties for Timed Automata. 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_6
Download citation
DOI: https://doi.org/10.1007/978-3-031-02003-2_6
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