Observations on determinization of Büchi automata

Authors:
Christoph Schulte Althoff;Wolfgang Thomas;Nico Wallmeier
Affiliations:
RWTH Aachen, Lehrstuhl Informatik, Aachen, Germany;RWTH Aachen, Lehrstuhl Informatik, Aachen, Germany;RWTH Aachen, Lehrstuhl Informatik, Aachen, Germany
Venue:
Theoretical Computer Science - Implementation and application of automata
Year:
2006

Citing 5
Cited 4

Automata on infinite objects

Handbook of theoretical computer science (vol. B)
Simulating alternating tree automata by nondeterministic automata: new results and new proofs of the theorems of Rabin, McNaughton and Safra

Theoretical Computer Science
Languages, automata, and logic

Handbook of formal languages, vol. 3
An effective decision procedure for linear arithmetic over the integers and reals

ACM Transactions on Computational Logic (TOCL)
Experiments with deterministic ω-automata for formulas of linear temporal logic

CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata

State of büchi complementation

CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Rabinizer: small deterministic automata for LTL (F,G)

ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
Synthesis from LTL specifications with mean-payoff objectives

TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
GOAL for games, omega-automata, and logics

CAV'13 Proceedings of the 25th international conference on Computer Aided Verification

Quantified Score

Hi-index	0.00

Visualization

Abstract

The two determinization procedures of Safra and Muller-Schupp for Büchi automata are compared, based on an implementation in a program called OmegaDet.