Axiomatizing Weak Ready Simulation Semantics over BCCSP
From MaRDI portal
Publication:3105742
DOI10.1007/978-3-642-23283-1_4zbMath1351.68177MaRDI QIDQ3105742
David de Frutos-Escrig, Carlos Gregorio Rodríguez, Luca Aceto, Anna Ingólfsdóttir
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
68Q55: Semantics in the theory of computing
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Axiomatizing weak simulation semantics over BCCSP, The Equational Theory of Weak Complete Simulation Semantics over BCCSP
Cites Work
- 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
- Ready to preorder: the case of weak process semantics
- Ready simulation for concurrency: it's logical!
- (Bi)simulations up-to characterise process semantics
- 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
- The origins of structural operational semantics
- Axiomatizing GSOS with termination
- Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet
- On the Unification of Process Semantics: Equational Semantics
- Refusal Simulation and Interactive Games
- 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
- Processes, Terms and Cycles: Steps on the Road to Infinity
- Processes, Terms and Cycles: Steps on the Road to Infinity
