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

Forfattere

  • Luca Aceto

DOI:

https://doi.org/10.7146/brics.v1i43.21599

Resumé

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.

Downloads

Publiceret

1994-12-14

Citation/Eksport

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

Nummer

Nr. 43 (1994): RS-43 A Complete Axiomatization of Timed Bisimulation for a Class of Timed Regular Behaviours (Revised Version)

Sektion

Artikler

Licens

Authors who publish with this journal agree to the following terms:

    1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.

    1. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.

  1. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).