Abstract
In this paper we present a methodology for the verification of performance and reliability properties of discrete real-time systems. The methodology relies on a temporal logic that can express bounds on the probability of events and on the average time between them. The semantics of the logics is defined with respect to timed systems that exhibit both probabilistic and nondeterministic behavior. We present model-checking algorithms for the algorithmic verification of the specifications, and we discuss their complexity.
The research was supported in part by the National Science Foundation under grant CCR-9527927, by the Defense Advanced Research Projects Agency under contract NAG2-892, by ARO under grant DAAH04-95-1-0317, and by ARO under the MURI grant DAAH04-96-1-0341.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
R. Alur and D. Dill. The theory of timed automata. In Real-Time: Theory in Practice, volume 600 of Lect. Notes in Comp. Sci., pages 45–73. Springer-Verlag, 1991.
A. Aziz, V. Singhal, F. Balarin, R.K. Brayton, and A.L. Sangiovanni-Vincentelli. It usually works: The temporal logic of stochastic systems. In Computer Aided Verification, volume 939 of Lect. Notes in Comp. Sci. Springer-Verlag, 1995.
D. Beauquier and A. Slissenko. Polytime model checking for timed probabilistic computation tree logic. Technical Report TR-96-08, Dept. of Informatics, Univ. Paris-12, April 1996.
D.P. Bertsekas. Dynamic Programming. Prentice-Hall, 1987.
A. Bianco and L. de Alfaro. Model checking of probabilistic and nondeterministic systems. In Found. of Software Tech. and Theor. Comp. Sci., volume 1026 of Lect. Notes in Comp. Sci., pages 499–513. Springer-Verlag, 1995.
C. Courcoubetis and M. Yannakakis. Markov decision processes and regular events. In ICALP'90, volume 443 of Lect. Notes in Comp. Sci., pages 336–349. Springer-Verlag, 1990.
L. de Alfaro. Formal verification of performance and reliability of real-time systems. Technical Report STAN-CS-TR-96-1571, Stanford University, June 1996.
E.V. Denardo. Computing a bias-optimal policy in a discrete-time markov decision problem. Operations Research, 18:279–289, 1970.
C. Derman. Finite State Markovian Decision Processes. Acedemic Press, 1970.
E.A. Emerson. Temporal and modal logic. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 16, pages 995–1072. Elsevier Science Publishers (North-Holland), Amsterdam, 1990.
E.A. Emerson and C.L. Lei. Modalities for model checking: Branching time strikes back. In Proc. 12th ACM Symp. Princ. of Prog. Lang., pages 84–96, 1985.
H. Hansson. Time and Probability in Formal Design of Distributed Systems. Elsevier, 1994.
H. Hansson and B. Jonsson. A framework for reasoning about time and reliability. In Proc. of Real Time Systems Symposium, pages 102–111. IEEE, 1989.
J.G. Kemeny, J.L. Snell, and A.W. Knapp. Denumerable Markov Chains. D. Van Nostrand Company, 1966.
Y. Kesten, Z. Manna, and A. Pnueli. Verifying clocked transition systems. In Hybrid Systems III, volume 1066 of Lect. Notes in Comp. Sci., pages 13–40. Springer-Verlag, 1996.
O. Kupferman and A. Pnueli. Once and for all. In Proc. 10th IEEE Symp. Logic in Comp. Sci., pages 25–35, 1995.
M. Kwiatkowska and C. Baier. Model checking for a probabilistic branching time logic with fairness. Technical Report CSR-96-12, University of Birmingham, June 1996.
Z. Manna and A. Pnueli. Models for reactivity. Acta Informatica, 30:609–678, 1993.
M.L. Puterman. Markov Decision Processes. John Wiley and Sons, 1994.
S. Safra. On the complexity of ω-automata. In Proc. 29th IEEE Symp. Found. of Comp. Sci., 1988.
S. Safra. Exponential determinization for ω-automata with strong-fairness acceptance condition. In Proc. ACM Symp. Theory of Comp., pages 275–282, 1992.
R. Segala. Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, MIT, June 1995. Technical Report MIT/LCS/TR-676.
R. Segala and N.A. Lynch. Probabilistic simulations for probabilistic processes. In CONCUR'94, volume 836, pages 481–496. Springer-Verlag, 1994.
M.Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proc. First IEEE Symp. Logic in Comp. Sci., pages 332–344, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de Alfaro, L. (1997). Temporal logics for the specification of performance and reliability. In: Reischuk, R., Morvan, M. (eds) STACS 97. STACS 1997. Lecture Notes in Computer Science, vol 1200. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023457
Download citation
DOI: https://doi.org/10.1007/BFb0023457
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62616-9
Online ISBN: 978-3-540-68342-1
eBook Packages: Springer Book Archive