Stochastic transition systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1466, Issue , 1998, Pages 423-438

  de Alfaro, Luca ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

RELIABILITY ANALYSIS;

DISTRIBUTED DELAYS; EARLY DESIGN STAGES; MEAN TIME BETWEEN FAILURES; PERFORMANCE AND RELIABILITIES; PROBABILISTIC SYSTEMS; SPECIFICATION AND VERIFICATION; STOCHASTIC TRANSITION SYSTEMS; SYSTEM THROUGHPUT;

STOCHASTIC SYSTEMS;

EID: 84945913752     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055639     Document Type: Conference Paper

References (20)

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.
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.
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.
4. M. Bernardo and R. Gorrieri. Extended Markovian process algebra. In Proc. CONCUR’96, volume 1119 of LNCS, pages 315-330. Springer-Verlag, 1996.
5. G. Ciardo, J.K. Muppala, and K.S. Trivedi. On the solution of GSPN reward models. Performance Evaluation, 12: 237-253, 1991.
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.
7. L. de Alfaro. Formal Verification of Probabilistic Systems. PhD thesis, Stanford University, 1997. Technical Report STAN-CS-TR-98-1601.
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.
9. L. de Alfaro. How to specify and verify the long-run average behavior of probabilistic systems. In Proc. LICS’98, 1998. To appear.
10. C. Derman. Finite State Markovian Decision Processes. Acedemic Press, 1970.
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.
12. J. Hillston. A Compositional Approach to Performance Modelling. Distinguished Dissertations Series. Cambridge University Press, 1996.
13. S. Hart, M. Sharir, and A. Pnueli. Termination of probabilistic concurrent programs. ACM Trans. Prog. Lang. Sys., 5(3): 356-380, 1983.
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.
15. J.G. Kemeny, J.L. Snell, and A.W. Knapp. Denumerable Markov Chains. D. Van Nostrand Company, 1966.
16. Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer-Verlag, New York, 1991.
17. A. Pnueli and L. Zuck. Probabilistic verification by tableaux. In Proc. LICS’86, pages 322-331, 1986.
18. R. Segala. Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, MIT, 1995. Technical Report MIT/LCS/TR-676.
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.
20. M.Y. Vardi. Automatic verification of probabilistic concurrent finite-state systems. In Proc. FOCS’85, pages 327-338, 1985.