Issue No. 05 - May (2001 vol. 27)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/32.922714
<p><b>Abstract</b>—This paper presents a new net-reduction methodology to facilitate the analysis of real-time systems using Delay Time Petri Nets (DTPNs). Net reduction is one of the most important techniques for reducing the state-explosion problem of Petri nets. However, the application of net reduction to current timed-extensions of Petri nets (such as Merlin's Time PNs) is very limited due to the difficulty faced in the preservation of timing constraints. To overcome this problem, this paper introduces DTPNs which are inspired by Merlin's Time PNs, Sénac's Hierarchical Time Stream PNs, and Little's Timed PNs. We show that DTPNs are much more suitable for net reduction. Then, this paper presents a new set of DTPN reduction rules for the analysis of schedule and deadlock analysis. Our work is distinct from the others since our goal is to analyze real-time systems and the reduction methods we propose preserve both timing properties (schedule) and deadlock. To evaluate our framework, we have implemented an automated analysis tool whose main functions include net reduction and class-graph generation. The experimental results show that our net-reduction methodology leads to a significant contribution to the efficient analysis of real-time systems.</p>
Real-time systems, state explosion, Petri nets, net reduction, schedule, deadlock, reachability.
E. Y. Juan, Y. Zhou, T. Murata and J. J. Tsai, "Reduction Methods for Real-Time Systems Using Delay Time Petri Nets," in IEEE Transactions on Software Engineering, vol. 27, no. , pp. 422-448, 2001.