A survey of modal logics characterising behavioural equivalences for non-deterministic and stochastic systems

Mathematical Structures in Computer Science

Volumn 18, Issue 1, 2008, Pages 29-55

  Bernardo, Marco ^a   Botta, Stefania ^a  

^a UNIVERSITY OF URBINO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; MATHEMATICAL OPERATORS; MODAL ANALYSIS; RANDOM PROCESSES;

MODAL LOGICS; STOCHASTIC SYSTEMS;

LOGIC PROGRAMMING;

EID: 40449118904     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0960129507006408     Document Type: Article

References (22)

1. Abramsky, S. (1987) Observational Equivalence as a Testing Equivalence. Theoretical Computer Science 53 225-241.
2. Bernardo, M. (2007) Non-Bisimulation-Based Markovian Behavioral Equivalences. To appear in Journal of Logic and Algebraic Programming.
3. Bernardo, M. and Botta, S. (2006) Modal Logic Characterization of Markovian Testing and Trace Equivalences. In: Proc. of the First Int. Workshop on Logic, Models and Computer Science (LMCS 2006), Camerino (Italy). Electronic Notes in Theoretical Computer Science.
4. Bernardo, M. and Bravetti, M. (2003) Performance Measure Sensitive Congruences for Markovian Process Algebras. Theoretical Computer Science 290 117-160.
5. Bernardo, M. and Cleaveland, R. (2000) A Theory of Testing for Markovian Processes. In : Proc. of the 11th Int. Conf. on Concurrency Theory (CONCUR 2000), State College (PA). Springer-Verlag Lecture Notes in Computer Science 1877 305-319.
6. Bravetti, M. and Aldini, A. (2003) Discrete Time Generative-Reactive Probabilistic Processes with Different Advancing Speeds Theoretical Computer Science 290 355-406.
7. Christoff, I. (1990) Testing Equivalences and Fully Abstract Models for Probabilistic Processes. In: Proc. of the First Int. Conf. on Concurrency Theory (CONCUR 1990), Amsterdam. SpringerVerlag Lecture Notes in Computer Science 458 126-140.
8. Clark, G., Gilmore, S. and Hillston, J. (1999) Specifying Performance Measures for PEPA. In: Proc. of the 5th AMAST Int. Workshop on Formal Methods for Real Time and Probabilistic Systems (ARTS 1999), Bamberg (Germany). Springer-Verlag Lecture Notes in Computer Science 1601 211-227.
9. Cleaveland, R., Dayar, Z., Smolka, S.A. and Yuen, S. (1999) Testing Preorders for Probabilistic Processes. Information and Computation 154 93-148.
10. De Nicola, R. and Hennessy, M. (1983) Testing Equivalences for Processes. Theoretical Computer Science 34 83-133.
11. van Glabbeek, R.J. (2001) The Linear Time - Branching Time Spectrum I. Handbook of Process Algebra, Elsevier 3-99.
12. van Glabbeek, R. J., Smolka, S.A. and Steffen, B. (1995) Reactive, Generative and Stratified Models of Probabilistic Processes. Information and Computation 121 59-80.
13. Hennessy (1985), M. Acceptance Trees. Journal of the ACM 32 896-928.
14. Hennessy, M. and Milner, R. (1985) Algebraic Laws for Nondeterminism and Concurrency. Journal of the ACM 32 137-162.
15. Hermanns, H. (2002) Interactive Markov Chains. Springer-Verlag Lecture Notes in Computer Science 2428.
16. Hillston, J. (1996) A Compositional Approach to Performance Modelling, Cambridge University Press.
17. Hoare, C. A. R. (1985) Communicating Sequential Processes, Prentice Hall.
18. Jou, C.-C. and Smolka, S.A. (1990) Equivalences, Congruences and Complete Axiomatizations for Probabilistic Processes. In: Proc. of the First Int. Conf. on Concurrency Theory (CONCUR 1990), Amsterdam (The Netherlands). Springer-Verlag Lecture Notes in Computer Science 458 367-383.
19. Kwiatkowska, M.Z. and Norman, G.J. (1998) A Testing Equivalence for Reactive Probabilistic Processes, Nice (France). In: Proc. of the 2nd Int. Workshop on Expressiveness in Concurrency (EXPRESS 1998). Electronic Notes in Theoretical Computer Science 16 (2) 114-132.
20. Larsen, K. G. and Skou, A. (1991) Bisimulation through Probabilistic Testing. Information and Computation 94 1-28.
21. Milner, R. (1989) Communication and Concurrency, Prentice Hall.
22. Wolf, V., Baier, C. and Majster-Cederbaum, M. (2005) Trace Machines for Observing Continuous-Time Markov Chains. In: Proc. of the 3rd Int. Workshop on Quantitative Aspects of Programming Languages (QAPL 2005), Edinburgh (UK). Electronic Notes in Theoretical Computer Science 153 (2) 259-277.