1995 IEEE International Conference on Systems, Man and Cybernetics. Intelligent Systems for the 21st Century
DOI: 10.1109/icsmc.1995.537977
|View full text |Cite
|
Sign up to set email alerts
|

Knitting technique with TP-PT generations for Petri net synthesis

Abstract: The behavior of a Petri net (PN) depends not only on the graphical structure, but also on the initial marking of the net. The knitting technique solves the structural problem. It contains some simple yet effective rules which can guide the synthesis of PN with desired properties. The previous knitting technique admits only TT generations among sequential or concurrent processes and PP generations among sequential or exclusive processes. The synthesized nets, however, are restricted because some generations are… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Publication Types

Select...
2
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 16 publications
(16 reference statements)
0
1
0
Order By: Relevance
“…Concerning refinement, synthesis, composition (node merging, fusion...) and abstraction techniques, the previous works closest to our notion introduced for PCMG ≤ are [39,40,31,28,41,42,43,44]. Numerous other studies provide algorithms for synthetizing, from a given labeled transition system, a Petri net with isomorphic reachability graph, see e.g.…”
Section: Related Workmentioning
confidence: 99%
“…Concerning refinement, synthesis, composition (node merging, fusion...) and abstraction techniques, the previous works closest to our notion introduced for PCMG ≤ are [39,40,31,28,41,42,43,44]. Numerous other studies provide algorithms for synthetizing, from a given labeled transition system, a Petri net with isomorphic reachability graph, see e.g.…”
Section: Related Workmentioning
confidence: 99%