Stochastic Hybrid Systems: Research Issues and Areas
暂无分享,去创建一个
[1] Joost-Pieter Katoen,et al. Safe On-The-Fly Steady-State Detection for Time-Bounded Reachability , 2005, Third International Conference on the Quantitative Evaluation of Systems - (QEST'06).
[2] Joost-Pieter Katoen,et al. A Markov reward model checker , 2005, Second International Conference on the Quantitative Evaluation of Systems (QEST'05).
[3] Christel Baier,et al. Comparative branching-time semantics for Markov chains , 2005, Inf. Comput..
[4] Casey A. Volino,et al. A First Course in Stochastic Models , 2005, Technometrics.
[5] Marta Z. Kwiatkowska,et al. Probabilistic symbolic model checking with PRISM: a hybrid approach , 2004, International Journal on Software Tools for Technology Transfer.
[6] William H. Sanders,et al. Optimal state-space lumping in Markov chains , 2003, Inf. Process. Lett..
[7] Joost-Pieter Katoen,et al. Model-checking large structured Markov chains , 2003, J. Log. Algebraic Methods Program..
[8] M. Bravetti. Revisiting Interactive Markov Chains , 2003, MTCS.
[9] Joost-Pieter Katoen,et al. Faster and Symbolic CTMC Model Checking , 2001, PAPM-PROBMIV.
[10] Marta Z. Kwiatkowska,et al. Automated Verification of a Randomized Distributed Consensus Protocol Using Cadence SMV and PRISM , 2001, CAV.
[11] Christel Baier,et al. On the Logical Characterisation of Performability Properties , 2000, ICALP.
[12] Henk C. Tijms,et al. A fast algorithm for the transient reward distribution in continuous-time Markov chains , 2000, Oper. Res. Lett..
[13] William H. Sanders,et al. A new methodology for calculating distributions of reward accumulated during a finite interval , 1996, Proceedings of Annual Symposium on Fault Tolerant Computing.
[14] William J. Stewart,et al. Introduction to the numerical solution of Markov Chains , 1994 .
[15] M. Puterman. Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .
[16] Kim G. Larsen,et al. Bisimulation through Probabilistic Testing , 1991, Inf. Comput..
[17] Kim Guldstrand Larsen,et al. Specification and refinement of probabilistic processes , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.
[18] C. Jones,et al. A probabilistic powerdomain of evaluations , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.
[19] A. M. Turing,et al. Checking a large routine , 1989 .
[20] Mihalis Yannakakis,et al. Verifying temporal properties of finite-state probabilistic programs , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[21] David Harel,et al. Statecharts: A Visual Formalism for Complex Systems , 1987, Sci. Comput. Program..
[22] Moshe Y. Vardi. Automatic verification of probabilistic concurrent finite state programs , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[23] Donald Gross,et al. The Randomization Technique as a Modeling Tool and Solution Procedure for Transient Markov Processes , 1984, Oper. Res..
[24] Joseph Sifakis,et al. Specification and verification of concurrent systems in CESAR , 1982, Symposium on Programming.
[25] Susan Owicki,et al. An axiomatic proof technique for parallel programs I , 1976, Acta Informatica.