THE SYNTHESIS PROBLEM OF PETRI NETS

Authors
Citation
J. Desel et W. Reisig, THE SYNTHESIS PROBLEM OF PETRI NETS, Acta informatica, 33(4), 1996, pp. 297-315
Citations number
8
Categorie Soggetti
Information Science & Library Science","Computer Science Information Systems
Journal title
ISSN journal
00015903
Volume
33
Issue
4
Year of publication
1996
Pages
297 - 315
Database
ISI
SICI code
0001-5903(1996)33:4<297:TSPOPN>2.0.ZU;2-V
Abstract
The synthesis problem of concurrent systems is the problem of synthesi zing a concurrent system model from sequential observations. The paper studies the synthesis problem for elementary Petri nets and transitio n systems. A characterization of the class of transition systems which correspond to elementary Petri nets is proven. It is shown how to gen erate all elementary Petri nets corresponding to a given transition sy stem. If there is any such elementary Petri net, it is proven that the re always exists a small one which has only polynomially many elements in the size of the transition system.