Toggle Main Menu Toggle Search

ePrints

Hasse Diagrams of Combined Traces

Lookup NU author(s): Dr Lukasz Mikulski, Professor Maciej Koutny

Downloads


Abstract

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.


Publication metadata

Author(s): Mikulski L, Koutny M

Publication type: Report

Publication status: Published

Series Title: School of Computing Science Technical Report Series

Year: 2011

Pages: 25

Print publication date: 01/11/2011

Source Publication Date: November 2011

Report Number: 1301

Institution: School of Computing Science, University of Newcastle upon Tyne

Place Published: Newcastle upon Tyne


Share