An algorithm for eliminating duplicate labels of a labelled Petri net

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Labelled Petri nets or labelled nets are commonly used for system specification where the locations of conditions are denoted as places with condition labels and the locations of events as transitions with event labels. For unique representation of conditions and events, elimination of duplicate labels is required. In this paper, an algorithm is proposed for such purpose through the fusion of common subnets. The algorithm has three distinctive features. First, the units of fusing are subnets instead of individual places and transitions. Second, the groups of common subnets identified for fusing are maximal and disjoint so that the fusion need to be done only once. Third, the fusion preserves firing sequences so that the specified system behaviours will not be altered.

Original languageEnglish
Title of host publicationProceedings - ISECS International Colloquium on Computing, Communication, Control, and Management, CCCM 2008
Pages74-78
Number of pages5
DOIs
Publication statusPublished - 2008
Externally publishedYes
EventISECS International Colloquium on Computing, Communication, Control, and Management, CCCM 2008 - Guangzhou, China
Duration: 3 Aug 20084 Aug 2008

Publication series

NameProceedings - ISECS International Colloquium on Computing, Communication, Control, and Management, CCCM 2008
Volume1

Conference

ConferenceISECS International Colloquium on Computing, Communication, Control, and Management, CCCM 2008
Country/TerritoryChina
CityGuangzhou
Period3/08/084/08/08

Fingerprint

Dive into the research topics of 'An algorithm for eliminating duplicate labels of a labelled Petri net'. Together they form a unique fingerprint.

Cite this