Interval semantics for Petri nets with inhibitor arcs

被引:0
作者
Alqarni, Mohammad [1 ]
Janicki, Ryszard [2 ]
机构
[1] Univ Jeddah, Fac Comp & Informat Technol, Jeddah, Saudi Arabia
[2] McMaster Univ, Dept Comp & Software, Hamilton, ON L8S 4K1, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
Inhibitor Petri nets; Interval processes; Interval traces; Semantics; MODELING CONCURRENCY; READ;
D O I
10.1016/j.tcs.2018.03.003
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Interval semantics of elementary Petri nets with inhibitor arcs is discussed. First an operational semantics in terms of interval orders is provided, and next the concept of interval process is introduced, discussed, and used to describe concurrent histories of such nets. It is shown that the interval process semantics is equivalent to recently proposed interval traces semantics. It is also proven that if operational semantics is restricted to stratified orders (i.e. step sequences) the proposed model is equivalent to models based on step processes and comtraces. (C) 2018 Elsevier B.V. All rights reserved.
引用
收藏
页码:1 / 23
页数:23
相关论文
共 49 条
[21]   STRUCTURE OF CONCURRENCY [J].
JANICKI, R ;
KOUTNY, M .
THEORETICAL COMPUTER SCIENCE, 1993, 112 (01) :5-52
[22]   SEMANTICS OF INHIBITOR NETS [J].
JANICKI, R ;
KOUTNY, M .
INFORMATION AND COMPUTATION, 1995, 123 (01) :1-16
[23]  
Janicki R., 2010, SCI APPL LANGUAGE ME, P311
[24]   Relational structures model of concurrency [J].
Janicki, Ryszard .
ACTA INFORMATICA, 2008, 45 (04) :279-320
[25]   Modeling concurrency with interval traces [J].
Janicki, Ryszard ;
Yin, Xiang .
INFORMATION AND COMPUTATION, 2017, 253 :78-108
[26]  
Janicki R, 2012, LECT NOTES COMPUT SC, V7454, P425, DOI 10.1007/978-3-642-32940-1_30
[27]  
Juhás G, 2007, LECT NOTES COMPUT SC, V4546, P184
[28]   Process semantics of general inhibitor nets [J].
Kleijn, HCM ;
Koutny, M .
INFORMATION AND COMPUTATION, 2004, 190 (01) :18-69
[29]  
Kleijn J, 2008, STUD COMPUT INTELL, V113, P125
[30]   THE MUTUAL EXCLUSION PROBLEM .1. A THEORY OF INTERPROCESS COMMUNICATION [J].
LAMPORT, L .
JOURNAL OF THE ACM, 1986, 33 (02) :313-326