论文信息 - An Algebraic Specification of Process Algebra, Including Two Examples

An Algebraic Specification of Process Algebra, Including Two Examples

A study is made of the possibilities to describe process algebra as an algebraic specification. Two examples from the field of the specification of communication protocols are discussed to analyse the adequacy of this approach in practical situations.

Sjouke Mauw | S. Mauw

[1] Hartmut Ehrig,et al. Fundamentals of Algebraic Specification 1 , 1985, EATCS Monographs on Theoretical Computer Science.

[2] Jan A. Bergstra,et al. Put and get, primitives for synchronous unreliable message passing , 1985 .

[3] Jan A. Bergstra,et al. Conditional Rewrite Rules: Confluence and Termination , 1986, J. Comput. Syst. Sci..

[4] Hartmut Ehrig,et al. ACT ONE - An Algebraic Specification Language with two Levels of Semantics , 1983, ADT.

[5] Jan A. Bergstra,et al. Algebra of Communicating Processes with Abstraction , 1985, Theor. Comput. Sci..

[6] Jan A. Bergstra,et al. Process Algebra for Synchronous Communication , 1984, Inf. Control..

[7] Robin Milner,et al. A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[8] Jan A. Bergstra,et al. On the Consistency of Koomen's Fair Abstraction Rule , 1987, Theor. Comput. Sci..

[9] Jan A. Bergstra,et al. Syntax and defining equations for an interrupt mechanism in process algebra , 1985 .

[10] C. A. R. Hoare,et al. Communicating Sequential Processes (Reprint) , 1983, Commun. ACM.

[11] Paul Klint,et al. Algebraic definition of a simple programming language , 1985 .