Bounded Consistency of P-Time Event Graphs
Davide Zorzenon, Jan Komenda, Jörg Raisch · 2020
The problem of checking the consistency property in a P-time event graph (P-TEG) is fundamental and has to be carried out before applying any control strategy. However, no generic algorithm that solves this problem is available yet. In this paper we propose a new, stronger, definition for consistency of P-TEGs that is both more useful and easier to check than standard consistency; bounded consistency. A PTEG is boundedly consistent if it admits a trajectory in which, for each pair of transitions, the time interval between their k-th firings is bounded for every k. We show that the problem of checking bounded consistency is equivalent to checking the existence of 1-periodic trajectories.