• Language, Semantics, and Methods for Cryptographic Protocols. With Federico Crazzolara.
    August 2000. In BRICS reports series RS-00-18

  • Presheaf Models for CCS-like Languages. With Gian Luca Cattani.
    November 1999. In BRICS reports series RS-99-36 . A full version appears in Theor. Comput. Sci. 300(1-3): 47-89 (2003)

  • Weak Bisimulation and Open Maps. With Marcelo P. Fiore and Gian Luca Cattani.
    LICS '99. In BRICS reports series RS-99-14

  • Event Structures as Presheaves--Two Representation Theorems.
    CONCUR '99. In BRICS reports series RS-99-7

  • A Compositional Proof System for the Modal mu-Calculus. With Henrik Reif Andersen and Colin Stirling.
    December 1998. In BRICS reports series RS-98-40

  • A Linear Metalanguage for Concurrency.
    AMAST'98. In BRICS reports series RS-98-31

  • A Categorical Axiomatics for Bisimulation. With Gian Luca Cattani and John Power.
    CONCUR '98. In BRICS reports series RS-98-22

  • A Representation Result for Free Cocompletions. With John Power and Gian Luca Cattani.
    September 1998. In Journal of Pure and Applied Algebra. In BRICS reports series RS-98-21

  • Relational Semantics of Non-Deterministic Dataflow. With Thomas Troels Hildebrandt and Prakash Panangaden.
    CONCUR'98. In BRICS reports series RS-97-36

  • A Theory of Recursive Domains with Applications to Concurrency. With Gian Luca Cattani and Marcelo P. Fiore.
    LICS '99. In BRICS reports series RS-97-35

  • Presheaf Models for the pi-Calculus. With Gian Luca Cattani and Ian Stark.
    CTCS '97. In BRICS reports series RS-97-34

  • Bistructures, Bidomains and Linear Logic. With Pierre-Louis Curien and Gordon Plotkin.
    In Essays in Honour of Robin Milner, MIT Press, 1998. In BRICS reports series RS-97-15

  • A Presheaf Semantics of Value-Passing Processes.
    CONCUR '96. In BRICS reports series RS-96-44

  • Presheaf Models for Concurrency. With Gian Luca Cattani.
    CSL '96. In BRICS reports series RS-96-35

  • Presheaves as transition systems. With Mogens Nielsen.
    In Partial Order Methods in Computer Science, Proc. of DIMACS Workshop July 24-26, Princeton, 1996. As ps.

  • Petri Nets and Bisimulations. With Mogens Nielsen.
    In Theoretical Computer Science 153(1-2):211-244, January 1996. In BRICS reports series RS-95-4

  • A Compositional Proof System for the Modal mu-Calculus. With Henrik Reif Andersen and Colin Stirling.
    LICS '94. In BRICS reports series RS-94-34

  • Stable Bistructure Models of PCF.
    Invited lecture MFCS '94. In BRICS reports series RS-94-13

  • Models for Concurrency. With Mogens Nielsen.
    Pre-published version of a chapter in the Handbook of Logic and the Foundations of Computer Science, vol. 4, pages 1-148, Oxford University Press, 1995. In DAIMI and BRICS reports series pdf

  • Bistructures, Bidomains and Linear Logic. With Gordon Plotkin.
    ICALP '94. In BRICS reports series RS-94-9

  • Bisimulation from Open Maps. With Andre Joyal and Mogens Nielsen.
    In LICS '93 special issue of Information and Computation, 127(2):164-185, June 1996. In BRICS reports series RS-94-7

  • Linear Logic on Petri Nets. With Uffe H. Engberg.
    In A Decade of Concurrency: Reflections and Perspectives, REX School/Symposium Proceedings, LNCS 803, 1994. In BRICS reports series RS-94-3

  • Semantics, Algorithmics and Logic: Basic Research in Computer Science. BRICS Inaugural Talk.
    In BRICS reports series RS-94-1

  • Relationships between Models of Concurrency. With Mogens Nielsen and Vladimiro Sassone.
    In proceedings of REX, a decade of concurrency, 1993, LNCS 803, 1994. In DAIMI Publications series PB-456

  • Completeness Results for Linear Logic on Petri Nets. With Uffe Engberg.
    In DAIMI Publications series PB-435

  • Compositional Checking of Satisfaction. With Henrik Reif Andersen.
    In Formal Methods in System Design, 1(4), December 1992. pdf version.

  • Compositional Checking of Satisfaction (Extended Abstract). With Henrik Reif Andersen.
    In Proceedings of CAV'91. Journal version above. Available from H R Andersen's publications.

  • On the compositional checking of validity.
    CONCUR'90. In DAIMI Publications series PB-324

  • Petri Nets as Models of Linear Logic. With Uffe Engberg.
    CAAP '90. In DAIMI Publications series PB-301

  • A Compositional Proof System on a Category of Labelled Transition Systems.
    LICS'88 Special Issue of Information and Computation, vol.87, 1990. In DAIMI reports series PB-294

  • Event Structures.
    Advances in Petri Nets 1986. Springer Lecture Notes in Computer Science 255, 1987.
    pdf.

  • A New Definition of Morphism on Petri Nets.
    STACS 1984. Springer Lecture Notes in Computer Science 166, 1984.
    pdf. Original full submitted version of 1983: pdf.