Computing Weakest Strategies for Safety Games of Imperfect Information (Q3617754): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q62047477, #quickstatements; #temporary_batch_1706974288397
ReferenceBot (talk | contribs)
Changed an Item
(5 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: BuDDy / rank
 
Normal rank
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/978-3-642-00768-2_10 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2145274913 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permissive strategies: from parity games to safety games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strategy Construction for Parity Games with Imperfect Information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient On-the-Fly Algorithms for Partially Observable Timed Games / 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: Safraless Compositional Synthesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4205072 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supervisory Control of a Class of Discrete Event Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of two-player games of incomplete information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2816007 / 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: Hybrid Systems: Computation and Control / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 04:45, 29 June 2024

scientific article
Language Label Description Also known as
English
Computing Weakest Strategies for Safety Games of Imperfect Information
scientific article

    Statements

    Identifiers