arrow
返回

A logic for reasoning about time and reliability

delete1994-09-01
delete0
delete
OA
AI
DOI:10.1007/bf01211866delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
AbstractWe present a logic for stating properties such as, “after a request for service there is at least a 98% probability that the service will be carried out within 2 seconds”. The logic extends the temporal logic CTL by Emerson, Clarke and Sistla with time and probabilities. Formulas are interpreted over discrete time Markov chains. We give algorithms for checking that a given Markov chain satisfies a formula in the logic. The algorithms require a polynomial number of arithmetic operations, in size of both the formula and the Markov chain. A simple example is included to illustrate the algorithms.

期刊

暂无期刊信息

机构

暂无机构信息
引用论文

引用论文

暂无论文信息