From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata (Q3303906): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1701.06103 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complementing semi-deterministic Büchi automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison of LTL to Deterministic Rabin Automata Translators / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of probabilistic verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Synthesis for Petri Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Profile trees for Büchi word automata, with application to determinization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3459475 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak alternating automata are not that weak / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limit deterministic and probabilistic automata for \(\mathrm{LTL}\backslash GU\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Construction of Deterministic Omega-automaton Using Derivatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limit-Deterministic Büchi Automata for Linear Temporal Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correct Hardware Design and Verification Methods / rank
 
Normal rank

Latest revision as of 06:18, 23 July 2024

scientific article
Language Label Description Also known as
English
From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata
scientific article

    Statements

    From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    5 August 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    regular language
    0 references
    linear temporal logic
    0 references
    synthesis problem
    0 references
    acceptance condition
    0 references
    small index
    0 references
    0 references
    0 references