Hostname: page-component-8448b6f56d-tj2md Total loading time: 0 Render date: 2024-04-23T06:19:26.741Z Has data issue: false hasContentIssue false

Elementary structures in process theory (1): Sets with renaming

Published online by Cambridge University Press:  10 November 2000

KOHEI HONDA
Affiliation:
Department of Computer Science, Queen Mary and Westfield College, University of London, E1 4NS, London, U.K.

Abstract

We study a general algebraic framework that underlies a wide range of computational formalisms that use the notion of names, notably process calculi. The algebraic framework gives a rigorous basis for describing and reasoning about processes semantically, as well as offering new insights into existing constructions. The formal status of the theory is elucidated by introducing its alternative presentation, which is geometric in nature and is based on explicit manipulation of connections among nameless processes. Nameless processes and their relational theory form a coherent universe in their own right, which underlies existing graphical formalisms such as proof nets. We establish the formal equivalence between these two presentations, and illustrate how they can be used complementarily for the precise and effective description of diverse algebras and the dynamics of processes through examples.

Type
Research Article
Copyright
2000 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)