scientific article; zbMATH DE number 1231593

MaRDI QIDQ4222913zbMATH OpenFDO

Authors Nadia Busi, Roberto Gorrieri, Gianluigi Zavattaro

Publication date 21 December 1998

Full work available at URL http://www.elsevier.com/cas/tree/store/tcs/free/noncas/pc/volume7.htm#busi

zbMATH Keywords

process algebra

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• On the expressiveness of Linda coordination primitives.
• Comparing three semantics for Linda-like languages
• A process algebraic view of Linda coordination primitives
• Linda-based applicative and imperative process algebras
• scientific article; zbMATH DE number 1696890

Cited in

(7)

• On the expressiveness of multiplicities in data-based coordination languages
• Process calculi as a tool for studying coordination, contracts and session types
• What is a ``good encoding of guarded choice?
• Comparing three semantics for Linda-like languages
• Replacement freeness: a criterion for separating process calculi
• On the expressiveness of Linda coordination primitives.
• A constructive proof of the soundness of the encoding of random access machines in a Linda calculus with ordered semantics.

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4222913)