Uniform Logical Characterizations of Testing Equivalences for Nondeterministic, Probabilistic and Markovian Processes

Electronic Notes in Theoretical Computer Science

Volumn 253, Issue 3, 2009, Pages 3-23

  Bernardo, Marco ^a  

^a UNIVERSITY OF URBINO   (Italy)

Author keywords

Markovian processes; modal logic; nondeterministic processes; probabilistic processes; testing equivalence

Indexed keywords

MARKOVIAN PROCESSES; MODAL LOGIC; NONDETERMINISTIC PROCESSES; PROBABILISTIC PROCESSES; TESTING EQUIVALENCE;

DIAMONDS; LINGUISTICS; QUERY LANGUAGES;

PROBABILISTIC LOGICS;

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

References (24)

1. Abramsky S. Observational Equivalence as a Testing Equivalence. Theoretical Computer Science 53 (1987) 225-241
2. Bernardo M. Non-Bisimulation-Based Markovian Behavioral Equivalences. Journal of Logic and Algebraic Programming 72 (2007) 3-49
3. Bernardo M., and Botta S. A Survey of Modal Logics Characterizing Behavioral Equivalences for Nondeterministic and Stochastic Systems. Mathematical Structures in Computer Science 18 (2008) 29-55
4. Bernardo M., and Bravetti M. Performance Measure Sensitive Congruences for Markovian Process Algebras. Theoretical Computer Science 290 (2003) 117-160
5. Bravetti M., and Aldini A. Discrete Time Generative-Reactive Probabilistic Processes with Different Advancing Speeds. Theoretical Computer Science 290 (2003) 355-406
6. Brookes S.D., Hoare C.A.R., and Roscoe A.W. A Theory of Communicating Sequential Processes. Journal of the ACM 31 (1984) 560-599
7. Christoff I. Testing Equivalences and Fully Abstract Models for Probabilistic Processes. Proc. of the 1st Int. Conf. on Concurrency Theory. (CONCUR 1990). LNCS 458 (1990) 126-140
8. Clark G., Gilmore S., and Hillston J. Specifying Performance Measures for PEPA. Proc. of the 5th AMAST Int. Workshop on Formal Methods for Real Time and Probabilistic Systems. (ARTS 1999). LNCS 1601 (1999) 211-227
9. Cleaveland R., Dayar Z., Smolka S.A., and Yuen S. Testing Preorders for Probabilistic Processes. Information and Computation 154 (1999) 93-148
10. Deng Y., van Glabbeek R.J., Hennessy M., Morgan C., and Zhang C. Characterising Testing Preorders for Finite Probabilistic Processes. Proc. of the 22nd IEEE Symp. on Logic in Computer Science. (LICS 2007) (2007), IEEE-CS Press 313-325
11. De Nicola R. Extensional Equivalences for Transition Systems. Acta Informatica 24 (1987) 211-237
12. De Nicola R., and Hennessy M. Testing Equivalences for Processes. Theoretical Computer Science 34 (1984) 83-133
13. Desharnais J., Edalat A., and Panangaden P. Bisimulation for Labelled Markov Processes. Information and Computation 179 (2002) 163-193
14. van Glabbeek R.J. The Linear Time - Branching Time Spectrum I. Handbook of Process Algebra (2001), Elsevier 3-99
15. 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
16. Hennessy M. Acceptance Trees. Journal of the ACM 32 (1985) 896-928
17. Hennessy M., and Milner R. Algebraic Laws for Nondeterminism and Concurrency. Journal of the ACM 32 (1985) 137-162
18. Hillston J. A Compositional Approach to Performance Modelling (1996), Cambridge University Press
19. Jou C.-C., and Smolka S.A. Equivalences, Congruences, and Complete Axiomatizations for Probabilistic Processes. Proc. of the 1st Int. Conf. on Concurrency Theory. (CONCUR 1990). LNCS 458 (1990) 367-383
20. Kwiatkowska M.Z., and Norman G.J. A Testing Equivalence for Reactive Probabilistic Processes. Proc. of the 2nd Int. Workshop on Expressiveness in Concurrency. (EXPRESS 1998). ENTCS 16 2 (1998) 114-132
21. Larsen K.G., and Skou A. Bisimulation through Probabilistic Testing. Information and Computation 94 (1991) 1-28
22. Larsen K.G., and Skou A. Compositional Verification of Probabilistic Processes. Proc. of the 3rd Int. Conf. on Concurrency Theory. (CONCUR 1992). LNCS 630 (1992) 456-471
23. Milner R. Communication and Concurrency (1989), Prentice Hall
24. Parma A., and Segala R. Logical Characterizations of Bisimulations for Discrete Probabilistic Systems. Proc. of the 10th Int. Conf. on Foundations of Software Science and Computational Structures. (FOSSACS 2007). LNCS 4423 (2007) 287-301