Global Timed Bisimulation: An Introduction
Global Timed Bisimulation: An Introduction
复制标题
全局定时双向模拟:简介
DOI:
--
复制
发表时间:
1999
期刊:
影响因子:
--
通讯作者:
M. Núñez
中科院分区:
文献类型:
--
作者:
David de Frutos;Natalia López;M. Núñez
Bisimulations are a broadly used formalism to define the semantics of process algebras. In particular, by means of weak bisimulation most of the internal activity of processes may be abstracted. Unfortunately, this is not fully accomplished: for instance, the internal choice operator becomes non-associative since bisimulation can see the branching structure of processes. In this paper we propose global timed bisimulation as a weakening of weak timed bisimulation. Global timed bisimulation is defined exactly as weak timed bisimulation once ordinary transitions are replaced by the adequate notions of generalized transitions. In order to asses the definition of our global timed bisimulation we present a collection of small examples that illustrate each of the clauses of that definition. Finally, a more elaborated example is presented to summarize the main properties of that notion.