Comparative trace semantics of time Petri nets

被引：0
作者：
D. I. Bushin
I. B. Virbitskaite
机构：
[1] Russian Academy of Sciences,A. P. Ershov Institute of Informatics Systems, Siberian Division
[2] Novosibirsk State University,undefined
来源：
Programming and Computer Software | 2015年 / 41卷
关键词：
Reachable State; Behavioral Equivalence; Trace Equivalence; Arbitrary Event; Firing Schedule;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
In the paper, a family of trace equivalencies in the interleaving, step, partial order, and nondeterministic semantics is defined and studied in the context of time Petri nets. The equivalences studied are based both on the classical concept of transition firing sequences and on time processes, i.e., time extensions of net processes with global transition firing moments. Relationships between the equivalences are established, and a hierarchy of classes of equivalent time Petri nets is constructed.
引用
收藏
页码：131 / 139
页数：8
相关论文
共 47 条
[1]  
van Glabbeek RJ(2001)Refinement of actions and equivalence notions for concurrent systems Acta Informatica 37 229-327
[2]  
Goltz U(1992)A survey of equivalence notions for net based systems Lecture Notes Comput. Sci. 609 410-472
[3]  
Pomello L(1981)Petri nets, event structures and domains, Part I Theor. Comput. Sci. 13 85-108
[4]  
Rozenberg G(1983)The non-sequential behaviour of Petri nets Information Control 57 125-147
[5]  
Simone C(1991)Branching processes of Petri nets Acta Informatica 28 575-591
[6]  
Nielsen M(1990)Behavioural notions for elementary net systems Distributed Computing 4 45-57
[7]  
Plotkin GD(1996)An event structure semantics for general Petri nets Theor. Comput. Sci. 153 129-170
[8]  
Winskel G(2001)Contextual Petri nets, asymmetric event structures, and processes Information Computation 171 1-49
[9]  
Goltz U(2004)Domain and event structure semantics for Petri nets with read and inhibitor arcs Theor. Comput. Sci. 323 129-189
[10]  
Reisig W(2008)Complete process semantics for inhibitor nets Fundamenta Informaticae 87 331-365
12345