Hasse Diagrams of Combined Traces

  1. Lookup NU author(s)
  2. Dr Lukasz Mikulski
  3. Professor Maciej Koutny
Author(s)Koutny M; Mikulski L
Editor(s)Brandt, J., Heljanko, K.
Publication type Conference Proceedings (inc. Abstract)
Conference Name12th International Conference on Application of Concurrency to System Design, ACSD 2012
Conference LocationHamburg, Germany
Year of Conference2012
Legacy Date27-29 June 2012
Volume
Pages92-101
ISBN9781467316873
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
One of the standard ways to represent concurrent behaviours is to use concepts originating from language theory, such as traces and comtraces. Traces can express notions such as concurrency and causality, whereas comtraces can also capture weak causality and simultaneity. This paper is concerned with the development of efficient data structures and algorithms for manipulating comtraces. We introduce Hasse diagrams for comtraces which are a generalisation of Hasse diagrams defined for partial orders and traces, and develop an efficient algorithm for deriving them from language theoretic representations of comtraces. We also explain how the new representation of comtraces can be used to implement efficiently some basic operations on comtraces.
PublisherIEEE
URLhttp://dx.doi.org/10.1109/ACSD.2012.9
DOI10.1109/ACSD.2012.9
ActionsLink to this publication
Library holdingsSearch Newcastle University Library for this item