Reactive synthesis without regret (Q520338): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00236-016-0268-z / rank
Normal rank
 
Property / cites work
 
Property / cites work: Reasoning about online algorithms with weighted automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-cycle games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regret in Decision Making under Uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synthesizing robust systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and Approximate Determinization of Discounted-Sum Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster algorithms for mean-payoff games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Doomsday equilibria for omega-regular games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantitative languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized mean-payoff and energy games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterated regret minimization: a new solution concept / rank
 
Normal rank
Property / cites work
 
Property / cites work: Energy and Mean-Payoff Games with Imperfect Information / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of mean payoff games on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positional strategies for mean payoff games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The disjoint shortest paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterated Regret Minimization in Game Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Games Without Determinization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mean-Payoff Games with Partial-Observation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model Checking Probabilistic Timed Automata with One or Two Clocks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest paths without a map / 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: Q4205072 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00236-016-0268-Z / rank
 
Normal rank

Latest revision as of 20:15, 9 December 2024

scientific article
Language Label Description Also known as
English
Reactive synthesis without regret
scientific article

    Statements

    Reactive synthesis without regret (English)
    0 references
    0 references
    0 references
    0 references
    3 April 2017
    0 references

    Identifiers

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