References

  1. L. Birkedal, S. Debois, E. Elsborg, T. Hildebrandt & H. Niss (2006): Bigraphical models of context-aware systems. In: Foundations of Software Science and Computation Structures. Springer, pp. 187–201, doi:10.1007/11690634_13.
  2. L. Birkedal, S. Debois & T. Hildebrandt (2008): On the construction of sorted reactive systems. In: CONCUR 2008. Springer, pp. 218–232, doi:10.1007/978-3-540-85361-9_20.
  3. T. Bolusset & F. Oquendo (2002): Formal refinement of software architectures based on rewriting logic. In: International Workshop on Refinement of Critical Systems: Methods, Tools and Experience, Grenoble.
  4. M. Bundgaard & V. Sassone (2006): Typed polyadic pi-calculus in bigraphs. In: Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming. ACM, pp. 1–12, doi:10.1145/1140335.1140336.
  5. T.C. Damgaard, V. Danos & J. Krivine (2008): A Language for the Cell. Technical Report TR-2008-116. IT University of Copenhagen.
  6. T.C. Damgaard & J. Krivine (2008): A Generic Language for Biological Systems based on Bigraphs. Technical Report TR-2008-115. IT University of Copenhagen.
  7. S. Debois: Computation in the Informatic Jungle. To appear. Draft available at http://www.itu.dk/people/debois/pubs/computation.pdf.
  8. E. Elsborg, T. Hildebrandt & D. Sangiorgi (2009): Type Systems for Bigraphs. In: Christos Kaklamanis & Flemming Nielson: Proceedings of the 4th International Symposium on Trustworthy Global Computing (TGC 2008), Lecture Notes in Computer Science 5474. Springer-Verlag, pp. 126–140, doi:10.1007/978-3-642-00945-7_8.
  9. M. Goldsmith & S. Creese (2010): Refinement-Friendly Bigraphs and Spygraphs. In: 2010 8th IEEE International Conference on Software Engineering and Formal Methods. IEEE, pp. 203–207, doi:10.1109/SEFM.2010.25. Available at http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=5637430.
  10. D. Grohmann & M. Miculan (2007): Reactive Systems over Directed Bigraphs. In: Lu\'ıs Caires & Vasco Thudichum Vasconcelos: Proceedings of the 18th International Conference on Concurrency Theory (CONCUR'07), Lecture Notes in Computer Science 4703. Springer-Verlag, pp. 380–394, doi:10.1007/978-3-540-74407-8_26.
  11. M. Hennessy & C. Stirling (1985): The power of the future perfect in program logics. Information and Control, pp. 23–52.
  12. T. Hildebrandt, H. Niss & M. Olsen (2006): Formalising Business Process Execution with Bigraphs and Reactive XML. In: Paolo Ciancarini & Herbert Wiklicky: Proceedings of the 8th International Conference on Coordination Models and Languages (COORDINATION'06), Lecture Notes in Computer Science 4038. Springer-Verlag, pp. 113–129, doi:10.1007/11767954_8.
  13. T.T. Hildebrandt (1999): Categorical Models for Fairness and a Fully Abstract Presheaf Semantics of SCCS with Finite Delay. In: CTCS'99, LNCS, doi:10.1016/S1571-0661(05)80311-1.
  14. O.H. Jensen (2006): Mobile Processes in Bigraphs. Available at http://www.cl.cam.ac.uk/ rm135/Jensen-monograph.pdf.
  15. J. Krivine, R. Milner & A. Troina (2008): Stochastic bigraphs. Electronic Notes in Theoretical Computer Science 218, pp. 73–96, doi:10.1016/j.entcs.2008.10.006.
  16. J. Leifer & R. Milner (2006): Transition systems, link graphs and Petri nets. Journal of Mathematical Structures in Computer Science 16(6), pp. 989–1047, doi:10.1017/S0960129506005664.
  17. R. Milner (1980): A calculus of communicating systems. Springer-Verlag.
  18. R. Milner (2005): Axioms for Bigraphical Structure. Journal of Mathematical Structures in Computer Science 15(6), pp. 1005–1032, doi:10.1017/S0960129505004809.
  19. R. Milner (2006): Pure Bigraphs: Structure and Dynamics. Information and Computation 204(1), pp. 60–122, doi:10.1016/j.ic.2005.07.003.
  20. R. Milner (2007): Local Bigraphs and Confluence: Two Conjectures: (Extended Abstract). In: Roberto Amadio & Iain Phillips: Proceedings of the 13th International Workshop on Expressiveness in Concurrency (EXPRESS 2006), Electronic Notes in Theoretical Computer Science 175. Elsevier, doi:10.1016/j.entcs.2006.07.035.
  21. R. Milner (2009): The space and motion of communicating agents. Cambridge University Press.
  22. S. Ó Conchúir (2009): Kind Bigraphs. In: Anthony Seda, Menouer Boubekeur, Ted Hurley, Micheal Mac an Airchinnigh, Michel Schellekens & Glenn Strong: Proceedings of the Irish Conference on the Mathematical Foundations of Computer Science and Information Technology (MFCSIT 2006), Electronic Notes in Theoretical Computer Science 225. Elsevier, pp. 361–377, doi:10.1016/j.entcs.2008.12.086.
  23. S. Reeves & D. Streader (2008): General refinement, part one: interfaces, determinism and special refinement. Electronic Notes in Theoretical Computer Science 214, pp. 277–307, doi:10.1016/j.entcs.2008.06.013.
  24. S. Reeves & D. Streader (2008): General refinement, part two: flexible refinement. Electronic Notes in Theoretical Computer Science 214, pp. 309–329, doi:10.1016/j.entcs.2008.06.014.
  25. M. Zhang, L. Shi, L. Zhu, Y. Wang, L. Feng & G. Pu (2008): A Bigraphical Model of WSBPEL. In: Second Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering (TASE'08). IEEE Computer Society, pp. 117–120.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org