Bibliographie

Dynamic Transition Refinement

Michael Köhler and Heiko Rölke.
Dynamic transition refinement.
Electronic Notes in Theoretical Computer Science, 175:119-134, June 2007.  [link]

Abrégé: Refinement of Petri nets is well suited for the hierarchical design of system models. It is used to represent a model at different levels of abstraction.
Usually, refinement is a static concept. For some inherent dynamic domains as for example the modeling of web services, we need a more flexible form of refinement, e.g. to bind web services at run-time. Run-time binding allows for a flexible orchestration of services. The requirement of dynamic refinement at run-time is quite strong. Since we would like to redefine the system structure by itself, transition refinement cannot be implemented by a model transformation. Instead, an approach is needed which allows for dynamic net structures that can evolve as an effect of transitions firing.
In previous work we introduced nets-within-nets as a formalism for the dynamic refinement of tokens. Here we consider an extension of nets-within-nets that uses special net tokens describing the refinement structure of transitions. Using this formalism it is possible to update refinements, introduce alternative refinements, etc. We present some formal properties of the extended formalism and introduce an example implementation for the tool Renew.

BibTeX enregistrement

@Article{Koehler+07g,
  author = {K{\"o}hler, Michael  and R{\"o}lke, Heiko},
  title =   {Dynamic Transition Refinement},
  journal = {Electronic Notes in Theoretical Computer Science},
 volume = 175,
  pages =  {119-134},
  year =  2007,
 month = {June},
  URL =   {http://dx.doi.org/10.1016/j.entcs.2007.03.007},
 abstract = {  Refinement of Petri nets is well suited for the hierarchical design of
  system models.  It is used to represent a model at different levels of
  abstraction.
  \par
  Usually, refinement is a static concept.  For some inherent dynamic domains
  as for example the modeling of web
  services, we need a more flexible form of refinement, e.g. to
  bind web services at run-time. Run-time binding allows for a flexible
  orchestration of services.
  The requirement of dynamic refinement at run-time is quite strong. Since we
  would like to redefine the system structure by itself, transition
  refinement cannot be implemented by a model transformation.  Instead, an
  approach is needed which allows for dynamic net structures that can evolve
  as an effect of transitions firing.
    \par
  In previous work we introduced nets-within-nets as a formalism for the
  dynamic refinement of tokens.  Here we consider an extension of
  nets-within-nets that uses special net tokens describing the refinement
  structure of transitions.  Using this formalism it is possible to update
  refinements, introduce alternative refinements, etc.
  We present some formal properties of the extended formalism and introduce an
  example implementation for the tool Renew.}
}

Copyright Notice

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.