Distributed and Modular State Space Exploration for Timed Petri Nets
C. Lakos, Laure Petrucci · 2005
Abstract. This paper extends modular state space construction for con-current systems to cater for timed systems. It identifies different forms of timed state space and presents algorithms for computing them. These include uniprocessor algorithms inspired by conservative and optimistic approaches to discrete event simulation, and also a distributed algorithm. The paper includes performance results for a simple case study. 1