Synthesis of General Petri Nets

スポンサーリンク

概要

• 論文の詳細を見る

• This paper presents a novel method to derive a general Petri net from state-based representations. The method is based on the theory of general regions for Transition Systems (TS). Transition systems are state graphs with labeled arcs. General regions are multisets of states preserving entry and exit conditions to each event of a TS. We have shown that if the excitation closure condition holds for a TS, then a general PN can be derived which obey two properties: (1) each transition of the PN is uniquely labeled with an event of the TS and (2) the PN is bisimilar to the original TS. The excitation closure condition we present here generalizes our condition for safe PNs. The notion of irredundant region set is exploited, to minimize the number of places in the net without affecting its behaviour.

• 社団法人電子情報通信学会の論文
• 1996-05-23

著者

• KISHINEVSKY Michael

  The University of Aizu

関連論文

• Petrify: A Tool for Manipulating Concurrent Specifications and Synthesis of Asynchronous Controllers (Special Issue on Asynchronous Circuit and System Design)
• Synthesis of General Petri Nets

スポンサーリンク