Work

Controller synthesis in timed Büchi automata: Robustness and punctual guards

Year: 2025

Type: article

Abstract: We consider the synthesis problem on timed automata with Büchi objectives, where delay choices made by a controller are subjected to small perturbations. Usually, the controller needs to avoid punctual guards, such as testing the equality of a clock to a constant. In this work, we generalize to a robustness setting that allows for punctual transitions in the automaton to be taken by controller with no perturbation. In order to characterize cycles that resist perturbations in our setting, we introduce a new structural requirement on the reachability relation along an accepting cycle of the automaton. This property is formulated on the region abstraction, and generalizes the existing characterization of winning cycles in the absence of punctual guards. We show that the problem remains within PSPACE despite the presence of punctual guards.

Source: Performance Evaluation

DOI: 10.1016/j.peva.2025.102483

Authors: Benoît Barbot, Damien Busatto-Gaston, Catalin Dima, Youssouf Oualhadj

Institutions: Université Paris-Est Créteil, Centre National de la Recherche Scientifique

Language: English

Topic: Formal Methods in Verification

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $2,540

Funder: Agence Nationale de la Recherche