1. Elvio Gilberto Amparore, Gianfranco Balbo, Marco Beccuti, Susanna Donatelli & Giuliana Franceschinis (2016): 30 years of GreatSPN. In: Principles of Performance and Reliability Modeling and Evaluation. Springer, pp. 227–254, doi:10.1007/978-3-319-30599-8_9.
  2. Paulo E. S. Barbosa, João Paulo Barros, Franklin Ramalho, Luís Gomes, Jorge Figueiredo, Filipe Moutinho, Anikó Costa & André Aranha (2011): SysVeritas: A Framework for Verifying IOPT Nets and Execution Semantics within Embedded Systems Design. In: Luis M. Camarinha-Matos: Technological Innovation for Sustainability - Second IFIP WG 5.5/SOCOLNET Doctoral Conference on Computing, Electrical and Industrial Systems, DoCEIS 2011, Costa de Caparica, Portugal, February 21-23, 2011. Proceedings, IFIP Advances in Information and Communication Technology 349. Springer, pp. 256–265, doi:10.1007/978-3-642-19170-1_28.
  3. Adel Bouhoula, Jean-Pierre Jouannaud & José Meseguer (2000): Specification and proof in membership equational logic. Theoretical Computer Science 236(1), pp. 35–132, doi:10.1016/S0304-3975(99)00206-6.
  4. Roberto Bruni & José Meseguer (2003): Generalized Rewrite Theories. In: Jos C. M. Baeten, Jan Karel Lenstra, Joachim Parrow & Gerhard J. Woeginger: Automata, Languages and Programming. Springer Berlin Heidelberg, Berlin, Heidelberg, pp. 252–266, doi:10.1007/3-540-45061-0_22.
  5. R. M. Burstall & J. A. Goguen (1982): Algebras, Theories and Freeness: An Introduction for Computer Scientists. In: Manfred Broy & Gunther Schmidt: Theoretical Foundations of Programming Methodology: Lecture Notes of an International Summer School, directed by F. L. Bauer, E. W. Dijkstra and C. A. R. Hoare. Springer Netherlands, Dordrecht, pp. 329–349, doi:10.1007/978-94-009-7893-5_11.
  6. Matteo Camilli, Carlo Bellettini & Lorenzo Capra (2018): A High-Level Petri Net-Based Formal Model of Distributed Self-Adaptive Systems. In: Proceedings of the 12th European Conference on Software Architecture: Companion Proceedings, ECSA'18. Association for Computing Machinery, New York, NY, USA, pp. 1–7, doi:10.1145/3241403.3241445.
  7. Manuel Clavel, Francisco Dur'an, Steven Eker, Patrick Lincoln, Narciso M. Oliet, Jos'e Meseguer & Carolyn Talcott (2007): All About Maude - A High-Performance Logical Framework: How to Specify, Program, and Verify Systems in Rewriting Logic. Lecture Notes in Computer Science. Springer, doi:10.1007/978-3-540-71999-1.
  8. Hartmut Ehrig, Kathrin Hoffmann, Julia Padberg, Ulrike Prange & Claudia Ermel (2007): Independence of Net Transformations and Token Firing in Reconfigurable Place/Transition Systems. In: Jetty Kleijn & Alex Yakovlev: Petri Nets and Other Models of Concurrency – ICATPN 2007. Springer Berlin Heidelberg, Berlin, Heidelberg, pp. 104–123, doi:10.1007/978-3-540-73094-1_9.
  9. Hartmut Ehrig & Julia Padberg (2004): Graph Grammars and Petri Net Transformations. In: Jörg Desel, Wolfgang Reisig & Grzegorz Rozenberg: Lectures on Concurrency and Petri Nets: Advances in Petri Nets. Springer, Berlin, Heidelberg, pp. 496–536, doi:10.1007/978-3-540-27755-2_14.
  10. Laid Kahloul, Allaoua Chaoui & Karim Djouani (2010): Modeling and Analysis of Reconfigurable Systems Using Flexible Petri Nets. In: Filip Zavoral, Jakub Yaghob, Pit Pichappan & Eyas El-Qawasmeh: Networked Digital Technologies. Springer Berlin Heidelberg, Berlin, Heidelberg, pp. 343–357, doi:10.1109/TASE.2010.28.
  11. Michael Köhler-Bußmeier (2009): Hornets: Nets within Nets Combined with Net Algebra. In: Giuliana Franceschinis & Karsten Wolf: Applications and Theory of Petri Nets. Springer Berlin Heidelberg, Berlin, Heidelberg, pp. 243–262, doi:10.1007/978-3-642-02424-5_15.
  12. M. Llorens & J. Oliver (2004): Structural and dynamic changes in concurrent systems: reconfigurable Petri nets. IEEE Transactions on Computers 53(9), pp. 1147–1158, doi:10.1109/TC.2004.66.
  13. Narciso Martí-Oliet, José Meseguer & Alberto Verdejo (2009): A Rewriting Semantics for Maude Strategies. Electronic Notes in Theoretical Computer Science 238(3), pp. 227–247, doi:10.1016/j.entcs.2009.05.022. Proceedings of the Seventh International Workshop on Rewriting Logic and its Applications (WRLA 2008).
  14. José Meseguer (1998): Membership algebra as a logical framework for equational specification. In: Francesco Parisi Presicce: Recent Trends in Algebraic Development Techniques. Springer Berlin Heidelberg, Berlin, Heidelberg, pp. 18–61, doi:10.1007/3-540-64299-4_26.
  15. José Meseguer (1992): Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science 96(1), pp. 73–155, doi:10.1016/0304-3975(92)90182-F.
  16. Julia Padberg & Laid Kahloul (2018): Overview of Reconfigurable Petri Nets. In: Reiko Heckel & Gabriele Taentzer: Graph Transformation, Specifications, and Nets: In Memory of Hartmut Ehrig. Springer International Publishing, Cham, pp. 201–222, doi:10.1007/978-3-319-75396-6_11.
  17. Julia Padberg & Alexander Schulz (2016): Model Checking Reconfigurable Petri Nets with Maude. In: Rachid Echahed & Mark Minas: Graph Transformation. Springer International Publishing, Cham, pp. 54–70, doi:10.1007/978-3-319-40530-8_4.
  18. Ulrike Prange, Hartmut Ehrig, Kathrin Hoffmann & Julia Padberg (2008): Transformations in Reconfigurable Place/Transition Systems. In: Pierpaolo Degano, Rocco De Nicola & José Meseguer: Concurrency, Graphs and Models: Essays Dedicated to Ugo Montanari on the Occasion of His 65th Birthday. Springer Berlin Heidelberg, Berlin, Heidelberg, pp. 96–113, doi:10.1007/978-3-540-68679-8_7.
  19. W. Reisig (1985): Petri Nets: An Introduction. Springer-Verlag New York, Inc., New York, NY, USA, doi:10.1007/978-3-642-69968-9.
  20. Mark-Oliver Stehr, José Meseguer & Peter Csaba Ölveczky (2001): Rewriting Logic as a Unifying Framework for Petri Nets, pp. 250–303. Springer, Berlin, Heidelberg, doi:10.1007/3-540-45541-8_9.
  21. Rüdiger Valk (2004): Object Petri Nets. In: Jörg Desel, Wolfgang Reisig & Grzegorz Rozenberg: Lectures on Concurrency and Petri Nets: Advances in Petri Nets. Springer, Berlin, Heidelberg, pp. 819–848, doi:10.1007/978-3-540-27755-2_23.
  22. Emanuele Viola (2001): E-unifiability via Narrowing. In: Theoretical Computer Science. Springer, Berlin, Heidelberg, pp. 426–438, doi:10.1007/3-540-45446-2_27.

Comments and questions to:
For website issues: