A term model for synchronous processes

DOI10.1016/S0019-9958(81)90082-6zbMath0503.68022MaRDI QIDQ3969860

Matthew C. B. Hennessy

Publication date: 1981

Published in: Information and Control (Search for Journal in Brave)

zbMATH Keywords

operational semanticsdenotational modelsynchronous processescommunicating processesproof-systemfull-abstractnessoperational pre-order

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Theory of operating systems (68N25)

Related Items (25)

GSOS and finite labelled transition systems ⋮ Merging regular processes by means of fixed-point theory ⋮ Termination, deadlock and divergence ⋮ Testing equivalence as a bisimulation equivalence ⋮ A characterization of finitary bisimulation ⋮ A context dependent equivalence between processes ⋮ Axiomatizing recursion-free, regular monitors ⋮ Testing equivalences for processes ⋮ A domain equation for bisimulation ⋮ CPO models for a class of GSOS languages ⋮ Semantics for finite delay ⋮ A semantic theory for value-passing processes based on the late approach ⋮ A fully abstract model for the \(\pi\)-calculus. ⋮ SOS rule formats for idempotent terms and idempotent unary operators ⋮ Axiomatizing weak simulation semantics over BCCSP ⋮ Lifting non-finite axiomatizability results to extensions of process algebras ⋮ The equational theory of prebisimilarity over basic CCS with divergence ⋮ A fully abstract denotational model for observational precongruence ⋮ A fully abstract denotational semantics for the calculus of higher-order communicating systems ⋮ A complete equational axiomatization for MPA with string iteration ⋮ Axiomatizing Weak Ready Simulation Semantics over BCCSP ⋮ Calculi for synchrony and asynchrony ⋮ Axiomatising finite delay operators ⋮ Systems Modelling via Resources and Processes: Philosophy, Calculus, Semantics, and Logic ⋮ Algebra of communicating processes with abstraction

This page was built for publication: A term model for synchronous processes