Adding action refinement to a finite process algebra (Q4036589)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 176759
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Adding action refinement to a finite process algebra |
scientific article; zbMATH DE number 176759 |
Statements
18 May 1993
0 references
action refinement
0 references
specification languages for concurrent systems
0 references
process algebra
0 references
0.9110930562019348
0 references
0.8796119093894958
0 references
Adding action refinement to a finite process algebra (English)
0 references
[For the entire collection see Zbl 0753.00027.] ``Action refinement occurs naturally when developing specifications for processes or systems. Process algebras have been developed as prototype specification languages for concurrent systems, see \textit{R. Milner} [Communication and Concurrency, Prentice Hall (1989; Zbl 0683.68008)], {C. A. R. Hoare} [Communicating sequential processes, Prentice Hall (1985; Zbl 0637.68007)], \textit{J. A. Bergstra} and \textit{J. W. Klop} [Theor. Comput. Sci. 37, 77-121 (1985; Zbl 0579.68016)] but, as it has been pointed out by \textit{L. Aceto} and \textit{H. Hennessy} [Logic in computer science, Proc. 4th Annual Symp., Pacific Grove/CA (USA) 1989, 138-145 (1989; Zbl 0716.68034)], they do not support this mechanism of action refinement. The object of this paper is to develop a reasonable process algebra which incorporates such a refinement operator and to suggest a suitable notion of semantic equivalence for specifications written in this process algebra. It should be viewed as a contribution to the theoretical foundations of process algebras which may eventually enable their use as the basis of formal specification methodologies which support action refinement''.
0 references