ANALYSIS OF TIMED PETRI NETS FOR REACHABILITY IN CONSTRUCTION APPLICATIONS

被引:2
|
作者
Nassar, Khaled [1 ]
Casavant, Albert [2 ]
机构
[1] Amer Univ Cairo, Dept Construct & Architectural Engn, Cairo 11511, Egypt
[2] Univ Maryland Eastern Shore, Dept Math & Comp Sci, Princess Anne, MD 21853 USA
关键词
Timed Petri nets; activity cycle diagrams; simulation; construction; reachability;
D O I
10.3846/1392-3730.2008.14.16
中图分类号
TU [建筑科学];
学科分类号
0813 ;
摘要
Petri nets have been used for many years to model complex processes. Examples are software design, workflow management, data analysis, concurrent programming, reliability engineering, real-time computing systems, operating systems, distributed systems. and biological processes. Timed petri nets enable the study of timed process reachability, i.e. can a certain state in the process be reached, given an initial state of TPN representing a given process. This paper shows how the reachability of TPN can be utilized to analyze several aspects of construction projects. TPN are introduced and contrasted to Activity Cycle Diagrams and are also formalized to allow for the reachability problem to be assessed. the benefits and limitations of the analysis are presented through the classic earth-moving problem.
引用
收藏
页码:189 / 198
页数:10
相关论文
共 50 条
  • [1] Forward reachability analysis of timed Petri nets
    Abdulla, PA
    Deneux, J
    Mahata, P
    Nylén, A
    FORMAL TECHNIQUES, MODELLING AND ANALYSIS OF TIMED AND FAULT-TOLERANT SYSTEMS, PROCEEDINGS, 2004, 3253 : 343 - 362
  • [2] Symbolic Reachability Analysis of Integer Timed Petri Nets
    Wan, Min
    Ciardo, Gianfranco
    SOFSEM 2009-THEORY AND PRACTICE OF COMPUTER SCIENCE, PROCEEDINGS, 2009, 5404 : 595 - 608
  • [3] Reachability analysis of (timed) Petri nets using real arithmetic
    Bérard, B
    Fribourg, L
    CONCUR'99: CONCURRENCY THEORY, 1999, 1664 : 178 - 193
  • [4] An extremum timed extended reachability graph for temporal analysis of time Petri nets
    Zhou, Jiazhong
    Lefebvre, Dimitri
    Li, Zhiwu
    DISCRETE EVENT DYNAMIC SYSTEMS-THEORY AND APPLICATIONS, 2024, 34 (03): : 403 - 427
  • [5] Minimal Cost Reachability/Coverability in Priced Timed Petri Nets
    Abdulla, Parosh Aziz
    Mayr, Richard
    FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATIONAL STRUCTURES, PROCEEDINGS, 2009, 5504 : 348 - +
  • [6] Reachability search in timed Petri nets using constraint programming
    Dress, OB
    Yim, P
    Korbaa, O
    Ghedira, K
    2004 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN & CYBERNETICS, VOLS 1-7, 2004, : 4923 - 4928
  • [7] Timed Petri nets for software applications
    Andrzejewski, G
    DESDES '1: PROCEEDINGS OF THE INTERNATIONAL WORKSHOP ON DISCRETE-EVENT SYSTEM DESIGN, 2001, : 73 - 78
  • [8] Reachability Analysis for a Class of Petri Nets
    Ru, Yu
    Hadjicostis, Christoforos N.
    PROCEEDINGS OF THE 48TH IEEE CONFERENCE ON DECISION AND CONTROL, 2009 HELD JOINTLY WITH THE 2009 28TH CHINESE CONTROL CONFERENCE (CDC/CCC 2009), 2009, : 1261 - 1266
  • [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] A Forward Reachability Algorithm for Bounded Timed-Arc Petri Nets
    David, Alexandre
    Jacobsen, Lasse
    Jacobsen, Morten
    Srba, Jiri
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2012, (102): : 125 - 140