Approximate analysis of probabilistic processes: Logic, simulation and games

Proceedings - 5th International Conference on the Quantitative Evaluation of Systems, QEST 2008

Volumn , Issue , 2008, Pages 264-273

  Desharnais, Josée ^a   Laviolette, François ^a   Tracol, Mathieu ^b  

^a UNIVERSITÉ LAVAL   (Canada)

^b UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION; SEMANTICS;

APPROXIMATE ANALYSIS; LOGICAL EQUIVALENCE; NON DETERMINISM; POLYNOMIAL ALGORITHM; POLYNOMIAL-TIME ALGORITHMS; PROBABILISTIC PROCESS; PROBABILISTIC SYSTEMS; WINNING STRATEGY;

COMPUTER CIRCUITS;

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

References (20)

1. S. Abramsky and R. Jagadeesan. Games and full completeness for multiplicative linear logic. J. Symbolic Logic, 59(2):543-574, 1994.
2. C. Baier. Polynomial time algorithms for testing probabilistic bisimulation and simulation. In Proceedings of the 8th International Conference on Computer Aided Verification (CAV'96), number 1102 in Lecture Notes in Computer Science, pages 38-49, 1996.
3. C. Baier and M. Kwiatkowska. Domain equations for probabilistic processes. Mathematical. Structures in Comp. Sci., 10(6):665-717, 2000.
4. S. Cattani and R. Segala. Decision algorithms for probabilistic bisimulation. In CONCUR '02: Proceedings of the 13th International Conference on Concurrency Theory, pages 371-385, London, UK, 2002. Springer-Verlag.
5. L. de Alfaro, R. Majumdar, V. Raman, and M. Stoelinga. Game relations and metrics. In LICS '07: Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science, pages 99-108, Washington, DC, USA, 2007. IEEE Computer Society.
6. J. Desharnais, A. Edalat, and P. Panangaden. Bisimulation for labeled Markov processes. Information and Computation, 179(2):163-193, December 2002.
7. J. Desharnais, V. Gupta, R. Jagadeesan, and P. Panangaden. Approximating labeled Markov processes. Information and Computation, 184(1):160-200, July 2003.
8. J. Desharnais, V. Gupta, R. Jagadeesan, and P. Panangaden. Metrics for labelled Markov processes. Theor. Comput. Sci., 318(3):323-354, 2004.
9. J. Desharnais, R. Jagadeesan, V. Gupta, and P. Panangaden. The metric analogue of weak bisimulation for probabilistic processes. In Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science (LICS02), pages 413-422, Copenhagen, Denmark, July 2002. IEEE Computer Society.
10. E. A. Emerson, C. S. Jutla, and A. P. Sistla. On model-checking for fragments of μ-calculus. In CAV, pages 385-396, 1993.
11. N. Ferns, P. Panangaden, and D. Precup. Metrics for Markov decision processes with infinite state spaces. In Proceedings of the 21th Annual Conference on Uncertainty in Artificial Intelligence (UAI-05), page 201, Arlington, Virginia, 2005. AUAI Press.
12. A. Giacalone, C.-C. Jou, and S. A. Smolka. Algebraic reasoning for probabilistic concurrent systems. In Proceedings of the Working Conference on Programming Concepts and Methods, IFIP TC2, 1990.
13. A. Girard and G. J. Pappas. Approximate bisimulation relations for constrained linear systems. Automatica, 43(8):1307-1317, 2007.
14. K. G. Larsen and A. Skou. Bisimulation through probablistic testing. Information and Computation, 94:1-28, 1991.
15. A. McIver and C. Morgan. Games, probability, and the quantitative μ-calculus qMμ. In LPAR '02: Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, pages 292-310, London, UK, 2002. Springer-Verlag.
16. R. Segala and N. Lynch. Probabilistic simulations for probabilistic processes. In B. Jonsson and J. Parrow, editors, Proceedings of CONCUR94, number 836 in Lecture Notes In Computer Science, pages 481-496. Springer-Verlag, 1994.
17. 3) algorithm for finding maximum flows in networks. Information Processing Letters, 7:277-8, 1978.
18. F. van Breugel, B. Sharma, and J. Worrell. Approximating a behavioural pseudometric without discount for probabilistic systems. In H. Seidl, editor, FoSSaCS, volume 4423 of Lecture Notes in Computer Science, pages 123-137. Springer, 2007.
19. F. van Breugel and J. Worrell. An algorithm for quantitative verification of probabilistic transition systems. In CONCUR '01: Proceedings of the 12th International Conference on Concurrency Theory, pages 336-350, London, UK, 2001. Springer-Verlag.
20. M. Ying and M. Wirsing. Approximate bisimilarity. In AMAST '00: Proceedings of the 8th International Conference on Algebraic Methodology and Software Technology, pages 309-322, London, UK, 2000. Springer-Verlag.