By Topic

Petri net tools for analysis and verification of task scheduling algorithm in real time distributed process control system

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Chen Qinghua ; East China Inst. of Technol., Nanjing, China ; Wu Yongsen ; Zhu Hong

This paper first show by formalism that a task scheduling algorithm can be equivalently specified by a set of rules, that is, a set of specification rules can constitute a task scheduling algorithm; and then show that these rules can be translated into a marked Petri net model involving the Petri net place,transitions and arcs that correspond to the states and state transition of the running procedure of the task scheduling algorithm so that reachability graph can be generated in terms of the model. From the reachability graph, we can see if there are livelock, deadlock and other faults of the task scheduling algorithm. In the last part, we illustrate an example to explain the detail process of rules' equivalent specification, rules' translation, and reachability graph generation in terms of a task scheduling algorithm, to analyse and verify its correctness and completeness.<>

Published in:

TENCON '93. Proceedings. Computer, Communication, Control and Power Engineering.1993 IEEE Region 10 Conference on  (Volume:4 )

Date of Conference:

19-21 Oct. 1993