scientific article; zbMATH DE number 3744561

Cited in

(63)

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

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)