Behavior relativity of Petri nets

被引:10
作者
Jiang, CJ [1 ]
Wang, HQ
Liao, SL
机构
[1] Tongji Univ, Dept Comp Sci & Engn, Shanghai 200092, Peoples R China
[2] Ningbo Univ, Sch Informat Sci & Engn, Ningbo 315211, Peoples R China
[3] Univ Shandong Sci & Technol, Dept Comp Sci & Technol, Shandong 201719, Peoples R China
[4] City Univ Hong Kong, Dept Informat Syst, Kowloon, Hong Kong, Peoples R China
关键词
Petri net; firing sequence; behavior relativity; synchronous composition; system analysis;
D O I
10.1007/BF02960767
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
This paper presents a novel methodology for modelling and analyzing of behavior relations of concurrent systems. The set of all firing sequences of a Petri net is an important tool for describing the dynamic behavior of concurrent systems. In this paper, the behavior relativity of two concurrent subsystems in their synchronous composition is presented. Such behavior relativities, including Controlled Relativity, United Relativity, Interactive Relativity and Exclusive Relativity, are defined respectively. The properties of the relativities, are discussed in detail. The analysis method for these properties is based on minimum T-invariants, when two subsystems are live bounded Petri nets. A well-known example has also been analyaed using the new methodology to demonstrate the advantages of the proposed methodology.
引用
收藏
页码:770 / 780
页数:11
相关论文
共 26 条
[1]   AUTOMATED-ANALYSIS OF CONCURRENT SYSTEMS WITH THE CONSTRAINED EXPRESSION TOOLSET [J].
AVRUNIN, GS ;
BUY, UA ;
CORBETT, JC ;
DILLON, LK ;
WILEDEN, JC .
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1991, 17 (11) :1204-1222
[2]   DESCRIBING AND ANALYZING DISTRIBUTED SOFTWARE SYSTEM DESIGNS [J].
AVRUNIN, GS ;
WILEDEN, JC .
ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1985, 7 (03) :380-403
[3]   Modular algebraic nets to specify concurrent systems [J].
Battiston, E ;
DeCindio, F ;
Mauri, G .
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1996, 22 (10) :689-705
[4]   COMPOSITIONAL VALIDATION OF TIME-CRITICAL SYSTEMS USING COMMUNICATING TIME PETRI NETS [J].
BUCCI, G ;
VICARIO, E .
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1995, 21 (12) :969-992
[5]   DEPENDENCY ANALYSIS - A PETRI-NET BASED TECHNIQUE FOR SYNTHESIZING LARGE CONCURRENT SYSTEMS [J].
CHEN, YG ;
TSAI, WT ;
CHAO, D .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1993, 4 (04) :414-426
[6]   SYNTHESIS OF A CLASS OF DEADLOCK-FREE PETRI NETS [J].
DATTA, A ;
GHOSH, S .
JOURNAL OF THE ACM, 1984, 31 (03) :486-506
[7]   A compact Petri net representation and its implications for analysis [J].
Dwyer, MB ;
Clarke, LA .
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1996, 22 (11) :794-811
[8]  
Jiang Changjun, 1992, Journal of Computer Science and Technology (English Language Edition), V7, P333, DOI 10.1007/BF02943550
[9]  
Jiang Changjun, 1995, Journal of Computer Science and Technology (English Language Edition), V10, P509, DOI 10.1007/BF02943509
[10]  
JIANG CJ, IN PRESS J SOFTWARE