Axiomatizing weak simulation semantics over BCCSP

DOI10.1016/j.tcs.2013.03.013zbMath1359.68183OpenAlexW2084709987MaRDI QIDQ2453533

Luca Aceto, Anna Ingólfsdóttir, David de Frutos-Escrig, Carlos Gregorio Rodríguez

Publication date: 10 June 2014

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.03.013

zbMATH Keywords

process algebraequational logicnon-finitely based algebrasequational axiomatizationscomplete simulation semanticsready simulation semanticssimulation semantics

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (2)

Axiomatizing Lüttgen \& Vogler's ready simulation for finite processes in \(\mathrm{CLL}_{R}\) ⋮ An axiomatic semantics for \(\mathsf{ioco} \underline{\mathsf{s}}\) conformance relation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bisimulation and divergence
• Ready to preorder: an algebraic and general proof
• On finite alphabets and infinite bases
• Lifting non-finite axiomatizability results to extensions of process algebras
• The equational theory of prebisimilarity over basic CCS with divergence
• Ready to preorder: the case of weak process semantics
• Ready simulation for concurrency: it's logical!
• (Bi)simulations up-to characterise process semantics
• A calculus of communicating systems
• Bisimulation through probabilistic testing
• A complete axiomatisation for observational congruence of finite-state behaviours
• Turning SOS rules into equations
• Testing equivalences for processes
• Impossible futures and determinism
• Axiomatizing GSOS with termination
• A structural approach to operational semantics
• Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet
• On the Unification of Process Semantics: Equational Semantics
• The Equational Theory of Weak Complete Simulation Semantics over BCCSP
• Axiomatizing Weak Ready Simulation Semantics over BCCSP
• On the Axiomatizability of Impossible Futures
• Safe Reasoning with Logic LTS
• Ready to Preorder: Get Your BCCSP Axiomatization for Free!
• Process algebra for synchronous communication
• Algebraic laws for nondeterminism and concurrency
• A term model for synchronous processes
• Termination, deadlock, and divergence
• Bisimulation can't be traced
• Branching time and abstraction in bisimulation semantics
• A finite equational base for CCS with left merge and communication merge
• Ready Simulation for Concurrency: It’s Logical!
• On the axiomatisability of priority
• Processes, Terms and Cycles: Steps on the Road to Infinity
• Processes, Terms and Cycles: Steps on the Road to Infinity

This page was built for publication: Axiomatizing weak simulation semantics over BCCSP