scientific article; zbMATH DE number 3744561

Cited in

(61)

Termination, deadlock and divergence
Axiomatizing weak ready simulation semantics over BCCSP
Processes, systems \& tests: defining contextual equivalences
A fully abstract denotational model for observational precongruence
Processes against tests: on defining contextual equivalences
Process calculus based upon evaluation to committed form
Compositionality of Hennessy-Milner logic by structural operational semantics
Experimenting with process equivalence
Proof systems for satisfiability in Hennessy-Milner logic with recursion
A fully abstract denotational model for observational precongruence
Modal logics for communicating systems
Theory of interaction
Mechanising a type-safe model of multithreaded Java with a verified compiler
Refusal testing
A fully abstract denotational semantics for the calculus of higher-order communicating systems
The compression structure of a process
A characterization of finitary bisimulation
Structured operational semantics and bisimulation as a congruence
Bisimulation through probabilistic testing
Specification-oriented semantics for communicating processes
A proof-theoretic characterization of observational equivalence
The \({\mathcal NU}\) system as a development system for concurrent programs: \(\delta{\mathcal NU}\)
A compositional protocol verification using relativized bisimulation
Observation equivalence as a testing equivalence
Divide and congruence: from decomposition of modal formulas to preservation of branching and \(\eta \)-bisimilarity
SOS formats and meta-theory: 20 years after
Late and early semantics coincide for testing
CPO models for a class of GSOS languages
Translations between modal logics of reactive systems
More on bisimulations for higher order \(\pi\)-calculus
The equational theory of prebisimilarity over basic CCS with divergence
Corrigendum: ``A domain equation for bisimulation by S. Abramsky
Modal logics for nominal transition systems
Testing probabilistic equivalence through reinforcement learning
\(\pi\)-calculus, internal mobility, and agent-passing calculi
Bisimulation and divergence
A logical characterization of observation equivalence
Branching time and orthogonal bisimulation equivalence
Divide and congruence. II: From decomposition of modal formulas to preservation of delay and weak bisimilarity
The name discipline of uniform receptiveness
On implementations and semantics of a concurrent programming language
Lifting non-finite axiomatizability results to extensions of process algebras
Ordered SOS process languages for branching and eager bisimulations
Rooted branching bisimulation as a congruence
Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation
Graphical versus logical specifications
Deciding orthogonal bisimulation
Finite axiom systems for testing preorder and De Simone process languages
Agreement between conformance and composition
On the computational complexity of bisimulation, redux
Axiomatizing weak simulation semantics over BCCSP
Bisimulation and action refinement
Non-regular iterators in process algebra
Computing maximal weak and other bisimulations
A context dependent equivalence between processes
On transformations of concurrent-object programs
A domain equation for bisimulation
Trade-offs in true concurrency: Pomsets and mazurkiewicz traces
Process calculus based upon evaluation to committed form
Quantales, finite observations and strong bisimulation
Structural operational semantics for weak bisimulations

This page was built for publication:

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