On Three Alternative Characterizations of Combined Traces

  • Authors:

  • Dai Tri Lê

  • Affiliations:

  • (Correspd.) Department of Computer Science, University of Toronto, Toronto, ON, M5S 3G4 Canada. ledt@cs.toronto.edu

  • Venue:
  • Fundamenta Informaticae - Applications and Theory of Petri Nets and Other Models of Concurrency, 2010
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

The combined trace (i.e., comtrace) notion was introduced by Janicki and Koutny in 1995 as a generalization of the Mazurkiewicz trace notion. Comtraces are congruence classes of step sequences, where the congruence relation is defined from two relations simultaneity and serializability on events. They also showed that comtraces correspond to some class of labeled stratified order structures, but left open the question of what class of labeled stratified orders represents comtraces. In this work, we proposed a class of labeled stratified order structures that captures exactly the comtrace notion. Our main technical contributions are representation theorems showing that comtrace quotient monoid, combined dependency graph (Kleijn and Koutny 2008) and our labeled stratified order structure characterization are three different and yet equivalent ways to represent comtraces. This paper is a revised and expanded version of Lê (in Proceedings of PETRI NETS 2010, LNCS 6128, pp. 104-124).