Time-stamps for Mazurkiewicz traces

Authors:
Wiesław Zielonka
Affiliations:
LIAFA, Université Paris, Paris Cedex, France
Venue:
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Year:
2006

Citing 8
Cited 0

An algorithm for computing asynchronous automata in the case of acyclic non-commutation graphs

14th International Colloquium on Automata, languages and programming
Some combinatorial aspects of time-stamp systems

European Journal of Combinatorics
Synthesis of nondeterministic asynchronous automata

Semantics of programming languages and model theory
Asynchronous mappings and asynchronous cellular automata

Information and Computation
A note on Me´tivier's construction of asynchronous automata for triangulated graphs

Fundamenta Informaticae - Special issue on formal language theory
The Book of Traces

The Book of Traces
Keeping track of the latest gossip in a distributed system

Distributed Computing
Graphs and Hypergraphs

Graphs and Hypergraphs

Quantified Score

Hi-index	0.00

Visualization

Abstract

We construct a new time-stamp system for Mazurkiewicz traces. We begin by constructing a sequential time-stamp system which turns out to be optimal for a certain class of time-stamps. In the next step we show that this time-stamp system can be adapted for Mazurkiewicz traces, i.e. it can be used also in a distributed environment.