Complementation constructions for nondeterministic automata on infinite words

Orna Kupferman; Moshe Y. Vardi

doi:10.1007/978-3-540-31980-1_14

Complementation constructions for nondeterministic automata on infinite words

Orna Kupferman^*
, Moshe Y. Vardi

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Contribution to journal › Conference article › peer-review

27 Scopus citations

Abstract

The complementation problem for nondeterministic automata on infinite words has numerous applications in formal verification. In particular, the language-containment problem, to which many verification problems are reduced, involves complementation. Traditional optimal complementation constructions are quite complicated and have not been implemented. Recently, we have developed an analysis techniques for runs of co-Büchi and generalized co-Büchi automata and used the analysis to describe simpler optimal complementation constructions for Büchi and generalized Büchi automata. In this work, we extend the analysis technique to Rabin and Streett automata, and use the analysis to describe novel and simple complementation constructions for them.

Original language	English
Pages (from-to)	206-221
Number of pages	16
Journal	Lecture Notes in Computer Science
Volume	3440
DOIs	https://doi.org/10.1007/978-3-540-31980-1_14
State	Published - 2005
Event	11th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2005, held as part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2005 - Edinburgh, United Kingdom Duration: 4 Apr 2005 → 8 Apr 2005

Access to Document

10.1007/978-3-540-31980-1_14

Cite this

@article{daa28c1bb52146edacff44f330e7f433,

title = "Complementation constructions for nondeterministic automata on infinite words",

abstract = "The complementation problem for nondeterministic automata on infinite words has numerous applications in formal verification. In particular, the language-containment problem, to which many verification problems are reduced, involves complementation. Traditional optimal complementation constructions are quite complicated and have not been implemented. Recently, we have developed an analysis techniques for runs of co-B{\"u}chi and generalized co-B{\"u}chi automata and used the analysis to describe simpler optimal complementation constructions for B{\"u}chi and generalized B{\"u}chi automata. In this work, we extend the analysis technique to Rabin and Streett automata, and use the analysis to describe novel and simple complementation constructions for them.",

author = "Orna Kupferman and Vardi, \{Moshe Y.\}",

year = "2005",

doi = "10.1007/978-3-540-31980-1\_14",

language = "אנגלית",

volume = "3440",

pages = "206--221",

journal = "Lecture Notes in Computer Science",

issn = "0302-9743",

publisher = "Springer Science and Business Media Deutschland GmbH",

note = "11th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2005, held as part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2005 ; Conference date: 04-04-2005 Through 08-04-2005",

}

TY - JOUR

T1 - Complementation constructions for nondeterministic automata on infinite words

AU - Kupferman, Orna

AU - Vardi, Moshe Y.

PY - 2005

Y1 - 2005

N2 - The complementation problem for nondeterministic automata on infinite words has numerous applications in formal verification. In particular, the language-containment problem, to which many verification problems are reduced, involves complementation. Traditional optimal complementation constructions are quite complicated and have not been implemented. Recently, we have developed an analysis techniques for runs of co-Büchi and generalized co-Büchi automata and used the analysis to describe simpler optimal complementation constructions for Büchi and generalized Büchi automata. In this work, we extend the analysis technique to Rabin and Streett automata, and use the analysis to describe novel and simple complementation constructions for them.

AB - The complementation problem for nondeterministic automata on infinite words has numerous applications in formal verification. In particular, the language-containment problem, to which many verification problems are reduced, involves complementation. Traditional optimal complementation constructions are quite complicated and have not been implemented. Recently, we have developed an analysis techniques for runs of co-Büchi and generalized co-Büchi automata and used the analysis to describe simpler optimal complementation constructions for Büchi and generalized Büchi automata. In this work, we extend the analysis technique to Rabin and Streett automata, and use the analysis to describe novel and simple complementation constructions for them.

UR - https://www.scopus.com/pages/publications/24644516273

U2 - 10.1007/978-3-540-31980-1_14

DO - 10.1007/978-3-540-31980-1_14

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???

AN - SCOPUS:24644516273

SN - 0302-9743

VL - 3440

SP - 206

EP - 221

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

T2 - 11th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2005, held as part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2005

Y2 - 4 April 2005 through 8 April 2005

ER -

Complementation constructions for nondeterministic automata on infinite words

Abstract

Access to Document

Other files and links

Fingerprint

Cite this