Reconfigurable Petri Nets with Transition Priorities and Inhibitor Arcs

被引:2
作者
Padberg, Julia [1 ]
机构
[1] Hamburg Univ Appl Sci, Hamburg, Germany
来源
GRAPH TRANSFORMATION (ICGT 2015) | 2015年 / 9151卷
关键词
Reconfigurable Petri nets; Category of partially ordered sets; Inhibitor arcs; Transition priorities; M-adhesive transformation system; GRAPH TRANSFORMATION; ADHESIVE; SYSTEMS; SEMANTICS; UNITS;
D O I
10.1007/978-3-319-21145-9_7
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
In this paper we introduce additional control structures for reconfigurable Petri nets. The main contributions are inhibitor arcs and transition priorities for reconfigurable Petri nets. The first ensure that a marking can inhibit the firing of a transition. Inhibitor arcs allow a transition to fire only if the adjacent place is empty. Transition priorities are given by an order of transitions and restrict the firing as well. A transition may fire only if it has the highest priority of all enabled transitions. Both concepts are compatible with reconfigurable Petri nets. In this paper we prove that place/transitions nets with inhibitor arcs and with transition priorities yield M-adhesive categories. Hence, we obtain the well-known results for M-adhesive categories. Moreover, we state the extension of our results to other types of Petri nets. We illustrate the new concepts within an ongoing case study concerning travel agencies. This study deals with the organisation of processes that are constantly suspended by others. The main focus of the case study is to investigate the possibilities of small and medium travel agencies to provide a continuous service for their customers while travelling.
引用
收藏
页码:104 / 120
页数:17
相关论文
共 30 条
  • [1] Graph transformation for specification and programming
    Andries, M
    Engels, G
    Habel, A
    Hoffmann, B
    Kreowski, HJ
    Kuske, S
    Plump, D
    Schürr, A
    Taentzer, A
    [J]. SCIENCE OF COMPUTER PROGRAMMING, 1999, 34 (01) : 1 - 54
  • [2] [Anonymous], 2014, GLOB TRAV EC MOR PER
  • [3] [Anonymous], EATCS MONOGRAPHS TCS
  • [4] PETRI NET SEMANTICS OF PRIORITY SYSTEMS
    BEST, E
    KOUTNY, M
    [J]. THEORETICAL COMPUTER SCIENCE, 1992, 96 (01) : 175 - 215
  • [5] High-level replacement units and their termination properties
    Bottoni, P
    Hoffmann, K
    Presicce, FP
    Taentzer, G
    [J]. JOURNAL OF VISUAL LANGUAGES AND COMPUTING, 2005, 16 (06) : 485 - 507
  • [6] Analysis issues in Petri nets with inhibitor arcs
    Busi, N
    [J]. THEORETICAL COMPUTER SCIENCE, 2002, 275 (1-2) : 127 - 177
  • [7] Codara P., 2007, THESIS U STUDI MILAN
  • [8] Ede M., 2012, ELECTR COMMUN, V54, P10
  • [9] Graph grammars and Petri net transformations
    Ehrig, H
    Padberg, J
    [J]. LECTURES ON CONCURRENCY AND PETRI NETS: ADVANCES IN PETRI NETS, 2004, 3098 : 496 - 536
  • [10] Ehrig H., 2014, MATH STRUCTURES COMP, V24, P48