## Mode Transfer in Process Algebra (2000)

Citations: | 15 - 2 self |

### BibTeX

@TECHREPORT{Baeten00modetransfer,

author = {J.C.M. Baeten and J.A. Bergstra},

title = {Mode Transfer in Process Algebra},

institution = {},

year = {2000}

}

### Years of Citing Articles

### OpenURL

### Abstract

This paper provides a systematic and full treatment of mode transfer operators in process algebra, including complete axiomatizations, operational rules, analysis of expressive power and extensions with timing features. In particular, we study a disrupt operator and an interrupt operator. Note: this paper is a revision and extension of [7] 1 Introduction A useful feature in programming languages and specification languages is the ability to denote mode switches. In particular, most languages have means to describe the disrupt or interrupt the normal execution of a system. Also in process algebra, various disrupt and interrupt operators have received attention, see e.g. [7], [10], [11], [3], [12]. In LOTOS (see [9]) we have the disruption operator, that is denoted [>. Another name is disabling. In this paper, we provide a systematic and full treatment of mode transfer operators in process algebra, including complete axiomatizations, operational rules, analysis of expressive power and ...

### Citations

207 |
Process Algebra
- Baeten, Weijland
- 1991
(Show Context)
Citation Context ...PA # is axiomatised by axioms A1-7 in Table 1. Omitting constant #, just having axioms A1-5, yields the process algebra BPA. More about these process algebras can be found in standard references [6], =-=[5]-=-. Now we add the mode transfer operators to this theory. Both x # y and x # y are written as the sum of two alternatives, depending whether the first action that is executed is a first action of x or ... |

156 | Real time process algebra
- Baeten, Bergstra
- 1991
(Show Context)
Citation Context ... look at extensions of the theory presented in the previous section. Especially important is the addition of timing features. First, we consider process algebra with real time in relative timing (see =-=[1]-=-). Further on, we look at discrete timing. We use the treatment and notation of [4], since it allows a smooth integration of real time and discrete time theories, and also allows separation of actions... |

74 |
Syntax and defining equations for an interrupt mechanism in process algebra
- Baeten, Bergstra, et al.
(Show Context)
Citation Context ...s have means to describe the disrupt or interrupt the normal execution of a system. Also in process algebra, various disrupt and interrupt operators have received attention, see e.g. [7], [10], [11], =-=[3]-=-, [12]. In LOTOS (see [9]) we have the disruption operator, that is denoted [>. Another name is disabling. In this paper, we provide a systematic and full treatment of mode transfer operators in proce... |

60 |
The algebra of recursively defined processes and the algebra of regular processes
- Bergstra, Klop
- 1984
(Show Context)
Citation Context ...ed from x by executing a sequence of steps. We call a process regular if its bisimulation equivalence class contains a transition system with finitely many states. It is a well-known result (see e.g. =-=[8]-=-) that a process is regular i# it can be defined by a finite linear recursive specification. Proposition 8 Consider the recursive equation X = a X # bc. Obviously, this equation is guarded. The soluti... |

54 |
A process specification formalism
- Mauw, Veltink
- 1990
(Show Context)
Citation Context ...e means to describe the disrupt or interrupt the normal execution of a system. Also in process algebra, various disrupt and interrupt operators have received attention, see e.g. [7], [10], [11], [3], =-=[12]-=-. In LOTOS (see [9]) we have the disruption operator, that is denoted [>. Another name is disabling. In this paper, we provide a systematic and full treatment of mode transfer operators in process alg... |

52 |
An operational semantics for CSP
- Plotkin
- 1983
(Show Context)
Citation Context ...= a + ba + cba while (a # b) # c = a + b (a + ca) + c (a + ba). Next, we provide a model for BPAmod on the basis of structured operational rules (socalledsSOS rules) in the style of Plotkin, see e.g. =-=[13]-=-. The rules in Table 2 define the following relations on closed BPAmod terms: binary relations . a # . and unary relations . a # # (for a # A). Intuitively, they have the following meaning: . x a # x ... |

27 | Process algebra with timing: Real time and discrete time
- Baeten, Middelburg
- 2000
(Show Context)
Citation Context ...ortant is the addition of timing features. First, we consider process algebra with real time in relative timing (see [1]). Further on, we look at discrete timing. We use the treatment and notation of =-=[4]-=-, since it allows a smooth integration of real time and discrete time theories, and also allows separation of actions and timing information. The framework of [4] allows for an integrated treatment of... |

9 |
A mode transfer operator in process algebra
- BERGSTRA
- 1988
(Show Context)
Citation Context ...rational rules, analysis of expressive power and extensions with timing features. In particular, we study a disrupt operator and an interrupt operator. Note: this paper is a revision and extension of =-=[7]-=- 1 Introduction A useful feature in programming languages and specification languages is the ability to denote mode switches. In particular, most languages have means to describe the disrupt or interr... |

6 |
Recursive process definitions with the state operator, Theoret
- Baeten, Bergstra
- 1991
(Show Context)
Citation Context ... process, e.g. defined by the pair of equations C = a D C, D = b + a D D. Then the process P = C # c is not recursively definable over BPA # . Proof This goes exactly like the proof of theorem 3.9 in =-=[2]-=- (only a little simpler).sThis proposition hinges on the fact that the process that is disrupting, i.e. c, terminates. For, the next proposition tells us, that if the disrupting process cannot termina... |

4 |
New features in PSF I: Interrupts, disrupts, and priorities
- Diertens
- 1994
(Show Context)
Citation Context ...ost languages have means to describe the disrupt or interrupt the normal execution of a system. Also in process algebra, various disrupt and interrupt operators have received attention, see e.g. [7], =-=[10]-=-, [11], [3], [12]. In LOTOS (see [9]) we have the disruption operator, that is denoted [>. Another name is disabling. In this paper, we provide a systematic and full treatment of mode transfer operato... |

2 |
Interrupt and disrupt in MSC. possibilities and problems
- Cobben
- 1998
(Show Context)
Citation Context ...nguages have means to describe the disrupt or interrupt the normal execution of a system. Also in process algebra, various disrupt and interrupt operators have received attention, see e.g. [7], [10], =-=[11]-=-, [3], [12]. In LOTOS (see [9]) we have the disruption operator, that is denoted [>. Another name is disabling. In this paper, we provide a systematic and full treatment of mode transfer operators in ... |