This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Structural and Dynamic Changes in Concurrent Systems: Reconfigurable Petri Nets
September 2004 (vol. 53 no. 9)
pp. 1147-1158
The aim of this work is the modeling and verification of concurrent systems subject to dynamic changes using extensions of Petri nets. We begin by introducing the notion of net rewriting system. In a net rewriting system, a system configuration is described as a Petri net and a change in configuration is described as a graph rewriting rule. We show that net rewriting systems are Turing powerful, that is, the basic decidable properties of Petri nets are lost and, thus, automatic verification in not possible for this class. A subclass of net rewriting systems are reconfigurable Petri nets. In a reconfigurable Petri net, a change in configuration amounts to the modification of the flow relations of the places in the domain of the involved rule according to this rule, independently of the context in which this rewriting applies. We show that reconfigurable Petri nets are formally equivalent to Petri nets. This equivalence ensures that all the fundamental properties of Petri nets are still decidable for reconfigurable Petri nets and this model is thus amenable to automatic verification tools. Therefore, the expressiveness of both models is the same, but, with reconfigurable Petri nets, we can easily and directly model systems that change their structure dynamically.

[1] A. Asperti and N. Busi, Mobile Petri Nets Technical Report UBLCS-96-10, Univ. of Bologna, Italy, 1996.
[2] E. Badouel, P. Darondeau, and A. Tokmakoff, Modelling Dynamic Agents Systems with Cooperating Automata Proc. Parallel and Distributed Processing Techniques and Applications (PDPTA '99), pp. 11-17, 1999.
[3] E. Badouel, M. Llorens, and J. Oliver, Modelling Concurrent Systems: Reconfigurable Nets Proc. Parallel and Distributed Processing Techniques and Applications (PDPTA'03), vol. IV, pp. 1568-1574, 2003.
[4] E. Badouel and J. Oliver, Reconfigurable Nets, a Class of High Level Petri Nets Supporting Dynamic Changes Technical Report, Inria Research Report PI-1163, France, 1998.
[5] E. Badouel and J. Oliver, Reconfigurable Nets, a Class of High Level Petri Nets Supporting Dynamic Changes within Workflow Systems Proc. Workflow Management: Net-Based Concepts, Models, Techniques and Tools (WFM '98), CSR 98/07, Dept. of Math. and Computing Science, Eindhoven Univ. of Tech nology, pp. 129-145, 1998.
[6] E. Badouel and J. Oliver, Dynamic Changes in Concurrent Systems: Modelling and Verification Technical Report, Inria Research Report PI-3708, France, 1999.
[7] P. Baldan, Modelling Concurrent Computations: From Contextual Petri Nets to Graph Grammars PhD Thesis, Univ. of Pisa TD-1/00, 2000.
[8] M. Buscemi and V. Sassone, High-Level Petri Nets as Type Theories in the Join Calculus Proc. Fourth Int'l Conf. Foundations of Software Science and Computation Structures (FoSSaCS '01), pp. 104-120, 2001.
[9] A. Corradini, Concurrent Computing: From Petri Nets to Graph Grammars Proc. Joint COMPUGRAPH/SEMAGRAPH Workshop Graph Rewriting and Computation, 1995. http://www.elsevier. nl/locate/entcsvolume2.html .
[10] C. Dufourd, A. Finkel, and P. Schnoebelen, Reset Nets between Decidability and Undecidability Proc. Int'l Colloquium Automata, Languages, and Programming (ICALP '98), pp. 103-115, 1998.
[11] H. Ehrig, Tutorial Introduction to the Algebraic Approach of Graph Grammmars Proc. Third Int'l Workshop Graph Grammars and Their Application to Computer Science, pp. 3-14, 1987.
[12] J. Engelfriet, G. Leih, and G. Rozenberg, Net Based Description of Parallel Object-Based Systems, or POTs and POPs Proc. Workshop Foundations of Object-Oriented Languages (FOOL '90), pp. 229-273, 1991.
[13] C. Fournet and G. Gonthier, The Reflexive Chemical Abstract Machine and the Join-Calculus Proc. 23rd ACM Symp. Principles of Programming Languages (POPL '96), pp. 372-385, 1996.
[14] C. Fournet, G. Gonthier, J. Lévy, L. Maranget, and D. Rémy, A Calculus of Mobile Agents Proc. Seventh Int'l Conf. Concurrency Theory (CONCUR '96), pp. 406-421, 1996.
[15] P. Gradit, F. Vernadat, and P. Azéma, Layered$\Delta$-Net Specification of a Workshop Proc. Int'l Conf. Parallel and Distributed Processing Techniques and Applications (PDPTA '99), vol. VI, pp. 2808-2814, 1999.
[16] J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages and Computation. Addison-Wesley, 1979.
[17] M. Llorens and J. Oliver, Modelización de Sistemas Concurrentes mediante Redes Reconfigurables IX Jornadas de Concurrencia, pp. 213-224, 2001.
[18] R. Milner, J. Parrow, and D. Walker, A Calculus of Mobile Processes J. Information and Computation, vol. 100, no. 1, pp. 1-77, 1992.
[19] T. Murata, “Petri Nets: Properties, Analysis and Application,” Proc. IEEE, vol. 77, no. 4, 1989.
[20] J.L. Peterson, Petri Net Theory and the Modeling of Systems. Englewood Cliffs, N.J.: Prentice Hall, 1981.
[21] H. Schneider, Graph Grammars as a Tool to Define the Behavior of Processes Systems: From Petri Nets to Linda Proc. Fourth Int'l Conf. Graph Grammars, 1993.
[22] T.A. Sudkamp, Languages and Machines. An Introduction to the Theory of Computer Science. Addison-Wesley, 1988.
[23] R. Valk, Self-Modifying Nets, a Natural Extension of Petri Nets Proc. Int'l Colloquium Automata, Languages, and Programming (ICALP '78), pp. 464-476, 1978.
[24] R. Valk, Generalizations of Petri Nets Proc. 10th Symp. Math. Foundations of Computer Science (MFCS '81), pp. 140-155, 1981.
[25] F. Vernadat, K. Drira, P. Azéma, An Integrated Description Technique for Distributed Cooperative Applications Proc. CESA'96 IMACS Multiconf., Symp. Discrete Events and Manufacturing Systems, pp. 608-612, 1996.

Index Terms:
Theory of computation, computation by abstract devices, models of computation, relations between models, modes of computation, parallelism and concurrency.
Citation:
Marisa Llorens, Javier Oliver, "Structural and Dynamic Changes in Concurrent Systems: Reconfigurable Petri Nets," IEEE Transactions on Computers, vol. 53, no. 9, pp. 1147-1158, Sept. 2004, doi:10.1109/TC.2004.66
Usage of this product signifies your acceptance of the Terms of Use.