Automata theory and model checking

Orna Kupferman

doi:10.1007/978-3-319-10575-8_4

Automata theory and model checking

Orna Kupferman^*

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

23 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 language	English
Title of host publication	Handbook of Model Checking
Publisher	Springer International Publishing
Pages	107-151
Number of pages	45
ISBN (Electronic)	9783319105758
ISBN (Print)	9783319105741
DOIs	https://doi.org/10.1007/978-3-319-10575-8_4
State	Published - 18 May 2018

Bibliographical note

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

Access to Document

10.1007/978-3-319-10575-8_4

Cite this

@inbook{931dfaf2ebe04721ad5a67d9d95f496d,

title = "Automata theory and model checking",

abstract = "We study automata on infinite words and their applications in system specification and verification. We first introduce B{\"u}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.",

author = "Orna Kupferman",

year = "2018",

month = may,

day = "18",

doi = "10.1007/978-3-319-10575-8_4",

language = "אנגלית",

isbn = "9783319105741",

pages = "107--151",

booktitle = "Handbook of Model Checking",

publisher = "Springer International Publishing",

}

TY - CHAP

T1 - Automata theory and model checking

AU - Kupferman, Orna

PY - 2018/5/18

Y1 - 2018/5/18

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85054047250&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-10575-8_4

DO - 10.1007/978-3-319-10575-8_4

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.chapter???

AN - SCOPUS:85054047250

SN - 9783319105741

SP - 107

EP - 151

BT - Handbook of Model Checking

PB - Springer International Publishing

ER -

Automata theory and model checking

Abstract

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this