Games for verification: Algorithmic issues

MaRDI QIDQ2763539zbMATH OpenFDO

Authors Marcin Jurdziński

Publication date 16 January 2002

zbMATH Keywords

finite labeled asynchronous transition systemshereditary history preserving bisimilaritymodal mu-calculus model checking

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 1500523
• Algorithms for Parity Games
• scientific article; zbMATH DE number 1670778
• Algorithms for solving parity games
• Solving parity games using an automata-based algorithm

Cited in

(5)

• A convex programming-based algorithm for mean payoff stochastic games with perfect information
• Approximation schemes for stochastic mean payoff games with perfect information and few random positions
• Lattice-theoretic progress measures and coalgebraic model checking
• A Note on Game Theory and Verification
• scientific article; zbMATH DE number 1500523 (Why is no real title available?)

This page was built for publication: Games for verification: Algorithmic issues

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2763539)