A Theory of Testing for Markovian Processes
暂无分享,去创建一个
[1] Holger Hermanns,et al. Interactive Markov Chains , 2002, Lecture Notes in Computer Science.
[2] Rance Cleaveland,et al. Testing Preorders for Probabilistic Processes , 1992, ICALP.
[3] Marcel F. Neuts,et al. Matrix-geometric solutions in stochastic models - an algorithmic approach , 1982 .
[4] Rance Cleaveland,et al. Testing Preorders for Probabilistic Processes , 1992, Inf. Comput..
[5] Luis G. Vargas. Review: Marcel F. Neuts, Matrix-geometric solutions in stochastic models, an algorithmic approach , 1983 .
[6] Ronald A. Howard,et al. Dynamic Probabilistic Systems , 1971 .
[7] Manuel Núñez,et al. Acceptance Trees for Probabilistic Processes , 1995, CONCUR.
[8] H. Hermanns,et al. Syntax , Semantics , Equivalences , and Axioms for MTIPP y , 1994 .
[9] Rocco De Nicola,et al. Testing Equivalences for Processes , 1984, Theor. Comput. Sci..
[10] J. Hillston. Exploiting Structure in Solution: Decomposing Composed Models , 1998 .
[11] M. Bernardo,et al. A Theory of Efficiency for Markovian Processes , 1999 .
[12] Jane Hillston,et al. A compositional approach to performance modelling , 1996 .
[13] Rance Cleaveland,et al. Fully Abstract Characterizations of Testing Preorders for Probabilistic Processes , 1994, CONCUR.