A clustering approach to approximate the timed reachability graph for a class of time Petri nets - Normandie Université Accéder directement au contenu
Article Dans Une Revue IEEE Transactions on Automatic Control Année : 2022

A clustering approach to approximate the timed reachability graph for a class of time Petri nets

Jiazhong Zhou
  • Fonction : Auteur
Zhiwu Li

Résumé

Timed extended reachability graphs (TERG) of time Petri nets abstract the temporal specifications and represent the feasible trajectories under the earliest firing policy. One drawback of such graphs is the rapid increase in the number of states with respect to time specifications. For this reason, approximations of TERG that remove some states have been studied in recent works. In this article, we improve the approximation of a TERG. New objects—called vertices—are defined to manipulate the time constraints and algorithms are proposed to cluster nearby vertices. A metric based on the time constraints is defined for this purpose and a cluster TERG of reduced size is obtained.

Domaines

Automatique
Fichier non déposé

Dates et versions

hal-03678961 , version 1 (25-05-2022)

Identifiants

Citer

Jiazhong Zhou, Dimitri Lefebvre, Zhiwu Li. A clustering approach to approximate the timed reachability graph for a class of time Petri nets. IEEE Transactions on Automatic Control, 2022, 67 (7), pp.3693-3698. ⟨10.1109/TAC.2021.3110010⟩. ⟨hal-03678961⟩
23 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More