Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
Information Processing Letters
On the concatenation of infinite traces
STACS '91 Selected papers of the 8th annual symposium on Theoretical aspects of computer science
The poset of infinitary traces
Theoretical Computer Science
Handbook of logic in computer science (vol. 3)
Metric completion versus ideal completion
Theoretical Computer Science
Partial commutation and traces
Handbook of formal languages, vol. 3
The Book of Traces
What topology tells us about diagnosability in partial order semantics
Discrete Event Dynamic Systems
| Hi-index | 0.00 |
The present paper characterizes the topological structure of real traces. This is done in terms of graph-theoretic properties of the underlying (possibly infinite) dependence alphabet. The topological space of real traces is shown to be homeomorphic to the direct product of (at most) the full binary tree and the full countably branching tree and one higher-dimensional grid. The occurrence of each of these factors depends on the existence of finite non-trivial and of infinite connected components and on the number of isolated letters of the dependence alphabet.