Antichains and compositional algorithms for LTL synthesis (Q453498): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Antichains / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10703-011-0115-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2108036288 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5692280 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Translating to Co-Büchi Made Tight, Unified, and Useful / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONCUR 2005 – Concurrency Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antichains: A New Algorithm for Checking Universality of Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Antichain Algorithm for LTL Realizability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compositional Algorithms for LTL Synthesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, logics, and infinite games. A guide to current research / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open Implication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compositional Control Synthesis for Partially Observable Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Safraless Compositional Synthesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Bounded Specifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Borel determinacy / 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: Verification, Model Checking, and Abstract Interpretation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4205072 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Omega-Regular Games with Imperfect Information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Synthesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754087 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Church’s Problem and a Tour through Automata Theory / rank
 
Normal rank

Latest revision as of 17:08, 5 July 2024

scientific article
Language Label Description Also known as
English
Antichains and compositional algorithms for LTL synthesis
scientific article

    Statements

    Antichains and compositional algorithms for LTL synthesis (English)
    0 references
    0 references
    0 references
    0 references
    27 September 2012
    0 references
    LTL realizability and synthesis
    0 references
    automata on infinite words
    0 references
    compositional algorithms
    0 references
    antichain algorithms
    0 references
    safety game
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references