An efficient method of maintaining the O-graph when editing a Petri net

Ching Huey Wang, Pei Shu Huang, Feng-Jian Wang

研究成果: Conference contribution

摘要

The specifications of high-level distributed systems are usually associated with workflow systems, which can be implicitly mapped to Petri nets for analysis. An occurrence graph (O-graph) is the state diagram of a Petri net, and used to analyze the net. In this paper, we present a technique that reduces the O-graph building time by modifying the current O-graph based on previous one, instead of constructing a new one when a modification is done during workflow editing. The modifications are discussed based on two groups of edit activities in Petri nets: (1) addition of a node, arc, or token and (2) deletion of a node, arc, or token. A modification activity in workflow editing can be transformed into one or more of the above editing activities for the corresponding Petri net implicitly. Thus, an O-graph can be built efficiently in an incremental way. So is its analysis for the editing of workflow specification.

原文English
主出版物標題Proceedings of the 13th IASTED International Conference on Software Engineering and Applications, SEA 2009
頁面158-165
頁數8
出版狀態Published - 1 十二月 2009
事件13th IASTED International Conference on Software 13th IASTED International Conference on Software Engineering and Applications, SEA 2009 - Cambridge, MA, United States
持續時間: 2 十一月 20094 十一月 2009

出版系列

名字Proceedings of the 13th IASTED International Conference on Software Engineering and Applications, SEA 2009

Conference

Conference13th IASTED International Conference on Software 13th IASTED International Conference on Software Engineering and Applications, SEA 2009
國家United States
城市Cambridge, MA
期間2/11/094/11/09

指紋 深入研究「An efficient method of maintaining the O-graph when editing a Petri net」主題。共同形成了獨特的指紋。

引用此