id: 00984874
dt: j
an: 00984874
au: Aceto, Luca; Jeffrey, Alan
ti: A complete axiomatization of timed bisimulation for a class of timed
    regular behaviours.
so: Theor. Comput. Sci. 152, No.2, 251-268 (1995).
py: 1995
pu: Elsevier Science Publishers, Amsterdam
la: EN
cc: 
ut: standard process algebras; timed bisimulation; open terms with finite-state
    recursion
ci: Zbl 0562.68065
li: doi:10.1016/0304-3975(94)00285-9
ab: Summary: One of the most satisfactory results in process theory is {\it R.
    Milner}’s [J. Comput. Syst. Sci. 28, 439-466 (1984; Zbl
    0562.68065)]axiomatization of strong bisimulation for regular CCS. This
    result holds for open terms with finite-state recursion. Wang has shown
    that timed bisimulation can also be axiomatized, but only for closed
    terms without recursion. We provide an axiomatization for timed
    bisimulation of open terms with finite-state recursion.
rv: