The equational theory of prebisimilarity over basic CCS with divergence

DOI10.1016/J.IPL.2008.05.019zbMATH Open1191.68425OpenAlexW2078387921MaRDI QIDQ975471FDOQ975471

Authors: Luca Aceto, Silvio Capobianco, Bas Luttik, Anna Ingolfsdottir 

Publication date: 9 June 2010

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

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

Recommendations

• Bisimulation and divergence
• The equational theory of weak complete simulation semantics over BCCSP
• Complete axiomatization for divergent-sensitive bisimulations in basic process algebra with prefix iteration
• On the axiomatisability of priority
• Axiomatizing weak simulation semantics over BCCSP

zbMATH Keywords

divergenceconcurrencyprocess algebraequational theoryfinite basiscomplete axiomatisationbasic CCSnon-finitely based equational theoryprebisimilarity

Mathematics Subject Classification ID

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

Cites Work

• LCF considered as a programming language
• A structural approach to operational semantics
• Title not available (Why is that?)
• Bisimulation can't be traced
• A domain equation for bisimulation
• A characterization of finitary bisimulation
• Title not available (Why is that?)
• Title not available (Why is that?)
• A term model for synchronous processes
• Termination, deadlock, and divergence
• Bisimulation and divergence
• Title not available (Why is that?)
• CONCUR '90. Theories of concurrency: unification and extension. Amsterdam, The Netherlands, August 1990. Proceedings
• Fully abstract models of typed \(\lambda\)-calculi
• CPO models for compact GSOS languages
• Lifting non-finite axiomatizability results to extensions of process algebras

Cited In (8)

• Lifting non-finite axiomatizability results to extensions of process algebras
• Divergence and unique solution of equations
• Bisimulation and divergence
• Complete axiomatization for divergent-sensitive bisimulations in basic process algebra with prefix iteration
• Impossibility Results for the Equational Theory of Timed CCS
• Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet
• Divergence and unique solution of equations
• Axiomatizing weak simulation semantics over BCCSP

This page was built for publication: The equational theory of prebisimilarity over basic CCS with divergence

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