Skip to main content
SpringerLink
Log in

Canonization of Reconfigurable PT Nets in Maude

  • Conference paper
  • First Online:
Reachability Problems (RP 2022)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13608))

Included in the following conference series:

Abstract

Petri Nets are a central model for concurrent or distributed systems but are not expressive enough to specify a system’s dynamic reconfiguration. Rewriting Logic, in turn, has proved to be a suitable framework for several formal models of distributed systems. We have recently proposed an efficient Maude formalization of dynamically reconfigurable PT nets. In this paper, we address the scalability of this model using a canonization technique for PT systems integrated into Maude.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 44.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    A kind is an equivalence class grouping sorts directly or indirectly related by subsort order; terms in a kind without a specific sort are undefined or error terms.

  2. 2.

    They represent the input, output, inhibitor connections, respectively.

  3. 3.

    \(\sigma \) is null is u is a ground term; if r is a conditional rule \(\sigma \) may involve free variables introduced by matching equations used in the rule’s condition.

  4. 4.

    swap is overloaded, e.g., by op swap : Imatrix Place Place -> Imatrix.

References

  1. Barbosa, P., et al.: SysVeritas: a framework for verifying IOPT nets and execution semantics within embedded systems design. In: Camarinha-Matos, L.M. (ed.) DoCEIS 2011. IAICT, vol. 349, pp. 256–265. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-19170-1_28

    Chapter  Google Scholar 

  2. Bouhoula, A., Jouannaud, J.P., Meseguer, J.: Specification and proof in membership equational logic. Theor. Comput. Sci. 236(1), 35–132 (2000). https://doi.org/10.1016/S0304-3975(99)00206-6

    Article  MathSciNet  MATH  Google Scholar 

  3. Bruni, R., Meseguer, J.: Generalized rewrite theories. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 252–266. Springer, Heidelberg (2003). https://doi.org/10.1007/3-540-45061-0_22

    Chapter  Google Scholar 

  4. Cabac, L., Duvigneau, M., Moldt, D., Rölke, H.: Modeling dynamic architectures using nets-within-nets. In: Ciardo, G., Darondeau, P. (eds.) ICATPN 2005. LNCS, vol. 3536, pp. 148–167. Springer, Heidelberg (2005). https://doi.org/10.1007/11494744_10

    Chapter  MATH  Google Scholar 

  5. Camilli, M., Capra, L.: Formal specification and verification of decentralized self-adaptive systems using symmetric nets. Discrete Event Dyn. Syst. 31(4), 609–657 (2021). https://doi.org/10.1007/s10626-021-00343-3

    Article  MathSciNet  MATH  Google Scholar 

  6. Capra, L.: A Maude implementation of rewritable Petri Nets: a feasible model for dynamically reconfigurable systems. In: Gleirscher, M., van de Pol, J., Woodcock, J. (eds.) Proceedings First Workshop on Applicable Formal Methods, Virtual, 23rd November 2021, Electronic Proceedings in Theoretical Computer Science, vol. 349, pp. 31–49. Open Publishing Association (2021). https://doi.org/10.4204/EPTCS.349.3

  7. Capra, L.: Rewriting logic and Petri nets: a natural model for reconfigurable distributed systems. In: Bapi, R., Kulkarni, S., Mohalik, S., Peri, S. (eds.) ICDCIT 2022. LNCS, vol. 13145, pp. 140–156. Springer, Cham (2022). https://doi.org/10.1007/978-3-030-94876-4_9

    Chapter  Google Scholar 

  8. Clavel, M., et al.: All About Maude - A High-Performance Logical Framework: How to Specify, Program, and Verify Systems in Rewriting Logic. Lecture Notes in Computer Science, Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-71999-1

    Book  MATH  Google Scholar 

  9. Ehrig, H., Hoffmann, K., Padberg, J., Prange, U., Ermel, C.: Independence of net transformations and token firing in reconfigurable place/transition systems. In: Kleijn, J., Yakovlev, A. (eds.) ICATPN 2007. LNCS, vol. 4546, pp. 104–123. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-73094-1_9

    Chapter  MATH  Google Scholar 

  10. Hoffmann, K., Ehrig, H., Mossakowski, T.: High-level nets with nets and rules as tokens. In: Ciardo, G., Darondeau, P. (eds.) ICATPN 2005. LNCS, vol. 3536, pp. 268–288. Springer, Heidelberg (2005). https://doi.org/10.1007/11494744_16

    Chapter  MATH  Google Scholar 

  11. Kahloul, L., Chaoui, A., Djouani, K.: Modeling and analysis of reconfigurable systems using flexible nets. In: Zavoral, F., Yaghob, J., Pichappan, P., El-Qawasmeh, E. (eds.) NDT 2010. CCIS, vol. 87, pp. 343–357. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-14292-5_36. https://doi.org/10.1109/TASE.2010.28

  12. Köhler-Bußmeier, M.: Hornets: nets within nets combined with net algebra. In: Franceschinis, G., Wolf, K. (eds.) PETRI NETS 2009. LNCS, vol. 5606, pp. 243–262. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-02424-5_15

    Chapter  MATH  Google Scholar 

  13. Llorens, M., Oliver, J.: Structural and dynamic changes in concurrent systems: reconfigurable Petri nets. IEEE Trans. Comput. 53(9), 1147–1158 (2004). https://doi.org/10.1109/TC.2004.66

    Article  Google Scholar 

  14. Meseguer, J.: Conditional rewriting logic as a unified model of concurrency. Theor. Comput. Sci. 96(1), 73–155 (1992). https://doi.org/10.1016/0304-3975(92)90182-F

    Article  MathSciNet  MATH  Google Scholar 

  15. Padberg, J., Kahloul, L.: Overview of reconfigurable Petri nets. In: Heckel, R., Taentzer, G. (eds.) Graph Transformation, Specifications, and Nets. LNCS, vol. 10800, pp. 201–222. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-75396-6_11

    Chapter  MATH  Google Scholar 

  16. Padberg, J., Schulz, A.: Model checking reconfigurable Petri nets with Maude. In: Echahed, R., Minas, M. (eds.) ICGT 2016. LNCS, vol. 9761, pp. 54–70. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-40530-8_4

    Chapter  Google Scholar 

  17. Prange, U., Ehrig, H., Hoffmann, K., Padberg, J.: Transformations in reconfigurable place/transition systems. In: Degano, P., De Nicola, R., Meseguer, J. (eds.) Concurrency, Graphs and Models. LNCS, vol. 5065, pp. 96–113. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-68679-8_7

    Chapter  Google Scholar 

  18. Reisig, W.: Petri Nets: An Introduction. Springer, New York (1985). https://doi.org/10.1007/978-3-642-69968-9

    Book  MATH  Google Scholar 

  19. Stehr, M.-O., Meseguer, J., Ölveczky, P.C.: Rewriting logic as a unifying framework for Petri nets. In: Ehrig, H., Padberg, J., Juhás, G., Rozenberg, G. (eds.) Unifying Petri Nets. LNCS, vol. 2128, pp. 250–303. Springer, Heidelberg (2001). https://doi.org/10.1007/3-540-45541-8_9

    Chapter  MATH  Google Scholar 

  20. Valk, R.: Object Petri nets. In: Desel, J., Reisig, W., Rozenberg, G. (eds.) ACPN 2003. LNCS, vol. 3098, pp. 819–848. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-27755-2_23

    Chapter  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Università degli Studi di Milano, Milan, Italy

    Lorenzo Capra

Authors
  1. Lorenzo Capra
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Lorenzo Capra .

Editor information

Editors and Affiliations

  1. Department of Computer Science, TU Kaiserslautern, Kaiserslautern, Germany

    Anthony W. Lin

  2. Max Planck Institute for Software Systems, Kaiserslautern, Germany

    Georg Zetzsche

  3. University of Liverpool, Liverpool, UK

    Igor Potapov

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Capra, L. (2022). Canonization of Reconfigurable PT Nets in Maude. In: Lin, A.W., Zetzsche, G., Potapov, I. (eds) Reachability Problems. RP 2022. Lecture Notes in Computer Science, vol 13608. Springer, Cham. https://doi.org/10.1007/978-3-031-19135-0_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-19135-0_11

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-19134-3

  • Online ISBN: 978-3-031-19135-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation