Change search
ReferencesLink to record
Permanent link

Direct link
A logic for reasoning about time and reliability
Number of Authors: 2
1990 (English)Report (Refereed)
Abstract [en]

We present a logic for stating properties such as, "after a request for service there is at least a 98\045 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 satis- fies a formula in the logic. The algorithms require a polynomial number of arithmetic operations, in size of both the formula and\003This research report is a revised and extended version of a paper that has appeared under the title "A Framework for Reasoning about Time and Reliability" in the Proceeding of the 10thIEEE Real-time Systems Symposium, Santa Monica CA, December 1989. This work was partially supported by the Swedish Board for Technical Development (STU) as part of Esprit BRA Project SPEC, and by the Swedish Telecommunication Administration.1the Markov chain. A simple example is included to illustrate the algorithms.

Place, publisher, year, edition, pages
Kista, Sweden: Swedish Institute of Computer Science , 1990, 1. , 35 p.
Series
SICS Research Report, ISSN 0283-3638 ; R90:13
Keyword [en]
Branching time temporal logic, Markov chains, Model checking, Real-time, Reliability
National Category
Computer and Information Science
Identifiers
URN: urn:nbn:se:ri:diva-21343OAI: oai:DiVA.org:ri-21343DiVA: diva2:1041377
Note
Original report number R90013.Available from: 2016-10-31 Created: 2016-10-31

Open Access in DiVA

fulltext(296 kB)4 downloads
File information
File name FULLTEXT01.pdfFile size 296 kBChecksum SHA-512
2fa868c93dad45d7c618e4324a8d193c9456cb5efd0aa21e4623568df2a2993113c28cbb54245b1758e50de34c7a77c4c27742dfee88a91391d4553dfb810c5e
Type fulltextMimetype application/pdf

Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 4 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

ReferencesLink to record
Permanent link

Direct link