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

DOI10.1016/J.ENTCS.2012.08.020zbMATH Open1342.68245OpenAlexW2034758493WikidataQ113318069 ScholiaQ113318069MaRDI QIDQ3178291FDOQ3178291

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

quantificationfull abstractionconsumptiondenotational semanticsresourceprocess calculusstructural operational semanticstrue concurrencypomset

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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

Cited In (3)

• A truly concurrent semantics for a process algebra using resource pomsets
• A Truly Concurrent Process Semantics over Multi-Pomsets of Consumable Resources
• Title not available (Why is that?)

This page was built for publication: A Truly Concurrent Process Semantics over Multi-Pomsets of Consumable Resources

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3178291)