A process algebraic view of Linda coordination primitives
From MaRDI portal
Publication:1127512
DOI10.1016/S0304-3975(97)00149-7zbMath0895.68016MaRDI QIDQ1127512
Roberto Gorrieri, Nadia Busi, Gianluigi Zavattaro
Publication date: 13 August 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items
A ground-complete axiomatization of stateless bisimilarity over Linda, On the expressiveness of multiplicities in data-based coordination languages, A process algebraic view of shared dataspace coordination, Comparing communication primitives via their relative expressive power, Full Abstraction for Linda, Nadia Busi's publications, A transition system semantics for the control-driven coordination language MANIFOLD, Comparing three semantics for Linda-like languages, On the expressiveness of Linda coordination primitives., Trace and testing equivalence on asynchronous processes, Synchrony vs Asynchrony in Communication Primitives
Uses Software
Cites Work
- Transition system specifications with negative premises
- Finite representations of CCS and TCSP programs by automata and Petri nets
- A calculus of mobile processes. II
- Testing equivalences for processes
- On the semantics of the call-by-name CPS transform
- Generative communication in Linda
- Barbed bisimulation
- Computability of Recursive Functions
- On bisimulations for the asynchronous π-calculus
- Unnamed Item
- Unnamed Item
