Abstract

P/T-Systems and related languages are a good technique for modeling dis- tributed executable processes. Reconguration Rules for P/T-Systems can be used to change their structure. This is useful for modeling processes that can change during their execution. This constellation is called a Recongurable P/T- System [1]. The task of modeling such a system requires the designer to consider all possible applications of the Reconguration Rules. Depending on the size of the system to be modeled, this task can be very complex. This paper proposes a structural restriction of the P/T-System by introduc- ing Net-Patterns. The purpose of these patterns is to simplify the complicated task of rule application and enable the designer to concentrate on the modeling process.

@inproceedings{Trollmann2010,
author = {Frank Trollmann and Sahin Albayrak},
title = {Using Net Patterns to Simplify the Application of Graph Transformation Rules},
booktitle = {4th International Workshop on Petri Nets and Graph Transformation PNGT 2010 at ICGT 2010},
year = {2010},
pages = {11-13},
url = {http://tfs.cs.tu-berlin.de/pngt10/TrollmannAlbayrak.UsingNetPatterns.pdf}
}