A theory of testing for Markovian processes

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

Volumn 1877 LNCS, Issue , 2000, Pages 305-319

  Bernardo, Marco ^a   Cleaveland, Rance ^b  

^a UNIVERSITY OF TURIN   (Italy)

^b Stony Brook University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; EFFICIENCY; INTERACTIVE COMPUTER SYSTEMS;

CLASSICAL-TESTING; MARKOVIAN BISIMULATIONS; MARKOVIAN PROCESS; PERFORMANCE MEASURE; PROBABILISTIC TESTING; SOFT REAL-TIME SYSTEMS; TESTING EQUIVALENCE; TESTING THEORIES;

REAL TIME SYSTEMS;

EID: 84885232797     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44618-4_23     Document Type: Conference Paper

References (13)

1. M. Bernardo, "Theory and Application of Extended Markovian Process Algebra,", Ph.D. Thesis, University of Bologna, 1999 (http://www.di.unito. it/~bernardo/)
2. M. Bernardo, W. R. Cleaveland, "A Theory of Efficiency for Markovian Processes,", Tech. Rep. UBLCS-99-02, University of Bologna, 1999
3. W. R. Cleaveland, M. C. B. Hennessy, "Testing Equivalence as a Bisimulation Equivalence,", in Formal Aspects of Computing 5: 1-20, 1993
4. W. R. Cleaveland, S. A. Smolka, A. E. Zwarico, "Testing Preorders for Probabilistic Processes,", in Proc. of ICALP'92, LNCS 623: 708-719, 1992
5. R. De Nicola, M. C. B. Hennessy, "Testing Equivalences for Processes,", in Theoretical Computer Science 34: 83-133, 1983
6. H. Hermanns, "Interactive Markov Chains,", Ph.D. Thesis, University of Erlangen, 1998
7. H. Hermanns, M. Rettelbach, "Syntax, Semantics, Equivalences, and Axioms for MTIPP,", in Proc. of PAPM '94, pp. 71-87, Erlangen, 1994
8. J. Hillston, "A Compositional Approach to Performance Modelling,", Cambridge University Press, 1996
9. J. Hillston, "Exploiting Structure in Solution: Decomposing Composed Models,", in Proc. of PAPM '98, pp. 1-15, 1998
10. R. A. Howard, "Dynamic Probabilistic Systems,", John Wiley & Sons, 1971
11. M. F. Neuts, "Matrix-Geometric Solutions in Stochastic Models - An Algorithmic Approach,", John Hopkins University Press, 1981
12. M. Nunez, D. de Frutos, L. Llana, "Acceptance Trees for Probabilistic Processes,", in Proc. of CONCUR'95, LNCS 962: 249-263, 1995
13. S. Yuen, W. R. Cleaveland, Z. Dayar, S. A. Smolka, "Fully Abstract Characterizations of Testing Preorders for Probabilistic Processes,", in Proc. of CONCUR '94, LNCS 836: 497-512, 1994.