Trace Machines for Observing Continuous-Time Markov Chains

Electronic Notes in Theoretical Computer Science

Volumn 153, Issue 2 SPEC. ISS., 2006, Pages 259-277

  Wolf, Verena ^a   Baier, Christel ^a   Majster Cederbaum, Mila ^a  

^a NONE

Author keywords

button pushing experiment; linear time semantics; Markov chain; trace equivalence; trace machine

Indexed keywords

COMPUTER SCIENCE; DISCRETE TIME CONTROL SYSTEMS; MATHEMATICAL MODELS; PROBABILITY; SEMANTICS;

BUTTON PUSHING EXPERIMENT; LINEAR-TIME SEMANTICS; MARKOV CHAIN; TRACE EQUIVALENCE; TRACE MACHINES;

MARKOV PROCESSES;

EID: 33646389825     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2005.10.042     Document Type: Article

References (28)

1. Bernardo M., and Cleaveland R. A theory of testing for Markovian processes. Proc. CONCUR 2000. LNCS volume 1877 (2000), Springer 305-319
2. Bernardo M., and Gorrieri R. Extended Markovian process algebra. Proc. CONCUR 1996. LNCS number 1119 (1996), Springer 315-330
3. In: Brinksma E., Hermanns H., and Katoen J.-P. (Eds). Lectures on formal methods and performance analysis. Tutorial Proc. of the EEF/Euro summer school on trends in computer science. LNCS volume 2090 (2001), Springer
4. Katoen J.-P., Baier C., Hermanns H., and Wolf V. Comparative branching time semantics for Markov chains. Proc. CONCUR 2003. LNCS number 2761 (2003), Springer 492-507
5. Christoff I. Testing equivalences and fully abstract models for probabilistic processes. Proc. CONCUR 1990. LNCS volume 458 (1990), Springer 126-140
6. Cleaveland R., Smolka S., and Zwarico A. Testing preorders for probabilistic processes. Proc. ICALP 92. LNCS volume 623 (1992), Springer 708-719
7. C. Daws, M. Kwiatkowska, and G. Norman. Automatic verification of the IEEE 1394 root contention protocol with KRONOS and PRISM. International Journal on Software Tools for Technology Transfer (STTT), to appear, 2004
8. Feller W. An Introduction to Probability Theory and Its Applications (1968), John Wiley and Sons
9. N. Gotz, U. Herzog, and M. Rettelbach. Tipp - a language for timed processes and performance evaluation. Technical Report 4/92, IMMD VII, University of Erlangen-Nurnberg, 1992
10. Hansson H. Time and Probability in Formal Design of Distributed Systems. Series in Real-Time Safety Critical Systems (1994), Elsevier
11. Haverkort B. Performance of Computer Communication Systems: A Model-Based Approach (1998), Wiley
12. Herescu M., and Palamidessi C. Probabilistic asynchronous pi-calculus. Proc. FoSSaCS 2000 (2000), Springer 146-160
13. Hermanns H. Interactive Markov Chains: The Quest for Quantitative Quality. LNCS volume 2428 (2002), Springer
14. Hermanns H., Katoen J.-P., Meyer-Kayser J., and Siegle M. A Markov chain model checker. Proc. TACAS 2000. LNCS volume 1785 (2000) 347-362
15. Hillston J. A compositional approach to performance modelling (1996), Cambridge University Press
16. Huynh D., and Tian L. On some equivalence relations for probabilistic processes. Fundamenta Informaticae 17 3 (1992) 211-234
17. B. Jonsson and W. Yi. Compositional testing preorders for probabilistic processes. In Proc. 10th IEEE LICS Symp, pages 431-441, 1995
18. Kulkarni V. Modeling and Analysis of Stochastic Systems (1995), Chapman & Hall
19. Larsen K., and Skou A. Bisimulation through probabilistic testing. Information and Computation 94 1 (1991) 1-28
20. Nottegar C., Priami C., and Degano P. Semantic-driven performance evaluation. LNCS 1577 (1999) 204-218
21. Di Pierro A., Hankin C., and Wiklicky H. Probabilistic KLAIM. Proc. COORDINATION 2004. LNCS volume 2949 (2004) 119-134
22. Priami C. Stochastic π-calculus. Computer Journal 38 7 (1995) 578-589
23. R. Segala. Modeling and verification of randomized distributed real-time systems. PhD thesis. Technical Report MIT/LCS/TR-676, MIT, 1995
24. Segala R. Testing probabilistic automata. Proc. CONCUR 1996. LNCS volume 1119 (1996), Springer 299-314
25. Segala R., and Lynch N. Probabilistic simulations for probabilistic processes. Nordic Journal of Computing 2 2 (1995) 250-273
26. Stoelinga M., and Vaandrager F. A testing scenario for probabilistic automata. Proc. of ICALP 2003. LNCS volume 2719 (2003), Springer 407-418
27. van Glabbeek R. The linear time-branching time spectrum. CONCUR'90: Theories of Concurrency: Unification and Extension (1990), Springer 278-297
28. R. van Glabbeek, S. Smolka, B. Steffen, and C. Tofts. Reactive, generative, and stratified models of probabilistic processes. In Proc. LICS 1990, pages 130-141, 1990