Linda-based applicative and imperative process algebras

DOI10.1016/S0304-3975(99)00339-4zbMath0944.68064OpenAlexW1992984380WikidataQ127482015 ScholiaQ127482015MaRDI QIDQ1575260

Rosario Pugliese, R. D. Nicola

Publication date: 21 August 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(99)00339-4

zbMATH Keywords

formal semanticsconcurrencyprocess algebrasasynchronous communications

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (2)

A ground-complete axiomatization of stateless bisimilarity over Linda ⋮ Trace and testing equivalence on asynchronous processes

Uses Software

• Linda
• UNITY

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algebraic semantics
• A proof system for communicating processes with value-passing
• A calculus of mobile processes. II
• On bisimulations for the asynchronous \(\pi\)-calculus
• A theory of communicating processes with value passing
• Testing equivalences for processes
• Testing equivalence for mobile processes
• Testing equivalence as a bisimulation equivalence
• Process algebra for synchronous communication
• A Theory of Communicating Sequential Processes
• Acceptance trees
• The Semantics of Call-By-Value and Call-By-Name in a Nondeterministic Environment
• Generative communication in Linda

This page was built for publication: Linda-based applicative and imperative process algebras