Relational structures for concurrent behaviours

Theoretical Computer Science, vol. 862, pp. 174–192

Abstract

Relational structures based on acyclic relations can successfully model fundamental aspects of concurrent systems behaviour. Examples include Elementary Net systems and Mazurkiewicz traces. There are however cases where more general relational structures are needed. In this paper, we present a general model of relational structures which can be used for a broad class of concurrent behaviours. We demonstrate how this general set-up works for combined order structures which are based on two relations, viz. an acyclic ‘before’ relation and a possibly cyclic ‘not later than’ relation.

Authors 4

1. Ryszard Janicki

   McMaster University

   Affiliation as printed

   Dept. Computing and Software, McMaster University, Hamilton, ON, L8S 4K1, Canada

2. Jetty Kleijn Aachen

   Leiden University

   Affiliation as printed

   LIACS, Leiden University, P.O. Box 9512, 2300 RA Leiden, the Netherlands

3. Maciej Koutny corresponding

   Newcastle University

   Affiliation as printed

   School of Computing, Newcastle University, Newcastle upon Tyne, NE1 7RU, UK

4. Łukasz Mikulski

   Nicolaus Copernicus University

   Affiliation as printed

   Fac. Math. and Computer Science, Nicolaus Copernicus University, Toruń, Poland