A COMPLETE AXIOMATIZATION OF TIMED BISIMULATION FOR A CLASS OF TIMED REGULAR BEHAVIORS

Authors
ACETO L JEFFREY A
Citation
L. Aceto et A. Jeffrey, A COMPLETE AXIOMATIZATION OF TIMED BISIMULATION FOR A CLASS OF TIMED REGULAR BEHAVIORS, Theoretical computer science, 152(2), 1995, pp. 251-268
Citations number
23
Categorie Soggetti
Computer Sciences","Computer Science Theory & Methods
Journal title
Theoretical computer science → ACNP
ISSN journal
03043975
Volume
152
Issue
2
Year of publication
1995
Pages
251 - 268
Database
ISI
SICI code
0304-3975(1995)152:2<251:ACAOTB>2.0.ZU;2-W
Abstract
One of the most satisfactory results in process theory is Milner's axi omatization 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 withou t recursion. In this paper, we provide an axiomatization for timed bis imulation of open terms with finite-state recursion.