Petri nets controlled by a finite state machine (Q2740486)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Petri nets controlled by a finite state machine |
scientific article; zbMATH DE number 1646957
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Petri nets controlled by a finite state machine |
scientific article; zbMATH DE number 1646957 |
Statements
3 December 2001
0 references
Petri net
0 references
finite state machine
0 references
Turing machine
0 references
Petri nets controlled by a finite state machine (English)
0 references
It is introduced a new mathematical model of controlling discrete systems. The model is named an extended Petri net and consists of a classical Petri net controlled by a finite state machine adding and removing tokens in special places of the net. An equivalence of the extended Petri nets to Turing machines is shown. Advantages of the extended Petri nets comparatively with the classical Petri nets are discussed.
0 references
0.8640775680541992
0 references
0.8032429218292236
0 references
0.8013145923614502
0 references
