A ground-complete axiomatization of stateless bisimilarity over Linda

DOI10.1016/J.IPL.2014.09.014MaRDI QIDQ477631zbMATH OpenOpenAlexFDO

Authors Luca Aceto, Eugen-Ioan Goriac, Anna Ingolfsdottir

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

concurrencyprocess algebraequational logicLindastateless bisimilarity

Mathematics Subject Classification ID

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

Recommendations

• Completeness of bisimilarity for contextual equivalence in linear theories
• Towards general axiomatizations for bisimilarity and trace semantics
• A completeness result for finite \(\lambda\)-bisimulations
• Universal axioms for bisimulations
• A complete normal-form bisimilarity for state
• Deciding bisimulation equivalences for a class of non-finite-state programs
• Deciding bisimulation equivalences for a class of non-finite-state programs
• scientific article; zbMATH DE number 1305004
• Bisimulation of labelled state-to-function transition systems coalgebraically
• Axiomatising infinitary probabilistic weak bisimilarity of finite-state behaviours

Cites work

• scientific article; zbMATH DE number 3716792 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 177854 (Why is no real title available?)
• scientific article; zbMATH DE number 1231687 (Why is no real title available?)
• A process algebraic view of Linda coordination primitives
• A theory of communicating processes with value passing
• Barbed bisimulation
• CONCUR '90. Theories of concurrency: unification and extension. Amsterdam, The Netherlands, August 1990. Proceedings
• Communicating processes with value-passing and assignments
• Embedding untimed into timed process algebra: the case for explicit termination
• Generative communication in Linda
• Hybrid process algebra
• Linda-based applicative and imperative process algebras
• Notions of bisimulation and congruence formats for SOS with data
• Process algebra with guards: Combining hoare logic with process algebra
• Process algebra: equational theories of communicating processes. With forewords by Tony Hoare, Robin Milner and Jan Bergstra.
• Processes, Terms and Cycles: Steps on the Road to Infinity
• Redesign of a systems engineering language: formalisation of \(\chi\)
• Reo: a channel-based coordination model for component composition
• Testing equivalences for processes
• The Algebra of Connectors—Structuring Interaction in BIP
• The algebra of communicating processes with empty process
• Unique fixpoint induction for message-passing process calculi

Cited in

(2)

• A complete normal-form bisimilarity for state
• PREG axiomatizer -- a ground bisimilarity checker for GSOS with predicates

Describes a project that uses

Uses Software

• Linda
• Reo

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q477631)