Article

Verifying Quantitative Properties of Continuous Probabilistic Timed Automata

Authors:

Marta Z. Kwiatkowska,

Roberto Segala,

Jeremy SprostonAuthors Info & Claims

CONCUR '00: Proceedings of the 11th International Conference on Concurrency Theory

Pages 123 - 137

Published: 22 August 2000 Publication History

Abstract

We consider the problem of automatically verifying real-time systems with continuously distributed random delays. We generalise probabilistic timed automata introduced in [19], an extension of the timed automata model of [4], with clock resets made according to continuous probability distributions. Thus, our model exhibits nondeterministic and probabilistic choice, the latter being made according to both discrete and continuous probability distributions. To facilitate algorithmic verification, we modify the standard region graph construction by subdividing the unit intervals in order to approximate the probability to within an interval. We then develop a model checking method for continuous probabilistic timed automata, taking as our specification language Probabilistic Timed Computation Tree Logic (PTCTL). Our method improves on the previously known techniques in that it allows the verification of quantitative probability bounds, as opposed to qualitative properties which can only refer to bounds of probability 0 or 1.

References

[1]

R. Alur. Private communication. 1998.

[2]

R. Alur, C. Courcoubetis, and D. Dill. Model-checking for probabilistic real-time systems. In Proc. ICALP'91, volume 510 of LNCS. Springer, 1991.

[3]

R. Alur, C. Courcoubetis, and D. Dill. Model-checking in dense real-time. Information and Computation, 104(1), 1993.

[4]

R. Alur and D. Dill. A theory of timed automata. Theoretical Computer Science, 126, 1994.

[5]

R. B. Ash. Real Analysis and Probability. Academic Press, 1972.

[6]

C. Baier, E. Clarke, V. Hartonas-Garmhausen, M. Kwiatkowska, and M. Ryan. Symbolic model checking for probabilistic processes. In Proc. ICALP'97, volume 1256 of LNCS. Springer, 1997.

[7]

C. Baier, J.-P. Katoen, and H. Hermanns. Approximate symbolic model checking of continuous-time Markov chains. In CONCUR'99, volume 1664 of LNCS. Springer, 1999.

[8]

C. Baier and M. Kwiatkowska. Model checking for a probabilistic branching time logic with fairness. Distributed Computing, 11, 1998.

[9]

J. Bengtsson, K. Larsen, F. Larsson, P. Pettersson, W. Yi, and C. Weise. New generation of UPPAAL. In Proc. International Workshop on Software Tools for Technology Transfer, 1998.

[10]

A. Bianco and L. de Alfaro. Model checking of probabilistic and nondeterministic systems. In FST and TCS, volume 1026 of LNCS. Springer, 1995.

[11]

M. Bozga, C. Daws, O. Maler, A. Olivero, S. Tripakis, and S. Yovine. Kronos: a model-checking tool for real-time systems. In Proc. CAV'98, volume 1427 of LNCS. Springer, 1998.

[12]

P. D'Argenio, J.-P. Katoen, and E. Brinksma. Specification and analysis of soft real-time systems: Quantity and quality. In Proc. IEEE Real-Time Systems Symposium. IEEE Computer Society Press, 1999.

[13]

L. de Alfaro. How to specify and verify the long-run average behaviour of probabilistic systems. In Proc. LICS'98. IEEE Computer Society Press, 1998.

[14]

L. de Alfaro. Stochastic transition systems. In Proc. CONCUR'98, volume 1466 of LNCS. Springer, 1998.

[15]

J. Desharnais, V. Gupta, R. Jagadeesan, and P. Panangaden. Approximating labelled Markov processes. To appear in LICS'2000.

[16]

H. Hansson and B. Jonsson. A logic for reasoning about time and reliability. Formal Aspects of Computing, 6(4), 1994.

[17]

T. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine. Symbolic model checking for real-time systems. Information and Computation, 111(2), 1994.

[18]

M. Kwiatkowska, G. Norman, R. Segala, and J. Sproston. Automatic verification of quantitative properties of continuous probabilistic real-time automata. Technical Report CSR-00-06, University of Birmingham, 2000.

[19]

M. Kwiatkowska, G. Norman, R. Segala, and J. Sproston. Automatic verification of real-time systems with discrete probability distributions. Technical Report CSR- 00-02, University of Birmingham, 2000. Accepted for a Special Issue of Theoretical Computer Science. Preliminary version of this paper appeared in Proc. ARTS'99, LNCS vol 1601, 1999.

[20]

R. Segala. Modelling and Verification of Randomized Distributed Real Time Systems. PhD thesis, Massachusetts Institute of Technology, 1995.

Cited By

Brázdil TKorenăźIak ăKrăźál JNovotný PźEhák V(2015)Optimizing Performance of Continuous-Time Stochastic Systems Using Timeout SynthesisProceedings of the 12th International Conference on Quantitative Evaluation of Systems - Volume 925910.1007/978-3-319-22264-6_10(141-159)Online publication date: 1-Sep-2015
https://dl.acm.org/doi/10.1007/978-3-319-22264-6_10
Konur S(2013)A survey on temporal logics for specifying and verifying real-time systemsFrontiers of Computer Science: Selected Publications from Chinese Universities10.1007/s11704-013-2195-27:3(370-403)Online publication date: 1-Jun-2013
https://dl.acm.org/doi/10.1007/s11704-013-2195-2
Ballarini PBertrand NHorváth APaolieri MVicario E(2013)Transient analysis of networks of stochastic timed automata using stochastic state classesProceedings of the 10th international conference on Quantitative Evaluation of Systems10.1007/978-3-642-40196-1_30(355-371)Online publication date: 27-Aug-2013
https://dl.acm.org/doi/10.1007/978-3-642-40196-1_30
Show More Cited By

Verifying Quantitative Properties of Continuous Probabilistic Timed Automata
1. Theory of computation
  1. Models of computation

Recommendations

Interrupt Timed Automata: verification and expressiveness

We introduce the class of Interrupt Timed Automata (ITA), a subclass of hybrid automata well suited to the description of timed multi-task systems with interruptions in a single processor environment.

While the reachability problem is undecidable for ...
Quantitative Automata under Probabilistic Semantics
LICS '16: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science

Automata with monitor counters, where the transitions do not depend on counter values, and nested weighted automata are two expressive automata-theoretic frameworks for quantitative properties. For a well-studied and wide class of quantitative functions,...
Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics
QEST '08: Proceedings of the 2008 Fifth International Conference on Quantitative Evaluation of Systems

In [BBBBG08] a probabilistic semantics for timed automata has been defined in order to rule out unlikely (sequences of) events. The qualitative model-checking problem for LTL properties has been investigated, where the aim is to check whether a given ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

CONCUR '00: Proceedings of the 11th International Conference on Concurrency Theory

August 2000

610 pages

ISBN:3540678972

Editor:
Catuscia Palamidessi

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 22 August 2000

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

17
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 12 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Brázdil TKorenăźIak ăKrăźál JNovotný PźEhák V(2015)Optimizing Performance of Continuous-Time Stochastic Systems Using Timeout SynthesisProceedings of the 12th International Conference on Quantitative Evaluation of Systems - Volume 925910.1007/978-3-319-22264-6_10(141-159)Online publication date: 1-Sep-2015
https://dl.acm.org/doi/10.1007/978-3-319-22264-6_10
Konur S(2013)A survey on temporal logics for specifying and verifying real-time systemsFrontiers of Computer Science: Selected Publications from Chinese Universities10.1007/s11704-013-2195-27:3(370-403)Online publication date: 1-Jun-2013
https://dl.acm.org/doi/10.1007/s11704-013-2195-2
Ballarini PBertrand NHorváth APaolieri MVicario E(2013)Transient analysis of networks of stochastic timed automata using stochastic state classesProceedings of the 10th international conference on Quantitative Evaluation of Systems10.1007/978-3-642-40196-1_30(355-371)Online publication date: 27-Aug-2013
https://dl.acm.org/doi/10.1007/978-3-642-40196-1_30
Ferrer Fioriti LHermanns H(2012)Heuristics for probabilistic timed automata with abstraction refinementProceedings of the 16th international GI/ITG conference on Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance10.1007/978-3-642-28540-0_11(151-165)Online publication date: 19-Mar-2012
https://dl.acm.org/doi/10.1007/978-3-642-28540-0_11
Crespo Fde la Encina ALlana L(2010)Fuzzy-Timed automataProceedings of the 12th IFIP WG 6.1 international conference and 30th IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems10.1007/978-3-642-13464-7_12(140-154)Online publication date: 7-Jun-2010
https://dl.acm.org/doi/10.1007/978-3-642-13464-7_12
Colvin RGrunske LWinter K(2007)Probabilistic timed behavior treesProceedings of the 6th international conference on Integrated formal methods10.5555/1770498.1770507(156-175)Online publication date: 2-Jul-2007
https://dl.acm.org/doi/10.5555/1770498.1770507
Kwiatkowska MCrnkovic IBertolino A(2007)Quantitative verificationThe 6th Joint Meeting on European software engineering conference and the ACM SIGSOFT symposium on the foundations of software engineering: companion papers10.1145/1295014.1295018(449-458)Online publication date: 3-Sep-2007
https://dl.acm.org/doi/10.1145/1295014.1295018
Kwiatkowska MCrnkovic IBertolino A(2007)Quantitative verificationProceedings of the the 6th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering10.1145/1287624.1287688(449-458)Online publication date: 7-Sep-2007
https://dl.acm.org/doi/10.1145/1287624.1287688
Younes HSimmons R(2006)Statistical probabilistic model checking with a focus on time-bounded propertiesInformation and Computation10.1016/j.ic.2006.05.002204:9(1368-1409)Online publication date: 1-Sep-2006
https://dl.acm.org/doi/10.1016/j.ic.2006.05.002
Wolovick NJohr S(2006)A characterization of meaningful schedulers for continuous-time markov decision processesProceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems10.1007/11867340_25(352-367)Online publication date: 25-Sep-2006
https://dl.acm.org/doi/10.1007/11867340_25
Show More Cited By

View Options

View options

Figures

Tables

Media

View Table of Conten