Profile trees for Büchi word automata, with application to determinization
From MaRDI portal
Publication:897653
Abstract: The determinization of Buchi automata is a celebrated problem, with applications in synthesis, probabilistic verification, and multi-agent systems. Since the 1960s, there has been a steady progress of constructions: by McNaughton, Safra, Piterman, Schewe, and others. Despite the proliferation of solutions, they are all essentially ad-hoc constructions, with little theory behind them other than proofs of correctness. Since Safra, all optimal constructions employ trees as states of the deterministic automaton, and transitions between states are defined operationally over these trees. The operational nature of these constructions complicates understanding, implementing, and reasoning about them, and should be contrasted with complementation, where a solid theory in terms of automata run DAGs underlies modern constructions. In 2010, we described a profile-based approach to Buchi complementation, where a profile is simply the history of visits to accepting states. We developed a structural theory of profiles and used it to describe a complementation construction that is deterministic in the limit. Here we extend the theory of profiles to prove that every run DAG contains a profile tree with at most a finite number of infinite branches. We then show that this property provides a theoretical grounding for a new determinization construction where macrostates are doubly preordered sets of states. In contrast to extant determinization constructions, transitions in the new construction are described declaratively rather than operationally.
Recommendations
Cites work
- scientific article; zbMATH DE number 4124989 (Why is no real title available?)
- scientific article; zbMATH DE number 3237829 (Why is no real title available?)
- scientific article; zbMATH DE number 3254905 (Why is no real title available?)
- Alternating-time temporal logic
- BÜCHI COMPLEMENTATION MADE TIGHTER
- Büchi complementation made tight
- Complementation, Disambiguation, and Determinization of Büchi Automata Unified
- Decision problems forω-automata
- Efficient Büchi universality checking
- From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata
- Improved Algorithms for the Automata-Based Approach to Model-Checking
- Observations on determinization of Büchi automata
- Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
- Testing and generating infinite sequences by a finite automaton
- The complexity of probabilistic verification
- Tighter Bounds for the Determinisation of Büchi Automata
- Unifying Büchi complementation constructions
- Weak alternating automata are not that weak
Cited in
(14)- New optimizations and heuristics for determinization of Büchi automata
- From LTL and limit-deterministic Büchi automata to deterministic parity automata
- On the power of finite ambiguity in Büchi complementation
- Towards a grand unification of Büchi complementation constructions
- Projection for Büchi tree automata with constraints between siblings
- Profile trees for Büchi word automata, with application to determinization
- Congruence Relations for Büchi Automata
- Divide-and-Conquer Determinization of Büchi Automata Based on SCC Decomposition
- Proof systems for the modal \(\mu \)-calculus obtained by determinizing automata
- Tighter Bounds for the Determinisation of Büchi Automata
- A modular approach for Büchi determinization
- Projection for Büchi Tree Automata with Constraints between Siblings
- From Muller to parity and Rabin qutomata: optimal transformations preserving (history) determinism
- Modular mix-and-match complementation of Büchi automata
This page was built for publication: Profile trees for Büchi word automata, with application to determinization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897653)
