A ground-complete axiomatization of stateless bisimilarity over Linda

DOI10.1016/j.ipl.2014.09.014zbMath1302.68198OpenAlexW1970782410MaRDI QIDQ477631

Luca Aceto, Eugen-Ioan Goriac, Anna Ingólfsdóttir

Publication date: 9 December 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2014.09.014

zbMATH Keywords

process algebraequational logicconcurrencyLindastateless bisimilarity

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Uses Software

• Reo
• Linda

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Communicating processes with value-passing and assignments
• Redesign of a systems engineering language: formalisation of \(\chi\)
• A process algebraic view of Linda coordination primitives
• CONCUR '90. Theories of concurrency: unification and extension. Amsterdam, The Netherlands, August 1990. Proceedings
• A theory of communicating processes with value passing
• Process algebra with guards: Combining hoare logic with process algebra
• Testing equivalences for processes
• The algebra of communicating processes with empty process
• Linda-based applicative and imperative process algebras
• Hybrid process algebra
• Notions of bisimulation and congruence formats for SOS with data
• Embedding untimed into timed process algebra: the case for explicit termination
• The Algebra of Connectors—Structuring Interaction in BIP
• Reo: a channel-based coordination model for component composition
• Generative communication in Linda
• Barbed bisimulation
• Processes, Terms and Cycles: Steps on the Road to Infinity
• Unique fixpoint induction for message-passing process calculi

This page was built for publication: A ground-complete axiomatization of stateless bisimilarity over Linda