Embedding untimed into timed process algebra: the case for explicit termination

DOI10.1017/S0960129503004006zbMath1088.68118OpenAlexW2146805109MaRDI QIDQ4461215

Jos C. M. Baeten

Publication date: 30 March 2004

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129503004006

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (5)

Axiomatizing GSOS with termination ⋮ Duplication of constants in process algebra ⋮ A ground-complete axiomatization of stateless bisimilarity over Linda ⋮ A ground-complete axiomatisation of finite-state processes in a generic process algebra ⋮ A Generic Process Algebra

This page was built for publication: Embedding untimed into timed process algebra: the case for explicit termination