0705.2205v2.pdf (289.97 kB)
Download file

From nondeterministic Buchi and Streett automata to deterministic parity automata

Download (289.97 kB)
conference contribution
posted on 28.09.2015, 10:47 by Nir Piterman
In this paper we revisit Safra's determinization constructions. We show how to construct deterministic automata with fewer states and, most importantly, parity acceptance conditions. Specifically, starting from a nondeterministic Buchi automaton with n states our construction yields a deterministic parity automaton with n2n+2 states and index 2n (instead of a Rabin automaton with (12)nn2n states and n pairs). Starting from a nondeterministic Streett automaton with n states and k pairs our construction yields a deterministic parity automaton with nn(k+2)+2(k+1)2n(K+1) states and index 2n(k+1) (instead of a Rabin automaton with (12)n(k+1)n n(k+2)(k+1)2n(k+1) states and n(k+1) pairs). The parity condition is much simpler than the Rabin condition. In applications such as solving games and emptiness of tree automata handling the Rabin condition involves an additional multiplier of n2n!(or(n(k+1))2(n(k+1))! in the case of Streett) which is saved using our construction.

History

Citation

21st annual IEEE symposium on logic in computer science, proceedings, 2006, pp. 255-264

Author affiliation

/Organisation/COLLEGE OF SCIENCE AND ENGINEERING/Department of Computer Science

Source

21st Annual IEEE Symposium on Logic in Computer Science (LICS 2006), Seattle, WA

Version

VoR (Version of Record)

Published in

21st annual IEEE symposium on logic in computer science

Publisher

IEEE

issn

1043-6871

isbn

0-7695-2631-4

Copyright date

2007

Available date

28/09/2015

Publisher version

http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=1691236

Temporal coverage: start date

12/08/2006

Temporal coverage: end date

15/08/2006

Language

en