scholarly journals Syntax and Defining Equations for an Interrupt Mechanism in Process Algebra1

1986 ◽  
Vol 9 (2) ◽  
pp. 127-167
Author(s):  
J.C.M. Baeten ◽  
J.A. Bergstra ◽  
J.W. Klop

A mechanism is introduced to describe priorities in ACP, the algebra of communicating processes, whereby some actions have priority over others in a non-deterministic choice (or sum). This mechanism can be used to model the working of interrupts in a distributed system. This is illustrated in an extensive example.

1988 ◽  
Vol 17 (6) ◽  
pp. 1134-1177 ◽  
Author(s):  
J. A. Bergstra ◽  
J. W. Klop ◽  
E.-R. Olderog

2021 ◽  
Vol 179 (4) ◽  
pp. 321-344
Author(s):  
J.A. Bergstra ◽  
C.A. Middelburg

This paper concerns the relation between process algebra and Hoare logic. We investigate the question whether and how a Hoare logic can be used for reasoning about how data change in the course of a process when reasoning equationally about that process. We introduce an extension of ACP (Algebra of Communicating Processes) with features that are relevant to processes in which data are involved, present a Hoare logic for the processes considered in this process algebra, and discuss the use of this Hoare logic as a complement to pure equational reasoning with the equational axioms of the process algebra.


2011 ◽  
Vol 1 (10) ◽  
pp. 81-82
Author(s):  
Chhaya Nayak ◽  
◽  
Deepak Tomar

Sign in / Sign up

Export Citation Format

Share Document