A Parametric Counterexample Refinement Approach for Robust Timed Specifications

TL;DR

This paper introduces a parametric refinement method for robust timed specifications, enabling the synthesis of implementations resilient to timing perturbations through iterative game-based analysis.

Contribution

It presents a novel iterative technique to evaluate and refine the maximum allowable perturbation in timed automata specifications using game strategies.

Findings

Prototype implementation demonstrates effectiveness

Refines admissible perturbation values iteratively

Enhances robustness in timed automata synthesis

Abstract

Robustness analyzes the impact of small perturbations in the semantics of a model. This allows to model hardware imprecision and therefore it has been applied to determine implementability of timed automata. In a recent paper, we extend this problem to a specification theory for real-timed systems based on timed input/output automata, that are interpreted as two-player games. We propose a construction that allows to synthesize an implementation of a specification that is robust under a given timed perturbation, and we study the impact of these perturbations when composing different specifications. To complete this work we present a technique that evaluates the greatest admissible perturbation. It consists in an iterative process that extracts a spoiling strategy when a game is lost, and through a parametric analysis refines the admissible values for the perturbation. We demonstrate this approach with a prototype implementation.