Abstract
The problem of deriving concurrent operational models from sequentially observed behaviour is solved for elementary Petri nets. Labelled directed graphs are used to represent behaviour. A new characterization of graphs representing the behaviour of some elementary Petri net is given. It is shown how the set of all nets exhibiting the behaviour given by a graph can be constructed and that, if this set is not empty, it contains a net with a polynomial number of elements in the size of the graph.
Cite
CITATION STYLE
Desei, J., & Reisig, W. (1993). The synthesis problem of Petri nets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 665 LNCS, pp. 120–129). Springer Verlag. https://doi.org/10.1007/3-540-56503-5_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
