Open AccessA Complete Axiomatization of Timed Bisimulation for a Class of Timed Regular Behaviours (Revised Version)
Author(s) -
Luca Aceto
Publication year - 1994
Publication title -
brics report series
Language(s) - English
Resource type - Journals
eISSN - 1601-5355
pISSN - 0909-0878
DOI - 10.7146/brics.v1i43.21599
Subject(s) - bisimulation , recursion (computer science) , class (philosophy) , process calculus , state (computer science) , mathematics , computer science , algebra over a field , discrete mathematics , pure mathematics , theoretical computer science , algorithm , artificial intelligence
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.