Towards action-refinement in process algebras

DOI10.1006/INCO.1993.1019zbMath0779.68028OpenAlexW2146485104MaRDI QIDQ2365760

Luca Aceto, Matthew C. B. Hennessy

Publication date: 29 June 1993

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

Full work available at URL: https://doi.org/10.1006/inco.1993.1019

zbMATH Keywords

process algebraaction refinementcomplete axiomatizationsrefine equivalencetimed-equivalence

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55)

Related Items (15)

A format for semantic equivalence comparison ⋮ Nonfinite axiomatizability of the equational theory of shuffle ⋮ Concurrent testing of processes ⋮ The difference between splitting in \(n\) and \(n+1\) ⋮ Timing and causality in process algebra ⋮ Free shuffle algebras in language varieties extended abstract ⋮ Nonfinite axiomatizability of shuffle inequalities ⋮ Revisiting sequential composition in process calculi ⋮ Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra ⋮ A timed calculus for wireless systems ⋮ Free shuffle algebras in language varieties ⋮ Metric Semantics and Full Abstractness for Action Refinement and Probabilistic Choice ⋮ Decomposition orders -- another generalisation of the fundamental theorem of arithmetic ⋮ On the semantics of durational actions ⋮ Vertical implementation

This page was built for publication: Towards action-refinement in process algebras