Introducing Structural Dynamic Changes in Petri Nets: Marked-Controlled Reconfigurable Nets

  • Marisa Llorens
  • Javier Oliver
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3299)


The aim of this work is the modeling and verification of concurrent systems that are subject to dynamic changes by using extensions of Petri nets. In previous studies, we have introduced net rewriting systems and a subclass of these called reconfigurable nets. 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. A reconfigurable net is a net rewriting system where a change in configuration amounts to a modification in the flow relations of the places in the domain of the involved rule in accordance with this rule, independently of the context in which this rewriting applies. In both models, the enabling of a rule depends only on the net topology. Here we introduce marked-controlled net rewriting systems and marked-controlled reconfigurable nets where the enabling of a rule also depends on the net marking. We show an implementation of marked-controlled reconfigurable nets with Petri nets. Even though the expressiveness of both models is the same, with marked-controlled reconfigurable nets, we can easily and directly model systems that change their structure dynamically. It may be more efficient to directly implement the methods of verification of properties of Petri nets on the marked-controlled reconfigurable nets model.


State Graph Reachable State Concurrent System Graph Grammar Control Place 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Asperti, A., Busi, N.: Mobile Petri Nets. Technical report UBLCS-96-10, University of Bologna, Italy (1996)Google Scholar
  2. 2.
    Badouel, E., Darondeau, P., Tokmakoff, A.: Modelling Dynamic Agents Systems with Cooperating Automata. In: Proc. Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA 1999), USA, pp. 11–17 (1999)Google Scholar
  3. 3.
    Badouel, E., Llorens, M., Oliver, J.: Modelling Concurrent Systems: Reconfigurable Nets. In: Proc. Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA 2003), USA, vol. IV, pp. 1568–1574 (2003)Google Scholar
  4. 4.
    Baldan, P.: Modelling Concurrent Computations: From Contextual Petri Nets to Graph Grammars. PhD Thesis, University of Pisa TD-1/00 (2000)Google Scholar
  5. 5.
    Buscemi, M., Sassone, V.: High-level Petri nets as type theories in the Join calculus. In: Honsell, F., Miculan, M. (eds.) FOSSACS 2001. LNCS, vol. 2030, pp. 104–120. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  6. 6.
    Corradini, A.: Concurrent Computing: From Petri Nets to Graph Grammars. In: Invited talk at the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation. ENTCS, vol. 2, Elsevier, Amsterdam (1995), Google Scholar
  7. 7.
    Dufourd, C., Finkel, A., Schnoebelen, P.: Reset nets between decidability and undecidability. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 103–115. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  8. 8.
    Engelfriet, J., Leih, G., Rozenberg, G.: Net Based Description of Parallel Objectbased Systems, or POTs and POPs. In: de Bakker, J.W., Rozenberg, G., de Roever, W.-P. (eds.) REX 1990. LNCS, vol. 489, pp. 229–273. Springer, Heidelberg (1991)CrossRefGoogle Scholar
  9. 9.
    Fournet, C., Gonthier, G., Lévy, J., Maranget, L., Rémy, D.: A Calculus of Mobile Agents. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol. 1119, pp. 406–421. Springer, Heidelberg (1996)Google Scholar
  10. 10.
    Gradit, P., Vernadat, F., Azéma, P.: Layered Δ-Net Specification of a Workshop. In: Proc. Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA 1999), USA, vol. VI, pp. 2808–2814 (1999)Google Scholar
  11. 11.
    Llorens, M., Oliver, J.: Sistemas de Reescritura de Redes. In: XI Jornadas de Concurrencia, Benicassim, Castellón (Spain), pp. 237–250 (2003)Google Scholar
  12. 12.
    Llorens, M.: Redes Reconfigurables. Modelización y Verificación. Phd thesis, Departamento de Sistemas Informáticos y Computación, Universidad Politécnica de Valencia, Spain (2003)Google Scholar
  13. 13.
    Llorens, M., Oliver, J.: Structural and Dynamic Changes in Concurrent Systems: Reconfigurable Nets. IEEE Transactions on Computers 53(9), 1147–1158 (2004)CrossRefGoogle Scholar
  14. 14.
    Milner, R., Parrow, J., Walker, D.: A Calculus of Mobile Processes. Journal of Information and Computation 100(1), 1–77 (1992)zbMATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Murata, T.: Petri Nets: Properties, Analysis and Applications. Proc. of the IEEE 77(4), 541–580 (1989)CrossRefGoogle Scholar
  16. 16.
    Peterson, J.L.: Petri Net Theory and the Modeling of Systems. Prentice-Hall, Englewood Cliffs (1981)Google Scholar
  17. 17.
    Schneider, H.: Graph Grammars as a Tool to Define the Behavior of Processes Systems: From Petri Nets to Linda. In: Proc. 5th Int. Conf. on Graph Grammars and their Application to Computer Science, Williamsburg, USA, pp. 7–12 (1994)Google Scholar
  18. 18.
    Valk, R.: Self-modifying Nets, a Natural Extension of Petri Nets. In: Ausiello, G., Böhm, C. (eds.) ICALP 1978. LNCS, vol. 62, pp. 464–476. Springer, Heidelberg (1978)Google Scholar
  19. 19.
    Valk, R.: Generalizations of Petri Nets. In: Gruska, J., Chytil, M.P. (eds.) MFCS 1981. LNCS, vol. 118, pp. 140–155. Springer, Heidelberg (1981)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Marisa Llorens
    • 1
  • Javier Oliver
    • 1
  1. 1.Departamento de Sistemas Informáticos y ComputaciónUniversidad Politénica de ValenciaValenciaSpain

Personalised recommendations