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

DOI10.1017/S0960129503004006MaRDI QIDQ4461215zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Embedding untimed into timed process algebra; the case for explicit termination
• Formal Methods for the Design of Real-Time Systems
• Processes, Terms and Cycles: Steps on the Road to Infinity
• A process algebra for timed systems
• Action Abstraction in Timed Process Algebra

Cited in

(10)

• Axiomatizing GSOS with termination
• Action Abstraction in Timed Process Algebra
• A ground-complete axiomatisation of finite-state processes in a generic process algebra
• A ground-complete axiomatization of stateless bisimilarity over Linda
• Embedding untimed into timed process algebra; the case for explicit termination
• A Generic Process Algebra
• Formal Methods for the Design of Real-Time Systems
• Termination, deadlock and divergence
• Processes, Terms and Cycles: Steps on the Road to Infinity
• Duplication of constants in process algebra

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4461215)