References

  1. Marc Bezem & Jan Friso Groote (1994): Invariants in Process Algebra with Data. In: Bengt Jonsson & Joachim Parrow: CONCUR, LNCS 836. Springer, pp. 401–416, doi:10.1007/978-3-540-48654-1_30.
  2. Pierre Bouvier, Hubert Garavel & Hernán Ponce de León (2020): Automatic Decomposition of Petri Nets into Automata Networks - A Synthetic Account. In: Ryszard Janicki, Natalia Sidorova & Thomas Chatain: Application and Theory of Petri Nets and Concurrency - 41st International Conference, PETRI NETS 2020, Paris, France, June 24-25, 2020, Proceedings, Lecture Notes in Computer Science 12152. Springer, pp. 3–23, doi:10.1007/978-3-030-51831-8_1.
  3. Ed Brinksma, Rom Langerak & Peter Broekroelofs (1993): Functionality Decomposition by Compositional Correctness Preserving Transformation. In: Costas Courcoubetis: CAV, LNCS 697. Springer, pp. 371–384, doi:10.1007/3-540-56922-7_31.
  4. Olav Bunte, Jan Friso Groote, Jeroen J. A. Keiren, Maurice Laveaux, Thomas Neele, Erik P. de Vink, Wieger Wesselink, Anton Wijs & Tim A. C. Willemse (2019): The mCRL2 Toolset for Analysing Concurrent Systems - Improvements in Expressivity and Usability. In: Tomás Vojnar & Lijun Zhang: TACAS, LNCS 11428. Springer, pp. 21–39, doi:10.1007/978-3-030-17465-1_2.
  5. Shing-Chi Cheung & Jeff Kramer (1996): Context Constraints for Compositional Reachability Analysis. ACM Trans. Softw. Eng. Methodol. 5(4), pp. 334–377, doi:10.1145/235321.235323.
  6. Pepijn Crouzen & Frédéric Lang (2011): Smart Reduction. In: FASE, Lecture Notes in Computer Science 6603. Springer, pp. 111–126, doi:10.1007/978-3-642-19811-3_9.
  7. Hubert Garavel, Frédéric Lang & Laurent Mounier (2018): Compositional Verification in Action. In: Falk Howar & Jiri Barnat: FMICS, LNCS 11119. Springer, pp. 189–210, doi:10.1007/978-3-030-00244-2_13.
  8. R. J. van Glabbeek, B. Luttik & N. Trcka (2009): Branching Bisimilarity with Explicit Divergence. Fundam. Inform. 93(4), pp. 371–392, doi:10.3233/FI-2009-109.
  9. Susanne Graf, Bernhard Steffen & Gerald Lüttgen (1996): Compositional Minimisation of Finite State Systems Using Interface Specifications. Formal Asp. Comput. 8(5), pp. 607–616, doi:10.1007/BF01211911.
  10. Jan Friso Groote & Faron Moller (1992): Verification of Parallel Systems via Decomposition. In: Rance Cleaveland: CONCUR, LNCS 630. Springer, pp. 62–76, doi:10.1007/BFb0084783.
  11. Jan Friso Groote & Mohammad Reza Mousavi (2014): Modeling and Analysis of Communicating Systems. MIT Press, doi:10.7551/mitpress/9946.001.0001.
  12. Wim H. Hesselink (1998): Invariants for the Construction of a Handshake Register. Inf. Process. Lett. 68(4), pp. 173–177, doi:10.1016/S0020-0190(98)00158-6.
  13. Sung-Shik T. Q. Jongmans, Dave Clarke & José Proença (2016): A procedure for splitting data-aware processes and its application to coordination. Sci. Comput. Program. 115-116, pp. 47–78, doi:10.1016/j.scico.2014.02.017.
  14. M. Laveaux (2021): Downloadable sources for the case study, doi:10.5281/zenodo.5091850.
  15. Maurice Laveaux & Tim A. C. Willemse (2020): Decompositional Minimisation of Monolithic Processes. CoRR abs/2012.06468. Available at https://arxiv.org/abs/2012.06468.
  16. Robin Milner (1983): Calculi for Synchrony and Asynchrony. Theor. Comput. Sci. 25, pp. 267–310, doi:10.1016/0304-3975(83)90114-7.
  17. Jaco van de Pol & Mark Timmer (2009): State Space Reduction of Linear Processes Using Control Flow Reconstruction. In: Zhiming Liu & Anders P. Ravn: Automated Technology for Verification and Analysis, 7th International Symposium, ATVA 2009, Macao, China, October 14-16, 2009. Proceedings, Lecture Notes in Computer Science 5799. Springer, pp. 54–68, doi:10.1007/978-3-642-04761-9_5.
  18. Daniela Remenska, Tim A. C. Willemse, Kees Verstoep, Wan J. Fokkink, Jeff Templon & Henri E. Bal (2012): Using Model Checking to Analyze the System Behavior of the LHC Production Grid. In: 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing, CCGrid 2012, Ottawa, Canada, May 13-16, 2012. IEEE Computer Society, pp. 335–343, doi:10.1109/CCGrid.2012.90.
  19. Judi Romijn & Jan Springintveld (1998): Exploiting Symmetry in Protocol Testing. In: Stanislaw Budkowski, Ana R. Cavalli & Elie Najm: FORTE XI / PSTV XVIII, IFIP Conference Proceedings 135. Kluwer, pp. 337–352, doi:10.1007/978-0-387-35394-4_29.
  20. Kuo-Chung Tai & Pramod V. Koppol (1993): Hierarchy-based incremental analysis of communication protocols. In: ICNP. IEEE Computer Society, pp. 318–325, doi:10.1109/ICNP.1993.340896.
  21. Kuo-Chung Tai & Pramod V. Koppol (1993): An Incremental Approach to Reachability Analysis of Distributed Programs. In: Jack C. Wileden: IWSSD. IEEE Computer Society, pp. 141–151, doi:10.1109/IWSSD.1993.315504.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org