An expressiveness study of priority in process calculi

DOI10.1017/S0960129509990168zbMath1191.68447MaRDI QIDQ3655761

Cristian Versari, Roberto Gorrieri, Nadia Busi

Publication date: 12 January 2010

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Related Items (2)

On the validity of encodings of the synchronous in the asynchronous \(\pi\)-calculus ⋮ Replacement freeness: a criterion for separating process calculi

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A randomized encoding of the \(\pi\)-calculus with mixed choice
• Priorities in process algebras
• On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes
• A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time
• A calculus of mobile processes. I
• A calculus of mobile processes. II
• CCS with priority choice
• The theory of interactive generalized semi-Markov processes
• What is a ``good encoding of guarded choice?
• Tutorial on separation results in process calculi via leader election problems
• CCS with priority guards
• Quantitative information in the tuple space coordination model
• On the Expressive Power of Global and Local Priority in Process Calculi
• Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator

This page was built for publication: An expressiveness study of priority in process calculi