Abstract
Automata on infinite words have gained a great deal of importance since their first definition some forty years ago. Apart from the interests from a theoretical point of view they have practical importance for the specification and verification of reactive systems that are not supposed to terminate at some point of time. Operating systems are an example of such systems, as they should be ready to process any user input as it is entered, without terminating after or during some task.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Farwer, B. (2002). ω-Automata. In: Grädel, E., Thomas, W., Wilke, T. (eds) Automata Logics, and Infinite Games. Lecture Notes in Computer Science, vol 2500. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36387-4_1
Download citation
DOI: https://doi.org/10.1007/3-540-36387-4_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00388-5
Online ISBN: 978-3-540-36387-3
eBook Packages: Springer Book Archive