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

Jiazhong Zhou; Dimitri Lefebvre; Zhiwu Li

doi:10.1109/TAC.2021.3110010

Journal Articles IEEE Transactions on Automatic Control Year : 2022

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

(1) , (2) , (1)

1
2

Jiazhong Zhou

Function : Author

Xidian University

Dimitri Lefebvre

Function : Author
PersonId : 759481
ORCID : 0000-0001-7060-756X
IdRef : 085139432

Groupe de Recherche en Electrotechnique et Automatique du Havre

Zhiwu Li

Function : Author
PersonId : 773377
ORCID : 0000-0003-1547-5503

Xidian University

Domains

Computer Science [cs] Automatic Control Engineering

Dimitri Lefebvre : Connect in order to contact the contributor

https://hal-normandie-univ.archives-ouvertes.fr/hal-03678961

Submitted on : Wednesday, May 25, 2022-4:41:19 PM

Last modification on : Thursday, May 26, 2022-3:38:47 AM

Dates and versions

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

Identifiers

HAL Id : hal-03678961 , version 1
DOI : 10.1109/TAC.2021.3110010

Cite

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, pp.1-1. ⟨10.1109/TAC.2021.3110010⟩. ⟨hal-03678961⟩

Export

BibTeX TEI Dublin Core DC Terms EndNote Datacite

Collections

COMUE-NORMANDIE UNILEHAVRE GREAH

13 View

0 Download

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

Domains

Dates and versions

Identifiers

Cite

Export

Collections

Altmetric

Share