Backward stochastic bisimulation in CSL model checking

Proceedings - First International Conference on the Quantitative Evaluation of Systems, QEST 2004

Volumn , Issue , 2004, Pages 220-229

  Sproston, Jeremy ^a   Donatelli, Susanna ^a  

^a UNIVERSITY OF TURIN   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BACKWARD STOCHASTIC BISIMULATION; CONTINUOUS STOCHASTIC LOGIC (CSL); STATE EQUIVALENCES; STATE LABELLING SETS;

COMPUTER AIDED ANALYSIS; COMPUTER SIMULATION; FORMAL LOGIC; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; PROBABILITY DISTRIBUTIONS;

RANDOM PROCESSES;

EID: 16244406547     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/QEST.2004.1348036     Document Type: Conference Paper

References (24)

1. A. Aziz, K. Sanwal, V. Singhal, and R. Brayton. Model-checking continuous time Markov chains. ACM Transactions on Computational Logic, 1(1):162-170, 2000.
2. A. Aziz, V. Singhal, F. Balarin, R. K. Brayton, and A. L. Sangiovanni-Vincentelli. It usually works: The temporal logic of stochastic systems. In P. Wolper, editor, Proceedings of the 7th International Conference on Computer Aided Verification (CAV'95), volume 939 of LNCS, pages 115-165. Springer-Verlag, 1995.
3. C. Baier, B. Haverkort, H. Hermanns, and J.-P. Katoen. On the logical characterisation of performability properties. In U. Montanari, J. D. P. Rolim, and E. Welzl, editors, Proceedings of the 12th International Colloquium on Automata, Languages and Programming (ICALP'OO), volume 1853 of LNCS, pages 780-792. Springer-Verlag, 2000.
4. C. Baier, B. Haverkort, H. Hermanns, and J.-P. Katoen. Model-checking algorithms for continuous-time Markov chains. IEEE Transactions on Software Engineering, 29(6):524-541, 2003.
5. P. Ballarini. Towards Compostional CSL Model Checking. PhD thesis, Dipartimento di Informatica, Università di Torino, 2004.
6. M. Bernardo and R. Gorrieri. A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time. Theoretical Computer Science, 202:1-54, 1998.
7. M. C. Browne, E. M. Clarke, and O. Grumberg. Characterizing finite Kripke structures in propositional temporal logic. Theoretical Computer Science, 59:115-131, 1988.
8. P. Buchholz. Exact and ordinary lumpability in finite Markov chains. Journal of Applied Probability, 31:59-74, 1994.
9. P. Buchholz. On a Markovian process algebra. Technical Report 500, Fachbereich Informatik, University of Dortmund, 1994.
10. P. Buchholz. Exact performance equivalence: An equivalence relation for stochastic automata. Theoretical Computer Science, 215(1-2):263-287, 1999.
11. L. Capra, C. Dutheillet, G. Franceschinis, and J.-M. Ilié. Exploiting partial symmetries for Markov chain aggregation. In F. Corradini and P. Inverardi, editors, Proceedings of the 1st International Workshop on Models for Time-Critical Systems (MTCS 2000), volume 39 of Electronic Notes in Theoretical Computer Science. Elsevier, 2000.
12. G. Chiola, C. Dutheillet, G. Franceschinis, and S. Haddad. Stochastic Well-Formed coloured nets for symmetric modelling applications. IEEE Transaction on Computers, 42(11):1343-1360, 1993.
13. E. M. Clarke, O. Grumberg, and D. A. Peled. Model Checking. MIT Press, 1999.
14. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, 1990.
15. S. Derisavi, H. Hermanns, and W. Sanders. Optimal state-space lumping in Markov chains. Information Processing Letters, 87(6):309-315, 2003.
16. H. Hansson and B. Jonsson. A logic for reasoning about time and reliability. Formal Aspects of Computing, 6(5):512-535, 1994.
17. T. A. Henzinger, O. Kupferman, and S. Qadeer. From prehistoric to postmodern symbolic model checking. Formal Methods in System Design, 23:303-327, 2003.
18. H. Hermanns, U. Herzog, and V. Mertsiotakis. Stochastic process algebras: Between LOTOS and Markov chains. Computer Networks and ISDN Systems, 30(9-10):901-924, 1998.
19. J. Hillston. A Compositional Approach to Performance Modelling. Cambridge University Press, 1996.
20. J. G. Kemeny and J. L. Snell. Finite Markov Chains. Van Nostrand, 1960.
21. M. Kwiatkowska, G. Norman, and D. Parker. PRISM: Probabilistic symbolic model checker. In T. Field, P. G. Harrison, J. T. Bradley, and U. Harder, editors, Proceedings of the 12th International Conference on Computer Performance Evaluation, Modelling Techniques and Tools (TOOLS 2002), volume 2324 of LNCS, pages 200-204. Springer-Verlag, 2002.
22. N. Lynch and F. W. Vaandrager. Forward and backward simulations part I: Untimed systems. Information and Computation, 121(2):214-233, 1995.
23. P. J. Schweitzer. Aggregation methods for large Markov chains. In G. Iazeolla, P. J. Coutois, and A. Hordijk, editors, Mathemantical Computer Performance and Reliability, pages 275-302. Elsevier, 1984.
24. J. Sproston and S. Donatelli. Backward stochastic bisimulation in CSL model checking. Available from: http://www.di.unito.it/~sproston/ Research/research.html.