## 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...

### Citations

700 |
Concurrency and automata on infinite sequences
- Park
- 1981
(Show Context)
Citation Context ...istinguish processes that only differ in their deadlock behaviour, such as a[1]+ffi[1] and a[1]+ffi[2]. The following notion of timed strong bisimulation [2] is a timed version of strong bisimulation =-=[23]-=-. The definition that is presented here stems from [18]. Definition 2.3 Two process expressions p 0 ; q 0 are strongly bisimilar, notation p 0 $ q 0 , if there exists a symmetric, binary timed strong ... |

273 | Branching time and abstraction in bisimulation semantics
- Glabbeek, Weijland
- 1996
(Show Context)
Citation Context ...ch of these extensions, the interaction of the silent stepswith time turns out to be deplorably complicated, see e.g. [3, 7, 15, 17, 19, 22, 24, 25]. Klusener [17, 19] extended branching bisimulation =-=[14]-=- to a timed setting. The intuition for branching bisimulation is that this equivalence preserves the branching structure of processes; a -transition is silent if and only if it does not lose possible ... |

161 | Real Time Process Algebra
- Baeten, Bergstra
- 1991
(Show Context)
Citation Context ...nitely many derivatives, and the initial actions of these derivatives together constitute a finite collection (cf [5] for the untimed case). 2.3 Timed Strong Bisimulation The ultimate delay U(p) from =-=[2]-=- is the latest moment in time up to which process p can idle without executing an initial action. It is defined inductively as follows: U(ff[r]) = maxfr; 0g U(p + q) = maxfU(p); U(q)g U(p \Delta q) = ... |

160 | A model for communicating sequential processes
- Brookes
- 1983
(Show Context)
Citation Context ... algebras such as CCS, CSP and ACP have been extended with a notion of time. In each of these extensions, the interaction of the silent stepswith time turns out to be deplorably complicated, see e.g. =-=[3, 7, 15, 17, 19, 22, 24, 25]-=-. Klusener [17, 19] extended branching bisimulation [14] to a timed setting. The intuition for branching bisimulation is that this equivalence preserves the branching structure of processes; a -transi... |

128 |
A complete inference system for a class of regular behaviours
- Milner
- 1984
(Show Context)
Citation Context ...bers extended with infinity (to express livelock). A timed action a[r] executes action a after exactly r time units of inaction. In this paper, the algebra BPA ffir is extended with recursion. Milner =-=[20]-=- was the first to derive completeness of an axiomatization for regular behaviours with respect to strong bisimulation in the untimed case. Bergstra and 1 Klop [6] proved a similar result in a slightly... |

114 | A congruence theorem for structured operational semantics with predicates
- Baeten, Verhoef
- 1993
(Show Context)
Citation Context ...d strong bisimulation is a congruence, which means that if p $ p 0 and q $ q 0 , then p+q $ p 0 +q 0 and p \Delta q $ p 0 \Delta q 0 . This property follows from the path format of Baeten and Verhoef =-=[4]-=-. They proved that if a collection of transition rules is within this format, and if these rules are `well-founded', then the strong bisimulation equivalence it induces on the algebra of closed terms ... |

64 |
Klop, The algebra of recursively defined processes and the algebra of regular processes
- Bergstra, W
- 1984
(Show Context)
Citation Context ...are called regular, which is justified by the fact that each process terms has only finitely many derivatives, and the initial actions of these derivatives together constitute a finite collection (cf =-=[5]-=- for the untimed case). 2.3 Timed Strong Bisimulation The ultimate delay U(p) from [2] is the latest moment in time up to which process p can idle without executing an initial action. It is defined in... |

60 |
A complete axiomatisation for observational congruence of finite-state behaviours
- Milner
- 1989
(Show Context)
Citation Context ...esults have been obtained by Aceto and Jeffrey [1] in the regular subcalculus of Wang Yi's timed CCS [16, 26], and by Chen [8] in his extension of CCS with real time. Bergstra and Klop [6] and Milner =-=[21]-=- deduced completeness results for axiomatizations for untimed regular processes with silent steps, in observational congruence. Bergstra and Klop [6, page 51] remark that their result on completeness ... |

54 | Ntyft/ntyxt rules reduce to ntree rules
- Fokkink, Glabbeek
- 1996
(Show Context)
Citation Context ...ules is within this format, and if these rules are `well-founded', then the strong bisimulation equivalence it induces on the algebra of closed terms is always a congruence. (Fokkink and van Glabbeek =-=[11]-=- showed that the well-foundedness 5 requirement can be omitted.) In order to apply the path format, the inductive rules that define the predicates U(p) = r for r 2 Q?0 [f1g are to be incorporated as t... |

26 | The Syntax and Semantics of timed CRL
- Groote
- 1997
(Show Context)
Citation Context ...o quite a different mathematical interpretation than in the untimed case. Currently, timed branching bisimulation is used to give semantics to an extension of the specification language CRL with time =-=[13]-=-. Although the definition of timed branching bisimulation is an intricate one, its axiomatization is crystal clear. One elegant axiom suffices to characterize timed branching bisimulation. Hence, perf... |

25 |
A complete inference system for regular processes with silent moves
- Bergstra, Klop
- 1986
(Show Context)
Citation Context ...r is extended with recursion. Milner [20] was the first to derive completeness of an axiomatization for regular behaviours with respect to strong bisimulation in the untimed case. Bergstra and 1 Klop =-=[6]-=- proved a similar result in a slightly different setting. They introduced two new axioms for recursion, called R1 and R2 (which are basically reformulations of axioms by Milner) and showed that R1,2 t... |

20 | A Complete Axiomatization of Timed Bisimulation for a Class of Timed Regular Behaviours
- Aceto, Jeffrey
- 1995
(Show Context)
Citation Context ...er with the standard axioms for the algebra BPA ffir are complete for the algebra of timed regular processes. This result is not very shocking; similar results have been obtained by Aceto and Jeffrey =-=[1]-=- in the regular subcalculus of Wang Yi's timed CCS [16, 26], and by Chen [8] in his extension of CCS with real time. Bergstra and Klop [6] and Milner [21] deduced completeness results for axiomatizati... |

19 |
Abstraction in real time process algebra, in
- Klusener
- 1991
(Show Context)
Citation Context ... algebras such as CCS, CSP and ACP have been extended with a notion of time. In each of these extensions, the interaction of the silent stepswith time turns out to be deplorably complicated, see e.g. =-=[3, 7, 15, 17, 19, 22, 24, 25]-=-. Klusener [17, 19] extended branching bisimulation [14] to a timed setting. The intuition for branching bisimulation is that this equivalence preserves the branching structure of processes; a -transi... |

18 |
TIC: A TImed Calculus
- Quemada, Frutos, et al.
- 1993
(Show Context)
Citation Context ... algebras such as CCS, CSP and ACP have been extended with a notion of time. In each of these extensions, the interaction of the silent stepswith time turns out to be deplorably complicated, see e.g. =-=[3, 7, 15, 17, 19, 22, 24, 25]-=-. Klusener [17, 19] extended branching bisimulation [14] to a timed setting. The intuition for branching bisimulation is that this equivalence preserves the branching structure of processes; a -transi... |

16 |
Discrete time process algebra with abstraction
- Baeten, Bergstra
(Show Context)
Citation Context |

11 | Deciding properties of regular real timed processes
- Holmer, Wang
- 1991
(Show Context)
Citation Context ...re complete for the algebra of timed regular processes. This result is not very shocking; similar results have been obtained by Aceto and Jeffrey [1] in the regular subcalculus of Wang Yi's timed CCS =-=[16, 26]-=-, and by Chen [8] in his extension of CCS with real time. Bergstra and Klop [6] and Milner [21] deduced completeness results for axiomatizations for untimed regular processes with silent steps, in obs... |

11 | The silent step in time
- Klusener
- 1992
(Show Context)
Citation Context |

11 |
A Calculus of Real Time Systems
- Wang
- 1991
(Show Context)
Citation Context ...re complete for the algebra of timed regular processes. This result is not very shocking; similar results have been obtained by Aceto and Jeffrey [1] in the regular subcalculus of Wang Yi's timed CCS =-=[16, 26]-=-, and by Chen [8] in his extension of CCS with real time. Bergstra and Klop [6] and Milner [21] deduced completeness results for axiomatizations for untimed regular processes with silent steps, in obs... |

10 |
Behavioural abstraction in TCCS
- Moller, Tofts
- 1992
(Show Context)
Citation Context |

7 |
An e ective axiomatization for real time ACP
- Fokkink, Klusener
- 1995
(Show Context)
Citation Context ...rationals, instead of the reals. For example, if X = a[1] \Delta X and Y = b[ p 2] \Delta Y , then the merge cannot be eliminated from XkY . 2 of timed regular processes in a setting with integration =-=[2, 12]-=-. This construct enables to express time dependencies, i.e., the behaviour of a process may depend on the moment in time that a previous action has been executed. Acknowledgements. This research was c... |

6 | An elimination theorem for regular behaviours with integration
- Fokkink
- 1993
(Show Context)
Citation Context ... of this paper. A straightforward collection of axioms from [2], together with axioms R1,2, suffice to eliminate these operators from the syntax, see [9]. 1 A stronger elimination result is proved in =-=[10]-=-, for a class 1 For this elimination result it is essential that the time domain consists of the rationals, instead of the reals. For example, if X = a[1] \Delta X and Y = b[ p 2] \Delta Y , then the ... |

4 |
Axiomatising real-timed processes
- Chen
- 1993
(Show Context)
Citation Context ...gebra of timed regular processes. This result is not very shocking; similar results have been obtained by Aceto and Jeffrey [1] in the regular subcalculus of Wang Yi's timed CCS [16, 26], and by Chen =-=[8]-=- in his extension of CCS with real time. Bergstra and Klop [6] and Milner [21] deduced completeness results for axiomatizations for untimed regular processes with silent steps, in observational congru... |

3 |
Regular processes with rational time and silent steps
- Fokkink
- 1992
(Show Context)
Citation Context ...ey are not essential for presenting the main ideas of this paper. A straightforward collection of axioms from [2], together with axioms R1,2, suffice to eliminate these operators from the syntax, see =-=[9]-=-. 1 A stronger elimination result is proved in [10], for a class 1 For this elimination result it is essential that the time domain consists of the rationals, instead of the reals. For example, if X =... |

3 |
Congruent weak bisimulation with dense real-time
- Ho-Stuart, Zedan, et al.
- 1993
(Show Context)
Citation Context |

2 |
A model for real-time process algebras
- Chen
- 1993
(Show Context)
Citation Context |