The synthesis problem of Petri nets (Q1901703)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 814156
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The synthesis problem of Petri nets |
scientific article; zbMATH DE number 814156 |
Statements
The synthesis problem of Petri nets (English)
0 references
19 November 1995
0 references
The synthesis problem of concurrent systems is the problem of synthesizing a concurrent system model from sequential observations. The paper studies the synthesis problem for elementary Petri nets and transition systems. A characterization of the class of transition systems which correspond to elementary Petri nets is proven. It is shown how to generate all elementary Petri nets corresponding to a given transition system. If there is any such elementary Petri net, it is proven that there always exists a small one which has only polynomially many elements in the size of the transition system.
0 references
concurrent system
0 references
Petri nets
0 references
0.9186747
0 references
0.9185649
0 references
0.91817963
0 references
0.91788965
0 references
0.9140832
0 references
0 references
