Sciweavers

88 search results - page 3 / 18
» Matching Systems for Concurrent Calculi
Sort
View
COORDINATION
2004
Springer
15 years 2 months ago
On Calculi for Context-Aware Coordination
Abstract. Modern distributed computing demands unprecedented levels of dynamicity and reconfiguration. Mobile computing, peer-to-peer networks, computational grids, multiagent sys...
Pietro Braione, Gian Pietro Picco
IFM
2010
Springer
113views Formal Methods» more  IFM 2010»
14 years 8 months ago
Translating Pi-Calculus into LOTOS NT
Process calculi supporting mobile communication, such as the π-calculus, are often seen as an evolution of classical value-passing calculi, in which communication between processe...
Radu Mateescu, Gwen Salaün
ICTCS
2001
Springer
15 years 1 months ago
Subtyping and Matching for Mobile Objects
In [BCC00], we presented a general framework for extending calculi of mobile agents with object-oriented features, and we studied a typed instance of that model based on Cardelli a...
Michele Bugliesi, Giuseppe Castagna, Silvia Crafa
IANDC
2006
121views more  IANDC 2006»
14 years 9 months ago
Comparing operational models of name-passing process calculi
We study three operational models of name-passing process calculi: coalgebras on (pre)sheaves, indexed labelled transition systems, and history dependent automata. The coalgebraic...
Marcelo P. Fiore, Sam Staton
CONCUR
2006
Springer
15 years 1 months ago
Concurrent Rewriting for Graphs with Equivalences
Several applications of graph rewriting systems (notably, some encodings of calculi with name passing) require rules which, besides deleting and generating graph items, are able to...
Paolo Baldan, Fabio Gadducci, Ugo Montanari