Complementing Semi-deterministic Büchi Automata

D 2016

Complementing Semi-deterministic Büchi Automata

BLAHOUDEK, František, Matthias HEIZMANN, Sven SCHEWE, Jan STREJČEK, Ming-Hsien TSAI et. al.

Basic information

Original name

Complementing Semi-deterministic Büchi Automata

Authors

BLAHOUDEK, František (203 Czech Republic, belonging to the institution), Matthias HEIZMANN (276 Germany), Sven SCHEWE (276 Germany), Jan STREJČEK (203 Czech Republic, guarantor, belonging to the institution) and Ming-Hsien TSAI (158 Taiwan)

Edition

Berlin, Tools and Algorithms for the Construction and Analysis of Systems 22nd International Conference, TACAS 2016, p. 770-787, 18 pp. 2016

Publisher

Springer Berlin Heidelberg

Other information

Language

English

Type of outcome

Stať ve sborníku

Field of Study

10201 Computer sciences, information science, bioinformatics

Country of publisher

Germany

Confidentiality degree

není předmětem státního či obchodního tajemství

Publication form

printed version "print"

References:

URL

Impact factor

Impact factor: 0.402 in 2005

RIV identification code

RIV/00216224:14330/16:00088081

Organization unit

Faculty of Informatics

ISBN

978-3-662-49673-2

ISSN

DOI

http://dx.doi.org/10.1007/978-3-662-49674-9_49

UT WoS

000406428000049

Keywords in English

Buchi automata;complementation

Abstract

V originále

We introduce an efficient complementation technique for semi-deterministic Büchi automata, which are Büchi automata that are deterministic in the limit: from every accepting state onward, their behaviour is deterministic. It is interesting to study semi-deterministic automata, because they play a role in practical applications of automata theory, such as the analysis of Markov decision processes. Our motivation to study their complementation comes from the termination analysis implemented in Ultimate Büchi Automizer, where these automata represent checked runs and have to be complemented to identify runs to be checked. We show that semi-determinism leads to a simpler complementation procedure: an extended breakpoint construction that allows for symbolic implementation. It also leads to significantly improved bounds as the complement of a semi-deterministic automaton with n states has less than 4^n states. Moreover, the resulting automaton is unambiguous, which again offers new applications, like the analysis of Markov chains. We have evaluated our construction against the semi-deterministic automata produced by the Ultimate Büchi Automizer. The evaluation confirms that our algorithm outperforms the known complementation techniques for general nondeterministic Büchi automata.

Links

GBP202/12/G061, research and development project

Name: Centrum excelence - Institut teoretické informatiky (CE-ITI) (Acronym: CE-ITI)

Investor: Czech Science Foundation

MUNI/A/0935/2015, interní kód MU

Name: Zapojení studentů Fakulty informatiky do mezinárodní vědecké komunity (Acronym: SKOMU)

Investor: Masaryk University, Category A

MUNI/A/0945/2015, interní kód MU

Name: Rozsáhlé výpočetní systémy: modely, aplikace a verifikace V.

Investor: Masaryk University, Category A

Citovat

BLAHOUDEK, František, Matthias HEIZMANN, Sven SCHEWE, Jan STREJČEK and Ming-Hsien TSAI. Complementing Semi-deterministic Büchi Automata. In Marsha Chechik, Jean-François Raskin. Tools and Algorithms for the Construction and Analysis of Systems 22nd International Conference, TACAS 2016. Berlin: Springer Berlin Heidelberg, 2016, p. 770-787. ISBN 978-3-662-49673-2. Available from: https://dx.doi.org/10.1007/978-3-662-49674-9_49.

@inproceedings{1351787,
   author = {Blahoudek, František and Heizmann, Matthias and Schewe, Sven and Strejček, Jan and Tsai, MingandHsien},
   address = {Berlin},
   booktitle = {Tools and Algorithms for the Construction and Analysis of Systems 22nd International Conference, TACAS 2016},
   doi = {http://dx.doi.org/10.1007/978-3-662-49674-9_49},
   editor = {Marsha Chechik, Jean-François Raskin},
   keywords = {Buchi automata;complementation},
   howpublished = {tištěná verze "print"},
   language = {eng},
   location = {Berlin},
   isbn = {978-3-662-49673-2},
   pages = {770-787},
   publisher = {Springer Berlin Heidelberg},
   title = {Complementing Semi-deterministic Büchi Automata},
   url = {http://link.springer.com/chapter/10.1007/978-3-662-49674-9_49},
   year = {2016}
}

TY  - JOUR
ID  - 1351787
AU  - Blahoudek, František - Heizmann, Matthias - Schewe, Sven - Strejček, Jan - Tsai, Ming-Hsien
PY  - 2016
TI  - Complementing Semi-deterministic Büchi Automata
PB  - Springer Berlin Heidelberg
CY  - Berlin
SN  - 9783662496732
KW  - Buchi automata;complementation
UR  - http://link.springer.com/chapter/10.1007/978-3-662-49674-9_49
L2  - http://link.springer.com/chapter/10.1007/978-3-662-49674-9_49
N2  - We introduce an efficient complementation technique for semi-deterministic Büchi automata, which are Büchi automata that are deterministic in the limit: from every accepting state onward, their behaviour is deterministic. It is interesting to study semi-deterministic automata, because they play a role in practical applications of automata theory, such as the analysis of Markov decision processes. Our motivation to study their complementation comes from the termination analysis implemented in Ultimate Büchi Automizer, where these automata represent checked runs and have to be complemented to identify runs to be checked. We show that semi-determinism leads to a simpler complementation procedure: an extended breakpoint construction that allows for symbolic implementation. It also leads to significantly improved bounds as the complement of a semi-deterministic automaton with n states has less than 4^n states. Moreover, the resulting automaton is unambiguous, which again offers new applications, like the analysis of Markov chains. We have evaluated our construction against the semi-deterministic automata produced by the Ultimate Büchi Automizer. The evaluation confirms that our algorithm outperforms the known complementation techniques for general nondeterministic Büchi automata.
ER  -

BLAHOUDEK, František, Matthias HEIZMANN, Sven SCHEWE, Jan STREJČEK and Ming-Hsien TSAI. Complementing Semi-deterministic Büchi Automata. In Marsha Chechik, Jean-Fran\c cois Raskin. \textit{Tools and Algorithms for the Construction and Analysis of Systems 22nd International Conference, TACAS 2016}. Berlin: Springer Berlin Heidelberg, 2016, p.~770-787. ISBN~978-3-662-49673-2. Available from: https://dx.doi.org/10.1007/978-3-662-49674-9\_{}49.

Detailed Information on Publication Record