A calculus of mobile processes, II

Milner, Robin; Parrow, Joachim; Walker, David

doi:10.1016/0890-5401(92)90009-5

Cited by 970 publications

(853 citation statements)

References 1 publication

Supporting

Mentioning

843

Contrasting

Unclassified

Order By: Relevance

“…In process calculi where broadcasting is the basic primitive for communication like CSP [12] and bπ-calculus [19], broadcasting on a private channel is equal to performing an internal action and no other process can observe the broadcast except the one that performed it.…”

Section: Operational Semantics Of Systemmentioning

confidence: 99%

See 1 more Smart Citation

On the Power of Attribute-Based Communication

Alrahman

Nicola

Loreti

2016

Formal Techniques for Distributed Objects, Components, and Systems

View full text Add to dashboard Cite

Abstract. In open systems, i.e. systems operating in an environment that they cannot control and with components that may join or leave, behaviors can arise as side effects of intensive components interaction. Finding ways to understand and design these systems and, most of all, to model the interactions of their components, is a difficult but important endeavor. To tackle these issues, we present AbC , a calculus for attributebased communication. An AbC system consists of a set of parallel agents each of which is equipped with a set of attributes. Communication takes place in an implicit multicast fashion, and interactions among agents are dynamically established by taking into account "connections" as determined by predicates over the attributes of agents. First, the syntax and the semantics of the calculus are presented, then expressiveness and effectiveness of AbC are demonstrated both in terms of modeling scenarios featuring collaboration, reconfiguration, and adaptation and of the possibility of encoding channel-based interactions and other interaction patterns. Behavioral equivalences for AbC are introduced for establishing formal relationships between different descriptions of the same system.

show abstract

Section: Operational Semantics Of Systemmentioning

confidence: 99%

“…Some of the well-known approaches include: channel-based models [17,12,19], group-based models [1,4,13], and publish/subscribe models [3,10].…”

Section: Introductionmentioning

confidence: 99%

On the Power of Attribute-Based Communication

Alrahman

Nicola

Loreti

2016

Formal Techniques for Distributed Objects, Components, and Systems

View full text Add to dashboard Cite

show abstract

“…This is certainly the case for foundational calculi like pi-calculus [5,6] and Fusion [10], but the relevance of name binding extends also to languages like Biztalk [4] and Highwire [3], oriented towards web services. Fusion extends the pi-calculus by introducing fusions, i.e.…”

Section: Introductionmentioning

confidence: 99%

A General Name Binding Mechanism

Boreale

Buscemi

Montanari

2005

Trustworthy Global Computing

View full text Add to dashboard Cite

Abstract. We study fusion and binding mechanisms in name passing process calculi. To this purpose, we introduce the U-Calculus, a process calculus with no I/O polarities and a unique form of binding. The latter can be used both to control the scope of fusions and to handle new name generation. This is achieved by means of a simple form of typing: each bound name x is annotated with a set of exceptions, that is names that cannot be fused to x. The new calculus is proven to be more expressive than pi-calculus and Fusion calculus separately. In U-Calculus, the syntactic nesting of name binders has a semantic meaning, which cannot be overcome by the ordering of name extrusions at runtime. Thanks to this mixture of static and dynamic ordering of names, U-Calculus admits a form of labelled bisimulation which is a congruence. This property yields a substantial improvement with respect to previous proposals by the same authors aimed at unifying the above two languages. The additional expressiveness of U-Calculus is also explored by providing a uniform encoding of mixed guarded choice into the choice-free sub-calculus.

show abstract

“…We focus on an abstract system description language called D [HR02b], an extension of the well-known  [MPW92,SW01]. In this language a system consists of a collection of processes, or agents, distributed among different sites, where they can use local resources; these resources are modelled using local versions of - communication channels.…”

Section: Introductionmentioning

confidence: 99%

Proof Methodologies for Behavioural Equivalence in Dpi

Ciaffaglione

Hennessy

Rathke

2005

Formal Techniques for Networked and Distributed Systems - FORTE 2005

View full text Add to dashboard Cite

Abstract. We focus on techniques for proving behavioural equivalence between systems in D, a distributed version of the  in which processes may migrate between dynamically created locations, and where resource access policies are implemented by means of capability types. We devise a tractable collection of auxiliary proof methods, relying mainly on the use of bisimulations up-to β-reductions, which considerably relieve the burden of exhibiting witness bisimulations. Using such methods we model simple distributed protocols, such as crossing a firewall, a server and its clients, metaservers installing memory services, and address their correctness in a relatively simple manner.

show abstract

A calculus of mobile processes, II

Abstract: This is the second of two papers in which we present the x-calculus, a calculus of mobile processes. We provide a detailed presentation of some of the theory of the calculus developed to date, and in particular we establish most of the results stated in the companion paper. k?

Cited by 970 publications

References 1 publication

On the Power of Attribute-Based Communication

On the Power of Attribute-Based Communication

A General Name Binding Mechanism

Proof Methodologies for Behavioural Equivalence in Dpi

Contact Info

Product

Resources

About