Modifying Petri net models by means of crosscutting operations

Increasingly complex abstraction and composition constructs have been proposed for Petri nets, sometimes to the point that the quantity and diversity of net inscriptions seem to obscure the proclaimed advantages of Petri nets graphical representation. These constructs are oriented towards system synthesis but typically overlook the necessity of future model modifications due to unanticipated changes in requirements. These can imply modifications across several of the initially composed modules. We propose the use of two simple composition operations, net addition and net subtraction, that allow the introduction of the necessary modifications without being dependent on the net class or composition constructs in use. The operations can even be used concomitantly with the existent composition constructs. Three application examples are also presented which illustrate the use of the proposed operations in classic settings.

[1]  Wolfgang Reisig,et al.  Petri Nets: Applications and Relationships to Other Models of Concurrency , 1986, Lecture Notes in Computer Science.

[2]  Stanley M. Sutton,et al.  N degrees of separation: multi-dimensional separation of concerns , 1999, Proceedings of the 1999 International Conference on Software Engineering (IEEE Cat. No.99CB37002).

[3]  Charles Lakos,et al.  Composing Abstractions of Coloured Petri Nets , 2000, ICATPN.

[4]  Peter Huber,et al.  Hierarchies in coloured Petri nets , 1991, Applications and Theory of Petri Nets.

[5]  Rainer Fehling,et al.  A Concept of Hierarchical Petri Nets with Building Blocks , 1991, Applications and Theory of Petri Nets.

[6]  Cristina V. Lopes,et al.  Aspect-oriented programming , 1999, ECOOP Workshops.

[7]  Julia Padberg,et al.  Petri Net Based Components for Evolvable Architectures , 2002, Trans. SDPS.

[8]  Wilfried Brauer,et al.  A survey of behaviour and equivalence preserving refinements of Petri nets , 1991, Applications and Theory of Petri Nets.

[9]  Peter Buchholz,et al.  Hierarchical High Level Petri Nets for Complex System Analysis , 1994, Application and Theory of Petri Nets.

[10]  Wolfgang Reisig,et al.  Petri Nets in Software Engineering , 1986, Advances in Petri Nets.

[11]  John A. N. Lee,et al.  A methodology for constructing predicate transition net specifications , 1991, Softw. Pract. Exp..

[12]  Hartmut Ehrig,et al.  Unifying Petri Nets: Advances in Petri Nets , 2002 .

[13]  Julia Padberg,et al.  Evolutionary Development of Business Process Centered Architectures using Component Technologies , 2001, Trans. SDPS.

[14]  Jörg Desel,et al.  ''What Is a Petri Net?'' , 2001, Unifying Petri Nets.

[15]  Charles Lakos,et al.  On the Abstraction of Coloured Petri Nets , 1997, ICATPN.

[16]  Xudong He,et al.  A Formal Definition of Hierarchical Predicate Transition Nets , 1996, Application and Theory of Petri Nets.

[17]  Gul Agha,et al.  Concurrent Object-Oriented Programming and Petri Nets , 2001, Lecture Notes in Computer Science.

[18]  Cristina V. Lopes,et al.  Aspect-oriented programming , 1999, ECOOP Workshops.

[19]  Manuel Silva Suárez,et al.  On the analysis and synthesis of free choice systems , 1991, Applications and Theory of Petri Nets.

[20]  Hartmut Ehrig,et al.  Unifying Petri Nets , 2001, Lecture Notes in Computer Science.

[21]  Christos T. Karamanolis,et al.  Elements of distributed algorithms-modeling and analysis with petri nets Wolfgang Reisig [Book review] , 1999, IEE Proceedings - Software.