BRANCHING-PROCESSES OF PETRI NETS

被引：184

作者：

ENGELFRIET, J

机构：

[1] Department of Computer Science, Leiden University, Leiden, 2300 RA

来源：

ACTA INFORMATICA | 1991年 / 28卷 / 06期

关键词：

D O I：

10.1007/BF01463946

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

The notion of a branching process is introduced, as a formalization of an initial part of a run of a Petri net, including nondeterministic choices. This generalizes the notion of a process in a natural way. It is shown that the set of branching processes of a Petri net is a complete lattice, with respect to the natural notion of partial order. The largest element of this lattice is the unfolding of the Petri net.

引用

页码：575 / 591

页数：17

共 10 条

[1]

Best E., 1988, EATCS MONOGRAPHS, V13

[2] THE NON-SEQUENTIAL BEHAVIOR OF PETRI NETS [J].

GOLTZ, U ;

REISIG, W .

INFORMATION AND CONTROL, 1983, 57 (2-3) :125-147

[3]

GOLTZ U, 1988, LECT NOTES COMPUT SC, V324, P339, DOI 10.1007/BFb0017157

[4]

GOLTZ U, 1984, LNCS, V172, P196, DOI [10.1007/3-540-13345-318, DOI 10.1007/3-540-13345-318]

[5] BEHAVIORAL NOTIONS FOR ELEMENTARY NET SYSTEMS [J].

NIELSEN, M ;

ROZENBERG, G ;

THIAGARAJAN, PS .

DISTRIBUTED COMPUTING, 1990, 4 (01) :45-57

[6] PETRI NETS, EVENT STRUCTURES AND DOMAINS, .1. [J].

NIELSEN, M ;

PLOTKIN, G ;

WINSKEL, G .

THEORETICAL COMPUTER SCIENCE, 1981, 13 (01) :85-108

[7]

REISIG W, 1985, EATCS MONOGRAPHS THE, V4

[8]

VANGLABBEEK R, 1987, LECT NOTES COMPUT SC, V259, P224

[9]

WINSKEL G, 1987, LECT NOTES COMPUT SC, V255, P325

[10]

Winskel Glynn, 1980, THESIS U EDINBURGH

← 1 →