ePrints

Invariant Structures and Dependence Relations

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

Downloads

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

Abstract

A step trace is an equivalence class of step sequences which can be thought of as different observations of the same underlying concurrent history. Equivalence is determined on basis of a step alphabet that describes the relations between events in terms of potential simultaneity and sequentialisability. Step traces cannot be represented by standard partial orders, but require so-called invariant structures, extended order structures that capture the phenomena of mutual exclusion and weak causality.In this paper, we present an effective way of deciding whether an invariant structure represents a step trace over a given step alphabet. We also describe a method by which one can check whether a given invariant structure can represent a step trace over any step alphabet. Moreover, if the answer is positive, the method provides a suitable step alphabet.

Publication metadata

Author(s): Janicki R, Kleijn J, Koutny M, Mikulski L

Publication type: Article

Publication status: Published

Journal: Fundamenta Informaticae

Year: 2017

Volume: 155

Issue: 1-2

Pages: 1-29

Online publication date: 12/09/2017

Acceptance date: 15/05/2017

ISSN (print): 0169-2968

ISSN (electronic): 1875-8681

Publisher: IOS Press

URL: https://doi.org/10.3233/FI-2017-1574

DOI: 10.3233/FI-2017-1574

Altmetrics

Share