Concurrency in Reconfigurable Place/Systems

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.