Axiomatizing weak simulation semantics over BCCSP

DOI10.1016/J.TCS.2013.03.013zbMATH Open1359.68183OpenAlexW2084709987MaRDI QIDQ2453533FDOQ2453533

Authors: Luca Aceto, Anna Ingolfsdottir, 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

Recommendations

• The equational theory of weak complete simulation semantics over BCCSP
• Axiomatizing weak ready simulation semantics over BCCSP
• Ready to Preorder: Get Your BCCSP Axiomatization for Free!
• Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet
• On Finite Alphabets and Infinite Bases III: Simulation

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)

Cites Work

• A structural approach to operational semantics
• The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.
• Process algebra for synchronous communication
• Algebraic laws for nondeterminism and concurrency
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Bisimulation can't be traced
• Bisimulation through probabilistic testing
• A calculus of communicating systems
• Testing equivalences for processes
• Title not available (Why is that?)
• A term model for synchronous processes
• Termination, deadlock, and divergence
• Branching time and abstraction in bisimulation semantics
• Bisimulation and divergence
• Title not available (Why is that?)
• A complete axiomatisation for observational congruence of finite-state behaviours
• Process algebra: equational theories of communicating processes. With forewords by Tony Hoare, Robin Milner and Jan Bergstra.
• Ready simulation for concurrency: it's logical!
• Turning SOS rules into equations
• Impossible futures and determinism
• Processes, Terms and Cycles: Steps on the Road to Infinity
• Axiomatizing GSOS with termination
• On the axiomatisability of priority
• Processes, Terms and Cycles: Steps on the Road to Infinity
• Ready to preorder: the case of weak process semantics
• Ready to Preorder: Get Your BCCSP Axiomatization for Free!
• Ready to preorder: an algebraic and general proof
• A finite equational base for CCS with left merge and communication merge
• On the unification of process semantics: equational semantics
• On finite alphabets and infinite bases
• Lifting non-finite axiomatizability results to extensions of process algebras
• (Bi)simulations up-to characterise process semantics
• The equational theory of prebisimilarity over basic CCS with divergence
• Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet
• 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 Simulation for Concurrency: It’s Logical!

Cited In (8)

• Axiomatizing weak ready simulation semantics over BCCSP
• The equational theory of weak complete simulation semantics over BCCSP
• The equational theory of prebisimilarity over basic CCS with divergence
• Nested semantics over finite trees are equationally hard
• An axiomatic semantics for \(\mathsf{ioco} \underline{\mathsf{s}}\) conformance relation
• Axiomatizing Lüttgen \& Vogler's ready simulation for finite processes in \(\mathrm{CLL}_{R}\)
• Ready to Preorder: Get Your BCCSP Axiomatization for Free!
• Equational characterization of covariant-contravariant simulation and conformance simulation semantics

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

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