Communicating sequential processes
Communicating sequential processes
Ready-trace semantics for concrete process algebra with the priority operator
The Computer Journal
Priorities in process algebras
Information and Computation - Selections from 1988 IEEE symposium on logic in computer science
A calculus of mobile processes, I
Information and Computation
A calculus of mobile processes, II
Information and Computation
Information and Computation
Comparing the expressive power of the synchronous and the asynchronous &pgr;-calculus
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Theoretical Computer Science
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
What is a “good” encoding of guarded choice?
Information and Computation - Special issue on EXPRESS 1997
A Calculus of Communicating Systems
A Calculus of Communicating Systems
The theory of interactive generalized semi-Markov processes
Theoretical Computer Science
An Object Calculus for Asynchronous Communication
ECOOP '91 Proceedings of the European Conference on Object-Oriented Programming
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Extended Markovian Process Algebra
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
Comparing the expressive power of the synchronous and asynchronous $pi$-calculi
Mathematical Structures in Computer Science
A randomized encoding of the π-calculus with mixed choice
Theoretical Computer Science - Process algebra
Computation: finite and infinite machines
Computation: finite and infinite machines
Quantitative information in the tuple space coordination model
Theoretical Computer Science - Quantitative aspects of programming languages (QAPL 2004)
Tutorial on separation results in process calculi via leader election problems
Theoretical Computer Science
Interactive Markov chains: and the quest for quantified quality
Interactive Markov chains: and the quest for quantified quality
On the expressive power of global and local priority in process calculi
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Revisiting glue expressiveness in component-based systems
COORDINATION'11 Proceedings of the 13th international conference on Coordination models and languages
Expressing global priorities by best-matching
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Hi-index | 0.00 |
Priority is a frequently used feature of many computational systems. In this paper we study the expressiveness of two process algebras enriched with different priority mechanisms. In particular, we consider a finite (that is, recursion-free) fragment of asynchronous CCS with global priority (FAP, for short) and Phillips' CPG (CCS with local priority), and contrast their expressive power with that of two non-prioritised calculi, namely the π-calculus and its broadcast-based version, called bπ. We prove, by means of leader-election-based separation results, that, under certain conditions, there exists no encoding of FAP in π-Calculus or CPG. Moreover, we single out another problem in distributed computing, which we call the last man standing problem (LMS for short), that better reveals the gap between the two prioritised calculi above and the two non-prioritised ones, by proving that there exists no parallel-preserving encoding of the prioritised calculi in the non-prioritised calculi retaining any sincere (complete but partially correct, that is, admitting divergence or premature termination) semantics.