Divide-and-Conquer Determinization of Büchi Automata Based on SCC Decomposition
From MaRDI portal
Publication:6487334
Recommendations
- Deternimization of Büchi automata as partitioned automata
- Determinization of Büchi-Automata
- Determinization of Büchi automata: unifying the approaches of Safra and Muller-Schupp
- Implementation and Application of Automata
- Observations on determinization of Büchi automata
- New optimizations and heuristics for determinization of Büchi automata
- Tighter Bounds for the Determinisation of Büchi Automata
- Minimising deterministic Büchi automata precisely using SAT solving
- Determinizing Büchi asynchronous automata
- Complementing deterministic Büchi automata in polynomial time
Cites work
- scientific article; zbMATH DE number 4124989 (Why is no real title available?)
- scientific article; zbMATH DE number 1500643 (Why is no real title available?)
- scientific article; zbMATH DE number 1517989 (Why is no real title available?)
- scientific article; zbMATH DE number 1765703 (Why is no real title available?)
- scientific article; zbMATH DE number 7561613 (Why is no real title available?)
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata
- A Unified Translation of Linear Temporal Logic to ω-Automata
- A modular approach for Büchi determinization
- A tighter analysis of Piterman's Büchi determinization
- Alternating automata, the weak monadic theory of trees and its complexity
- Alternating finite automata on -words
- An improved construction of deterministic omega-automaton using derivatives
- Büchi complementation made tight
- Complementation, Disambiguation, and Determinization of Büchi Automata Unified
- Complementing semi-deterministic Büchi automata
- Divide-and-Conquer Determinization of Büchi Automata Based on SCC Decomposition
- From LTL and limit-deterministic Büchi automata to deterministic parity automata
- From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata
- Lower Bounds for Complementation of omega-Automata Via the Full Automata Technique
- Modalities for model checking: Branching time logic strikes back
- New optimizations and heuristics for determinization of Büchi automata
- On-the-Fly Stuttering in the Construction of Deterministic ω-Automata
- Owl: a library for \(\omega \)-words, automata, and LTL
- Profile trees for Büchi word automata, with application to determinization
- Reasoning about infinite computations
- State of Büchi complementation
- The complexity of probabilistic verification
- Tighter Bounds for the Determinisation of Büchi Automata
- Weak alternating automata are not that weak
- ω-Automata
Cited in
(3)
This page was built for publication: Divide-and-Conquer Determinization of Büchi Automata Based on SCC Decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487334)
