论文信息 - A Note on Expressiveness of Process Algebra

A Note on Expressiveness of Process Algebra

We extend the work of Baeten, Bergstra & Klop by showing that every recursively enumerable transition system can be expressed in process algebra up to weak bisimulation.

Iain Phillips | I. Phillips

[1] Robert de Simone,et al. Higher-Level Synchronising Devices in Meije-SCCS , 1985, Theor. Comput. Sci..

[2] Robin Milner,et al. Communication and concurrency , 1989, PHI Series in computer science.

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

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

[5] Frits W. Vaandrager,et al. Expressiveness results for process algebras , 1993 .

[6] C. A. R. Hoare,et al. Communicating sequential processes , 1978, CACM.

[7] Frits W. Vaandrager,et al. Expressive Results for Process Algebras , 1992, REX Workshop.