Automata theory and model checking

Orna Kupferman*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

22 Scopus citations

Abstract

We study automata on infinite words and their applications in system specification and verification. We first introduce Büchi automata and survey their closure properties, expressive power, and determinization. We then introduce additional acceptance conditions and the model of alternating automata. We compare the different classes of automata in terms of expressive power and succinctness, and describe decision problems for them. Finally, we describe the automata-theoretic approach to system specification and verification.

Original languageAmerican English
Title of host publicationHandbook of Model Checking
PublisherSpringer International Publishing
Pages107-151
Number of pages45
ISBN (Electronic)9783319105758
ISBN (Print)9783319105741
DOIs
StatePublished - 18 May 2018

Bibliographical note

Publisher Copyright:
© Springer International Publishing AG, part of Springer Nature 2018. All rights reserved.

Fingerprint

Dive into the research topics of 'Automata theory and model checking'. Together they form a unique fingerprint.

Cite this