Thomas T. Hildebrandt

Recent publications:

• Bigraphs and (Reactive) XML - an XML-centric model of computation (with Jacob W. Winther).
  IT University of Copenhagen, (submitted), Dec 2004. (pdf, small revision Jan 12, 2005.)

• Bisimulation Congruences for Homer - a calculus of Higher-order mobile embedded resources (with Jens Chr. Godskesen and Mikkel Bundgaard).
  IT University Technical Report Series, TR-2004-52, Oct 2004. (pdf)

• A CPS Encoding of Name-Passing in Higher-Order Mobile Embedded Resources (with Mikkel Bundgaard and Jens Chr. Godskesen).
  International Workshop on Expressiveness in Concurrency (Express), August 2004, London, UK. (pdf)

• A relational model of non-deterministic dataflow (with P. Panangaden, and G. Winskel).
  Vol 14, issue 05, Journal of MSCS, pp 613-649, Oct 2004. (Full version of CONCUR '98 paper).

• Copyability Types for Mobile Computing Resources. (with Jens Chr. Godskesen).
  International Workshop on Formal Methods and Security, May 2003, Nanjing, China

• A Calculus of Mobile Resources (with Jens Chr. Godskesen and Vladimiro Sassone).
  In Proceedings of the 13th International Conference on Concurrency Theory, CONCUR 2002

• Towards Categorical Models for Fairness: Fully Abstract Presheaf Semantics of SCCS with Finite Delay(*).
  Journal of Theoretical Computer Science, Volume 294, Numbers 1-2: Category Theory and Computer Science J. Adámek, M. Escardó, M. Hofmann, 2003. (postscript, pdf and dvi).

• Categorical Models for Fairness: Completion vs Delay(**).
  MFCSIT2000, First Irish Conference on the Mathematical Foundations of Computer Science and Information Technology, July 20-21, ENTCS 40, 2000. (postscript, pdf, and bib).

• A Generalised Kahn Principle for a Relational Semantics of Indeterminate Dataflow(**).
  MFPS XVI, Stevens Institute of Technology, New Jersey, April 13-16, 2000.

• Categorical Models for Concurrency: Independence, Fairness and Dataflow.
  Ph.D. Dissertation, Department of Computer Science, University of Aarhus, Denmark, October, 1999.

• On Plain and Hereditary History-Preserving Bisimulation (with S. Fröschle).
  In Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science, MFCS'99, LNCS 1672, pp. 354--365, 1999.
  Full version available as BRICS Report, RS-99-4 (postscript, pdf and dvi).

• A Relational Model of Non-deterministic Dataflow (with P. Panangaden, and G. Winskel).
  In Proceedings of the 9th International Conference on Concurrency Theory, CONCUR '98, LNCS 1466, pp. 613--628, 1998