首页> 外文会议>CONCUR'99 : Concurrency theory >Approximate symbolic model checking of continuous-time markov chains (extended )abstract
【24h】

Approximate symbolic model checking of continuous-time markov chains (extended )abstract

机译:连续时间马尔可夫链(扩展)抽象的近似符号模型检查

获取原文
获取原文并翻译 | 示例

摘要

This paper presents a symbolic model checking algorithm for continuous-time Markov chains for an extension of the continuous stochastic logic CSL of Aziz et al [1]. The considered logic contains a time-bounded until-operator and a novel operator to express steady-state probabilities. We show that the model checking problem for this logic reduces to a system of linear equations (for unbounded until and the steady state-operator) and a Volterra integral equation system for time-bounded until. We propse a symbolic approximate method for solving the integrals using MTDDs (multi-terminal decision diagrams), a generalisation of MTBDDs. These new structures are suitable for numerical integration using quadrature formulas based on equally-spaced abscissas, like trapezoidal, Simpson and Romberg integration schemes.
机译:本文提出了一种用于连续时间马尔可夫链的符号模型检查算法,以扩展Aziz等人[1]的连续随机逻辑CSL。所考虑的逻辑包含一个限时的直到运算符和一个表示稳态概率的新颖运算符。我们证明了此逻辑的模型检查问题简化为线性方程组(对于无界直到和稳态算子)和Volterra积分方程组有时间限制到。我们提出了一种符号近似方法,用于使用MTDD(多端子决策图)(MTBDD的概括)求解积分。这些新结构适用于使用基于等距横坐标的正交公式进行数值积分,例如梯形,辛普森和Romberg积分方案。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号