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

DOI10.1016/j.entcs.2012.08.020zbMath1342.68245OpenAlexW2034758493WikidataQ113318069 ScholiaQ113318069MaRDI QIDQ3178291

Dan Teodosiu

Publication date: 8 July 2016

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

Full work available at URL: https://doi.org/10.1016/j.entcs.2012.08.020

zbMATH Keywords

quantificationstructural operational semanticsdenotational semanticsconsumptionfull abstractiontrue concurrencyresourceprocess calculuspomset

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

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

Cites Work

• Handbook of weighted automata
• A calculus and logic of resources and processes
• Modeling concurrency with partial orders
• A truly concurrent semantics for a process algebra using resource pomsets
• Resource traces: A domain for processes sharing exclusive resources.
• A Truly Concurrent Process Semantics over Multi-Pomsets of Consumable Resources
• A domain for concurrent termination a generalization of Mazurkiewicz traces
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item