This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Timing Constraint Petri Nets and Their Application to Schedulability Analysis of Real-Time System Specifications
January 1995 (vol. 21 no. 1)
pp. 32-49
In this paper, we present timing constraint Petri nets (or TCPN's for short) and describe how to use them to model a real-time system specification and determine whether the specification is schedulable with respect to imposed timing constraints. The strength of TCPN's over other time-related Petri nets is in the modeling and analysis of conflict structures. Schedulability analysis is conducted in three steps: specification modeling, reachability simulation, and timing analysis. First, we model a real-time system by transforming its system specification along with its imposed timing constraints into a TCPN; we call this net N_s. Then we simulate the reachability of N_s to verify whether a marking, M_n, is reachable from an initial marking, M_0. It is important to note that a reachable marking in Petri nets is not necessarily reachable in TCPN's due to the imposed timing constraints. Therefore, in the timing analysis step, a reachable marking M_n found in the reachability simulation step is analyzed to verify whether M_n is reachable with the timing constraints. M_n is said to be reachable in the TCPN's if and only if we can find at least one firing sequence \sigma so that all transitions in \sigma are strongly schedulable with respect to M_0 under the timing constraints. If such M_n can be found, then we can assert that the specification is schedulable under the imposed timing constraints, otherwise the system specification needs to be modified or the timing constraints need to be relaxed. We also present a synthesis method for determining the best approximation of the earliest fire beginning time (EFBT) and the latest fire ending time (LFET) of each strongly schedulable transition.

[1] B. Berthomieu and M. Diaz,“Modeling and verification of time dependent systems using time Petri nets,”IEEE Trans. Software Eng., vol. SE-17, pp. 259–273, Mar. 1991.
[2] J. E. Coolahan, Jr. and N. Roussopoulos,“Timing requirements for time driven systems using augmented Petri nets,”IEEE Trans. Software Eng., vol. SE-9, pp. 603–616, Sept. 1983.
[3] B. Dasarathy,“Timing constraints of real-time systems: constructs for expressing them, methods of validating them,”IEEE Trans. Software Eng., vol. SE-11, pp. 80–86, Jan. 1985.
[4] 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. SE-20, pp. 127–141, Feb. 1994.
[5] 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. SE-17, pp. 160–171, Feb. 1991.
[6] D. Haban and K. G. Shin,“Application of real-time monitoring to scheduling tasks with random execution times,”IEEE Trans. Software Eng., vol. SE-16, pp. 1374–1389, Dec. 1990.
[7] M. A. Holliday and M. K. Vernon,“A generalized timed Petri net model for performance analysis,”IEEE Trans. Software Eng., vol. SE-13, pp. 1297–1310, Dec. 1987.
[8] F. Jahanian and A. K.-L. Mok,“Safety analysis of timing properties in real-time systems,”IEEE Trans. Software Eng., vol. SE-12, pp. 890–904, Sept. 1986.
[9] ——,“A graph-theoretic approach for timing analysis and its implementation,”IEEE Trans. Comput., vol. C-36, pp. 961–975, Aug. 1987.
[10] N. Leveson, “Safety Analysis Using Petri Nets,” IEEE Trans. Software Eng., vol. 13, no. 3, Mar. 1987.
[11] J. Li, I. Suzuki and M. Yamashita,“A new structural induction theorem for rings of temporal Petri nets,”IEEE Trans. on Software Engin., vol. SE-20, no. 2, pp. 115–126, Feb. 1994.
[12] N. Lopez-Benitez,“Dependability modeling and analysis of distributed programs,”IEEE Trans. Software Eng., vol. SE-20, pp. 345–352, May 1994.
[13] P. M. Merlin and D. J. Farber,“Recoverability of communication protocols implications of a theoretical study,”IEEE Trans. Commun., vol. COM-24, pp. 1036–1043, Sept. 1976.
[14] T. Murata,“Petri nets: properties, analysis and application,”inProc. IEEE, vol. 77, 1989, pp. 541–580.
[15] M. Notomi and T. Murata,“Hierarchical reachability graph of bounded Petri nets for concurrent-software analysis,”IEEE Trans. Software Eng., vol. SE-20, pp. 325–336, May 1994.
[16] D. Peng and K. G. Shin,“Modeling of concurrent task execution in a distributed system for real-time control,”IEEE Trans. Comput., vol. C-36, pp. 500–516, Apr. 1987.
[17] C. V. Ramamoorthy and G. S. Ho,“Performance evaluation of asynchronous concurrent systems using Petri nets,”IEEE Trans. Software Eng., vol. SE-6, pp. 440–449, Sept. 1980.
[18] C. Ramchandani,“Analysis of asynchronous concurrent systems by Petri nets.”Cambridge, MA: MIT, Project MAC, TR-120, Feb. 1974.
[19] R. R. Razouk and C. V. Phelps,“Performance analysis using time Petri nets,”inProc. 4th IFIP Protocol Specification, Testing and Verification, Y. Yemini et al., Eds. Amsterdam, The Netherlands: North-Holland, 1985.
[20] J. A. Stankovic, K. Ramamritham, and S. Cheng,“Evaluation of a flexible task scheduling algorithm for distributed hard real-time systems,”IEEE Trans. Comput., vol. 34, pp. 1130–1143, Dec. 1985.
[21] A. D. Stoyenko, C. Hamacher, and R. C. Holt,“Analyzing hard-real-time programs for guaranteed schedulability,”IEEE Trans. Software Eng., vol. SE-17, pp. 737–750, Aug. 1991.
[22] I. Suzuki and H. Lu,“Temporal Petri nets and their application to modeling and analysis of a handshake daisy chain arbiter,”IEEE Trans. Comput., vol. C-38, pp. 696–704, May 1989.
[23] H. Tokuda and M. Kotera,“Scheduler 1-2-3: an interactive schedulability analyzer for real-time systems,”inProc. of IEEE 12th Int. Comput. Software and Applic. Conf., Chicago, IL, Oct. 1988, pp. 211–219.
[24] J. J. P. Tsai, K. Y. Fang, H. Y. Chen, and Y. D. Bi,“A non-interference monitoring and replay mechanism for real-time software testing and debugging,”IEEE Trans. Software Eng, vol. SE-16, pp. 897–916, Aug. 1990.
[25] J. J. P. Tsai, K. Y. Fang, and H. Y. Chen,“A non-invasive architecture to monitoring real-time distributed systems,”IEEE Comput., vol. 23, pp. 11–23, Mar. 1990.
[26] J. J. P. Tsai and T. J. Weigert,Knowledge-Based Software Development For Real-Time Distributed Systems. Singapore: World Scientific Publication, 1993.
[27] J. J. P. Tsai, T. Weigert, and H.C. Jang“A hybrid knowledge representation as a basis of requirement specification and specification analysis,”IEEE Trans. Software Eng., vol. SE-18, pp. 1076–1100, Dec. 1992.
[28] J. J. P. Tsai and S. J. H. Yang,Monitoring and Debugging of Distributed Real-Time Systems. Washington, DC: IEEE Computer Society Press, 1995.

Index Terms:
Timing constraints, Petri nets, time Petri nets, timed Petri nets, specification and verification, timing analysis, real-time systems, synthesis.
Citation:
Jeffrey J. P. Tsai, Steve Jennhwa Yang, Yao-Hsiung Chang, "Timing Constraint Petri Nets and Their Application to Schedulability Analysis of Real-Time System Specifications," IEEE Transactions on Software Engineering, vol. 21, no. 1, pp. 32-49, Jan. 1995, doi:10.1109/32.341845
Usage of this product signifies your acceptance of the Terms of Use.