Abstract
Aimed at the deficiencies of resources based time Petri nets (RBTPN) in doing scheduling analysis for distributed real-time embedded systems, the assemblage condition of complex scheduling sequences is presented to easily compute scheduling length and simplify scheduling analysis. Based on this, a new hierarchical RBTPN model is proposed. The model introduces the definition of transition border set, and represents it as an abstract transition. The abstract transition possesses all resources of the set, and has the highest priority of each resource; the execution time of abstract transition is the longest time of all possible scheduling sequences. According to the characteristics and assemblage condition of RBTPN, the refinement conditions of transition border set are given, and the conditions ensure the correction of scheduling analysis. As a result, it is easy for us to understand the scheduling model and perform scheduling analysis.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S. Edwards, L. Lavagno, E. A. Lee, A. Sangiovanni-Vincentelli. Design of embedded systems: Formal models, validation, and synthesis. Proceedings of the IEEE, vol. 85, no. 3, pp. 366–390, 1997.
H. Zhang. The Research of Real-time Scheduling for Distributed Embedded Systems, Ph. D. dissertation, Institute of Automation, Chinese Academy of Sciences, PRC, 2006.
L. A. Cortés, P. Eles, Z. Peng. Modeling and formal verification of embedded systems based on a Petri net representation. Journal of Systems Architecture, vol. 49, no. 12–15, pp. 571–598, 2003.
C. Ramchandani. Analysis of Asynchronous Concurrent Systems by Timed Petri Nets, Project MAC, Technology Report No. 120, Massachusetts Institute of Technology, USA, 1974.
P. Merlin, D. J. Faber. Recoverability of communication protocols — Implications of a theoretical study. IEEE Transactions on Communications, vol. 24, no. 9, pp. 1036–1043, 1976.
D. LIME, O. H. Roux. Expressiveness and analysis of scheduling extended time Petri nets. In Proceedings of the 5th IFAC International Conference on Fieldbus Systems and Their Applications, California, USA, pp. 193–202, 2003.
R. Barreto, S. Cavalcante, P. Maciel. A time Petri net approach for finding pre-runtime schedules in embedded hard real-time systems. In Proceedings of the 24th International Conference on Distributed Computing Systems Workshops, IEEE, Washington, DC, USA pp. 846–851, 2004.
Y. Okawa, T. Yoneda. Verification of schedulability of realtime systems with extended time Petri nets. In Proceedings of the 3rd Workshop on Parallel and Distributed Real-time Systems, IEEE, Washington, DC, USA, pp. 185–192, 1995.
M. Naedele. Modeling and simulating functional and timing aspects of real-time systems by delegated execution. In Proceedings of the 7th IEEE International Conference and Workshop on the Engineering of Computer Based Systems, IEEE, Washington, DC, USA, pp. 64–72, 2000.
O. H. Roux, A. M. Déplanche. A T-time Petri net extension for real-time task scheduling modeling. European Journal of Automation, vol. 36, no. 7, pp. 973–987, 2002.
H. T. Zhang, Y. F. Ai. Scheduling modeling based on Petri nets for distributed real-time embedded systems. Computer Engineering, vol. 32, no. 18, pp. 6–8, 2006. (in Chinese)
H. T. Zhang, Y. F. Ai. Research of scheduling analysis based on Petri nets for distributed real-time embedded systems. Journal of Jilin University of China (Engineering and Technology Edition), vol. 37, no. 3, pp. 616–620, 2007. (in Chinese)
H. T. Zhang, Y. F. Ai. An algorithm of scheduling analysis for distributed real-time embedded systems. Journal of University of Electronic Science and Technology of China, vol. 36, no. 3, pp. 489–492, 2007. (in Chinese)
H. T. Zhang, Y. F. Ai. Time analysis of scheduling sequences based on Petri nets for distributed real-time embedded systems. In Proceedings of the 2nd IEEE/ASME International Conference on Mechatronic and Embedded Systems and Applications, IEEE, Piscataway, USA, pp. 1–5, 2005.
D. X. Xu, X. He, Y. Deng. Compositional schedulability analysis of real-time systems using time Petri nets. IEEE Transactions on Software Engineering, vol. 28, no. 10, pp. 984–996, 2002.
Author information
Authors and Affiliations
Corresponding author
Additional information
Hai-Tao Zhang received the B. Sc. and M. Sc. degrees in mechanical engineering from Henan University of Science and Technology, PRC in 1994 and 1997, respectively, and the Ph.D. degree in control theory and control engineering from the Institute of Automation, Chinese Academy of Sciences, PRC in 2006. He is currently an associate professor in the Electronic & Information Engineering College at Henan University of Science and Technology.
His research interests include intelligent control and computer application technology.
Gui-Fang Wu received the B. Sc. and M. Sc. degrees in mechanical engineering from Beijing University of Science and Technology, PRC in 2000 and 2002, respectively, and the Ph. D. degree in mechatronics from Beijing University of Science and Technology in 2006. He is currently an associate professor in the Electronic & Information Engineering College at Henan University of Science and Technology, PRC.
His research interests include intelligent control and computer application technology.
Rights and permissions
About this article
Cite this article
Zhang, HT., Wu, GF. Modeling and analysis of scheduling for distributed real-time embedded systems. Int. J. Autom. Comput. 7, 525–530 (2010). https://doi.org/10.1007/s11633-010-0536-2
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11633-010-0536-2