Embedding Untimed into Timed Process Algebra; the Case for Explicit Termination

DOI10.1016/S1571-0661(05)82501-0zbMath1260.68256OpenAlexW2093335611MaRDI QIDQ4917024

Jos C. M. Baeten

Publication date: 26 April 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s1571-0661(05)82501-0

Mathematics Subject Classification ID

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

Related Items (max. 100)

Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Top-down design and the algebra of communicating processes
• A complete equational axiomatization for MPA with string iteration
• Turning SOS rules into equations
• On sequential composition, action prefixes and process prefix
• A complete equational axiomatization for prefix iteration
• Nonaxiomatisability of equivalences over finite state processes
• The algebra of communicating processes with empty process
• Discrete time process algebra
• Process algebra for synchronous communication
• Process Algebra
• Termination, deadlock, and divergence
• Branching time and abstraction in bisimulation semantics
• Discrete time process algebra with abstraction
• Formal Methods for the Design of Real-Time Systems
• Axiomatizing flat iteration

This page was built for publication: Embedding Untimed into Timed Process Algebra; the Case for Explicit Termination