Robust worst cases for parity games algorithms (Q2182730)

From MaRDI portal
Revision as of 09:31, 17 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Robust worst cases for parity games algorithms
scientific article

    Statements

    title
    Robust worst cases for parity games algorithms (English)
    0 references
    author
    Massimo Benerecetti
    0 references
    Daniele Dell'Erba
    0 references
    Fabio Mogavero
    0 references
    publication date
    26 May 2020
    0 references
    zbMATH Keywords
    parity games
    0 references
    infinite-duration games on graphs
    0 references
    formal methods
    0 references
    describes a project that uses
    PGSolver
    0 references
    Oink
    0 references
    cites work
    Q3384167
    0 references
    Borel determinacy
    0 references
    Q4722064
    0 references
    Q4722045
    0 references
    Q3753490
    0 references
    Q4542592
    0 references
    Strategy logic
    0 references
    Q2908844
    0 references
    Q2980973
    0 references
    Q4501540
    0 references
    Q2754084
    0 references
    Q5015267
    0 references
    Q5144638
    0 references
    Q3083813
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q17
    0 references
    91A43
    0 references
    91A80
    0 references
    zbMATH DE Number
    7203668
    0 references
    OpenAlex ID
    W2996393320
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2182730&oldid=38928023"
    Powered by MediaWiki