A process algebraic view of Linda coordination primitives

Busi, Nadia; Gorrieri, Roberto; Zavattaro, Gianluigi

doi:10.1016/s0304-3975(97)00149-7

Cited by 70 publications

(49 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The calculus that we consider in this paper is an abstract formalization of several existing concurrent languages based on the blackboard model, e.g., [5,15,9,21]. The calculus is equipped with two basic operations out(a) and in(a) for adding and removing a message from a common global store.…”

Section: An Asynchronous Process Algebramentioning

confidence: 99%

Compositional Verification of Asynchronous Processes via Constraint Solving

Delzanno

Gabbrielli

2005

Automata, Languages and Programming

View full text Add to dashboard Cite

Abstract. In this paper we investigate the foundations of a constraintbased compositional verification method for infinite-state systems. We first consider an asynchronous process calculus which is an abstract formalization of several existing languages based on the blackboard model. For this calculus we define a contraint-based symbolic representation of a compositional model based on traces. The constraint system we use combines formulas of integer arithmetics with equalities over uninterpreted function symbols in which satisfiability is decidable. The translation is inductively defined via a CLP program. Execution traces of a process can be compositionally obtained from the solutions of the answer constraints of the CLP encoding. This way, the task of compositional verification can be reduced to constraint computing and solving.

show abstract

Section: An Asynchronous Process Algebramentioning

confidence: 99%

Compositional Verification of Asynchronous Processes via Constraint Solving

Delzanno

Gabbrielli

2005

Automata, Languages and Programming

View full text Add to dashboard Cite

show abstract

“…The main difference between our formalism and the π-calculus is the use of generative communication operations instead of channel-based primitives. The idea of embedding a Linda-like language in a process calculus has been explored in depth in previous work (Busi et al 1998;DeNicola and Pugliese 1996). The advantages of this approach is that the semantics is self-contained, simple and enjoys broad acceptance.…”

Section: The Lime Calculusmentioning

confidence: 99%

Coordination and mobility in CoreLime

Cărbunar¹,

Valente

Vítek³

2004

Math. Struct. Comp. Sci.

View full text Add to dashboard Cite

The choice of suitable high-level communication primitives for wide area network programming languages remains an open problem. This paper is driven by the practical consideration of providing an efficient and secure communication infrastructure for mobile agent systems. This has led us to formalise the Lime coordination middleware and propose a simplified model, which we call CoreLime, that addresses some of the main shortcomings of Lime while retaining its distinguishing feature, namely transient sharing of tuple spaces. We further discuss a prototype implementation along with security extensions. Our contribution is thus an exploration of the language design space rather than a theoretical investigation of properties of these models.

show abstract

“…The relevant fragment of the textual grammar of MSCs is reproduced in Table 2. 3 The grammar contains the following undefined non-terminals:…”

Section: Message Sequence Chart Documentsmentioning

confidence: 99%

“…Message pools will be used for the modelling of the asynchronous communication of MSCs using the synchronous communication of C Msa. Message pools are inspired by the modelling of asynchronous communication in of coordination languages; see, e.g., [3]. A message pool is used to buffer the sent but not yet received messages.…”

Section: The Process Algebra Cmscmentioning

confidence: 99%

An Algebraic Semantics for Message Sequence Chart Documents

Gehrke

Huhn

Rensink

et al. 1998

IFIP Advances in Information and Communication Technology

View full text Add to dashboard Cite

Message Sequence Charts (MSCs) are a graphical and textual language for the specification of message passing systems, in particular telecommunication systems. MSCs are standardised by the Internal Telecommunication Union in standard Z.120. Included in the standard is a formal semantics for MSCs by means of a process algebra. This semantics covers the complete language of single MSCs but lacks an interpretation for conditions which are used as continuation points of MSCs within an MSC document (a collection of MSCs). In this paper, we give a process algebraic semantics for basic MSCs including conditions, enabling the formal interpretation of entire MSC documents.

show abstract

A process algebraic view of Linda coordination primitives

Cited by 70 publications

References 5 publications

Compositional Verification of Asynchronous Processes via Constraint Solving

Compositional Verification of Asynchronous Processes via Constraint Solving

Coordination and mobility in CoreLime

An Algebraic Semantics for Message Sequence Chart Documents

Contact Info

Product

Resources

About