From LTL to deterministic automata. A safraless compositional approach (Q2363815): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(13 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: SPOT / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: BEEM / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: LTL2BA / 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: ltl2dstar / rank
 
Normal rank
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: Archive Formal Proofs / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Isabelle/HOL / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Isabelle/Isar / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SPIN / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2557837928 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1402.3388 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning about infinite computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4493881 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4551134 / rank
 
Normal rank
Property / cites work
 
Property / cites work: LTL to Büchi Automata Translation: Fast and More Deterministic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Manipulating LTL Formulas Using Spot 1.0 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5322945 / 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: Tighter Bounds for the Determinisation of Büchi Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rabinizer: Small Deterministic Automata for LTL(F,G) / 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 deterministic automata. A safraless compositional approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4817549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536600 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing Büchi Automata from Linear Temporal Logic Using Simulation Relations for Alternating Büchi Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4422087 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754087 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-the-Fly Stuttering in the Construction of Deterministic ω-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: On the Merits of Temporal Testers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3814796 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Safraless Procedures for Timed Specifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Safraless Compositional Synthesis / 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: Rabinizer 3: Safraless Translation of LTL to Small Deterministic Automata / 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: Experiments with deterministic \(\omega\)-automata for formulas of linear temporal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isabelle/HOL. A proof assistant for higher-order logic / rank
 
Normal rank

Latest revision as of 05:03, 14 July 2024

scientific article
Language Label Description Also known as
English
From LTL to deterministic automata. A safraless compositional approach
scientific article

    Statements

    From LTL to deterministic automata. A safraless compositional approach (English)
    0 references
    0 references
    0 references
    0 references
    26 July 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    automata theory
    0 references
    temporal logic
    0 references
    verification
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references