| |  Verfügbarkeit |
| Autoren | Köhler, Michael; Rölke, Heiko |
|---|
| Institution | ICATPN International Conference on Applications and Theory of Petri Nets |
|---|
| Titel | Web service orchestration with super-dual object nets. |
|---|
| URL | https://doi.org/10.1007/978-3-540-73094-1_17 |
|---|
| URN, persistent | 10.1007/978-3-540-73094-1_17 |
|---|
| Erscheinungsjahr | 2007 |
|---|
| Sammelwerk | Kleijn, Jetty (Hrsg.); Yakovlev, Alex (Hrsg.): Petri nets and other models of concurrency. Proceedings of the 28th international conference on Applications and theory of Petri Nets and other models of concurrency. ICATPN 2007. June 25-29, Siedlce, Poland. |
|---|
| Seitenzahl | S. 263-280 |
|---|
| Verlag | Berlin; Heidelberg; New York: Springer |
|---|
| Reihe | Lecture notes in computer science |
|---|
| ISBN | 978-3-540-73093-4; 978-3-540-73094-1 |
|---|
| ISSN | 0302-9743; 1611-3349 |
|---|
| Dokumenttyp | Sammelwerksbeitrag; gedruckt; online |
|---|
| Beigaben | Literaturangaben, Abbildungen |
|---|
| Sprache | englisch |
|---|
| Schlagwörter | Informatik; Mathematik; Computertechnologie; Abstraktion; Verbesserung; Veredelung; Website; Systematik; |
|---|
| 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. Usually, refinement is a static concept. For some inherent dynamic domains as for example the modelling 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 (Orig.). |
|---|
| Förderkennzeichen | PLI3047 |
|---|
