Skip to main content

Stochastic transition systems

  • Conference paper
  • First Online:
CONCUR'98 Concurrency Theory (CONCUR 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1466))

Included in the following conference series:

Abstract

Traditional methods for the analysis of system performance and reliability generally assume a precise knowledge of the system and its workload. Here, we present methods that are suited for the analysis of systems that contain partly unknown or unspecified components, such as systems in their early design stages.

We introduce stochastic transition systems, a high-level formalism for the modeling of timed probabilistic systems. Stochastic transition systems extend current modeling capabilities by enabling the representation of transitions having unknown delay distributions, alongside transitions with zero or exponentially-distributed delay. We show how these various types of transitions can be uniformly represented in terms of nondeterminism, probability, fairness and time, yielding efficient algorithms for system analysis. Finally, we present methods for the specification and verification of long-run average properties of STSs. These properties include many relevant performance and reliability indices, such as system throughput, average response time, and mean time between failures.

This work was partially supported by the NSF grant CCR-95-27927, by DARPA under the NASA grant NAG2-892, by the ARO grant DAAH04-95-1-0317, by ARO under the MURI grant DAAH04-96-1-0341, by Army contract DABT63-96-C-0096 (DARPA), by the ONR YIP award N00014-95-1-0520, by the NSF CAREER award CCR-9501708, and by the NSF grant CCR-9504469.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Ajmone Marsan, G. Balbo, and G. Conte. A class of generalized stochastic Petri nets for the performance analysis of multiprocessor systems. ACM Trans. Comp. Sys., 2(2):93–122, 1984.

    Article  Google Scholar 

  2. R. Alur, C. Courcoubetis, and D. Dill. Verifying automata specifications of probabilistic real-time systems. In Real Time: Theory in Practice, volume 600 of LNCS, pages 28–44. Springer-Verlag, 1992.

    Google Scholar 

  3. M. Bernardo. An algebra-based method to associate rewards with EMPA terms. In Proc. ICALP'97, volume 1256 of LNCS, pages 358–368. Springer-Verlag, 1997.

    Google Scholar 

  4. M. Bernardo and R. Gorrieri. Extended Markovian process algebra. In Proc. CONCUR'96, volume 1119 of LNCS, pages 315–330. Springer-Verlag, 1996.

    Google Scholar 

  5. G. Ciardo, J.K. Muppala, and K.S. Trivedi. On the solution of GSPN reward models. Performance Evaluation, 12:237–253, 1991.

    Article  MATH  Google Scholar 

  6. G. Clark. Formalising the specification of rewards with PEPA. In Proc. 4th Workshop on Process Algebras and Performance Modelling, pages 139–160. CLUT, Torino, Italy, 1996.

    Google Scholar 

  7. L. de Alfaro. Formal Verification of Probabilistic Systems. PhD thesis, Stanford University, 1997. Technical Report STAN-CS-TR-98-1601.

    Google Scholar 

  8. L. de Alfaro. Temporal logics for the specification of performance and reliability. In Proc. STACS'97, volume 1200 of LNCS, pages 165–176. Springer-Verlag, 1997.

    Google Scholar 

  9. L. de Alfaro. How to specify and verify the long-run average behavior of probabilistic systems. In Proc. LICS'98, 1998. To appear.

    Google Scholar 

  10. C. Derman. Finite State Markovian Decision Processes. Acedemic Press, 1970.

    Google Scholar 

  11. H.N. Götz, U. Herzog, and M. Rettelbach. Multiprocessor and distributed system design: the integration of functional specification and performance analysis using stochastic process algebras. In PERFORMANCE'93, volume 729 of LNCS, Springer-Verlag, 1993.

    Google Scholar 

  12. J. Hillston. A Compositional Approach to Performance Modelling. Distinguished Dissertations Series. Cambridge University Press, 1996.

    Google Scholar 

  13. S. Hart, M. Sharir, and A. Pnueli. Termination of probabilistic concurrent programs. ACM Trans. Prog. Lang. Sys., 5(3):356–380, 1983.

    Article  MATH  Google Scholar 

  14. M. Kwiatkowska and C. Baier. Model checking for a probabilistic branching time logic with fairness. To appear in Distributed Computing. Preliminary version in Technical Report CSR-96-12, University of Birmingham, 1996.

    Google Scholar 

  15. J.G. Kemeny, J.L. Snell, and A.W. Knapp. Denumerable Markov Chains. D. Van Nostrand Company, 1966.

    Google Scholar 

  16. Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer-Verlag, New York, 1991.

    Google Scholar 

  17. A. Pnueli and L. Zuck. Probabilistic verification by tableaux. In Proc. LICS'86, pages 322–331, 1986.

    Google Scholar 

  18. R. Segala. Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, MIT, 1995. Technical Report MIT/LCS/TR-676.

    Google Scholar 

  19. R. Segala and N.A. Lynch. Probabilistic simulations for probabilistic processes. In Proc. CONCUR'94, volume 836 of LNCS, pages 481–496. Springer-Verlag, 1994.

    Google Scholar 

  20. M.Y. Vardi. Automatic verification of probabilistic concurrent finite-state systems. In Proc. FOCS'85, pages 327–338, 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Davide Sangiorgi Robert de Simone

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

de Alfaro, L. (1998). Stochastic transition systems. In: Sangiorgi, D., de Simone, R. (eds) CONCUR'98 Concurrency Theory. CONCUR 1998. Lecture Notes in Computer Science, vol 1466. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055639

Download citation

  • DOI: https://doi.org/10.1007/BFb0055639

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64896-3

  • Online ISBN: 978-3-540-68455-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics