Generative communication in Linda
From MaRDI portal
Recommendations
Cited in
(88)- Comparing communication primitives via their relative expressive power
- Dynamic management of capabilities in a network aware coordination language
- LMNtal as a hierarchical logic programming language
- NetWorkSpace: A coordination system for high-productivity environments
- The probe: An addition to communication primitives
- A process algebraic view of Linda coordination primitives
- Refining multiset transformers
- Entailment-based actions for coordination
- An implementation of Linda for a NUMA machine
- Messages versus messengers in distributed programming
- Distributed programming with logic tuple spaces
- Fairness in shared invocation servicing
- New architectures for constructed complex systems
- A transition system semantics for the control-driven coordination language MANIFOLD
- Comparing three semantics for Linda-like languages
- Types for access control
- Linda-based applicative and imperative process algebras
- Towards an integration science. The influence of Richard Bellman on our research.
- A semantic theory of the Internet of Things
- Semantic models of a timed distributed dataspace architecture
- A coordination approach to mobile components
- On the expressiveness of Linda coordination primitives.
- Trace and testing equivalence on asynchronous processes
- ALua: Flexibility for parallel programming
- Expired data collection in shared dataspaces.
- Abstractions for fault-tolerant global computing
- Efficient exhaustive listings of reversible one dimensional cellular automata
- Asynchronous communication model based on linear logic
- Architectural CCS
- Process calculi as a tool for studying coordination, contracts and session types
- On the expressiveness of multiplicities in data-based coordination languages
- From distributed coordination to field calculus and aggregate computing
- Expressiveness of concurrent intensionality
- A formal approach to the engineering of domain-specific distributed systems
- Basic observables for a calculus for global computing
- On the collective sort problem for distributed tuple spaces
- Combining metaheuristics and exact methods for solving exactly multi-objective problems on the grid
- A process algebraic view of shared dataspace coordination
- On the expressive power of \textsc{Klaim}-based calculi
- New and improved: Linda in Java
- The seal calculus
- MOMI: a calculus for mobile mixins
- Quantitative information in the tuple space coordination model
- Implementing set objects in dynamic distributed systems
- A sorted semantic framework for applied process calculi (extended abstract)
- Comparative analysis of the expressiveness of shared dataspace coordination
- Defining actions in concurrent declarative programming
- Structuring operational semantics: simplification and computation
- Comparing three coordination models: Reo, ARC, and RRD
- Coordination models Orc and Reo compared
- Synchrony vs asynchrony in communication primitives
- Parallel-distributed programming tool for the Linda programming model
- On the expressiveness of symmetric communication
- Event-Based Service Coordination
- The Calculus of Handshake Configurations
- Joyce—A programming language for distributed systems
- scientific article; zbMATH DE number 1231686 (Why is no real title available?)
- Symbolic execution of Reo circuits using constraint automata
- A model of context-dependent component connectors
- On Byzantine generals with alternative plans
- scientific article; zbMATH DE number 1790374 (Why is no real title available?)
- Logic programming as a service
- A higher-order calculus of computational fields
- scientific article; zbMATH DE number 2087416 (Why is no real title available?)
- A ground-complete axiomatization of stateless bisimilarity over Linda
- Wide-area parallel programming using the remote method invocation model
- Formal \textsf{ReSpecT}
- The inhibition spectrum and the achievement of causal consistency
- Causal-consistent rollback in a tuple-based language
- The ARC programming model -- language constructs for coordination
- Coordinating asynchronous and open distributed systems under semiring-based timing constraints
- Programming autonomic systems with multiple constraint stores
- Channel-based coordination via constraint satisfaction
- Multiple-Labelled Transition Systems for nominal calculi and their logics
- Full Abstraction for Linda
- A principled exploration of coordination models
- Blackboard relations in the \(\mu\text{Log}\) coordination model
- Comparing three coordination models: Reo, ARC, and PBRD
- simpA: an agent-oriented approach for programming concurrent applications on top of Java
- Linear constraint systems as high-level nets
- Algebraic specification of agent computation
- An algebraic approach for modelling organisation, roles and contexts in MAS
- A decentralized computational infrastructure for Grid-based parallel asynchronous iterative applications
- Service oriented computing from a process algebraic perspective
- Towards a process calculus for REST: current state of the art
- From flow logic to static type systems for coordination languages
- Providing data confidentiality against malicious hosts in shared data spaces
- Event based choreography
This page was built for publication: Generative communication in Linda
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5184391)
