Optimal Translation of LTL to Limit Deterministic Automata (Q3303923): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Rabinizer / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: PRISM / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MoChiBA / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2590126170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic generators and games for Ltl fragments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective Translation of LTL to Deterministic Rabin Automata: Beyond the (F,G)-Fragment / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of probabilistic verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: From LTL to deterministic automata. A safraless compositional approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lazy probabilistic model checking without determinisation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Games Without Determinization / 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: Experiments with deterministic \(\omega\)-automata for formulas of linear temporal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Are Good-for-Games Automata Good for Probabilistic Model Checking? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rabinizer 3: Safraless Translation of LTL to Small Deterministic Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rabinizer 2: Small Deterministic Automata for LTL ∖ GU / rank
 
Normal rank
Property / cites work
 
Property / cites work: From LTL to Symbolically Represented Deterministic Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification, Model Checking, and Abstract Interpretation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4315289 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limit-Deterministic Büchi Automata for Linear Temporal Logic / rank
 
Normal rank

Latest revision as of 06:19, 23 July 2024

scientific article
Language Label Description Also known as
English
Optimal Translation of LTL to Limit Deterministic Automata
scientific article

    Statements

    Optimal Translation of LTL to Limit Deterministic Automata (English)
    0 references
    0 references
    0 references
    5 August 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references