A Complete Axiomatization of Timed Bisimulation for a Class of Timed Regular Behaviours (Revised Version)
AbstractOne 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.
How to Cite
Aceto, L. (1994). A Complete Axiomatization of Timed Bisimulation for a Class of Timed Regular Behaviours (Revised Version). BRICS Report Series, 1(43). https://doi.org/10.7146/brics.v1i43.21599
Articles published in DAIMI PB are licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.