Towards Efficient Partial Order Techniques for Time Petri Nets - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2020

Towards Efficient Partial Order Techniques for Time Petri Nets

Résumé

Time Petri nets (TPN for short) are established as a powerful formalism for modeling and verifying systems with explicit soft and hard time constraints. However, their verification techniques run against the state explosion problem that is accentuated by the fact that the diamond property is difficult to meet, even for conflict-free transitions. To deal with this limitation, the partial order reduction (POR) techniques of Petri nets (PN for short) are used in combination with the partially ordered sets (POSETs). Nevertheless, POSETs introduce extra selection conditions that may offset the benefits of the POR techniques. This paper establishes a subclass of TPN for which the POR techniques of PN can be used without resorting to POSETs.
Fichier non déposé

Dates et versions

hal-03130690 , version 1 (03-02-2021)

Identifiants

Citer

Kuangze Wang, Hanifa Boucheneb, Kamel Barkaoui, Zhiwu Li. Towards Efficient Partial Order Techniques for Time Petri Nets. 14th International Conference on Verification and Evaluation of Computer and Communication Systems. VECoS 2020, Oct 2020, Xian ( virtual), France. pp.100-115, ⟨10.1007/978-3-030-65955-4_8⟩. ⟨hal-03130690⟩
76 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More