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

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish
Title of host publicationProceedings of the 13th IASTED International Conference on Software Engineering and Applications, SEA 2009
Pages158-165
Number of pages8
StatePublished - 1 Dec 2009
Event13th IASTED International Conference on Software 13th IASTED International Conference on Software Engineering and Applications, SEA 2009 - Cambridge, MA, United States
Duration: 2 Nov 20094 Nov 2009

Publication series

NameProceedings 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
CountryUnited States
CityCambridge, MA
Period2/11/094/11/09

Keywords

  • Incremental development
  • O-graph
  • Petri net
  • Workflow

Fingerprint Dive into the research topics of 'An efficient method of maintaining the O-graph when editing a Petri net'. Together they form a unique fingerprint.

  • Cite this

    Wang, C. H., Huang, P. S., & Wang, F-J. (2009). An efficient method of maintaining the O-graph when editing a Petri net. In Proceedings of the 13th IASTED International Conference on Software Engineering and Applications, SEA 2009 (pp. 158-165). (Proceedings of the 13th IASTED International Conference on Software Engineering and Applications, SEA 2009).