Folded Hasse Diagrams of Combined Traces

  1. Lookup NU author(s)
  2. Dr Lukasz Mikulski
  3. Professor Maciej Koutny
Author(s)Mikulski L, Koutny M
Publication type Report
Series TitleSchool of Computing Science Technical Report Series
Source Publication DateNovember 2012
Report Number1357
Full text is available for this publication:
To represent concurrent behaviours one can useconcepts originating from language theory, includingtraces and comtraces. Traces can expressnotions such as concurrency and causality, whereas comtracescan also capture weak causality and simultaneity.This paper is concerned with the development of efficient data structures and algorithmsfor manipulating comtraces. We introduce and investigate folded Hasse diagrams of comtraceswhich generalise Hasse diagrams defined for partial ordersand traces.We also develop an efficient on-linealgorithm for deriving Hasse diagrams from language theoretic representations ofcomtraces. Finally, we briefly discuss how folded Hasse diagramscould be used to implement efficiently some basic operations on comtraces.
InstitutionNewcastle University
Place PublishedNewcastle upon Tyne
ActionsLink to this publication