Compositional synthesis of augmented marked graphs

K. S. Cheung, K. O. Chow

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

4 Citations (Scopus)

Abstract

Augmented marked graphs possess some structural characteristics which are desirable for modelling shared-resource systems. This paper investigates the compositional synthesis of augmented marked graphs via a set of common resource places. It is shown that the synthesis preserves boundedness and conservativeness while liven ess and reversibility can be preserved under a pretty simple condition. This can be applied to component-based system design, where a system is synthesised from a set of subsystems via common resources. By modelling the subsystems as augmented marked graphs and synthesising them via the corresponding resource places, based on the property-preserving features of this compositional synthesis, the properties of the integrated system can be readily derived.

Original languageEnglish
Title of host publication2007 IEEE International Conference on Control and Automation, ICCA
Pages2810-2814
Number of pages5
DOIs
Publication statusPublished - 2007
Externally publishedYes
Event2007 IEEE International Conference on Control and Automation, ICCA - Guangzhou, China
Duration: 30 May 20071 Jun 2007

Publication series

Name2007 IEEE International Conference on Control and Automation, ICCA

Conference

Conference2007 IEEE International Conference on Control and Automation, ICCA
Country/TerritoryChina
CityGuangzhou
Period30/05/071/06/07

Keywords

  • Augmented marked graph
  • Compositional synthesis
  • Petri net
  • Shared-resource system

Fingerprint

Dive into the research topics of 'Compositional synthesis of augmented marked graphs'. Together they form a unique fingerprint.

Cite this