Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Hybrid Systems: Computation and Control

HSCC 2007: Hybrid Systems: Computation and Control pp 90–103Cite as

Symbolic Analysis for GSMP Models with One Stateful Clock

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4416))

Abstract

We consider the problem of verifying reachability properties of stochastic real-time systems modeled as generalized semi-Markov processes (GSMPs). The standard simulation-based techniques for GSMPs are not adequate for solving verification problems, and existing symbolic techniques either require memoryless distributions for firing times, or approximate the problem using discrete time or bounded horizon. In this paper, we present a symbolic solution for the case where firing times are random variables over a rich class of distributions, but only one event is allowed to retain its firing time when a discrete change occurs. The solution allows us to compute the probability that such a GSMP satisfies a property of the form “can the system reach a target, while staying within a set of safe states”. We report on illustrative examples and their analysis using our procedure.

This research was supported by the US National Science Foundation via grants CCR-0410662 and CSR-EHS 0509143.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alur, R., Bernadsky, M.: Bounded model checking for GSMP models of stochastic real-time systems. In: Hespanha, J.P., Tiwari, A. (eds.) HSCC 2006. LNCS, vol. 3927, pp. 19–33. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  2. Alur, R., Courcoubetis, C., Dill, D.L.: Model-checking for probabilistic real-time systems. In: Leach Albert, J., Monien, B., Rodríguez-Artalejo, M. (eds.) ICALP 1991. LNCS, vol. 510, pp. 115–136. Springer, Heidelberg (1991)

    Google Scholar 

  3. Alur, R., Dill, D.L.: A theory of timed automata. TCS 126, 183–235 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  4. Asmussen, S.: Applied Probability and Queues. Springer, Heidelberg (2006)

    Google Scholar 

  5. Aziz, A., et al.: Model-checking continuous-time Markov chains. ACM Trans. on Computational Logic 1(1), 162–170 (2000)

    Article  MathSciNet  Google Scholar 

  6. Choi, H., Kulkarni, V.G., Trivedi, K.: Markov regenerative stochastic Petri nets. Performance Evaluation 20, 337–357 (1994)

    Article  MathSciNet  Google Scholar 

  7. Cumani, A.: Esp — A package for the evaluation of stochastic Petri nets with phase-type distributed transition times. In: Proc. of Int. Workshop on Timed Petri Nets, Torino, Italy, no. 674, pp. 144–151. IEEE Computer Society Press, Los Alamitos (1985)

    Google Scholar 

  8. German, R.: Performance analysis of communication systems: Modeling with non-Markovian stochastic Petri nets. J. Wiley & Sons, Chichester (2000)

    MATH  Google Scholar 

  9. Glynn, P.W.: A GSMP formalism for discrete event systems. Proc. of the IEEE 77(1), 14–23 (1988)

    Article  Google Scholar 

  10. Haverkort, B.: Performance of computer-communication systems: A model-based approach. Wiley & Sons, Chichester (1998)

    Google Scholar 

  11. Kwiatkowska, M.Z.: Model checking for probability and time: from theory to practice. In: Proc. of the 18th IEEE Symposium on Logic in CS, pp. 351–360. IEEE Computer Society Press, Los Alamitos (2003)

    Google Scholar 

  12. Lindemann, C., Thümmler, A.: Numerical Analysis of Generalized Semi-Markov Processes. Research Report No. 722, Dept. of CS, University of Dortmund (1999)

    Google Scholar 

  13. López, G., Hermanns, H., Katoen, J.-P.: Beyond Memoryless Distributions: Model Checking Semi-Markov Chains. In: de Luca, L., Gilmore, S. (eds.) PROBMIV 2001, PAPM-PROBMIV 2001, and PAPM 2001. LNCS, vol. 2165, pp. 57–70. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  14. Shedler, G.S.: Regenerative stochastic simulation. Academic Press, London (1993)

    MATH  Google Scholar 

  15. Ye, H., Corless, R.: Solving linear integral equations in Maple. In: Proc. of the Int. Symposium on Symbolic and Algebraic Computation, pp. 95–102 (1992)

    Google Scholar 

  16. Zeilberger, D.: Holonomic Systems Approach To Special Functions. J. Computational and Applied Math. 32, 321–368 (1990)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer and Information Science, University of Pennsylvania,  

    Mikhail Bernadsky & Rajeev Alur

Authors
  1. Mikhail Bernadsky
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rajeev Alur
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Alberto Bemporad Antonio Bicchi Giorgio Buttazzo

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Bernadsky, M., Alur, R. (2007). Symbolic Analysis for GSMP Models with One Stateful Clock. In: Bemporad, A., Bicchi, A., Buttazzo, G. (eds) Hybrid Systems: Computation and Control. HSCC 2007. Lecture Notes in Computer Science, vol 4416. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71493-4_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-71493-4_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-71492-7

  • Online ISBN: 978-3-540-71493-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation