A semantics theory for global computing systems

Abstract

We introduce cKlaim, a process calculus that can be thought of as a variant of the pi-calculus with process distribution, process mobility and asynchronous communication through distributed repositories. Upon it, we develop a semantic theory to reason about programs. More precisely, we introduce a natural contextually defined behavioural semantics, give a coinductive characterization in terms of a labelled bisimulation and illustrate some significant laws. Then, we smoothly tune the theory to model two more concrete settings obtained by explicitly considering failures and node connections, two low-level features that in real life can affect the underlying network infrastructure and, hence, the ability of processes to perform remote operations.

@Unpublished\{gorla.pugliese:semantics-theory-global-computing, author = \{D. Gorla and R. Pugliese}, title = \{A semantics theory for global computing systems}, year = \{2004}, url = \{http://mikado.di.fc.ul.pt/repository/gorla.pugliese_semantics-theory-global-computing.pdf} }

About this site. Last modified: Wed Sep 20 22:02:33 CEST 2017