Domain and event structure semantics for Petri nets with read and inhibitor arcs

被引:46
作者
Baldan, P
Busi, N
Corradini, A
Pinna, GM
机构
[1] Univ Venice, Dipartimento Informat, I-30172 Venice, Italy
[2] Univ Bologna, Dipartimento Sci Informaz, Bologna, Italy
[3] Univ Pisa, Dipartimento Informat, Pisa, Italy
[4] Univ Siena, Dipartimento Sci Matemat & Informat, I-53100 Siena, Italy
关键词
Petri nets; read and inhibitor arcs; true concurrency; unfolding; categorical semantics; event structures; domains;
D O I
10.1016/j.tcs.2004.04.001
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We propose a functorial concurrent semantics for Petri nets extended with read and inhibitor arcs, that we call inhibitor nets. Along the lines of the seminal work by Winskel on safe (ordinary) nets, the truly concurrent semantics is given at a categorical level via a chain of coreflections leading from the category SW-IN of semi-weighted inhibitor nets to the category Dom of finitary prime algebraic domains (equivalent to the category PES of prime event structures). As an intermediate semantic model, we introduce inhibitor event structures, an event-based model able to faithfully capture the dependencies among events which arise in the presence of read and inhibitor arcs. Inhibitor event structures generalise several event structure models in the literature, like prime, asymmetric and bundle event structures. (C) 2004 Elsevier B.V. All rights reserved.
引用
收藏
页码:129 / 189
页数:61
相关论文
共 41 条
[1]  
AGERWALA T, 1973, COMPUTER ARCHITECTUR, V4, P81
[2]  
AGERWALA T, 1974, 32 J HOPK U
[3]  
[Anonymous], 2000, THESIS U PISA
[4]  
[Anonymous], THESIS STANFORD U
[5]   Contextual Petri nets, asymmetric event structures, and processes [J].
Baldan, P ;
Corradini, A ;
Montanari, U .
INFORMATION AND COMPUTATION, 2001, 171 (01) :1-49
[6]  
Baldan P, 2000, LNCS, V1877, P442
[7]  
BOUDOL G, LECT NOTES COMPUTER, V469, P62
[8]   Partial order and contextual net semantics for atomic and locally atomic CC programs [J].
Bueno, F ;
Hermenegildo, M ;
Montanari, U ;
Rossi, F .
SCIENCE OF COMPUTER PROGRAMMING, 1998, 30 (1-2) :51-82
[9]  
Busi N., 1999, Fundamenta Informaticae, V40, P165
[10]   On the expressiveness of Linda coordination primitives [J].
Busi, N ;
Gorrieri, R ;
Zavattaro, G .
INFORMATION AND COMPUTATION, 2000, 156 (1-2) :90-121