The equational theory of prebisimilarity over basic CCS with divergence

DOI10.1016/j.ipl.2008.05.019zbMath1191.68425OpenAlexW2078387921MaRDI QIDQ975471

Silvio Capobianco, Luca Aceto, Bas Luttik, Anna Ingólfsdóttir

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

zbMATH Keywords

process algebradivergencefinite basisconcurrencyequational theorycomplete 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)

Related Items

Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet ⋮ Axiomatizing weak simulation semantics over BCCSP

Cites Work

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