A domain for concurrent termination a generalization of Mazurkiewicz traces

DOI10.1007/3-540-60084-1_59zbMath1412.68150OpenAlexW1562120089MaRDI QIDQ4645163

Paul Gastin, Volker Diekert

Publication date: 10 January 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60084-1_59

zbMATH Keywords

process algebrainfinite worddependence graphtrace theoryreal trace

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (2)

A Truly Concurrent Process Semantics over Multi-Pomsets of Consumable Resources ⋮ Resource traces: A domain for processes sharing exclusive resources.

Cites Work

• On the concatenation of infinite traces
• The poset of infinitary traces
• A metric for traces
• Poset properties of complex traces
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A domain for concurrent termination a generalization of Mazurkiewicz traces