Constructing programs or processes

S.V. Reeves and D. Streader

2005 (December)

Working Paper No. 09/2005

Abstract

We define interacting sequential programs, motivated originally by constructivist considerations. We use them to investigate notions of implementation and determinism. Process algebras do not define what can be implemented and what cannot. As we demonstrate it is problematic to do so on the set of all processes. Guided by constructivist notions we have constructed interacting sequential programs which we claim can be readily implemented and are a subset of processes.

Keywords: Process algebra, determinism, cause, refinement, constructive

http://www.cs.waikato.ac.nz/pubs/wp/2005/uow-cs-wp-2005-09.pdf