状态标记马尔可夫链的速率降低与上界时间受限CSL要求
Rate Reduction for State-labelled Markov Chains with Upper Time-bounded CSL Requirements
AI总结:
本文提出算法用于识别并降低状态标记连续时间马尔可夫链模型中可控转移速率集,以满足由CSL上界时间受限Until公式指定的要求,通过状态空间自然划分提出两种简单算法。
摘要:
本文提出算法用于识别并降低状态标记连续时间马尔可夫链模型中可控转移速率集,以满足由CSL上界时间受限Until公式指定的要求。我们区分了两种不同的情况,取决于概率界类型。状态空间的自然划分允许我们开发可能的解决方案,从而得到两种情况的简单算法。
英文摘要:
This paper presents algorithms for identifying and reducing a dedicated set of controllable transition rates of a state-labelled continuous-time Markov chain model. The purpose of the reduction is to make states to satisfy a given requirement, specified as a CSL upper time-bounded Until formula. We distinguish two different cases, depending on the type of probability bound. A natural partitioning of the state space allows us to develop possible solutions, leading to simple algorithms for both cases.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。