A Clustering Approach to Approximate the Timed Reachability Graph for a Class of Time Petri Nets

DOI10.1109/TAC.2021.3110010OpenAlexW3198066883MaRDI QIDQ5092293

Jiazhong Zhou, Dimitri Lefebvre, Zhiwu Li

Publication date: 28 July 2022

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tac.2021.3110010

Mathematics Subject Classification ID

Systems theory; control (93-XX)

Related Items (1)

Reconfigurable timed graphs for the design of optimal scheduling in uncertain environments based on transition-timed Petri net

This page was built for publication: A Clustering Approach to Approximate the Timed Reachability Graph for a Class of Time Petri Nets