Abstract
We can model embedded systems as hybrid systems. Moreover, they are distributed and real-time systems. Therefore, it is important to specify and verify randomness and soft real-time properties. For the purpose of system verification, we formally define probabilistic linear hybrid automaton and its symbolic reachability analysis method. It can describe uncertainties and soft real-time characteristics. Our proposal method is the first attempt to symbolically verify probabilistic linear hybrid automata.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Alur, R., Henzinger, T.A., Ho, P.-H.: Automatic symbolic verification of embedded systems. IEEE Transactions on Software Engineering 22(3), 181–201 (1996)
Alur, R., Coucoubetis, C., Henzinger, T.A., Ho, P.-H., Nicollin, X., Olivero, A., Sifakis, J., Yovine, S.: The algorithmic analysis of hybrid systems. Theoretical Computer Science 138, 3–34 (1995)
Henzinger, T.A., Nicollin, X., Sifakis, J., Yovine, S.: Symbolic model checking for real-time systems. Information and Computation 111, 193–244 (1994)
Kwiatkowska, M., Norman, G., Sproston, J.: Symbolic model checking for probabilistic timed automata. Technical Report CSR-03-10, School of Computer Science, University of Birmingham (2003)
Kwiatkowska, M., Norman, G., Segala, R., Sproston, J.: Automatic verification of real-time systems with discrete probability distributions. Theoretical Computer Science 282, 101–150 (2002)
Sproston, J.: Model checking for probabilistic timed and hybrid systems. PhD thesis, Technical Report CSR-01-04, School of Computer Science, University of Birmingham (2001)
Sproston, J.: Analyzing subclasses of probabilistic hybrid automata. Technical Report CSR-99-8, School of Computer Science, University of Birmingham (1999)
Sproston, J.: Decidable model checking of probabilistic hybrid automata. In: Joseph, M. (ed.) FTRTFT 2000. LNCS, vol. 1926, pp. 31–45. Springer, Heidelberg (2000)
Hart, S., Sharir, M., Pnueli, A.: Termination of Probabilistic concurrent program. ACM Transactions on Programming Languages and Systems (TOPLAS) 5(3), 356–380 (1983)
Emerson, E.A.: Temporal and modal logic. In: Handbook of theoretical computer science (vol. B): formal models and semantics, pp. 995–1072. MIT Press, Cambridge (1991)
Courcoubetis, C., Yannakakis, M.: The complexity of probabilistic verification. Journal of the ACM (JACM) 42(4), 857–907 (1995)
Tarski, A.: A decision method for elementary algebra and geometry, 2nd edn. University of California Press, Berkeley (1951)
Abrial, J.-R., Börger, E., Langmaack, H. (eds.): Dagstuhl Seminar 1995. LNCS, vol. 1165. Springer, Heidelberg (1996)
Henzinger, T.A., Wong-Toi, H.: Using HYTECH to synthesize control parameters for a steam boiler. In: [13], pp. 265–282
McIver, A., Morgan, C., Troubitsyna, E.: The probabilistic steam boiler: a case study in probabilistic data refinement. In: Proc. of IRW/FMP 1998, Australia (1998)
Clarke, E.M., Grumberg, O., Peled, D.A.: Model checking. MIT Press, Cambridge (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mutsuda, Y., Kato, T., Yamane, S. (2005). Specification and Verification Techniques of Embedded Systems Using Probabilistic Linear Hybrid Automata. In: Yang, L.T., Zhou, X., Zhao, W., Wu, Z., Zhu, Y., Lin, M. (eds) Embedded Software and Systems. ICESS 2005. Lecture Notes in Computer Science, vol 3820. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11599555_34
Download citation
DOI: https://doi.org/10.1007/11599555_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30881-2
Online ISBN: 978-3-540-32297-9
eBook Packages: Computer ScienceComputer Science (R0)