• Publications
  • Influence
Bisimulation can't be traced
tl;dr
Bisimulation is the primitive notion of equivalence between concurrent processes in Milner's Calculus of Communicating Systems (CCS); there is a nontrivial game-like protocol for distinguishing nonbisimular processes. Expand
  • 399
  • 51
  • Open Access
Turning SOS rules into equations
tl;dr
A procedure is given for extracting from a GSOS specification of an arbitrary process algebra a complete axiom system for bisimulation equivalence (equational, except for possibly one conditional equation). Expand
  • 72
  • 11
Bisimulation can't be traced
tl;dr
In the concurrent language CCS, two programs are considered the same if they are bisimilar. Expand
  • 106
  • 10
Bisimulation can't be traced. Preliminary report
Bisimulation is the primitive notion of equivalence between concurrent processes in Milner's Calculus of Communicating Systems (CCS); there is a nontrivial game-like protocol for distinguishingExpand
  • 110
  • 8
  • Open Access
Structural Operational Semantics for Weak Bisimulations
  • B. Bloom
  • Mathematics, Computer Science
  • Theor. Comput. Sci.
  • 24 July 1995
tl;dr
In this study, we present rule formats for four main notions of bisimulation with silent moves in process algebras defined by WB cool rules; we give sufficient conditions under which equational axiom systems can be generated from operational rules. Expand
  • 103
  • 8
Unsupervised Machine Learning on a Hybrid Quantum Computer
Machine learning techniques have led to broad adoption of a statistical model of computing. The statistical distributions natively available on quantum processors are a superset of those availableExpand
  • 107
  • 8
  • Open Access
Turning SOS Rules into Equations
tl;dr
We give a procedure for converting any GSOS language definition to a finite complete equational axiom system (possibly with one infinitary induction principle) which precisely characterizes strong bisimulation of processes. Expand
  • 98
  • 7
  • Open Access
Transformational Design and Implementation of a New Efficient Solution to the Ready Simulation Problem
tl;dr
A transformational methodology is described for simultaneously designing algorithms and developing programs. Expand
  • 79
  • 7
  • Open Access
Precongruence formats for decorated trace semantics
tl;dr
This paper explores the connection between semantic equivalences and preorders for concrete sequential processes, represented by means of labeled transition systems, and formats of transition system specifications using Plotkin's structural approach. Expand
  • 73
  • 5
  • Open Access
Thorn: robust, concurrent, extensible scripting on the JVM
tl;dr
This paper reports on the design and implementation of Thorn, a novel programming language targeting the JVM that supports the evolution of scripts into industrial grade programs. Expand
  • 71
  • 5
  • Open Access