Controller Synthesis for Parametric Timed Games

2025-06-18

AI Summary

This paper addresses the computational and deployability challenges of synthesizing winning strategies for parametric timed game systems. Methodologically, it introduces a symbolic strategy synthesis algorithm that—uniquely—constructs explicit winning strategies (rather than merely deriving parameter constraints), enabling direct generation of executable controllers and automated translation into parametric timed automata for practical deployment. The technical framework integrates parametric timed automaton modeling, game-theoretic semantics, and efficient symbolic solving. Evaluated on the Production Cell benchmark, the approach successfully automates controller synthesis and formal verification. It significantly enhances strategy interpretability, executability, and practical utility. By bridging high-level strategic reasoning with low-level implementation, this work establishes a novel paradigm for controller synthesis in parametric real-time systems.

Technology Category

• Planning, Routing, and Scheduling: Optimization of Spatio-temporal Systems
• Constraint Satisfaction and Optimization: Satisfiability Modulo Theories
• Multiagent Systems: Mechanism Design

Application Category

• Semantics and Knowledge: Methods, algorithms and applications for the development of semantic models, knowledge graphs and other forms of structured data models with machine-interpretable semantics
• Systems and Infrastructure for Web, Mobile and WoT: Experiences and lessons learnt from Web-based algorithms and system deployments
• Economics, Online Markets and Human Computation: Incentives in network design for Web infrastructures and ecosystems

Abstract

We present a (semi)-algorithm to compute winning strategies for parametric timed games. Previous algorithms only synthesized constraints on the clock parameters for which the game is winning. A new definition of (winning) strategies is proposed, and ways to compute them. A transformation of these strategies to (parametric) timed automata allows for building a controller enforcing them. The feasibility of the method is demonstrated by an implementation and experiments for the Production Cell case study.

Problem

• Compute winning strategies for parametric timed games
• Synthesize constraints on clock parameters for winning
• Transform strategies to timed automata for controllers

Innovation

• Semi-algorithm for parametric timed games
• New winning strategies definition
• Transform strategies to timed automata