English

A Zone-Based Algorithm for Timed Parity Games

Logic in Computer Science 2025-10-10 v1

Abstract

This paper revisits timed games by building upon the semantics introduced in "The Element of Surprise in Timed Games". We introduce some modifications to this semantics for two primary reasons: firstly, we recognize instances where the original semantics appears counterintuitive in the context of controller synthesis; secondly, we present methods to develop efficient zone-based algorithms. Our algorithm successfully addresses timed parity games, and we have implemented it using UppAal's zone library. This prototype effectively demonstrates the feasibility of a zone-based algorithm for parity objectives and a rich semantics for timed interactions between the players.

Keywords

Cite

@article{arxiv.2510.07361,
  title  = {A Zone-Based Algorithm for Timed Parity Games},
  author = {Gilles Geeraerts and Frédéric Herbreteau and Jean-François Raskin and Alexis Reynouard},
  journal= {arXiv preprint arXiv:2510.07361},
  year   = {2025}
}

Comments

16 pages, 5 figures, to be published in FSTTCS 2025

R2 v1 2026-07-01T06:24:46.867Z