Decomposition of transition systems into sets of synchronizing Free-choice Petri Nets
2022 25th Euromicro Conference on Digital System Design (DSD)(2022)
摘要
Petri nets and transition systems are two important formalisms used for modeling concurrent systems. One interesting problem in this domain is the creation of a Petri net with a reachability graph equivalent to a given transition system. This paper focuses on the creation of a set of synchronizing Free-choice Petri nets (FCPNs) from a transition system. FCPNs are more amenable for visualization and structural analysis while not being excessively simple, as in the case of state machines. The results show that with a small set of FCPNs, the complexity of the model can be reduced when compared to the synthesis of a monolithic Petri net.
更多查看译文
关键词
Transition system,Petri net,Free-choice Petri net,decomposition,theory of regions,SAT,pseudo-Boolean optimization
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要