Relevant Timed Schedules/Clock Vectors for Constructing Time Petri Net Reachability Graphs

被引：0
|
作者：
Hanifa Boucheneb
Kamel Barkaoui
机构：
[1] École Polytechnique de Montréal,Laboratoire VeriForm, Department of Computer Engineering
[2] Conservatoire National des Arts et Métiers,Laboratoire CEDRIC
来源：
Discrete Event Dynamic Systems | 2011年 / 21卷
关键词：
Time Petri nets; Reachability graph; Timed schedule based graph; Clock vector based graph;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We consider here the time Petri nets (the TPN model) and its state space abstractions. We show that only some timed schedules/clock vectors (one per enabled transition) of the clock/firing domains are relevant to construct reachability graphs for the TPN. Moreover, we prove formally that the resulting graphs are smaller than the TPN reachability graphs proposed in the literature. Furthermore, these results establish a relation between dense time and discrete time analysis of time Petri nets and allow also improving discrete time analysis by considering only some elements of the clock/firing domains.
引用
收藏
页码：171 / 204
页数：33
相关论文
共 36 条
  • [1] Relevant Timed Schedules/Clock Vectors for Constructing Time Petri Net Reachability Graphs
    Boucheneb, Hanifa
    Barkaoui, Kamel
    DISCRETE EVENT DYNAMIC SYSTEMS-THEORY AND APPLICATIONS, 2011, 21 (02): : 171 - 204
  • [2] Relevant Timed Schedules Clock Valuations for Constructing Time Petri Net Reachability Graphs
    Boucheneb, Hanifa
    Barkaoui, Kamel
    FORMAL MODELING AND ANALYSIS OF TIMED SYSTEMS, PROCEEDINGS, 2008, 5215 : 265 - +
  • [3] TIMED PETRI NET SCHEDULES
    CARLIER, J
    CHRETIENNE, P
    LECTURE NOTES IN COMPUTER SCIENCE, 1988, 340 : 62 - 84
  • [4] Composite schedules of manufacturing cells and their timed Petri net models
    Zuberek, WM
    INFORMATION INTELLIGENCE AND SYSTEMS, VOLS 1-4, 1996, : 2990 - 2995
  • [5] A timed Petri net framework to find optimal IRIS schedules
    Werner, Matthias
    CONTROL AND CYBERNETICS, 2006, 35 (03): : 703 - 719
  • [6] Petri Net Reachability Graphs: Decidability Status of FO Properties
    Darondeau, Philippe
    Demri, Stephane
    Meyer, Roland
    Morvan, Christophe
    IARCS ANNUAL CONFERENCE ON FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE (FSTTCS 2011), 2011, 13 : 140 - 151
  • [7] Diagnosabilization of Time Petri net for timed fault
    Coquand, Camille
    Pencole, Yannick
    Subias, Audine
    IFAC PAPERSONLINE, 2023, 56 (02): : 8648 - 8653
  • [8] QUALITATIVE-ANALYSIS OF PERIODIC SCHEDULES FOR DETERMINISTICALLY TIMED PETRI NET SYSTEMS
    ONAGA, K
    SILVA, M
    WATANABE, T
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1993, E76A (04) : 580 - 592
  • [9] Scheduling Timed Petri Nets with a Time-Feasible Reachability Tree
    Kim, Hyun-Jung
    Lee, Jun-Ho
    Lee, Tae-Eog
    2013 10TH IEEE INTERNATIONAL CONFERENCE ON NETWORKING, SENSING AND CONTROL (ICNSC), 2013, : 94 - 99
  • [10] Minimal time reachability problem of some subclasses of timed Petri nets
    Ohta, A
    Tsuji, K
    Hisamura, T
    2005 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS (ISCAS), VOLS 1-6, CONFERENCE PROCEEDINGS, 2005, : 760 - 763
1234