The concatenable processes of a Petri net N can be characterized abstractly as the arrows of a symmetric monoidal category ~(N). However, this is only a partial axiomatization, since it is based on a concrete, ad hoe chosen, category of symmetries Sym N. In this paper we give a completely abstract
✦ LIBER ✦
An algebraic characterization of independence of Petri net processes
✍ Scribed by Józef Winkowski
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 201 KB
- Volume
- 88
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
An axiomatization of the algebra of Petr
✍
Vladimiro Sassone
📂
Article
📅
1996
🏛
Elsevier Science
🌐
English
⚖ 867 KB
An algebraic characterization of semanti
✍
Bernhard von Stengel
📂
Article
📅
1991
🏛
Elsevier Science
🌐
English
⚖ 766 KB
Algebra of regular Petri nets
✍
V. E. Kotov
📂
Article
📅
1980
🏛
Springer US
🌐
English
⚖ 897 KB
Process of petri nets extension
✍
Zhou Guofu; He Yanxiang
📂
Article
📅
2006
🏛
Wuhan University
🌐
English
⚖ 342 KB
Processes of timed Petri nets
✍
Józef Winkowski
📂
Article
📅
2000
🏛
Elsevier Science
🌐
English
⚖ 286 KB
Processes of timed Petri nets are represented by labelled partial orders with some extra features. These features re ect the execution times of processes and allow to combine processes sequentially and in parallel, which leads to some algebras. The processes can be represented either without specify
Branching processes of Petri nets
✍
Joost Engelfriet
📂
Article
📅
1991
🏛
Springer-Verlag
🌐
English
⚖ 914 KB