ePrints

Folded Hasse diagrams of combined traces

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

Downloads

Full text for this publication is not currently held within this repository. Alternative links are provided below where available.

Abstract

To represent concurrent behaviours one can use concepts originating from language theory, including 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 and investigate folded Hasse diagrams of comtraces which generalise Hasse diagrams defined for partial orders and traces. We also develop an efficient on-line algorithm for deriving Hasse diagrams from language theoretic representations of comtraces. Finally, we briefly discuss how folded Hasse diagrams could be used to implement efficiently some basic operations on comtraces.

Publication metadata

Author(s): Mikulski L, Koutny M

Publication type: Article

Publication status: Published

Journal: Information Processing Letters

Year: 2014

Volume: 114

Issue: 4

Pages: 208-216

Print publication date: 01/04/2014

Online publication date: 13/11/2013

Acceptance date: 11/11/2013

ISSN (print): 0020-0190

ISSN (electronic): 1872-6119

Publisher: Elsevier

URL: http://dx.doi.org/10.1016/j.ipl.2013.11.009

DOI: 10.1016/j.ipl.2013.11.009

Altmetrics

Share