References

  1. Martín Abadi & Cédric Fournet (2001): Mobile values, new names, and secure communication. In: POPL. ACM, pp. 104–115. Available at http://doi.acm.org/10.1145/360204.360213.
  2. Martín Abadi & Andrew D. Gordon (1999): A Calculus for Cryptographic Protocols: The spi Calculus. Inf. Comput. 148(1), pp. 1–70. Available at http://dx.doi.org/10.1006/inco.1998.2740.
  3. Jesper Bengtson, Magnus Johansson, Joachim Parrow & Björn Victor (2011): Psi-calculi: a framework for mobile processes with nominal data and logic. Logical Methods in Computer Science 7(1). Available at http://dx.doi.org/10.2168/LMCS-7(1:11)2011.
  4. Maria Grazia Buscemi & Ugo Montanari (2007): CC-Pi: A Constraint-Based Language for Specifying Service Level Agreements. In: ESOP'07, LNCS 4421. Springer, pp. 18–32. Available at http://dx.doi.org/10.1007/978-3-540-71316-6_3.
  5. Marco Carbone, Thomas T. Hildebrandt, Gian Perrone & Andrzej Wasowski (2012): Refinement for Transition Systems with Responses. In: 4th Workshop on Foundations of Interface Technologies (FIT'12), EPTCS 87, pp. 48–55. Available at http://dx.doi.org/10.4204/EPTCS.87.5.
  6. Rocco De Nicola, Gian Luigi Ferrari, Ugo Montanari, Rosario Pugliese & Emilio Tuosto (2005): A Process Calculus for QoS-Aware Applications. In: COORDINATION, LNCS 3454. Springer, pp. 33–48. Available at http://dx.doi.org/10.1007/11417019_3.
  7. Rob van Glabbeek (2006): On the Expressiveness of Higher Dimensional Automata. Theor. Comput. Sci. 356(3), pp. 265–290. Available at http://dx.doi.org/10.1016/j.tcs.2006.02.012.
  8. Rob van Glabbeek & Ursula Goltz (2001): Refinement of actions and equivalence notions for concurrent systems. Acta Informatica 37(4/5), pp. 229–327, doi:10.1007/s002360000041. Available at http://link.springer.de/link/service/journals/00236/bibs/1037004/10370229.htm.
  9. Rob van Glabbeek & Gordon Plotkin (2009): Configuration structures, event structures and Petri nets. Theor. Comput. Sci. 410(41), pp. 4111–4159. Available at http://dx.doi.org/10.1016/j.tcs.2009.06.014.
  10. Vincent Gupta (1994): Chu Spaces: A Model of Concurrency. Stanford University.
  11. Thomas T. Hildebrandt & Raghava Rao Mukkamala (2010): Declarative Event-Based Workflow as Distributed Dynamic Condition Response Graphs. In: PLACES, EPTCS 69, pp. 59–73. Available at http://dx.doi.org/10.4204/EPTCS.69.5.
  12. Thomas T. Hildebrandt, Raghava Rao Mukkamala & Tijs Slaats (2012): Nested Dynamic Condition Response Graphs. In: 4th IPM International Conference on Fundamentals of Software Engineering (FSEN), LNCS 7141. Springer, pp. 343–350. Available at http://dx.doi.org/10.1007/978-3-642-29320-7_23.
  13. Hans Hüttel (2011): Typed psi-calculi. In: Joost-Pieter Katoen & Barbara König: 22nd International Conference on Concurrency Theory (CONCUR'11), LNCS 6901. Springer, pp. 265–279. Available at http://dx.doi.org/10.1007/978-3-642-23217-6_18.
  14. Hans Hüttel (2013): On Representing Located Process Calculi in the psi-calculus. personal communication.
  15. Robin Milner (1983): Calculi for Synchrony and Asynchrony.. Theor. Comput. Sci. 25, pp. 267–310, doi:10.1016/0304-3975(83)90114-7.
  16. Robin Milner, Joachim Parrow & David Walker (1992): A Calculus of Mobile Processes, I-II. Information and Computation 100(1), pp. 1–77, doi:10.1016/0890-5401(92)90008-4.
  17. Mogens Nielsen, Gordon Plotkin & Glynn Winskel (1979): Petri Nets, Event Structures and Domains.. In: Semantics of Concurrent Computation, LNCS 70. Springer, pp. 266–284, doi:10.1007/BFb0022474.
  18. Håkon Normann, Cristian Prisacariu & Thomas Hildebrandt (2014): True Concurrency Semantics for Psi-calculi. In: 1st International Workshop on Meta Models for Process Languages (MeMo). (presentation).
  19. Andrew M. Pitts (2013): Nominal Sets: Names and Symmetry in Computer Science. Cambridge Tracts in Theoretical Computer Science 57. Cambridge Univ. Press, doi:10.1017/CBO9781139084673.
  20. Vaughan R. Pratt (1991): Modeling Concurrency with Geometry. In: POPL'91, pp. 311–322. Available at http://doi.acm.org/10.1145/99583.99625.
  21. Vaughan R. Pratt (1995): Chu Spaces and their Interpretation as Concurrent Objects. In: Computer Science Today: Recent Trends and Develop., LNCS 1000. Springer, pp. 392–405. Available at http://dx.doi.org/10.1007/BFb0015256.
  22. Vaughan R. Pratt (2000): Higher dimensional automata revisited. Math. Struct. Comput. Sci. 10(4), pp. 525–548, doi:10.1017/S0960129500003169.
  23. Tijs Slaats, Raghava Rao Mukkamala, Thomas T. Hildebrandt & Morten Marquard (2013): Exformatics Declarative Case Management Workflows as DCR Graphs. In: Business Process Management, LNCS 8094. Springer, pp. 339–354. Available at http://dx.doi.org/10.1007/978-3-642-40176-3_28.
  24. Glynn Winskel (1982): Event Structure Semantics for CCS and Related Languages. In: ICALP, LNCS 140. Springer, pp. 561–576. Available at http://dx.doi.org/10.1007/BFb0012800.
  25. Glynn Winskel (1986): Event Structures. In: Advances in Petri Nets, LNCS 255. Springer, pp. 325–392. Available at http://dx.doi.org/10.1007/3-540-17906-2_31.
  26. Glynn Winskel & Mogens Nielsen (1995): Models for Concurrency. In: Samson Abramski, Dov M. Gabbay & Tom S.E. Maibaum: Handbook of Logic in Computer Science – vol 4 – Semantic Modelling. Oxford University Press, pp. 1–148.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org