scientific article; zbMATH DE number 3744561

Cited in

(63)

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

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)