The following pages link to CCS with priority choice (Q1346713):
Displaying 18 items.
- A denotational semantics for Handel-C (Q539165) (← links)
- On the axiomatizability of priority. II (Q549169) (← links)
- QoS negotiation in service composition (Q615894) (← links)
- Preferential choice and coordination conditions (Q864506) (← links)
- An operational semantics of occam (Q914399) (← links)
- On the computational power of BlenX (Q1044845) (← links)
- A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time (Q1128976) (← links)
- A process algebra with distributed priorities (Q1276244) (← links)
- Priority as extremal probability (Q1816921) (← links)
- A modular framework for verifying versatile distributed systems (Q2011199) (← links)
- Replacement freeness: a criterion for separating process calculi (Q2210864) (← links)
- Priority and abstraction in process algebra (Q2381506) (← links)
- CCS with priority guards (Q2474050) (← links)
- The expressiveness of CSP with priority (Q2520703) (← links)
- Expressing priorities and external probabilities in process algebra via mixed open/closed systems (Q2864370) (← links)
- An expressiveness study of priority in process calculi (Q3655761) (← links)
- On the axiomatisability of priority (Q5458057) (← links)
- A process algebra with distributed priorities (Q6104364) (← links)