You are viewing a javascript disabled version of the site. Please enable Javascript for this site to function properly.
Go to headerGo to navigationGo to searchGo to contentsGo to footer
In content section. Select this link to jump to navigation

An Axiomatization for Regular Processes in Timed Branching Bisimulation

Article type: Research Article

Authors: Fokkink, Wan

Affiliations: University of Wales Swansea, Department of Computer Science, Singleton Park, Swansea SA2 8PP, Wales. w.j.fokkink@swan.ac.uk

Abstract: Klusener introduced a timed variant of branching bisimulation. In this paper it is shown that Klusener's axioms for finite process terms, together with two standard axioms for recursion, make a complete axiomatization for regular processes modulo timed branching bisimulation.

Keywords: timed process algebra, regular processes, branching bisimulation

DOI: 10.3233/FI-1997-323407

Journal: Fundamenta Informaticae, vol. 32, no. 3-4, pp. 329-340, 1997

Published: 1997
Price: EUR 27.50
Show more