Resource traces: A domain for processes sharing exclusive resources.

DOI10.1016/S0304-3975(00)00336-4zbMath1052.68081WikidataQ127087517 ScholiaQ127087517MaRDI QIDQ1605180

Dan Teodosiu, Paul Gastin

Publication date: 15 July 2002

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

zbMATH Keywords

SemanticsMazurkiewicz tracesConcurrencyScott domains

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 ⋮ A truly concurrent semantics for a process algebra using resource pomsets

Cites Work

• On the concatenation of infinite traces
• The poset of infinitary traces
• Asynchronous mappings and asynchronous cellular automata
• A metric for traces
• Theory of traces
• A calculus of communicating systems
• Combinatorics on traces
• Mathematical foundations of computer science 1993. 18th international symposium, MFCS '93, Gdańsk, Poland, August/September 1993. Proceedings
• Data Types as Lattices
• A domain for concurrent termination a generalization of Mazurkiewicz traces
• Poset properties of complex traces
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Resource traces: A domain for processes sharing exclusive resources.