SEMANTICS OF INHIBITOR NETS

被引:96
作者
JANICKI, R [1 ]
KOUTNY, M [1 ]
机构
[1] UNIV NEWCASTLE, DEPT COMP SCI, NEWCASTLE UPON TYNE NE1 7RU, TYNE & WEAR, ENGLAND
关键词
D O I
10.1006/inco.1995.1153
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We discuss an abstract semantics of concurrent systems generalising causal partial orders. The new semantics employs relational structures-called stratified order structures-which comprise causal partial orders and weak causal partial orders. Stratified order structures can be represented by certain equivalence classes of step sequences-comtraces-directly generalising Mazurkiewicz traces. We use Elementary Net Systems with inhibitor arcs as a system model and show that stratified order structures can provide an abstract semantics which is consistent with their operational semantics expressed in terms of step sequences. Two different types of operational rules are considered. We also construct occurrence nets to enable the generation of stratified order structures for a given run of the net. (C) 1995 Academic Press. Inc.
引用
收藏
页码:1 / 16
页数:16
相关论文
共 33 条
[1]   THEORY OF TRACES [J].
AALBERSBERG, IJ ;
ROZENBERG, G .
THEORETICAL COMPUTER SCIENCE, 1988, 60 (01) :1-82
[2]  
AGERWALA T, 1974, 32 J HOPK U COMP SCI
[3]   SEQUENTIAL AND CONCURRENT BEHAVIOR IN PETRI NET THEORY [J].
BEST, E ;
DEVILLERS, R .
THEORETICAL COMPUTER SCIENCE, 1987, 55 (01) :87-136
[4]  
BILLINGTON J, 1989, 3RD P INT WORKSH PET, P61
[5]  
CARTIER P, 1969, LECTURE NOTES MATH, V85
[6]  
CHIOLA G, 1991, 12 INT C APPL THEOR, P182
[7]  
CHRISTIANSEN S, 1993, LECTURE NOTES COMPUT, V651, P186
[8]  
DIEKERT V, 1991, LECT NOTES COMPUT SC, V480, P105
[9]  
FRAISSE R, 1986, THEORY RELATIONS
[10]  
Gaifman H., 1987, Proceedings of the Symposium on Logic in Computer Science (Cat. No.87CH2464-6), P72