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
β¦ LIBER β¦
Branching processes of Petri nets
β Scribed by Joost Engelfriet
- Publisher
- Springer-Verlag
- Year
- 1991
- Tongue
- English
- Weight
- 914 KB
- Volume
- 28
- Category
- Article
- ISSN
- 0001-5903
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Processes of timed Petri nets
β
JΓ³zef Winkowski
π
Article
π
2000
π
Elsevier Science
π
English
β 286 KB
Petri Nets and Regular Processes
β
Petr JanΔar; Javier Esparza; Faron Moller
π
Article
π
1999
π
Elsevier Science
π
English
β 364 KB
We consider the following problems: (a) Given a labelled Petri net and a finite automaton, are they equivalent?; (b) Given a labelled Petri net, is it equivalent to some (unspecified) finite automaton? These questions are studied within the framework of trace and bisimulation equivalences, in both t
Process of petri nets extension
β
Zhou Guofu; He Yanxiang
π
Article
π
2006
π
Wuhan University
π
English
β 342 KB
Petri nets
β
Y. Narahari
π
Article
π
1999
π
Indian Academy of Sciences
π
English
β 840 KB
Petri nets in dynamic process planning
β
K. Srihari; C.R. Emerson
π
Article
π
1990
π
Elsevier Science
π
English
β 345 KB
Modelling and justifying discrete produc
β
FrantiΕ‘ek ΔapkoviΔ
π
Article
π
1993
π
Elsevier Science
π
English
β 739 KB