## An Axiomatization for Regular Processes in Timed Branching Bisimulation (1998)

Venue: | Fundamenta Informaticae |

Citations: | 5 - 0 self |

### BibTeX

@ARTICLE{Fokkink98anaxiomatization,

author = {Wan Fokkink},

title = {An Axiomatization for Regular Processes in Timed Branching Bisimulation},

journal = {Fundamenta Informaticae},

year = {1998},

volume = {32},

pages = {329--340}

}

### OpenURL

### Abstract

ion The previous section treated BPA ffir with recursion modulo timed strong bisimulation. In this section the alphabet is extended with a special constant ø , to obtain BPA ffiø r with recursion, and process terms are considered modulo rooted timed branching bisimulation. In the sequel, a and ff will represent elements from A [ føg and A [ fffi; øg, respectively. 3.1 Time Shift In order to define timed branching bisimulation, the syntax is extended with the time shift operator (r)p, which takes a rational number r and a process term p. The process term (r)p denotes the behaviour of p that is shifted r units in time. Its ultimate delay is defined by U((r)p) = maxfU(p) + r; 0g The transition rules and axioms for the time shift are given in Table 4. Using axioms TS1-4, this operator can be eliminated from all process terms. 3.2 Timed Branching Bisimulation The operational semantics consists of the transition rules in Table 1 and Table 2 and Table 4. The definition of timed strong...