Mechanizing the Powerset Construction for Restricted Classes of ω-Automata
From MaRDI portal
(Redirected from Publication:3510798)
Recommendations
- A power-set construction for reducing Büchi automata to non-determinism degree two
- On the generative power of -grammars and -automata
- On the power of P automata
- scientific article; zbMATH DE number 3984581
- -automata
- ω-Automata
- scientific article; zbMATH DE number 1472391
- On the power of P and dP automata
- On alternating \(\omega\)-automata
- scientific article; zbMATH DE number 4179361
Cites work
- ``More deterministic vs. ``smaller Büchi automata for efficient LTL model checking
- Alternating finite automata on -words
- An effective decision procedure for linear arithmetic over the integers and reals
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- Complementing deterministic Büchi automata in polynomial time
- Decision problems forω-automata
- Don’t Care Words with an Application to the Automata-Based Approach for Real Addition
- Efficient minimization of deterministic weak -automata
- Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata
- Faster algorithms for the nonemptiness of streett automata and for communication protocol pruning
- Formalization and validation of the general inter-ORB protocol (GIOP) using PROMELA and SPIN
- scientific article; zbMATH DE number 1670781 (Why is no real title available?)
- scientific article; zbMATH DE number 1701356 (Why is no real title available?)
- scientific article; zbMATH DE number 734956 (Why is no real title available?)
- scientific article; zbMATH DE number 1759609 (Why is no real title available?)
- scientific article; zbMATH DE number 1796123 (Why is no real title available?)
- scientific article; zbMATH DE number 1392310 (Why is no real title available?)
- Mathematical Foundations of Computer Science 2003
- MONA IMPLEMENTATION SECRETS
- On syntactic congruences for \(\omega\)-languages
- TYPENESS FOR ω-REGULAR AUTOMATA
- Verifying a signature architecture: a comparative case study
- Weak alternating automata are not that weak
Cited in
(10)- Don't care words with an application to the automata-based approach for real addition
- Deciding monadic second order logic over -words by specialized finite automata
- On the generative power of -grammars and -automata
- Generic emptiness check for fun and profit
- scientific article; zbMATH DE number 1538036 (Why is no real title available?)
- Theories of real addition with and without a predicate for integers
- Don’t Care Words with an Application to the Automata-Based Approach for Real Addition
- Dissecting \texttt{ltlsynt}
- On the power of automata minimization in reactive synthesis
- A power-set construction for reducing Büchi automata to non-determinism degree two
This page was built for publication: Mechanizing the Powerset Construction for Restricted Classes of ω-Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3510798)
