Modular specifications in process algebra
In recent years a wide variety of process algebras has been proposed in the literature. Often these process algebras are closely related: they can be viewed as homomorphic images, submodels or restrictions of each other. The aim of this paper is to show how the semantical reality, consisting of a large number of closely related process algebras, can be reflected, and even used, on the level of algebraic specifications and in process verifications. This is done by means of the notion of a module. The simplest modules are building blocks of operators and axioms, each block describing a feature of concurrency in a certain semantical setting. These modules can then be combined by means of a union operator +, an export operator □, allowing to forget some operators in a module, an operator H, changing semantics by taking homomorphic images, and an operator S which takes subalgebras. These operators enable us to combine modules in a subtle way, when the direct combination would be inconsistent. We show how auxiliary process algebra operators can be hidden when this is needed. Moreover it is demonstrated how new process combinators can be defined in terms of the more elementary ones in a clean way. As an illustration of our approach, a methodology is presented that can be used to specify FIFO-queues, and that facilitates verification of concurrent systems containing these queues.
|Keywords||Chaining operator, Communication protocols, Concurrency, Export operator, FIFO-queues, Homomorphism operator, Modular algebraic specifications, Process algebra, Subalgebra operator, Union of modules|
van Glabbeek, R.J, & Vaandrager, F.W. (1987). Modular specifications in process algebra. In Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence (pp. 465–506). doi:10.1007/BFb0015049