Abstract:
Abstract. It has long been recognised that ordinary process algebra has di-culty dealing with actions of dierent 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 the summation operator of Milner's process calculus CCS. In our approach, priority is unstrati ed, meaning that actions are not assigned xed levels, so that the same action can have dierent priority depending where it appears in a program. An important feature is that, unlike in other unstratied accounts of priority in CCS (such as that of Camilleri and Winskel), we can treat inputs and outputs symmetrically. We introduce the new calculus, give examples, develop its theory (including bisimulation, equational laws and logics), and compare it with existing approaches.
Citations
|
2762
|
Communication and Concurrency
– Milner
- 1989
|
|
2677
|
Communicating Sequential Processes
– Hoare
- 1995
|
|
402
|
Algebraic laws for nondeterminism and concurrency
– Hennessy, Milner
- 1985
|
|
313
|
Communicating and Mobile Systems: The π Calculus
– Milner
- 1999
|
|
302
|
Process algebra for synchronous communication
– Bergstra, Klop
- 1984
|
|
203
|
Branching time and abstraction in bisimulation semantics
– Glabbeek, Weijland
- 1996
|
|
104
|
Communicating and Mobile Systems: the -Calculus
– Milner
- 1999
|
|
84
|
Priorities in process algebra
– Cleaveland, Hennessy
- 1990
|
|
66
|
Syntax and defining equations for an interrupt mechanism in process algebra
– Baeten, Bergstra, et al.
- 1986
|
|
48
|
CCS with priority choice
– Camilleri, Winskel
- 1995
|
|
16
|
Priority as extremal probability
– Smolka, Steffen
|
|
14
|
A process algebra with distributed priorities
– Cleaveland, Luttgen, et al.
- 1997
|
|
12
|
A process calculus with incomparable priorities
– Hansson, Orava
- 1992
|
|
9
|
Priorities and abstraction in process algebra
– Natarajan, Christoff, et al.
- 1994
|
|
8
|
A formal definition of priority in CSP
– Fidge
- 1993
|
|
4
|
Syntax and de#ning equations for an interrupt mechanism in process algebra,Fundamenta Informaticae IX
– Baeten, Bergstra, et al.
- 1986
|
|
3
|
A typed, prioritized process algebra
– Jeffrey
- 1993
|
|
3
|
Pre-emptive Modeling of Concurrent and Distributed Systems
– Luttgen
- 1998
|
|
2
|
A formal denition of priority in CSP
– Fidge
- 1993
|
|
1
|
Broadcasting with priority, 5th ESOP
– Prasad
- 1994
|
|
1
|
A typed, prioritized process algebra
– Jerey
- 1993
|
|
1
|
Pre-emptive Modeling of Concurrent and Distributed Systems
– Lttgen
- 1998
|
|
