Robust worst cases for parity games algorithms (Q2182730)

From MaRDI portal
Revision as of 06:11, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
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

    Identifiers

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