CCS with priority choice
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1863171
- CCS with priority guards
- A monotone framework for CCS
- scientific article; zbMATH DE number 3911691
- On the expressive power of CCS
- On the Expressive Power of Restriction and Priorities in CCS with Replication
- scientific article; zbMATH DE number 4018372
- The power of choice in priority scheduling
- Notes on the methodology of CCS and CSP
- CCCP
Cited in
(21)- A denotational semantics for Handel-C
- scientific article; zbMATH DE number 1863171 (Why is no real title available?)
- On the axiomatizability of priority. II
- On the axiomatisability of priority
- A modular framework for verifying versatile distributed systems
- A process algebra with distributed priorities
- Preferential choice and coordination conditions
- Priority as extremal probability
- The Concurrency Workbench with priorities
- A process algebra with distributed priorities
- A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time
- The expressiveness of CSP with priority
- QoS negotiation in service composition
- An operational semantics of occam
- Replacement freeness: a criterion for separating process calculi
- CCS with priority guards
- Priority and abstraction in process algebra
- Expressing priorities and external probabilities in process algebra via mixed open/closed systems
- An expressiveness study of priority in process calculi
- scientific article; zbMATH DE number 3995043 (Why is no real title available?)
- On the computational power of BlenX
This page was built for publication: CCS with priority choice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1346713)