A Complete Axiomatization of Timed Bisimulation for a Class of Timed Regular Behaviours (Revised Version)

Luca Aceto


One of the most satisfactory results in process theory is Milner's 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. In this paper, we provide an axiomatization for timed bisimulation of open terms with finite-state recursion.

Full Text:


DOI: http://dx.doi.org/10.7146/brics.v1i43.21599
This website uses cookies to allow us to see how the site is used. The cookies cannot identify you or any content at your own computer.

ISSN: 0909-0878 

Hosted by the Royal Danish Library and Aarhus University Library