Modeling and analysis of scheduling for distributed real-time embedded systems

Authors:
Hai-Tao Zhang;Gui-Fang Wu
Affiliations:
Electronic and Information Engineering College, Henan University of Science and Technology, Luoyang, PRC 471003;Electronic and Information Engineering College, Henan University of Science and Technology, Luoyang, PRC 471003
Venue:
International Journal of Automation and Computing
Year:
2010

Citing 5
Cited 0

Verification of Schedulability of Real-Time Systems with Extended Time Petri Nets

WPDRTS '95 Proceedings of the 3rd Workshop on Parallel and Distributed Real-Time Systems
ANALYSIS OF ASYNCHRONOUS CONCURRENT SYSTEMS BY TIMED PETRI NETS

ANALYSIS OF ASYNCHRONOUS CONCURRENT SYSTEMS BY TIMED PETRI NETS
Modeling and formal verification of embedded systems based on a Petri net representation

Journal of Systems Architecture: the EUROMICRO Journal - Special issue: Synthesis and verification
A Time Petri Net Approach for Finding Pre-Runtime Schedules in Embedded Hard Real-Time Systems

ICDCSW '04 Proceedings of the 24th International Conference on Distributed Computing Systems Workshops - W7: EC (ICDCSW'04) - Volume 7
Compositional schedulability analysis of real-time systems using time Petri nets

IEEE Transactions on Software Engineering

Quantified Score

Hi-index	0.00

Visualization

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.