A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
A Complete Axiomatization of Timed Bisimulation for a Class of Timed Regular Behaviours (Revised Version)
1994
BRICS Report Series
Preserved Fulltext
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.
doi:10.7146/brics.v1i43.21599
fatcat:drn65gl5urgk3nwvamypefkxmq