A process algebraic view of Linda coordination primitives
From MaRDI portal
(Redirected from Publication:1127512)
Recommendations
Cites work
- A calculus of mobile processes. II
- Barbed bisimulation
- Computability of Recursive Functions
- Finite representations of CCS and TCSP programs by automata and Petri nets
- Generative communication in Linda
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 3310089 (Why is no real title available?)
- On bisimulations for the asynchronous π-calculus
- On the semantics of the call-by-name CPS transform
- Testing equivalences for processes
- Transition system specifications with negative premises
Cited in
(14)- Comparing communication primitives via their relative expressive power
- A transition system semantics for the control-driven coordination language MANIFOLD
- Comparing three semantics for Linda-like languages
- Linda-based applicative and imperative process algebras
- On the expressiveness of Linda coordination primitives.
- Trace and testing equivalence on asynchronous processes
- On the expressiveness of multiplicities in data-based coordination languages
- A process algebraic view of shared dataspace coordination
- scientific article; zbMATH DE number 1696890 (Why is no real title available?)
- Synchrony vs asynchrony in communication primitives
- Nadia Busi's publications
- scientific article; zbMATH DE number 1231593 (Why is no real title available?)
- A ground-complete axiomatization of stateless bisimilarity over Linda
- Full Abstraction for Linda
This page was built for publication: A process algebraic view of Linda coordination primitives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1127512)