CCS with priority guards

DOI10.1007/3-540-44685-0_21MaRDI QIDQ4791842zbMATH OpenFDO

Authors Iain Phillips

Publication date 3 February 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2154/21540305.htm

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• CCS with priority guards
• Priority as extremal probability
• Priorities in process algebras
• CCS with priority choice
• An expressiveness study of priority in process calculi

Cited in

(14)

• On the computational power of BlenX
• CCS with priority choice
• Priority as extremal probability
• Priority and abstraction in process algebra
• Tutorial on separation results in process calculi via leader election problems
• CCS with priority guards
• The expressive power of monotonic parallel composition
• On the Expressive Power of Global and Local Priority in Process Calculi
• Compositional Abstraction in Real-Time Model Checking
• On the Expressive Power of Restriction and Priorities in CCS with Replication
• On Observing Dynamic Prioritised Actions in SOC
• A randomized encoding of the \(\pi\)-calculus with mixed choice
• Priorities in process algebras
• Preferential choice and coordination conditions

This page was built for publication: CCS with priority guards

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