Faster Algorithms for Alternating Refinement Relations

DOI10.4230/LIPICS.CSL.2012.167zbMath1252.68202arXiv1201.4449OpenAlexW2242982113MaRDI QIDQ4649545

Siddhesh Chaubal, Pritish Kamath, Krishnendu Chatterjee

Publication date: 22 November 2012

Full work available at URL: https://arxiv.org/abs/1201.4449

zbMATH Keywords

alternating simulationgraph gamesfair simulation

Mathematics Subject Classification ID

Games involving graphs (91A43) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (3)

A Simpler Alternative: Minimizing Transition Systems Modulo Alternating Simulation Equivalence ⋮ Quantitative fair simulation games ⋮ CEGAR for compositional analysis of qualitative properties in Markov decision processes

This page was built for publication: Faster Algorithms for Alternating Refinement Relations