This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Compositional Schedulability Analysis of Real-Time Systems Using Time Petri Nets
October 2002 (vol. 28 no. 10)
pp. 984-996
This paper presents an approach to the schedulability analysis of real-time systems modeled in time Petri nets by separating timing properties from other behavioral properties. The analysis of behavioral properties is conducted based on the reachability graph of the underlying Petri net, whereas timing constraints are checked in terms of absolute and relative firing domains. If a specific task execution is schedulable, we calculate the time span of the task execution, and pinpoint nonschedulable transitions to help adjust timing constraints. A technique for compositional timing analysis is also proposed to deal with complex task sequences, which not only improves efficiency but also facilitates the discussion of the reachability issue with regard to schedulability. We have identified a class of well-structured time Petri nets such that their reachability can be easily analyzed.

[1] B. Berthomieu and M. Diaz, “Modeling and Verification of Time Dependent Systems Using Time Petri Nets,” IEEE Trans. Software Eng., vol. 17, no. 3, pp. 259-273, Mar. 1991.
[2] G. Bucci and E. Vicario, “Compositional Validation of Time-Critical Systems Using Communicating Time Petri Nets,” IEEE Trans. Software Eng., vol. 21, no. 12, pp. 969-992, Dec. 1995.
[3] M. Felder, D. Mandrioli, and A. Morzenti, “Proving Properties of Real Time Systems through Logical Specifications and Petri Net Models,” IEEE Trans. Software Eng., vol. 20, no. 2, pp. 127-141, Feb. 1994.
[4] C. Ghezzi, D. Mandrioli, S. Morasca, and M. Pezze, “A Unified High-Level Petri Net Formalism for Time Critical Systems,” IEEE Trans. Software Eng., vol. 17, no. 2, pp. 160-171, Feb. 1991.
[5] D. Haban and K.G. Shin, “Application of Real-Time Monitoring to Scheduling Tasks with Random Execution Times,” IEEE Trans. Software Eng., vol. 16, no. 12, pp. 1374-1389, Dec. 1990.
[6] F. Jahanian and A.K.-L. Mok, “Safety Analysis of Timing Properties in Real-Time Systems,” IEEE Trans. Software Eng., vol. 12, pp. 890-904, 1986.
[7] E.Y.T. Juan, J.J.P. Tsai, and T. Murata, “Compositional Verification of Concurrent Systems Using Petri-Net-Based Condensation Rules,” ACM Trans. Programming Languages and Systems, vol. 21, no. 5, pp. 917-979, 1998.
[8] P.M. Merlin and D.J. Farber, “Recoverability of Communication Protocols,” IEEE Trans. Comm., vol. 24, no. 4, pp. 1036-1043, 1976.
[9] T. Murata, “Petri Nets: Properties, Analysis and Applications,” Proc. IEEE, vol. 77, no. 4, pp. 541-580, Apr. 1989.
[10] A.D. Stoyenko, C. Hamacher, and R.C. Holt, “Analyzing Hard-Real-Time Programs for Guaranteed Schedulability,” IEEE Trans. Software Eng., vol. 17, no. 8, pp. 737-750, Aug. 1991.
[11] J.J.P. Tsai, S.J. Yang, and Y.-H. Chang, “Timing Constraint Petri Nets and Their Application to Schedulability Analysis of Real-Time System Specifications,” IEEE Trans. Software Eng., vol. 21, no. 1, pp. 32-49, Jan. 1995.
[12] J. Wang and Y. Deng, “Incremental Modeling and Verification of Flexible Manufacturing Systems,” J. Intelligent Manufacturing, no. 4, 1999.
[13] J. Wang, X. He, and Y. Deng, “Software Architecture Specification and Analysis in SAM: A Case Study,” Information and Software Technology, vol. 41, no. 7, pp. 451-467, 1999.
[14] J. Wang, G. Xu, and Y. Deng, “Reachability Analysis of Real-Time Systems Using Time Petri Nets,” IEEE Trans. Systems, Man, and Cybernatics, vol. 30, no. 5, Oct. 2000.

Index Terms:
Real-time systems, time Petri nets, schedulability, reachability.
Citation:
"Compositional Schedulability Analysis of Real-Time Systems Using Time Petri Nets," IEEE Transactions on Software Engineering, vol. 28, no. 10, pp. 984-996, Oct. 2002, doi:10.1109/TSE.2002.1
Usage of this product signifies your acceptance of the Terms of Use.