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
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
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
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
Expressiveness of Point-to-Point versus Broadcast Communications
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
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
Quantitative information in the tuple space coordination model
Theoretical Computer Science - Quantitative aspects of programming languages (QAPL 2004)
On the Expressive Power of Restriction and Priorities in CCS with Replication
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
On the expressive power of priorities in CHR
PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
On the computational power of BlenX
Theoretical Computer Science
An expressiveness study of priority in process calculi
Mathematical Structures in Computer Science
π@: a π-based process calculus for the implementation of compartmentalised bio-inspired calculi
SFM'08 Proceedings of the Formal methods for the design of computer, communication, and software systems 8th international conference on Formal methods for computational systems biology
The expressive power of CHR with priorities
Information and Computation
| 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 (i.e. recursion-free) fragment of asynchronous CCS with global priority (FAP, for short) and Phillips' CPG (CCS with local priority), and we contrast their expressive power with that of two non-prioritised calculi, namely the p-calculus and its broadcast-based version, called bp. We prove, by means of leader-election-based separation results, that there exists no encoding of FAP into p-Calculus or CPG, under certain conditions. Moreover, we single out another problem in distributed computing, 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 into the non-prioritised calculi retaining any sincere (complete but partially correct, i.e., admitting divergence or premature termination) semantics.