A truly concurrent semantics for a process algebra using resource pomsets

DOI10.1016/S0304-3975(02)00021-XzbMath0997.68081MaRDI QIDQ1603698

Paul Gastin, Michael W. Mislove

Publication date: 15 July 2002

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

zbMATH Keywords

process algebradenotational semanticsSOS-style operational semantics

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 (1)

A Truly Concurrent Process Semantics over Multi-Pomsets of Consumable Resources

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Petri nets with individual tokens
• Modeling concurrency with partial orders
• A calculus of communicating systems
• Approximating traces
• Full abstraction and recursion
• Resource traces: A domain for processes sharing exclusive resources.
• A Theory of Communicating Sequential Processes
• The Existence of Irr(X)

This page was built for publication: A truly concurrent semantics for a process algebra using resource pomsets