Markovian testing equivalence and exponentially timed internal actions

Electronic Proceedings in Theoretical Computer Science, EPTCS

Volumn 13, Issue , 2009, Pages 13-25

  Bernardo, Marco ^a  

^a ISTI CNR   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; POLYNOMIAL APPROXIMATION;

BEHAVIORAL EQUIVALENCE; MARKOVIAN; MARKOVIAN PROCESS; MODAL LOGIC; POLYNOMIAL-TIME; SOUND AND COMPLETE; TESTING EQUIVALENCE;

FORMAL METHODS;

EID: 81955166446     PISSN: 20752180     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4204/EPTCS.13.2     Document Type: Conference Paper

References (19)

1. C. Baier, J.-P. Katoen, H. Hermanns, and V. Wolf, "Comparative Branching-Time Semantics for Markov Chains", in Information and Computation 200:149-214, 2005.
2. M. Bernardo, "Non-Bisimulation-Based Markovian Behavioral Equivalences", in Journal of Logic and Algebraic Programming 72:3-49, 2007.
3. M. Bernardo, "Towards State Space Reduction Based on T-Lumpability-Consistent Relations", in Proc. of EPEW 2008, Springer, LNCS 5261:64-78, Palma de Mallorca (Spain), 2008.
4. M. Bernardo, "Uniform Logical Characterizations of Testing Equivalences for Nondeterministic, Probabilistic and Markovian Processes", in Proc. of QAPL 2009, Elsevier, ENTCS, York (UK), 2009.
5. M. Bernardo and M. Bravetti, "Performance Measure Sensitive Congruences for Markovian Process Algebras", in Theoretical Computer Science 290:117-160, 2003.
6. M. Bravetti, "Revisiting Interactive Markov Chains", in Proc. of MTCS 2002, Elsevier, ENTCS 68(5):1- 20, Brno (Czech Republic), 2002.
7. S.D. Brookes, C.A.R. Hoare, and A.W. Roscoe, "A Theory of Communicating Sequential Processes", in Journal of the ACM 31:560-599, 1984.
8. P. Buchholz, "Exact and Ordinary Lumpability in Finite Markov Chains", in Journal of Applied Probability 31:59-75, 1994.
9. I. Christoff, "Testing Equivalences and Fully Abstract Models for Probabilistic Processes", in Proc. of CONCUR 1990, Springer, LNCS 458:126-140, Amsterdam (The Netherlands), 1990.
10. R. Cleaveland, Z. Dayar, S.A. Smolka, and S. Yuen, "Testing Preorders for Probabilistic Processes", in Information and Computation 154:93-148, 1999.
11. R. De Nicola and M. Hennessy, "Testing Equivalences for Processes", in Theoretical Computer Science 34:83-133, 1983.
12. R.J. van Glabbeek, S.A. Smolka, and B. Steffen, "Reactive, Generative and Stratified Models of Probabilistic Processes", in Information and Computation 121:59-80, 1995.
13. H. Hermanns, "Interactive Markov Chains", Springer, LNCS 2428, 2002.
14. J. Hillston, "A Compositional Approach to Performance Modelling", Cambridge University Press, 1996.
15. D.T. Huynh and L. Tian, "On Some Equivalence Relations for Probabilistic Processes", in Fundamenta Informaticae 17:211-234, 1992.
16. M.Z. Kwiatkowska and G.J. Norman, "A Testing Equivalence for Reactive Probabilistic Processes", in Proc. of EXPRESS 1998, Elsevier, ENTCS 16(2):114-132, Nice (France), 1998.
17. R. Milner, "Communication and Concurrency", Prentice Hall, 1989.
18. W.-G. Tzeng, "A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata", in SIAM Journal on Computing 21:216-227, 1992.
19. V. Wolf, C. Baier, and M. Majster-Cederbaum, "Trace Machines for Observing Continuous-Time Markov Chains", in Proc. of QAPL 2005, Elsevier, ENTCS 153(2):259-277, Edinburgh (UK), 2005.