JOURNAL OF COMPUTERS (JCP)
ISSN : 1796-203X
Volume : 3    Issue : 12    Date : December 2008

A Petri Net based Method for Analyzing Schedulability of Distributed Real-time Embedded Systems
Liqiong Chen, Zhiqing Shao, Guisheng Fan, and Hanhua Ma
Page(s): 35-42
Full Text:
PDF (504 KB)


Abstract
As computer systems become increasingly internetworked, a challenging problem faced by
researchers and developers of distributed real-time and embedded (DRE) systems is devising and
implementing an effective shedulability strategy that can meet real-time requirements in varying
operational conditions. In this paper, an extended Place-timed Petri nets (EPdPN) is proposed for
schedulability analysis in DRE systems. First, we can capture important features of DRE systems and
describe them by the semantic model. Second, the key component in DRE systems such as task, the
relations between task, communication between module and resource et al. can be modeled by
using EPdPN. Third, we present the concept of greatest concurrent set and convert schedulability
problem into the analysis of state graph by using proposed algorithm, which can work out the feasible
solution of scheduling in DRE systems. Finally, a specific example is given to simulate analytical
process by using EPdPN, the results show that the method can be a good solution to analyze the
schedulability of DRE systems.

Index Terms
Distributed real-time and embedded system, Petri nets, schedulability, state graph, communication