scientific article; zbMATH DE number 7455748
From MaRDI portal
Publication:5021011
Moshe Y. Vardi, Yong Li, Li-jun Zhang
Publication date: 11 January 2022
Full work available at URL: https://arxiv.org/abs/2005.09125
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Applications of game theory (91A80) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Alternating finite automata on \(\omega\)-words
- The complementation problem for Büchi automata with applications to temporal logic
- Complementing deterministic Büchi automata in polynomial time
- Unambiguous Büchi automata.
- On finitely ambiguous Büchi automata
- Complementation of finitely ambiguous Büchi automata
- An efficient synthesis algorithm for parametric Markov chains against linear time properties
- Complementing semi-deterministic Büchi automata
- B\"uchi Complementation and Size-Change Termination
- State of B\"uchi Complementation
- Advanced Ramsey-Based Büchi Automata Inclusion Testing
- Lower Bounds for Complementation of omega-Automata Via the Full Automata Technique
- Complementation, Disambiguation, and Determinization of Büchi Automata Unified
- Weak alternating automata are not that weak
- Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata
- Antichains for the Automata-Based Approach to Model-Checking
- The complexity of probabilistic verification
- Markov Chains and Unambiguous Büchi Automata
- Computer Aided Verification
- Büchi Complementation Made Tight
This page was built for publication:
