Axiomatizing weak ready simulation semantics over BCCSP

DOI10.1007/978-3-642-23283-1_4MaRDI QIDQ3105742zbMATH OpenOpenAlexFDO

Authors Luca Aceto, David de Frutos Escrig, Carlos Gregorio Rodríguez, Anna Ingolfsdottir

Publication date 6 January 2012

Published in Theoretical Aspects of Computing – ICTAC 2011 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-23283-1_4

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)

Recommendations

• Axiomatizing weak simulation semantics over BCCSP
• The equational theory of weak complete simulation semantics over BCCSP
• scientific article; zbMATH DE number 2038703
• Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet
• Ready to Preorder: Get Your BCCSP Axiomatization for Free!

Cites work

• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 3744561 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• (Bi)simulations up-to characterise process semantics
• A complete axiomatisation for observational congruence of finite-state behaviours
• A finite equational base for CCS with left merge and communication merge
• A term model for synchronous processes
• Algebraic laws for nondeterminism and concurrency
• Axiomatizing GSOS with termination
• Bisimulation and divergence
• Bisimulation can't be traced
• Bisimulation through probabilistic testing
• Branching time and abstraction in bisimulation semantics
• Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet
• Impossible futures and determinism
• Lifting non-finite axiomatizability results to extensions of process algebras
• On finite alphabets and infinite bases
• On the unification of process semantics: equational semantics
• Process algebra for synchronous communication
• 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
• Processes, Terms and Cycles: Steps on the Road to Infinity
• Ready simulation for concurrency: it's logical!
• Ready to Preorder: Get Your BCCSP Axiomatization for Free!
• Ready to preorder: an algebraic and general proof
• Ready to preorder: the case of weak process semantics
• Refusal simulation and interactive games
• Termination, deadlock, and divergence
• Testing equivalences for processes
• The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.
• The origins of structural operational semantics
• Turning SOS rules into equations

Cited in

(5)

• The equational theory of weak complete simulation semantics over BCCSP
• scientific article; zbMATH DE number 2038703 (Why is no real title available?)
• Ready Simulation for Concurrency: It’s Logical!
• Ready to preorder: the case of weak process semantics
• Axiomatizing weak simulation semantics over BCCSP

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

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