CCS with priority choice
From MaRDI portal
Publication:1346713
DOI10.1006/inco.1995.1003zbMath0818.68107OpenAlexW2151950311MaRDI QIDQ1346713
Glynn Winskel, Juanito Camilleri
Publication date: 10 April 1995
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/inco.1995.1003
Related Items
Priority and abstraction in process algebra, Preferential choice and coordination conditions, A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time, QoS negotiation in service composition, An operational semantics of occam, Replacement freeness: a criterion for separating process calculi, A process algebra with distributed priorities, CCS with priority guards, A denotational semantics for Handel-C, On the axiomatizability of priority. II, A modular framework for verifying versatile distributed systems, On the axiomatisability of priority, Priority as extremal probability, A process algebra with distributed priorities, An expressiveness study of priority in process calculi, On the computational power of BlenX, Expressing Priorities and External Probabilities in Process Algebra via Mixed Open/Closed Systems
