• 沒有找到結果。

Reduction Methods for Real-Time Systems using Delay Time Petri Nets

N/A
N/A
Protected

Academic year: 2022

Share "Reduction Methods for Real-Time Systems using Delay Time Petri Nets"

Copied!
1
0
0

加載中.... (立即查看全文)

全文

(1)

題名: Reduction Methods for Real-Time Systems using Delay Time Petri Nets 作者: Jeffrey J. P. Tsai;. Juan T. Murata;Y. Zhou

日期: 2001-03

上傳時間: 2009-12-02T01:04:09Z 出版者: Asia University

摘要: We present a new net-reduction methodology to facilitate the analysis of real-time systems using Delay Time Petri Nets (DTPNs). Net reduction is one of the most important techniques for reducing the state-explosion problem of Petri nets. However, the application of net reduction to current timed-extensions of Petri nets (such as Merlin's Time PNs) is very limited due to the difficulty faced in the preservation of timing

constraints. To overcome this problem, we introduce DTPNs which are inspired by Merlin's (1976) Time PNs, Senac's (1994) Hierarchical Time Stream PNs, and Little's (1991) Timed PNs. We show that DTPNs are much more suitable for net reduction. Then, we present a new set of DTPN reduction rules for the analysis of schedule and deadlock analysis.

Our work is distinct from the others since our goal is to analyze real-time systems and the reduction methods we propose preserve both timing properties (schedule) and deadlock. To evaluate our framework, we have implemented an automated analysis tool whose main functions include net reduction and class-graph generation. The experimental results show that our net-reduction methodology leads to a significant contribution to the efficient analysis of real-time systems

參考文獻

相關文件

The focus of this paper is to propose the use of task structures for modeling knowledge-based systems at the requirements specification level, and the use of high-level Petri nets

z MGCP (Media Gateway Control Protocol)/MEGACO (Media Gateway Control Protocol).. z SIGTRAN

The performance guarantees of real-time garbage collectors and the free-page replenishment mechanism are based on a constant α, i.e., a lower-bound on the number of free pages that

* All rights reserved, Tei-Wei Kuo, National Taiwan University,

Reading: Stankovic, et al., “Implications of Classical Scheduling Results for Real-Time Systems,” IEEE Computer, June 1995, pp.. Copyright: All rights reserved, Prof. Stankovic,

ArchIS’ architecture uses (a) XML to support temporally grouped (virtual) representations of the database history, (b) XQuery to express powerful temporal queries on such views,

Our model system is written in quasi-conservative form with spatially varying fluxes in generalized coordinates Our grid system is a time-varying grid. Extension of the model to

Other advantages of our ProjPSO algorithm over current methods are (1) our experience is that the time required to generate the optimal design is gen- erally a lot faster than many