Results 1  10
of
36
The Mcalculus: A HigherOrder Distributed Process Calculus
, 2003
"... This paper presents a new distributed process calculus, called the Mcalculus, that can be understood as a higherorder version of the Distributed Join calculus with programmable localities. The calculus retains the implementable character of the Distributed Join calculus while overcoming several im ..."
Abstract

Cited by 57 (5 self)
 Add to MetaCart
This paper presents a new distributed process calculus, called the Mcalculus, that can be understood as a higherorder version of the Distributed Join calculus with programmable localities. The calculus retains the implementable character of the Distributed Join calculus while overcoming several important limitations: insufficient control over communication and mobility, absence of dynamic binding, and limited locality semantics. The calculus is equipped with a polymorphic type system that guarantees the unicity of locality names, even in presence of higherorder communications a crucial propertyfor the determinacy of message routing in the calculus.
The Kell calculus: operational semantics and type system
 FMOODS, Lecture Notes in Computer Science 2884 (2003
, 2003
"... This paper presents the Kell calculus, a new distributed process calculus that retains the original insights of the Seal calculus (local actions, process replication) and of the Mcalculus (higherorder processes and programmable membranes), although in a much simpler setting than the latter. The c ..."
Abstract

Cited by 23 (1 self)
 Add to MetaCart
This paper presents the Kell calculus, a new distributed process calculus that retains the original insights of the Seal calculus (local actions, process replication) and of the Mcalculus (higherorder processes and programmable membranes), although in a much simpler setting than the latter. The calculus is equipped with a type system that enforces a unicity property for location names that is crucial for the efficient implementation of the calculus. 1
PolyA: True type polymorphism for Mobile Ambients
, 2004
"... Previous type systems for mobility calculi (the original Mobile Ambients, its variants and descendants, e.g., Boxed Ambients and Safe Ambients, and other related systems) offer little support for generic mobile agents. Previous systems either do not handle communication at all or globally assign fix ..."
Abstract

Cited by 14 (4 self)
 Add to MetaCart
(Show Context)
Previous type systems for mobility calculi (the original Mobile Ambients, its variants and descendants, e.g., Boxed Ambients and Safe Ambients, and other related systems) offer little support for generic mobile agents. Previous systems either do not handle communication at all or globally assign fixed communication types to ambient names that do not change as an ambient moves around or interacts with other ambients. This makes it hard to type examples such as a messenger ambient that uses communication primitives to collect a message of nonpredetermined type and deliver it to a nonpredetermined destination. In contrast, we present our new type system PolyA. Instead of assigning communication types to ambient names, PolyA assigns a type to each process P that gives upper bounds on (1) the possible ambient nesting shapes of any process P ′ to which P can evolve, (2) the values that may be communicated at each location, and (3) the capabilities that can be used at each location. Because PolyA can type generic mobile agents, we believe PolyA is the first type system for a mobility calculus that provides type polymorphism comparable in power to polymorphic type systems for the λcalculus. PolyA is easily extended to ambient calculus variants. A restriction of PolyA has principal typings. 1
NonFunctional Aspects of Wide Area Network Programming
, 2003
"... WideArea Network (WAN) applications have become one of the most popular applications in current distributed computing. Internet and the World Wide Web are now the primary environment for designing, developing and distributing applications. This scenario imposes different programming metaphors wit ..."
Abstract

Cited by 14 (13 self)
 Add to MetaCart
(Show Context)
WideArea Network (WAN) applications have become one of the most popular applications in current distributed computing. Internet and the World Wide Web are now the primary environment for designing, developing and distributing applications. This scenario imposes different programming metaphors with respect to traditional applications. Theoretical models for formally reasoning on WAN applications must consider many crucial aspects and their mutual relationships, e.g. mobility, network awareness, security, service level agreement, etc. This dissertation attempts to formally define declarative approaches for dealing with various facets of actual WAN programming and verification issues. We propose a declarative approach based on hypergraphs that provide foundational framework for “declaring ” components ’ behaviours of a distributed system. It is exercised with two wellknown models for distributed computations as Ambient and Klaim. Moreover, we extend Klaim with constructs for specifying, at applica
A Calculus of Kells
 IN PROCEEDINGS 2ND INTERNATIONAL WORKSHOP ON FOUNDATIONS OF GLOBAL COMPUTING
, 2003
"... This paper introduces the Kell calculus, a new process calculus that retains the original insights of the Mcalculus (local actions, higherorder processes and programmable membranes) in a much simpler setting. The calculus is shown expressive enough to provide a direct encoding of several recent di ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
This paper introduces the Kell calculus, a new process calculus that retains the original insights of the Mcalculus (local actions, higherorder processes and programmable membranes) in a much simpler setting. The calculus is shown expressive enough to provide a direct encoding of several recent distributed process calculi such as Mobile Ambients and the Distributed Join calculus.
When Ambients Cannot be Opened
 In Proceedings of FoSSaCS 2003
, 2003
"... We investigate expressiveness of a fragment of the ambient calculus, a formalism for describing distributed and mobile computations. More precisely, we study expressiveness of the pure and public ambient calculus from which the has been removed, in terms of the reachability problem of the reduct ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
(Show Context)
We investigate expressiveness of a fragment of the ambient calculus, a formalism for describing distributed and mobile computations. More precisely, we study expressiveness of the pure and public ambient calculus from which the has been removed, in terms of the reachability problem of the reduction relation. Surprisingly, we show that even for this very restricted fragment, the reachability problem is not decidable. At a second step, for a slightly weaker reduction relation, we prove that reachability can be decided by reducing this problem to markings reachability for Petri nets. Finally, we show that the nameconvergence problem as well as the modelchecking problem turn out to be undecidable for both the original and the weaker reduction relation. 1
Automated analysis of security in networking systems. Ph. D. thesis proposal. Available from http://www.imm.dtu.dk/∼mib/thesis
, 2004
"... www.imm.dtu.dk ..."
(Show Context)
A Calculus of Bounded Capacities
 In ASIAN’03, number 2896 in LNCS
, 2003
"... Resource control has attracted increasing interest in foundational research on distributed systems. This paper focuses on space control and develops an analysis of space usage in the context of an ambientlike calculus with bounded capacities and weighed processes, where migration and activation ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
(Show Context)
Resource control has attracted increasing interest in foundational research on distributed systems. This paper focuses on space control and develops an analysis of space usage in the context of an ambientlike calculus with bounded capacities and weighed processes, where migration and activation require space.
Mobile Processes with Dependent Communication Types and Singleton Types for Names and Capabilities
 Kansas State University, Department of Computing
, 2002
"... There are many calculi for reasoning about concurrent communicating processes which have locations and are mobile. Examples include the original Ambient Calculus and its many variants, the Seal Calculus, the MRcalculus, the Mcalculus, etc. It is desirable to use such calculi to describe the behavi ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
(Show Context)
There are many calculi for reasoning about concurrent communicating processes which have locations and are mobile. Examples include the original Ambient Calculus and its many variants, the Seal Calculus, the MRcalculus, the Mcalculus, etc. It is desirable to use such calculi to describe the behavior of mobile agents. It seems reasonable that mobile agents should be able to follow nonpredetermined paths and to carry nonpredetermined types of data from location to location, collecting and delivering this data using communication primitives. Previous type systems for ambient calculi make this di#cult or impossible to express, because these systems (if they handle communication at all) have always globally mapped each ambient name to a type governing the type of values that can be communicated locally or with adjacent locations, and this type can not depend on where the ambient has traveled. We present a new type system PolyA where there are no global assignments of types to ambient names. Instead, the type of an ambient process P not only indicates what can be locally communicated but also gives an upper bound on the possible ambient nesting shapes of any process P # to which P can evolve, as well as the possible capabilities and names that can be exhibited or communicated at each location. Because these shapes can depend on which capabilities and names are actually communicated, the types support this with explicit dependencies on communication. PolyA is thus the first type system for an ambient calculus which provides type polymorphism of the kind that is usually present in polymorphic type systems for the #calculus. 1
A Calculus of HigherOrder Distributed Components
 RR4692, INRIA, January, 2003, http://www.inria.fr/rrrt/rr4692.html. Activity Report INRIA 2003 Miscellaneous
"... appor t de re c he rc he ..."