Communicating sequential processes
Communicating sequential processes
Priorities in process algebras
Information and Computation - Selections from 1988 IEEE symposium on logic in computer science
A formal definition of priority in CSP
ACM Transactions on Programming Languages and Systems (TOPLAS)
A calculus of mobile processes, I
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
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Communication and Concurrency
A Process Calculus with Incomparable Priorities
NAPAW '92 Proceedings of the First North American Process Algebra Workshop
Priority and Abstraction in Process Algebra
Proceedings of the 14th Conference on Foundations of Software Technology and Theoretical Computer Science
Compositional Abstraction in Real-Time Model Checking
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
On the expressibility of priority
Information Processing Letters
Parallel computing with the Pi-calculus
Proceedings of the sixth workshop on Declarative aspects of multicore programming
Separation results via leader election problems
FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
On the expressive power of global and local priority in process calculi
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
| Hi-index | 0.00 |
It has long been recognised that standard process algebra has difficulty dealing with actions of different priority, such as for instance an interrupt action of high priority. Various solutions have been proposed. We introduce a new approach, involving the addition of "priority guards" to Milner's process calculus CCS. In our approach, priority is unstratified, meaning that actions are not assigned fixed levels, so that the same action can have different priority depending where it appears in a program. Unlike in other unstratified accounts of priority in CCS (such as that of Camilleri and Winskel), we treat inputs and outputs symmetrically. We introduce the new calculus, give examples, develop its theory (including bisimulation and equational laws), and compare it with existing approaches. We show that priority adds expressiveness to both CCS and the π-calculus.