Linda

swMATH9427MaRDI QIDQ21410FDOQ21410

Author name not available (Why is that?)

Cited In (76)

• On the expressiveness of multiplicities in data-based coordination languages
• Process calculi as a tool for studying coordination, contracts and session types
• The Calculus of Handshake Configurations
• MOMI: a calculus for mobile mixins
• A process algebraic view of shared dataspace coordination
• From distributed coordination to field calculus and aggregate computing
• Programming Autonomic Systems with Multiple Constraint Stores
• Comparative analysis of the expressiveness of shared dataspace coordination
• Asynchronous communication model based on linear logic
• On the collective sort problem for distributed tuple spaces
• Combining metaheuristics and exact methods for solving exactly multi-objective problems on the grid
• Coordinating Asynchronous and Open Distributed Systems under Semiring-Based Timing Constraints
• The inhibition spectrum and the achievement of causal consistency
• Expressiveness of concurrent intensionality
• Blackboard relations in the \(\mu\text{Log}\) coordination model
• The ARC Programming Model – Language Constructs for Coordination
• Defining actions in concurrent declarative programming
• Title not available (Why is that?)
• Fairness in shared invocation servicing
• New architectures for constructed complex systems
• Providing data confidentiality against malicious hosts in shared data spaces
• Generative communication in Linda
• Implementing set objects in dynamic distributed systems
• Expired data collection in shared dataspaces.
• Channel-based coordination via constraint satisfaction
• Entailment-based actions for coordination
• Formal ReSpecT
• A principled exploration of coordination models
• Algebraic specification of agent computation
• Abstractions for fault-tolerant global computing
• Event based choreography
• A decentralized computational infrastructure for Grid-based parallel asynchronous iterative applications
• The seal calculus
• Coordination models Orc and Reo compared
• Service oriented computing from a process algebraic perspective
• On the expressive power of \textsc{Klaim}-based calculi
• Case studies in asynchronous data parallelism
• Symbolic execution of Reo circuits using constraint automata
• A model of context-dependent component connectors
• On Byzantine generals with alternative plans
• Efficient exhaustive listings of reversible one dimensional cellular automata
• Refining multiset transformers
• Semantic models of a timed distributed dataspace architecture
• From flow logic to static type systems for coordination languages
• A coordination approach to mobile components
• Logic programming as a service
• Structuring operational semantics: simplification and computation
• Basic observables for a calculus for global computing
• Comparing three semantics for Linda-like languages
• Trace and testing equivalence on asynchronous processes
• The Linda alternative to message-passing systems
• Distributed programming with logic tuple spaces
• Dynamic management of capabilities in a network aware coordination language
• A ground-complete axiomatization of stateless bisimilarity over Linda
• Towards a process calculus for REST: current state of the art
• simpA: an agent-oriented approach for programming concurrent applications on top of Java
• On the expressiveness of Linda coordination primitives.
• NetWorkSpace: A coordination system for high-productivity environments
• Quantitative information in the tuple space coordination model
• A Sorted Semantic Framework for Applied Process Calculi (Extended Abstract)
• LMNtal as a hierarchical logic programming language
• On the Expressiveness of Symmetric Communication
• A calculus of quality for robustness against unreliable communication
• Comparing three coordination models: Reo, ARC, and PBRD
• A process algebraic view of Linda coordination primitives
• Synchrony vs asynchrony in communication primitives
• A transition system semantics for the control-driven coordination language MANIFOLD
• Linda-based applicative and imperative process algebras
• Comparing three coordination models: Reo, ARC, and RRD
• Types for access control
• A semantic theory of the Internet of things
• A formal approach to the engineering of domain-specific distributed systems
• Causal-consistent rollback in a tuple-based language
• Comparing communication primitives via their relative expressive power
• An algebraic approach for modelling organisation, roles and contexts in MAS
• Towards an integration science. The influence of Richard Bellman on our research.

This page was built for software: Linda