For the most recent entries see the Petri Nets Newsletter.

Graphs for Generalized Traces.

Biermann, I.; Rozoy, B.

In: Desel, J.: Structures in Concurrency Theory, Proceedings of the International Workshop on Structures in Concurrency Theory (STRICT), Berlin, 11-13 May 1995, pages 101-115. 1995.

Abstract: Mazurkiewicz traces form a model suitable for the investigation of some aspects of concurrency. We want to investigate one of its generalization based on the weakening of the condition that the equivalence relation is a congruence. The (quasi-)prefix ordering is then compared with the configuration graph induced by the partial ordering of symbol occurrences. We point out differences and exhibit necessary and/or sufficient conditions for them to be isomorphic: this is settled with the help of diamond properties.

Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography