A zone-based algorithm for timed parity games

DOI10.4230/LIPICS.FSTTCS.2025.33MaRDI QIDQ7391908zbMATH OpenFDO

Authors G. Geeraerts, Frédéric Herbreteau, Jean-François Raskin, Alexis Reynouard

Publication date 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.FSTTCS.2025.33

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)

Cites work

• A theory of timed automata
• Almost ASAP semantics: from timed models to timed implementations
• Automatic Synthesis of Robust and Optimal Controllers – An Industrial Case Study
• CONCUR 2005 – Concurrency Theory
• Formal Modeling and Analysis of Timed Systems
• scientific article; zbMATH DE number 2085321 (Why is no real title available?)
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• Minimum-Time Reachability in Timed Games
• On the Value Problem in Weighted Timed Games.
• Realizability of real-time logics
• Safraless Procedures for Timed Specifications

This page was built for publication: A zone-based algorithm for timed parity games

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