Coloured Petri nets: basic concepts, analysis methods and practical use, vol. 2
Coloured Petri nets: basic concepts, analysis methods and practical use, vol. 2
A linear logic view of object petri nets
Fundamenta Informaticae - Special issue on Petri nets
Fundamenta Informaticae - Special issue on Concurrency specification and programming (CS&P)
Inheritance of workflows: an approach to tackling problems related to change
Theoretical Computer Science
Self-Modifying Nets, a Natural Extension of Petri Nets
Proceedings of the Fifth Colloquium on Automata, Languages and Programming
Proceedings of the IFIP TC6/WG6.1 Third International Conference on Formal Methods for Open Object-Based Distributed Systems (FMOODS)
Elements of General Net Theory
Proceedings of the Advanced Course on General Net Theory of Processes and Systems: Net Theory and Applications
A Concept of Hierarchical Petri Nets with Building Blocks
Papers from the 12th International Conference on Applications and Theory of Petri Nets: Advances in Petri Nets 1993
Concurrency in mobile object net systems
Fundamenta Informaticae - Concurrency specification and programming
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Modelling mobility and mobile agents using nets within nets
ICATPN'03 Proceedings of the 24th international conference on Applications and theory of Petri nets
| Hi-index | 0.00 |
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 many scenarios, however, it is desirable to have a more flexible form of refinement. For example in the context of service updates, e.g. version control in distributed systems, a mechanism for dynamic transition refinement is needed. The requirement of dynamic refinement at runtime 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 in the context of workflow modeling.