TY  - CHAP
ED  - Mossakowski, Till
ED  - Montanari, Ugo
ED  - Haveraaen, Magne
Y1  - 2007///
UR  - http://dx.doi.org/10.1007/978-3-540-73859-6_15
PB  - Springer
SN  - 978-3-540-73857-2
ID  - eprints154
A1  - Gadducci, Fabio
A1  - Lluch-Lafuente, Alberto
N2  - This paper extends our graph-based approach to the verification of spatial properties of ?-calculus specifications. The mechanism is based on an encoding for mobile calculi where each process is mapped into a graph (with interfaces) such that the denotation is fully abstract with respect to the usual structural congruence, i.e., two processes are equivalent exactly when the corresponding encodings yield isomorphic graphs. Behavioral and structural properties of ?-calculus processes expressed in a spatial logic can then be verified on the graphical encoding of a process rather than on its textual representation. In this paper we introduce a modal logic for graphs and define a translation of spatial formulae such that a process verifies a spatial formula exactly when its graphical representation verifies the translated modal graph formula.

N1  - The original publication is available at www.springerlink.com
TI  - Graphical Encoding of a Spatial Logic for the pi-Calculus
T3  - Lecture Notes in Computer Science
EP  - 225
SP  - 209
AV  - public
T2  - Algebra and Coalgebra in Computer Science (CALCO?07)
M1  - 4624
ER  -