Solving μ-Calculus Parity Games by Symbolic Planning (Q3614877): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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-00431-5_2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1570795393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4817533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4418690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time model-checking algorithm for the alternation-free modal mu- calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Accelerated Algorithm for 3-Color Parity Games with an Application to Timed Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3883467 / 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: Q4501540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deterministic subexponential algorithm for solving parity games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2845509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite games played on finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Parity Games in Big Steps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast and simple nested fixpoints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the synthesis of strategies in infinite games / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Multi-Core Solver for Parity Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754084 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic Synthesis of Finite-State Controllers for Request-Response Specifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tools and Algorithms for the Construction and Analysis of Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite games on finitely coloured graphs with applications to automata on infinite trees / rank
 
Normal rank

Latest revision as of 04:25, 29 June 2024

scientific article
Language Label Description Also known as
English
Solving μ-Calculus Parity Games by Symbolic Planning
scientific article

    Statements

    Solving μ-Calculus Parity Games by Symbolic Planning (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 March 2009
    0 references
    0 references
    0 references
    0 references
    0 references