A complete axiomatization of timed bisimulation for a class of timed regular behaviours

DOI10.1016/0304-3975(94)00285-9zbMath0872.68039OpenAlexW2043781314MaRDI QIDQ672231

Alan Jeffrey, Luca Aceto

Publication date: 27 February 1997

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

Full work available at URL: https://doi.org/10.1016/0304-3975(94)00285-9

zbMATH Keywords

open terms with finite-state recursionstandard process algebrastimed bisimulation

Mathematics Subject Classification ID

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

Related Items (6)

Bisimulation on speed: Worst-case efficiency ⋮ A bulk-synchronous parallel process algebra ⋮ Timing and causality in process algebra ⋮ Unifying behavioral equivalences of timed transition systems ⋮ Is observational congruence on \(\mu \)-expressions axiomatisable in equational Horn logic? ⋮ On timed alternating simulation for concurrent timed games

Cites Work

• A complete inference system for a class of regular behaviours
• CONCUR '90. Theories of concurrency: unification and extension. Amsterdam, The Netherlands, August 1990. Proceedings
• A complete axiomatisation for observational congruence of finite-state behaviours
• The algebra of timed processes, ATP: Theory and application
• A process algebra for timed systems
• Real time process algebra
• Algebraic laws for nondeterminism and concurrency
• Process Algebra
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A complete axiomatization of timed bisimulation for a class of timed regular behaviours