ASIA unversity:Item 310904400/4775
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 92958/108462 (86%)
造访人次 : 20403968      在线人数 : 236
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


    题名: Reduction Methods for Real-Time Systems using Delay Time Petri Nets
    作者: Jeffrey J. P. Tsai;. Juan T. Murata;Y. Zhou
    日期: 2001-03
    上传时间: 2009-12-02 09:04:09 (UTC+8)
    出版者: 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
    關聯: IEEE Transactions on Software Engineering 27(5):422-448
    显示于类别:[生物資訊與醫學工程學系 ] 期刊論文


    档案 描述 大小格式浏览次数
    310904400-4775.doc34KbMicrosoft Word255检视/开启


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回馈