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
β¦ LIBER β¦
Algebra of regular Petri nets
β Scribed by V. E. Kotov
- Publisher
- Springer US
- Year
- 1980
- Tongue
- English
- Weight
- 897 KB
- Volume
- 16
- Category
- Article
- ISSN
- 1573-8337
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Petri Nets and Regular Processes
β
Petr JanΔar; Javier Esparza; Faron Moller
π
Article
π
1999
π
Elsevier Science
π
English
β 364 KB
Petri nets with generalized algebra: a c
β
Gabriel JuhΓ‘s
π
Article
π
1999
π
Elsevier Science
π
English
β 897 KB
High-level algebraic Petri nets
β
Chieh-Ying Kan; Xudong He
π
Article
π
1995
π
Elsevier Science
π
English
β 914 KB
Petri nets
β
Y. Narahari
π
Article
π
1999
π
Indian Academy of Sciences
π
English
β 840 KB
Unifying Petri Nets with Restricted Occu
β
JΓΆrg Desel; Gabriel JuhΓ‘s; Robert Lorenz
π
Article
π
2001
π
Elsevier Science
π
English
β 292 KB
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 restri
An algebraic characterization of indepen
β
JΓ³zef Winkowski
π
Article
π
2003
π
Elsevier Science
π
English
β 201 KB