Modular analysis of Petri nets

被引:62
作者
Christensen, S
Petrucci, L
机构
[1] Aarhus Univ, Dept Comp Sci, DK-8000 Aarhus C, Denmark
[2] ENS Cachan, LSV, CNRS, UMR 8643, F-94235 Cachan, France
关键词
D O I
10.1093/comjnl/43.3.224
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
This paper shows how two of the most important analysis methods for Petri nets can be performed in a modular way. We illustrate our techniques by means of modular Place/Transitions nets (modular PT-nets) in which the individual modules interact via shared places and shared transitions. For place invariants we show that it is possible to construct invariants of the total modular PT-net from invariants of the individual modules. For state spaces, we show that it is possible to deride behavioural properties of the modular PT-net from state spaces of the individual modules plus a synchronization graph, without unfolding to the ordinary state space. The generalization of our techniques to high-level Petri nets is rather straightforward.
引用
收藏
页码:224 / 242
页数:19
相关论文
共 19 条
  • [11] JENSEN K, 1994, COLOURED PATRI NETS, V2
  • [12] Jensen K, 1992, Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use, V1, DOI [DOI 10.1007/978-3-662-03241-1, 10.1007/978-3-662-06289-0, DOI 10.1007/978-3-662-06289-0]
  • [13] NARAHARI Y, 1986, LECT NOTES COMPUT SC, V222, P330
  • [14] HIERARCHICAL REACHABILITY GRAPH OF BOUNDED PETRI NETS FOR CONCURRENT-SOFTWARE ANALYSIS
    NOTOMI, M
    MURATA, T
    [J]. IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1994, 20 (05) : 325 - 336
  • [15] PETRI NETS AND ALGEBRAIC SPECIFICATIONS
    REISIG, W
    [J]. THEORETICAL COMPUTER SCIENCE, 1991, 80 (01) : 1 - 34
  • [16] VALMARI A, 1991, LECT NOTES COMPUT SC, V483, P491
  • [17] VALMARI A, 1990, P 11 INT C APPL THEO, P43
  • [18] Vernadat F, 1997, LECT NOTES COMPUT SC, V1248, P253
  • [19] 1996, DESIGN CPN 3 0 META