Abstract:
We 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 This 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 10 th IEEE 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. the Markov chain. A simple example is inc...
Citations
|
2014
|
The Design and Analysis of Computer Algorithms
– Aho, Hopcroft, et al.
- 1974
|
|
985
|
Automatic verification of finite-state concurrent systems using temporal logic specifications
– Clarke, Emerson, et al.
- 1986
|
|
479
|
Finite Markov Chains
– Kemeny, Snell
- 1983
|
|
453
|
and P.Wolper. An Automata-Theoretic approach to Automatic Program Verification
– Vardi
- 1986
|
|
405
|
The Science of Programming
– Gries
- 1981
|
|
217
|
Safety analysis of timing properties in real-time systems
– Jahanian, Mok
- 1986
|
|
190
|
A really temporal logic
– Alur, Henzinger
- 1989
|
|
180
|
Algorithmic Graph Theory
– Gibbons
- 1989
|
|
173
|
Automatic verification of probabilistic concurrent finite-state programs
– Vardi
- 1985
|
|
146
|
A note on reliable full-duplex transmissions over half duplex lines
– Bartlett, Scantlebury, et al.
- 1969
|
|
131
|
Using branching time temporal logic to synthesize synchronization skeletons
– Clarke, Emerson
- 1982
|
|
108
|
Quantitative temporal reasoning
– Emerson, Mok, et al.
- 1990
|
|
96
|
Performance Models of Multiprocessor Systems
– Marsan, Balbo, et al.
- 1986
|
|
47
|
A generalized timed Petri net model for performance analysis
– Holliday, Vernon
- 1985
|
|
47
|
Verification of multiprocess probabilistic protocols
– Pnueli, Zuck
- 1986
|
|
44
|
Termination of probabilistic concurrent programs
– Hart, Sharir, et al.
- 1983
|
|
37
|
Applications of temporal logic to the specification of real-time systems
– Pnueli, Harel
- 1988
|
|
30
|
Probabilistic Temporal Logic for Finite and Bounded Models
– Hart, Sharir
- 1984
|
|
27
|
Real-time programming and asynchronous message passing
– Koymans, Vytopil, et al.
- 1983
|
|
23
|
A software package for the analysis of generalized stochastic Petri net models
– Chiola
- 1985
|
|
21
|
Proving real-time properties of programs with temporal logic
– Bernstein, Harter
- 1981
|
|
10
|
Decidability and expressiveness of logics of processes
– Abrahamson
- 1980
|
|
9
|
Reasoning about Fair Concurrent Programs
– Courcoubetis, Vardi, et al.
- 1986
|
|
9
|
W.M.: Modelling, Specifying and Verifying Real-time Embedded Computer Systems
– Ostroff, Wonham
|
|
8
|
Fairness Properties in Process Algebra
– Parrow
- 1985
|
|
7
|
Exact Performance Estimates for Multiprocessor Memory and Bus Interference
– Holliday, Vernon
- 1987
|
|
5
|
Performance Analysis of Multiprocessor Cache Consistency Protocols Using Generalized Timed Petri Nets
– Vernon, Holliday
- 1986
|
|
4
|
A decidable propositional probabilistic dynamic logic with explicit probabilities
– Feldman
- 1984
|
|
1
|
Mol82] M.K. Molloy. Performane analysis using stochastic petri nets
– Information, Control
- 1982
|
|
1
|
Proving liveness properteis of concurrent programs
– Owicki, Lamport
- 1982
|
|
1
|
Time dependent distributed systems: Proving safety, liveness and real-time properties
– North-Holland
- 1984
|
