Unifying Petri Nets with Restricted Occurrence Rule Using Partial Algebra
✍ Scribed by Jörg Desel; Gabriel Juhás; Robert Lorenz
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 292 KB
- Volume
- 44
- Category
- Article
- ISSN
- 1571-0661
No coin nor oath required. For personal study only.
✦ Synopsis
The aim of this paper is to present a unifying concept for Petri nets with restricted occurrence rule, to obtain non-sequential semantics in a systematic way. It is shown that partial algebra is a suitable basis for process construction. Restrictions of the occurrence rule are translated into restrictions of concurrent composition of processes. We illustrate this claim on several well-known examples, including context and capacity restrictions. For elementary nets with context we show the one-toone correspondence between processes constructed using partial algebra and partial order based processes.