CCS with priority guards
From MaRDI portal
Publication:2474050
DOI10.1016/j.jlap.2007.06.005zbMath1134.68042OpenAlexW1979323524WikidataQ126253054 ScholiaQ126253054MaRDI QIDQ2474050
Publication date: 5 March 2008
Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlap.2007.06.005
Related Items (8)
A General Theory of Barbs, Contexts, and Labels ⋮ Replacement freeness: a criterion for separating process calculi ⋮ A denotational semantics for Handel-C ⋮ Concurrency cannot be observed, asynchronously ⋮ On the expressibility of priority ⋮ On the Expressive Power of Restriction and Priorities in CCS with Replication ⋮ An expressiveness study of priority in process calculi ⋮ Expressing Priorities and External Probabilities in Process Algebra via Mixed Open/Closed Systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Priorities in process algebras
- A complete inference system for a class of regular behaviours
- On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes
- A calculus of mobile processes. II
- A complete axiomatisation for observational congruence of finite-state behaviours
- CCS with priority choice
- Mobile ambients
- Decoding choice encodings
- Leader election in rings of ambient processes
- Process algebra for synchronous communication
- Communicating sequential processes
- Foundations of Software Science and Computation Structures
This page was built for publication: CCS with priority guards