Approximate reasoning for real-time probabilistic processes
暂无分享,去创建一个
[1] A. Wightman,et al. Mathematical Physics. , 1930, Nature.
[2] M. Fréchet. Convergence in probability , 1930 .
[3] A. Skorokhod. Limit Theorems for Stochastic Processes , 1956 .
[4] E. Anderson. Linear Programming In Infinite Dimensional Spaces , 1970 .
[5] Ward Whitt,et al. Continuity of Generalized Semi-Markov Processes , 1980, Math. Oper. Res..
[6] Jane Hillston,et al. A compositional approach to performance modelling , 1996 .
[7] G. S. Shedler,et al. Regeneration and Networks of Queues , 1986 .
[8] A. Shiryaev,et al. Limit Theorems for Stochastic Processes , 1987 .
[9] Gautam Appa,et al. Linear Programming in Infinite-Dimensional Spaces , 1989 .
[10] Scott A. Smolka,et al. Equivalences, Congruences, and Complete Axiomatizations for Probabilistic Processes , 1990, CONCUR.
[11] Thomas A. Henzinger,et al. Logics and Models of Real Time: A Survey , 1991, REX Workshop.
[12] Kim G. Larsen,et al. Bisimulation through Probabilistic Testing , 1991, Inf. Comput..
[13] Hans A. Hansson. Time and probability in formal design of distributed systems , 1991, DoCS.
[14] Rajeev Alur,et al. A Theory of Timed Automata , 1994, Theor. Comput. Sci..
[15] Nancy A. Lynch,et al. Probabilistic Simulations for Probabilistic Processes , 1994, Nord. J. Comput..
[16] R. Blute,et al. Bisimulation for Labeled Markov Processes , 1997 .
[17] John C. Mitchell,et al. A probabilistic poly-time framework for protocol analysis , 1998, CCS '98.
[18] Radha Jagadeesan,et al. Metrics for partial labeled markov systems , 1999 .
[19] Radha Jagadeesan,et al. Metrics for Labeled Markov Systems , 1999, CONCUR.
[20] Christel Baier,et al. Approximate Symbolic Model Checking of Continuous-Time Markov Chains , 1999, CONCUR.
[21] Rance Cleaveland,et al. Testing Preorders for Probabilistic Processes , 1992, Inf. Comput..
[22] Insup Lee,et al. Weak Bisimulation for Probabilistic Systems , 2000, CONCUR.
[23] J. Worrell,et al. Towards Quantitative Verification of Probabilistic Transition Systems , 2001, ICALP.
[24] James Worrell,et al. An Algorithm for Quantitative Verification of Probabilistic Transition Systems , 2001, CONCUR.
[25] Radha Jagadeesan,et al. The metric analogue of weak bisimulation for probabilistic processes , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.
[26] Alison L Gibbs,et al. On Choosing and Bounding Probability Metrics , 2002, math/0209021.
[27] Mario Bravetti,et al. The theory of interactive generalized semi-Markov processes , 2002, Theor. Comput. Sci..
[28] Holger Hermanns,et al. Interactive Markov Chains , 2002, Lecture Notes in Computer Science.
[29] Ward Whitt,et al. An Introduction to Stochastic-Process Limits and their Application to Queues , 2002 .
[30] Christel Baier,et al. Model checking performability properties , 2002, Proceedings International Conference on Dependable Systems and Networks.
[31] Abbas Edalat,et al. Bisimulation for Labelled Markov Processes , 2002, Inf. Comput..
[32] Thomas A. Henzinger,et al. Discounting the Future in Systems Theory , 2003, ICALP.
[33] Radha Jagadeesan,et al. Metrics for labelled Markov processes , 2004, Theor. Comput. Sci..