Topological aspects of traces

  • Jaap van Oosten
Full Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1091)


Traces play a major role in several models of concurrency. They arise out of “independence structures” which are sets with a symmetric, irreflexive relation.

In this paper, independence structures are characterized as certain topological spaces. We show that these spaces are a universal construction known as “soberification”, a topological generalization of the ideal completion construction in domain theory. We also show that there is a group action connected to this construction.

Finally, generalizing the constructions in the first part of the paper, we define a new category of “labelled systems of posets”. This category includes labelled event structures as a full reflective subcategory, and has moreover a very straightforward notion of bisimulation which restricts on event structures to strong history-preserving bisimulation.

Keywords and phrases

Partial order independence relations traces topology event structures bisimulation 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BT]
    Diekert, & Rozenburg (eds), The Book of Traces, World Scientific (Singapore) 1994Google Scholar
  2. [D]
    Diekert, On the concatenation of infinite traces, TCS 113 (1993), 35–54Google Scholar
  3. [Joh]
    P.T. Johnstone, Stone Spaces, Cambridge University Press 1982Google Scholar
  4. [JNW]
    A. Joyal, M. Nielsen & G. Winskel, Bisimulation from open maps, BRICS Report, RS-94-7, Aarhus 1994. To appear in Information and Computation.Google Scholar
  5. [KPP]
    Kwiatkowska, Penczek & Peled, A hierarchy of partial order temporal properties, in: LNCS 827Google Scholar
  6. [Kwi]
    Marta Kwiatkowska, Defining Process Fairness for Non-Interleaving Concurrency, LNCS 472, 1991, and: On Topological characterization of behavioral properties, in: Reed, Roscoe &: Wachter (eds), Topology and Category Theory in Computer Science, Clarendon (Oxford), 1991Google Scholar
  7. [WN94]
    G. Winskel & M. Nielsen, Models of Concurrency, BRICS Report RS-94–12, Aarhus 1994. To appear in: Abramsky, Gabbay & Maibaum (eds), Handbook of Logic in Computer Science, Oxford University PressGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Jaap van Oosten
    • 1
  1. 1.Basic Research in Computer Science, Centre of the Danish National Research Foundation, Department of Computer ScienceUniversity of AarhusDenmark

Personalised recommendations