Axiomatizing weak simulation semantics over BCCSP
From MaRDI portal
Publication:2453533
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
Cites work
- scientific article; zbMATH DE number 4039251 (Why is no real title available?)
- scientific article; zbMATH DE number 3716792 (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?)
- scientific article; zbMATH DE number 48630 (Why is no real title available?)
- (Bi)simulations up-to characterise process semantics
- A calculus of communicating systems
- A complete axiomatisation for observational congruence of finite-state behaviours
- A finite equational base for CCS with left merge and communication merge
- A structural approach to operational semantics
- A term model for synchronous processes
- Algebraic laws for nondeterminism and concurrency
- Axiomatizing GSOS with termination
- Axiomatizing weak ready simulation semantics over BCCSP
- 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 axiomatisability of priority
- On the axiomatizability of impossible futures
- 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 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
- Safe Reasoning with Logic LTS
- Termination, deadlock, and divergence
- Testing equivalences for processes
- The equational theory of prebisimilarity over basic CCS with divergence
- The equational theory of weak complete simulation semantics over BCCSP
- The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.
- Turning SOS rules into equations
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
- An axiomatic semantics for \(\mathsf{ioco} \underline{\mathsf{s}}\) conformance relation
- Ready to Preorder: Get Your BCCSP Axiomatization for Free!
- Axiomatizing Lüttgen \& Vogler's ready simulation for finite processes in \(\mathrm{CLL}_{R}\)
- Nested semantics over finite trees are equationally hard
- 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)
