scientific article

zbMath0515.68029MaRDI QIDQ3662610

Rocco De Nicola, Matthew C. B. Hennessy

Publication date: 1983

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

CCScomplete proof systemsrepresentation treessemantic theory for processes

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Related Items (14)

On bisimilarity in lambda calculi with continuous probabilistic choice ⋮ Synchronization trees ⋮ Testing probabilistic equivalence through reinforcement learning ⋮ A coinductive calculus for asynchronous side-effecting processes ⋮ Typing access control and secure information flow in sessions ⋮ General Refinement, Part One: Interfaces, Determinism and Special Refinement ⋮ Refusal testing ⋮ Observation equivalence as a testing equivalence ⋮ (Bi)simulations up-to characterise process semantics ⋮ Axiomatising finite delay operators ⋮ Non-deterministic data types: Models and implementations ⋮ A proof-theoretic characterization of observational equivalence ⋮ On powerdomains and modality ⋮ Simulations Up-to and Canonical Preorders

This page was built for publication: