References

  1. Martín Abadi, Bruno Blanchet & Cédric Fournet (2018): The Applied Pi Calculus: Mobile Values, New Names, and Secure Communication. J. ACM 65(1), pp. 1:1–1:41, doi:10.1145/3127586.
  2. Luca Aceto & Uffe Engberg (1991): Failures semantics for a simple process language with refinement. In: Somenath Biswas & Kesav V. Nori: Foundations of Software Technology and Theoretical Computer Science. Springer, pp. 89–108, doi:10.1007/3-540-54967-6_63.
  3. Luca Aceto & Matthew Hennessy (1994): Adding action refinement to a finite process algebra. Inform. and Comput. 115(2), pp. 179–247, doi:10.1006/inco.1994.1096.
  4. Clément Aubert, Ross Horne & Christian Johansen (2022): Diamonds for Security: A Non-Interleaving Operational Semantics for the Applied Pi-Calculus. In: Bartek Klin, Sławomir Lasota & Anca Muscholl: 33rd International Conference on Concurrency Theory, Leibniz International Proceedings in Informatics 243. Schloss Dagstuhl–Leibniz-Zentrum für Informatik, pp. 30:1–30:26, doi:10.4230/LIPIcs.CONCUR.2022.30.
  5. Michele Boreale & Davide Sangiorgi (1998): A fully abstract semantics for causality in the π-calculus. Acta Inform. 35(5), pp. 353–400, doi:10.1007/s002360050124.
  6. Gérard Boudol, Ilaria Castellani, Matthew Hennessy & Astrid Kiehn (1994): A Theory of Processes with Localities. Formal Aspects Comput. 6(2), pp. 165–200, doi:10.1007/BF01221098.
  7. Ilaria Castellani (1995): Observing distribution in processes: static and dynamic localities. Int. J. Found. Comput. Sci. 6(04), pp. 353–393, doi:10.1142/S0129054195000196.
  8. V. Cheval, R. Crubillé & S. Kremer (2022): Symbolic Protocol Verification with Dice: Process Equivalences in the Presence of Probabilities. In: 2022 2022 IEEE 35th Computer Security Foundations Symposium (CSF) (CSF). IEEE Computer Society, Los Alamitos, CA, USA, pp. 303–318, doi:10.1109/CSF54842.2022.00020.
  9. Vincent Cheval, Steve Kremer & Itsaka Rakotonirina (2019): Exploiting Symmetries When Proving Equivalence Properties for Security Protocols. In: Lorenzo Cavallaro, Johannes Kinder, XiaoFeng Wang & Jonathan Katz: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, CCS 2019, London, UK, November 11-15, 2019. ACM, pp. 905–922, doi:10.1145/3319535.3354260.
  10. Silvia Crafa, Daniele Varacca & Nobuko Yoshida (2012): Event Structure Semantics of Parallel Extrusion in the Pi-Calculus. In: Lars Birkedal: Foundations of Software Science and Computational Structures - 15th International Conference, FOSSACS 2012, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2012, Tallinn, Estonia, March 24 - April 1, 2012. Proceedings, LNCS 7213. Springer, pp. 225–239, doi:10.1007/978-3-642-28729-9_15.
  11. Ioana Cristescu, Jean Krivine & Daniele Varacca (2015): Rigid Families for CCS and the π-calculus. In: Martin Leucker, Camilo Rueda & Frank D. Valencia: Theoretical Aspects of Computing - ICTAC 2015 - 12th International Colloquium Cali, Colombia, October 29-31, 2015, Proceedings, LNCS 9399. Springer, pp. 223–240, doi:10.1007/978-3-319-25150-9_14.
  12. Pierpaolo Degano, Rocco De Nicola & Ugo Montanari (1989): Partial orderings descriptions and observations of nondeterministic concurrent processes. In: J. W. de Bakker, W. P. de Roever & G. Rozenberg: Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency. Springer, pp. 438–466, doi:10.1007/BFb0013030.
  13. Yuxin Deng, Matthew Hennessy, Rob van Glabbeek & Carroll Morgan (2008): Characterising Testing Preorders for Finite Probabilistic Processes. Log. Methods Comput. Sci. Volume 4, Issue 4, doi:10.2168/LMCS-4(4:4)2008.
  14. Ihor Filimonov, Ross Horne, Sjouke Mauw & Zach Smith (2019): Breaking Unlinkability of the ICAO 9303 Standard for e-Passports Using Bisimilarity. In: Kazue Sako, Steve A. Schneider & Peter Y. A. Ryan: Computer Security - ESORICS 2019 - 24th European Symposium on Research in Computer Security, Luxembourg, September 23-27, 2019, Proceedings, Part I, LNCS 11735. Springer, pp. 577–594, doi:10.1007/978-3-030-29959-0_28.
  15. Rob van Glabbeek (1990): The refinement theorem for ST-bisimulation semantics. Technical Report R 9002. Centre for Mathematics and Computer Science. Available at https://ir.cwi.nl/pub/5765.
  16. Rob van Glabbeek (2001): The linear time-branching time spectrum I. The semantics of concrete, sequential processes. In: J. A. Bergstra, A. Ponse & S. A. Smolka: Handbook of process algebra. Elsevier, pp. 3–99, doi:10.1016/b978-044482830-9/50019-9.
  17. Rob van Glabbeek & Gordon D. Plotkin (2009): Configuration structures, event structures and Petri nets. Theor. Comput. Sci. 410(41), pp. 4111–4159, doi:10.1016/j.tcs.2009.06.014.
  18. Rob van Glabbeek & Frits W. Vaandrager (1997): The Difference between Splitting in n and n+1. Inf. Comput. 136(2), pp. 109–142, doi:10.1006/inco.1997.2634.
  19. Roberto Gorrieri & Cosimo Laneve (1995): Split and ST Bisimulation Semantics. Inf. Comput. 118(2), pp. 272–288, doi:10.1006/inco.1995.1066.
  20. Matthew Hennessy (1995): Concurrent Testing of Processes. Acta Informatica 32(6), pp. 509–543, doi:10.1007/BF01178906.
  21. Ross Horne & Sjouke Mauw (2021): Discovering ePassport Vulnerabilities using Bisimilarity. Log. Meth. Comput. Sci. 17(2), pp. 24, doi:10.23638/LMCS-17(2:24)2021.
  22. Ross Horne, Sjouke Mauw & Semen Yurkov (2021): Compositional Analysis of Protocol Equivalence in the Applied π-Calculus Using Quasi-open Bisimilarity. In: Antonio Cerone & Peter Csaba Ölveczky: Theoretical Aspects of Computing - ICTAC 2021 - 18th International Colloquium, Virtual Event, Nur-Sultan, Kazakhstan, September 8-10, 2021, Proceedings, LNCS 12819. Springer, pp. 235–255, doi:10.1007/978-3-030-85315-0_14.
  23. Christian Johansen (2016): ST-structures. J. Log. Algebraic Methods Program. 85(6), pp. 1201–1233, doi:10.1016/j.jlamp.2015.10.009.
  24. Madhavan Mukund & Mogens Nielsen (1992): CCS, Location and Asynchronous Transition Systems. In: R. K. Shyamasundar: Foundations of Software Technology and Theoretical Computer Science, 12th Conference, New Delhi, India, December 18-20, 1992, Proceedings, LNCS 652. Springer, pp. 328–341, doi:10.1007/3-540-56287-7_116.
  25. Joachim Parrow, Johannes Borgström, Lars-Henrik Eriksson, Ramunas Gutkovas & Tjark Weber (2021): Modal Logics for Nominal Transition Systems. Log. Meth. Comput. Sci. 17(1), pp. 6:1–6:49, doi:10.23638/LMCS-17(1:6)2021.
  26. Alexander Rabinovich & Boris Avraamovich Trakhtenbrot (1988): Behavior Structures and Nets. Fund. Inform. 11(4), pp. 357–404, doi:10.3233/FI-1988-11404.
  27. Davide Sangiorgi (1996): Locality and interleaving semantics in calculi for mobile processes. Theor. Comput. Sci. 155(1), pp. 39–83, doi:10.1016/0304-3975(95)00020-8.
  28. Davide Sangiorgi (1996): A Theory of Bisimulation for the pi-Calculus. Acta Inform. 33(1), pp. 69–97, doi:10.1007/s002360050036.
  29. Davide Sangiorgi & David Walker (2001): On Barbed Equivalences in pi-Calculus. In: Kim Guldstrand Larsen & Mogens Nielsen: CONCUR 2001 - Concurrency Theory, 12th International Conference, Aalborg, Denmark, August 20-25, 2001, Proceedings, LNCS 2154. Springer, pp. 292–304, doi:10.1007/3-540-44685-0_20.
  30. Daniele Varacca & Nobuko Yoshida (2010): Typed event structures and the linear pi-calculus. Theor. Comput. Sci. 411(19), pp. 1949–1973, doi:10.1016/j.tcs.2010.01.024.
  31. Walter Vogler (1991): Failures semantics based on interval semiwords is a congruence for refinement. Distributed Computing 4(3), pp. 139–162, doi:10.1007/BF01798961.
  32. Walter Vogler (1996): The Limit of Split_n-Language Equivalence. Inf. Comput. 127(1), pp. 41–61, doi:10.1006/inco.1996.0048.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org