Topological (Bi-)Simulation
Topological (Bi-)Simulation
复制标题
拓扑(双)仿真
DOI:
10.1016/j.entcs.2004.08.017
复制
发表时间:
2004
期刊:
影响因子:
--
通讯作者:
M. Reniers
中科院分区:
文献类型:
--
作者:
P. Cuijpers;M. Reniers
Since the work of van Glabbeek [9] there is a general agreement within computer science that bisimulation is the strongest notion of equivalence of interest on labelled transition systems. However, for example in the field of hybrid systems the need is felt for a stronger kind of equivalence than bisimulation. There, the problem of Zeno-behavior (an infinite number of events occurring in a finite time interval [16, 5, 3, 10], also called supertask in philosophy [15, 18]), gives rise to labelled transition systems that are considered different, but cannot be distinguished using bisimulation.