From Branching to Linear Time, Coalgebraically

From Branching to Linear Time, Coalgebraically
复制标题

从代数意义上的分支到线性时间

DOI:
10.4204/eptcs.126.2
复制
发表时间:
2013
期刊:
Fundam. Informaticae
影响因子:
--
通讯作者:
C. Cîrstea
C. Cîrstea
中科院分区:
--
文献类型:
--
作者:
C. Cîrstea

文献摘要

被引文献

相似文献

我们将基于状态的系统建模为协代数,其类型包含分支,并表明通过适当地适应协代数双模拟的定义,可以得到这种协代数中状态的线性时间行为的一般和一致的说明。通过远离真值的布尔宇宙,我们的方法可以测量具有分支的系统中的状态能够表现出特定线性时间行为的程度。例如,在概率系统中测量特定行为发生的概率,或者在加权计算的情况下测量显示特定行为的最小成本。
We consider state-based systems modelled as coalgebras whose type incorporates branching, and show that by suitably adapting the definition of coalgebraic bisimulation, one obtains a general and uniform account of the linear-time behaviour of a state in such a coalgebra. By moving away from a boolean universe of truth values, our approach can measure the extent to which a state in a system with branching is able to exhibit a particular linear-time behaviour. This instantiates to measuring the probability of a specific behaviour occurring in a probabilistic system, or measuring the minimal cost of exhibiting a specific behaviour in the case of weighted computations.