Abstract
Hybrid automata offer a framework for the description of systems with both discrete and continuous components, such as digital technology embedded in an analogue environment. Traditional uses of hybrid automata express choice of transitions purely in terms of nondeterminism, abstracting potentially significant information concerning the relative likelihood of certain behaviours. To model such probabilistic information, we present a variant of hybrid automata augmented with discrete probability distributions. We concentrate on restricted subclasses of the model in order to obtain decidable model checking algorithms for properties expressed in probabilistic temporal logics.
Supported in part by the EPSRC grant GR/N22960.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Alur, C. Courcoubetis, N. Halbwachs, T. A. Henzinger, P.-H. Ho, X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine. The algorithmic analysis of hybrid systems. Theoretical Computer Science, 138:3–34, 1995.
R. Alur and D. Dill. A theory of timed automata. Theoretical Computer Science, 126:183–235, 1994.
R. Alur, T. A. Henzinger, G. Lafferriere, and G. J. Pappas. Discrete abstractions of hybrid systems. To appear in Proceedings of the IEEE, 2000.
A. Aziz, V. Singhal, F. Balarin, R. Brayton, and A. Sangiovanni-Vincentelli. It usually works: the temporal logic of stochastic systems. In Proc. 7th CAV, volume 939 of Lecture Notes in Computer Science, pages 155–165. Springer-Verlag, 1995.
C. Baier. On algorithmic verification methods for probabilistic systems, 1998. Habilitation thesis, University of Mannheim.
C. Baier and M. Kwiatkowska. Model checking for a probabilistic branching time logic with fairness. Distributed Computing, 11:125–155, 1998.
A. Bianco and L. de Alfaro. Model checking of probabilistic and nondeterministic systems. In Proc. FST&TCS’95, volume 1026 of LNCS, pages 499–513. Springer-Verlag, 1995.
L. de Alfaro, M. Kwiatkowska, G. Norman, D. Parker, and R. Segala. Symbolic model checking of concurrent probabilistic processes using MTBDDs and the Kronecker representation. In Proc. TACAS’00, volume 1785 of LNCS, pages 395–410. Springer-Verlag, 2000.
H. Hansson and B. Jonsson. A logic for reasoning about time and reliability. Formal Aspects of Computing, 6(5):512–535, 1994.
T. A. Henzinger, B. Horowitz, and R. Majumdar. Rectangular hybrid games. In Proc. CONCUR’99, volume 1664 of LNCS, pages 320–335. Springer-Verlag, 1999.
T. A. Henzinger, B. Horowitz, R. Majumdar, and H. Wong-Toi. Beyond HyTech: hybrid systems analysis using interval numerical methods. In Proc. HSCC’00, volume 1790 of LNCS, pages 130–144. Springer-Verlag, 2000.
T. A. Henzinger, P. Kopke, A. Puri, and P. Varaiya. What’s decidable about hybrid automata? Journal of Computer and System Sciences, 57(1):94–124, 1998.
T. A. Henzinger and R. Majumdar. Symbolic model checking for rectangular hybrid systems. In Proc. TACAS’00, volume 1785 of LNCS, pages 142–156. Springer-Verlag, 2000.
J. Hu, J. Lygeros, and S. Sastry. Towards a theory of stochastic hybrid systems. In Proc. HSCC’00, volume 1790 of LNCS. Springer-Verlag, 2000.
B. Jonsson and K. G. Larsen. Specification and refinement of probabilistic processes. In Proc. 6th LICS, pages 266–279. IEEE Computer Society Press, 1991.
M. Kwiatkowska, G. Norman, R. Segala, and J. Sproston. Automatic verification of real-time systems with discrete probability distributions. To appear in Theoretical Computer Science, special issue on ARTS’99: Formal Methods for Real-time and Probabilistic Systems, 2000.
M. Kwiatkowska, G. Norman, R. Segala, and J. Sproston. Verifying quantitative properties of continuous probabilistic timed automata. In Proc. CONCUR’00, LNCS. Springer-Verlag, 2000.
G. Lafferriere, G. Pappas, and S. Yovine. A new class of decidable hybrid systems. In Proc. HSCC’99, volume 1569 of LNCS, pages 137–151. Springer-Verlag, 1999.
R. Milner. Communication and Concurrency. International Series in Computer Science. Prentice Hall, 1989.
A. Olivero, J. Sifakis, and S. Yovine. Using abstractions for the verification of linear hybrid systems. In Proc. 6th CAV, volume 818 of LNCS, pages 81–94. Springer-Verlag, 1994.
R. Segala and N. Lynch. Probabilistic simulations for probabilistic processes. Nordic Journal of Computing, 2(2):250–273, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sproston, J. (2000). Decidable Model Checking of Probabilistic Hybrid Automata. In: Joseph, M. (eds) Formal Techniques in Real-Time and Fault-Tolerant Systems. FTRTFT 2000. Lecture Notes in Computer Science, vol 1926. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45352-0_5
Download citation
DOI: https://doi.org/10.1007/3-540-45352-0_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41055-3
Online ISBN: 978-3-540-45352-9
eBook Packages: Springer Book Archive