The poset of infinitary traces

DOI10.1016/0304-3975(93)90247-QzbMath0787.68056MaRDI QIDQ689293

Brigitte Rozoy, Paul Gastin

Publication date: 20 December 1993

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

zbMATH Keywords

partially ordered setspartially commutative monoidScott domaininfinite tracesdomain and event structures

Mathematics Subject Classification ID

Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Continuous lattices and posets, applications (06B35)

Related Items (11)

Deterministic asynchronous automata for infinite traces ⋮ Pattern matching in trace monoids ⋮ Poset properties of complex traces ⋮ The word problem for \(1\mathcal{LC}\) congruences is NP-hard. ⋮ The topology of Mazurkiewicz traces. ⋮ A domain for concurrent termination a generalization of Mazurkiewicz traces ⋮ On the concatenation of infinite traces ⋮ The poset of infinitary traces ⋮ Asynchronous cellular automata for infinite traces ⋮ An extension of Kleene's and Ochmański's theorems to infinite traces ⋮ Resource traces: A domain for processes sharing exclusive resources.

Cites Work

• The poset of infinitary traces
• A metric for traces
• Un modèle asynchrone pour les systèmes distribués. (An asynchronous model of distributed systems)
• Theory of traces
• Petri nets, event structures and domains. I
• Adherences of languages
• Event structures and trace monoids
• On automata on infinite trees
• Combinatorics on traces
• Combinatorial problems of commutation and rearrangements
• Concurrent Machines
• Time, clocks, and the ordering of events in a distributed system
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The poset of infinitary traces