On the concatenation of infinite traces

DOI10.1016/0304-3975(93)90209-CzbMath0786.68074MaRDI QIDQ685439

Volker Diekert

Publication date: 17 October 1993

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

concatenationtrace theorydependence graphsinfinite tracessemantics for infinite concurrent processesultra-metric spaces

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (6)

The topology of Mazurkiewicz traces. ⋮ Topological aspects of traces ⋮ Logical definability on infinite traces ⋮ A domain for concurrent termination a generalization of Mazurkiewicz traces ⋮ RECOGNIZABLE AND LOGICALLY DEFINABLE LANGUAGES OF INFINITE COMPUTATIONS IN CONCURRENT AUTOMATA ⋮ Resource traces: A domain for processes sharing exclusive resources.

Cites Work

• The poset of infinitary traces
• Partial commutations and faithful rational transductions
• A metric for traces
• Maximal serializability of iterated transactions
• Theory of traces
• Combinatorics on traces
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the concatenation of infinite traces