1992
DOI: 10.1007/3-540-55719-9_107
|View full text |Cite
|
Sign up to set email alerts
|

A trace semantics for Petri Nets

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
13
0

Year Published

1993
1993
2004
2004

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 20 publications
(14 citation statements)
references
References 11 publications
1
13
0
Order By: Relevance
“…In particular, we shall present a category GTL of generalized trace languages which is equivalent to the category dLES of deterministic labelled event structures. We remark that a similar idea of generalizing Mazurkiewicz trace languages has been considered also in [4].…”
Section: Introductionmentioning
confidence: 91%
“…In particular, we shall present a category GTL of generalized trace languages which is equivalent to the category dLES of deterministic labelled event structures. We remark that a similar idea of generalizing Mazurkiewicz trace languages has been considered also in [4].…”
Section: Introductionmentioning
confidence: 91%
“…The proof of this is rather involved, but may be found in [61], and for more general forms of net systems in [97] and [33].…”
Section: Theorem 29 Td Nt Is the Right Adjoint Of A Coreflection Bementioning
confidence: 99%
“…A really excellent survey is given by Martí-Oliet and Meseguer in [57]. Other relevant approaches are by Mukund [66], which provides an account of net behaviours in terms of (step) transition systems, and by Hoogers et al in [42], that uses (generalised) trace theory (cf. [56,27]) to the same purpose, and in [43], where a notion of net unfolding is explained in terms of a notion of local event structure.…”
Section: Related Workmentioning
confidence: 99%