Please use this identifier to cite or link to this item:
http://dx.doi.org/10.14279/depositonce-10289
For citation please use:
For citation please use:
Main Title: | Concurrency in Reconfigurable Place/Systems |
Subtitle: | Independence of Net Transformations as well as Net Transformations and Token Firing |
Author(s): | Ehrig, Hartmut Ermel, Claudia Hoffmann, Kathrin Padberg, Julia Prange, Ulrike |
Type: | Research Paper |
URI: | https://depositonce.tu-berlin.de/handle/11303/11405 http://dx.doi.org/10.14279/depositonce-10289 |
License: | http://rightsstatements.org/vocab/InC/1.0/ |
Abstract: | Reconfigurable place/transition systems are Petri nets with initialmarkings and a set of rules which allow the modification of the net during runtime in order to adapt the net to new requirements. For the transformation of Petri nets, adhesive high-level replacement systems have been recently introduced as a new categorical framework in the double pushout approach. In this paper, we analyze concurrency in reconfigurable place/transition systems. We show that place/transition systems are a weak adhesive high-level replacement category, which allows us to apply the developed theory also to tranformations within reconfigurable place/transition systems. Furthermore, we analyze under which conditions net transformations and token firing can be executed in arbitrary order. As an illustrating example, reconfigurable place/transition systems are applied in a mobile network scenario. |
Subject(s): | reconfigurable place/transition systems petri nets net transformation token firing |
Issue Date: | 2007 |
Date Available: | 17-Jun-2020 |
Language Code: | en |
DDC Class: | 004 Datenverarbeitung; Informatik |
Series: | Forschungsberichte der Fakultät IV - Elektrotechnik und Informatik / Technische Universität Berlin |
Series Number: | 2007-02 |
ISSN: | 1436-9915 |
TU Affiliation(s): | Fak. 4 Elektrotechnik und Informatik |
Appears in Collections: | Technische Universität Berlin » Publications |
Files in This Item:
Items in DepositOnce are protected by copyright, with all rights reserved, unless otherwise indicated.