The poset of infinitary traces
From MaRDI portal
Publication:689293
DOI10.1016/0304-3975(93)90247-QzbMATH Open0787.68056MaRDI QIDQ689293FDOQ689293
Publication date: 20 December 1993
Published in: Theoretical Computer Science (Search for Journal in Brave)
Recommendations
partially ordered setspartially commutative monoidScott domaindomain and event structuresinfinite traces
Continuous lattices and posets, applications (06B35) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)
Cites Work
- Petri nets, event structures and domains. I
- Title not available (Why is that?)
- Concurrent Machines
- Title not available (Why is that?)
- Combinatorics on traces
- Time, clocks, and the ordering of events in a distributed system
- Combinatorial problems of commutation and rearrangements
- Title not available (Why is that?)
- Title not available (Why is that?)
- A metric for traces
- Title not available (Why is that?)
- Title not available (Why is that?)
- Event structures and trace monoids
- Theory of traces
- On automata on infinite trees
- Adherences of languages
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The poset of infinitary traces
- Un modèle asynchrone pour les systèmes distribués. (An asynchronous model of distributed systems)
Cited In (14)
- The poset of infinitary traces
- Resource traces: A domain for processes sharing exclusive resources.
- Deterministic asynchronous automata for infinite traces
- Symmetries of the partial order of traces
- The word problem for \(1\mathcal{LC}\) congruences is NP-hard.
- An extension of Kleene's and Ochmański's theorems to infinite traces
- Greene-Kleitman's theorem for infinite posets
- Event structures and trace monoids
- A domain for concurrent termination a generalization of Mazurkiewicz traces
- Poset properties of complex traces
- Asynchronous cellular automata for infinite traces
- Pattern matching in trace monoids
- The topology of Mazurkiewicz traces.
- On the concatenation of infinite traces
This page was built for publication: The poset of infinitary traces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q689293)