From data structure to process structure

Abstract

This paper deals with transformations in a process algebraic formalism that has been extended with an abstract data type language. We show how for a well-known class of processes (bags, queues, stacks, etc.) descriptions in terms of simple process definitions and complex state parameters can be transformed in a stepwise fashion into equivalent systems of interacting processes with state parameters of reduced complexity. The key to the solution are so-called context equations.