• Aucun résultat trouvé

Reconfigurable Petri Nets: Modeling and Analysis

N/A
N/A
Protected

Academic year: 2022

Partager "Reconfigurable Petri Nets: Modeling and Analysis"

Copied!
1
0
0

Texte intégral

(1)

Reconfigurable Petri Nets:

Modeling and Analysis

Julia Padberg

Hamburg University of Applied Sciences, Germany

Abstract

The results of the research group forMANET (funded by the German Research Council 2006-2012) on reconfigurable Petri nets are presented in this talk. We introduce a family of modeling techniques consisting of Petri nets together with a set of rules. For reconfigurable Petri nets not only the follower marking can be computed but also the structure can be changed by rule application to ob- tain a new net that is more appropriate with respect to some requirements of the environment. Moreover, these activities can be interleaved. For rule-based modification of Petri nets we use the framework of net transformations that is inspired by graph transformation systems. The basic idea behind net transfor- mation is the stepwise modification of Petri nets by given rules. The rules present a rewriting of nets where the left-hand side is replaced by the right-hand side.

Motivation for this family of formal modeling techniques is the observation that in increasingly many application areas the underlying system has to be dy- namic in a structural sense. Complex coordination and structural adaptation at run-time (e.g. mobile ad-hoc networks, communication spaces, ubiquitous com- puting) are main features that need to be modeled adequately. The distinction between the net behavior and the dynamic change of its net structure is the characteristic feature that makes reconfigurable Petri nets so suitable for sys- tems with dynamic structures.

In this talk we first motivate the use of reconfigurable Petri nets and present their basic ideas. The concepts are discussed and are then given mathematically.

We employ the notion of high-level replacement systems extensively to obtain rules and transformations of place/transition nets. These notions are then exem- plified in a case study modeling scenarios of the Living Place Hamburg. Living Place Hamburg can be considered as a system of ubiquitous computing and am- bient intelligence. Scenarios of the Living Place are modeled using reconfigurable place/transition nets providing a formal model of the internal system behavior of this system, so that this model helps us to improve our understanding of the modeled system. Subsequently we extend the theory to algebraic high-level nets, this employs again high-level replacement systems with nested application conditions as well as a individual token approach. These new concepts are illus- trated and discussed in the case studySkypeat length. The analysis ofSkypeas a concrete and typical existing Communication Platform is an example for a mod- eling methodology for Communication Platforms using an integrated modeling approach based on algebraic higher order nets.

The talk is concluded with a discussion of further results.

Références

Documents relatifs

In timed nets [65], [70], [83], firing times are associated with transitions, and transition firings are real–time events, i.e., tokens are removed from input places at the beginning

Abstract – Place and transition refinements provide a convenient method of structuring complex net models by replacing single elements (places and transitions) at a ‘higher–level’

Unit´e de recherche INRIA Rennes, Irisa, Campus universitaire de Beaulieu, 35042 RENNES Cedex Unit´e de recherche INRIA Rhˆone-Alpes, 655, avenue de l’Europe, 38330 MONTBONNOT ST

This model is based on Hierarchical Timed Stream Petri Nets (HTSPN), which has been proposed for specifying temporal and logical constraints in high level multimedia description

The proposed extensions, for Valk’s proposal, have tried to introduce reconfigurability in the structure of the object nets through two basic mechanisms: graph transformation

Moreover, one can compute the minimum and maximum elapsed time through every path of the graph which permits on- the-fly verification of timed reachability properties (e.g., is

The introduction of global constraints in the model leads us to develop several verification algorithm for the compositional phase in order to prevent the composer from

In an ongoing example reconfigurable Petri nets are used to model and to verify partial dynamic reconfiguration of field programmable gate arrays using the tool ReconNet ([5] or