Process Calculus

2001 ◽  
pp. 11-36 ◽  
Author(s):  
Mingsheng Ying
Keyword(s):  
Author(s):  
Naoki Kobayashi ◽  
Shin Saito ◽  
Eijiro Sumii

2002 ◽  
Vol 66 (3) ◽  
pp. 145-169 ◽  
Author(s):  
Florence Germain ◽  
Marc Lacoste ◽  
Jean-Bernard Stefani

Author(s):  
Uwe Nestmann ◽  
Rachele Fuzzati ◽  
Massimo Merro
Keyword(s):  

2007 ◽  
Vol 7 (1-2) ◽  
pp. 123-151 ◽  
Author(s):  
IVAN LANESE ◽  
UGO MONTANARI

AbstractIn this paper we compare three different formalisms that can be used in the area of models for distributed, concurrent and mobile systems. In particular we analyze the relationships between a process calculus, the Fusion Calculus, graph transformations in the Synchronized Hyperedge Replacement with Hoare synchronization (HSHR) approach and logic programming. We present a translation from Fusion Calculus into HSHR (whereas Fusion Calculus uses Milner synchronization) and prove a correspondence between the reduction semantics of Fusion Calculus and HSHR transitions. We also present a mapping from HSHR into a transactional version of logic programming and prove that there is a full correspondence between the two formalisms. The resulting mapping from Fusion Calculus to logic programming is interesting since it shows the tight analogies between the two formalisms, in particular for handling name generation and mobility. The intermediate step in terms of HSHR is convenient since graph transformations allow for multiple, remote synchronizations, as required by Fusion Calculus semantics.


2009 ◽  
Vol 19 (5) ◽  
pp. 959-1027 ◽  
Author(s):  
MATTHEW COLLINSON ◽  
DAVID PYM

Mathematical modelling is one of the fundamental tools of science and engineering. Very often, models are required to be executable, as a simulation, on a computer. In this paper, we present some contributions to the process-theoretic and logical foundations of discrete-event modelling with resources and processes. We present a process calculus with an explicit representation of resources in which processes and resources co-evolve. The calculus is closely connected to a logic that may be used as a specification language for properties of models. The logic is strong enough to allow requirements that a system has a certain structure: for example, that it is a parallel composite of subsystems. This work consolidates, extends and improves upon aspects of earlier work of ours in this area. An extended example, consisting of a semantics for a simple parallel programming language, indicates a connection with separating logics for concurrency.


Sign in / Sign up

Export Citation Format

Share Document