A Congruence for Petri Nets

被引：21

作者：

Sassone, Vladimiro ^{[1
]}

Sobocinski, Pawel ^{[2
]}

机构：

[1] Univ Sussex, Brighton, E Sussex, England

[2] Univ Pisa, Pisa, Italy

来源：

ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE | 2005年 / 127卷 / 02期

关键词：

Petri Nets; contexts; congruences;

D O I：

10.1016/j.entcs.2005.02.008

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We introduce a way of viewing Petri nets as open systems. This is done by considering a bicategory of cospans over a category of p/t nets and embeddings. We derive a labelled transition system (LTS) semantics for such nets using GIPOs and characterise the resulting congruence. Technically, our results are similar to the recent work by Milner on applying the theory of bigraphs to Petri Nets. The two main differences are that we treat p/t nets instead of c/e nets and we deal directly with a category of nets instead of encoding them into bigraphs.

引用

页码：107 / 120

页数：14

共 11 条

[1]

BALDAN P, 2001, LNCS, V2154, P502

[2] THE CHEMICAL ABSTRACT MACHINE [J].

BERRY, G ;

BOUDOL, G .

THEORETICAL COMPUTER SCIENCE, 1992, 96 (01) :217-248

[3]

JENSEN O, 2003, 570 U CAMBR COMP LAB

[4]

Lack S, 2004, LECT NOTES COMPUT SC, V2987, P273

[5]

Leifer J., 2001, THESIS

[6]

LEIFER J, 2000, LNCS, V1877, P243

[7]

Milner R., 2003, SPRINGER LECT NOTES, V3098, P686, DOI DOI 10.1007/978-3-540-27755-2

[8]

Sassone V., 2003, Nordic Journal of Computing, V10, P163

[9]

SASSONE V, 2004, RS0411 BRICS U AARH

[10]

Sassone V., 2003, LECT NOTES COMPUTER, V2620

← 1 2 →