A calculus of higher order communicating systems

Thomsen, Bent

doi:10.1145/75277.75290

Cited by 115 publications

(58 citation statements)

References 16 publications

(8 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…They have been put forward in the early 1990s, with CHOCS [1], Plain CHOCS [2], the Higher-Order π-calculus [3], and others. Higher-order (or process-passing) concurrency is often presented as an alternative paradigm to the first order (or name-passing) concurrency of the π-calculus for the description of mobile systems.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

On the Expressiveness of Forwarding in Higher-Order Communication

Giusto

Pérez

Zavattaro

2009

Theoretical Aspects of Computing - ICTAC 2009

View full text Add to dashboard Cite

Abstract. In higher-order process calculi the values exchanged in communications may contain processes. There are only two capabilities for received processes: execution and forwarding. Here we propose a limited form of forwarding: output actions can only communicate the parallel composition of statically known closed processes and processes received through previously executed input actions. We study the expressiveness of a higher-order process calculus featuring this style of communication. Our main result shows that in this calculus termination is decidable while convergence is undecidable.

show abstract

Section: Introductionmentioning

confidence: 99%

“…non existence of divergent computations) and convergence (i.e. existence of a terminating computation) 1 are both undecidable. In contrast, somewhat surprisingly, strong bisimilarity is decidable, and several sensible bisimilarities in the higher-order setting coincide with it.…”

Section: Introductionmentioning

confidence: 99%

On the Expressiveness of Forwarding in Higher-Order Communication

Giusto

Pérez

Zavattaro

2009

Theoretical Aspects of Computing - ICTAC 2009

View full text Add to dashboard Cite

show abstract

“…The work on ECCS [5], perhaps the most immediate predecessor of the π-calculus, advocates static scoping of names. In contrast, the work on CHOCS [14] advocates dynamic name scoping in the context of higher-order CCS. Furthermore, the CCS variant in [10] uses statically scoped parametric definitions while the Edinburgh Concurrency Workbench tool [4] uses dynamic scoping for parametric definitions.…”

Section: Discussionmentioning

confidence: 99%

On the Expressiveness of Infinite Behavior and Name Scoping in Process Calculi

Giambiagi

Gerardo

Valencia

2004

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. In the literature there are several CCS-like process calculi differing in the constructs for the specification of infinite behavior and in the scoping rules for channel names. In this paper we study various representatives of these calculi based upon both their relative expressiveness and the decidability of divergence. We regard any two calculi as being equally expressive iff for every process in each calculus, there exists a weakly bisimilar process in the other. By providing weak bisimilarity preserving mappings among the various variants, we show that in the context of relabeling-free and finite summation calculi: (1) CCS with parameterless (or constant) definitions is equally expressive to the variant with parametric definitions. (2) The CCS variant with replication is equally expressive to that with recursive expressions and static scoping. We also state that the divergence problem is undecidable for the calculi in (1) but decidable for those in (2). We obtain this from (un)decidability results by Busi, Gabbrielli and Zavattaro, and by showing the relevant mappings to be computable and to preserve divergence and its negation. From (1) and the well-known fact that parametric definitions can replace injective relabelings, we show that injective relabelings are redundant (i.e., derived) in CCS (which has constant definitions only).

show abstract

“…This calculus, called LAL, is similar to CHOCS ( [Tho90]) and has been studied in [HK94]. It turns out that Corollary 3 also holds for LAL.…”

Section: Conclusion and Related Workmentioning

confidence: 99%

Bisimulations for Asynchronous Mobile Processes

Hansen¹,

Hüttel²,

Kleist³

1996

BRICS

View full text Add to dashboard Cite

Within the past few years there has been renewed interest in the study of value-passing process calculi as a consequence of the emergence of the π-calculus. In this paper we consider Plain LAL, a mobile process calculus which differs from the π-calculus in the sense that the communication of data values happens asynchronously. The surprising result is that in the presence of asynchrony, the open, late and early bisimulation equivalences coincide -this in contrast to the π-calculus where they are distinct. The result allows us to formulate a common equational theory which is sound and complete for finite terms of Plain LAL.

show abstract

A calculus of higher order communicating systems

Cited by 115 publications

References 16 publications

On the Expressiveness of Forwarding in Higher-Order Communication

On the Expressiveness of Forwarding in Higher-Order Communication

On the Expressiveness of Infinite Behavior and Name Scoping in Process Calculi

Bisimulations for Asynchronous Mobile Processes

Contact Info

Product

Resources

About