scientific article
From MaRDI portal
Publication:3938462
zbMath0479.68011MaRDI QIDQ3938462
Matthew C. B. Hennessy, Gordon D. Plotkin
Publication date: 1980
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
operatorslabelled transition systemmodelrecursive definitionsbehaviour of communicating processesoperational preorder between programsoperationally equivalentsound and complete proof system
Abstract data types; algebraic specification (68Q65) General topics in the theory of software (68N01) Theory of operating systems (68N25) Combinatory logic and lambda calculus (03B40)
Related Items (22)
The origins of structural operational semantics ⋮ Termination, deadlock and divergence ⋮ A characterization of finitary bisimulation ⋮ A context dependent equivalence between processes ⋮ Synchronization trees ⋮ Testing equivalences for processes ⋮ CPO models for a class of GSOS languages ⋮ A semantic theory for value-passing processes based on the late approach ⋮ A presheaf semantics of value-passing processes ⋮ A fully abstract model for the \(\pi\)-calculus. ⋮ Partial abstract types ⋮ Communicating processes with value-passing and assignments ⋮ The equational theory of prebisimilarity over basic CCS with divergence ⋮ A fully abstract denotational semantics for the calculus of higher-order communicating systems ⋮ Refusal testing ⋮ A complete axiomatisation for observational congruence of finite-state behaviours ⋮ Bisimulation and divergence ⋮ Semantics of algorithmic languages ⋮ Bisimulations for a calculus of broadcasting systems ⋮ Linda-based applicative and imperative process algebras ⋮ Calculi for synchrony and asynchrony ⋮ Axiomatising finite delay operators
This page was built for publication:
