Markovian Testing and Trace Equivalences Exactly Lump More Than Markovian Bisimilarity

Electronic Notes in Theoretical Computer Science

Volumn 162, Issue 1, 2006, Pages 87-99

  Bernardo, Marco ^a  

^a UNIVERSITY OF URBINO   (Italy)

Author keywords

bisimulation; Markov chain; Markovian process algebra

Indexed keywords

COMPUTER SIMULATION; MATHEMATICAL MODELS;

MARKOVIAN BISIMILARITY; MARKOVIAN TESTING; MARKOVIAN TRACE EQUIVALENCE;

MARKOV PROCESSES;

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

References (17)

1. Baier C., Katoen J.-P., Hermanns H., and Wolf V. Comparative Branching-Time Semantics for Markov Chains. Information and Computation 200 (2005) 149-214
2. M. Bernardo, "Non-Bisimulation-Based Markovian Behavioral Equivalences", submitted for publication
3. Bernardo M., and Bravetti M. Performance Measure Sensitive Congruences for Markovian Process Algebras. Theoretical Computer Science 290 (2003) 117-160
4. Bernardo M., and Cleaveland W.R. A Theory of Testing for Markovian Processes. Proc. of the 11th Int. Conf. on Concurrency Theory. (CONCUR 2000), State College (PA). LNCS 1877 (2000) 305-319
5. Buchholz P. Exact and Ordinary Lumpability in Finite Markov Chains. Journal of Applied Probability 31 (1994) 59-75
6. Cleaveland W.R., Dayar Z., Smolka S.A., and Yuen S. Testing Preorders for Probabilistic Processes. Information and Computation 154 (1999) 93-148
7. Cleaveland W.R., and Hennessy M.C.B. Testing Equivalence as a Bisimulation Equivalence. Formal Aspects of Computing 5 (1993) 1-20
8. De Nicola R., and Hennessy M.C.B. Testing Equivalences for Processes. Theoretical Computer Science 34 (1983) 83-133
9. van Glabbeek R.J., Smolka S.A., and Steffen B. Reactive, Generative and Stratified Models of Probabilistic Processes. Information and Computation 121 (1995) 59-80
10. Hermanns H. Interactive Markov Chains. LNCS 2428 (2002)
11. H. Hermanns and M. Rettelbach, "Syntax, Semantics, Equivalences, and Axioms for MTIPP", in Proc. of the 2nd Int. Workshop on Process Algebra and Performance Modelling (PAPM 1994), Technical Report 27-4, pp. 71-87, Erlangen (Germany), 1994
12. Hillston J. A Compositional Approach to Performance Modelling (1996), Cambridge University Press
13. Larsen K.G., and Skou A. Bisimulation through Probabilistic Testing. Information and Computation 94 (1991) 1-28
14. Milner R. Communication and Concurrency (1989), Prentice Hall
15. Nuñez M. Algebraic Theory of Probabilistic Processes. Journal of Logic and Algebraic Programming 56 (2003) 117-177
16. Stark E.W., Cleaveland W.R., and Smolka S.A. A Process-Algebraic Language for Probabilistic I/O Automata. Proc. of the 14th Int. Conf. on Concurrency Theory. (CONCUR 2003), Marseille (France). LNCS 2761 (2003) 189-203
17. Wolf V., Majster-Cederbaum M., and Baier C. Trace Machines for Observing Continuous-Time Markov Chains. Proc. of the 3rd Int. Workshop on Quantitative Aspects of Programming Languages. (QAPL 2005), Edinburgh (UK). ENTCS (2005)