Approximate reasoning for real-time probabilistic processes

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

Volumn , Issue , 2004, Pages 304-313

  Gupta, Vineet ^a   Jagadeesan, Radha ^b   Panangaden, Prakash ^c  

^a GOOGLE INC   (United States)

^b DEPAUL UNIVERSITY   (United States)

^c MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BISIMULATION; PROBABILISTIC CONCURRENT PROCESSES; REAL-TIME PROBABILISTIC PROCESSES; REAL-VALUED MODAL LOGIC;

APPROXIMATION THEORY; COMPUTER SIMULATION; ERRORS; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; MODAL ANALYSIS; PROBABILISTIC LOGICS; PROBABILITY DISTRIBUTIONS; REAL TIME SYSTEMS;

MARKOV PROCESSES;

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

References (27)

1. R. Alur and D. Dill. A theory of timed automata. Theoretical Computer Science, 126:183-235, 1994.
2. R. Alur and T. Henzinger. Logics and models of real time: a survey. In J. W. de Bakker, C. Huizing, W. P. de Roever, and G. Rozenberg, editors, REX workshop "Real time: Theory in Practice", LNCS 600, Springer-Verlag, 1992.
3. E. J. Anderson and P. Nash. Linear programming in infinite-dimensional spaces. Wiley-Interscience Series in Discrete Mathematics and Optimization. John Wiley & Sons Ltd., 1987. Theory and applications, A Wiley-Interscience Publication.
4. C. Baier, J.-P. Katoen, and H. Hermanns. Approximate symbolic model checking of continuous-time markov chains. In Proceedings of Concurrency Theory (CON-CUR'99), LNCS 1664, Springer-Verlag, 1999.
5. P. Billingsley. Convergence of Probability Measures. Wiley-Interscience, 1999.
6. M. Bravetti and R. Gorrieri. The theory of interactive generalized semi-markov processes. Theoretical Computer Science, 281(2):5-32, 2002.
7. F. Breugel and I. Worrell. An algorithm for quantitative verification of probabilistic systems. In Proceedings of 12th International Conference on Concurrency Theory, LNCS 2154, Springer-Verlag, 2001.
8. F. Breugel and J. Worrell. Towards quantitative verification of probabilistic transition systems. In Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP) 2001, LNCS 2076, Springer-Verlag, 2001.
9. R. Cleaveland, S. Smolka, and A. Zwarico. Testing preorders for probabilistic processes. In W. Kuich, editor, Automata, Languages and Programming (ICALP 92), LNCS 623, pages 708-719. Springer-Verlag, 1992.
10. L. de Alfaro, T. Henzinger, and R. Majumdar. Discounting the future in systems theory. In International Conference on Automata, Languages and Programming, LNCS 2719, pages 1022-1037. Springer-Verlag, 2003.
11. J. Desharnais, V. Gupta, R. Jagadeesan, and P. Panangaden. Metrics for partial labeled markov systems. In International Conference on Concurrency Theory, LNCS 1664, Springer-Verlag, 1999.
12. J. Desharnais, V. Gupta, R. Jagadeesan, and P. Panangaden. The metric analogue of weak bisimulation for probabilistic processes. In Logic in Computer Science, pages 413-422, 2002.
13. J. Desharnais, V. Gupta, R. Jagadeesan, and P. Panangaden. Metrics for labeled Markov systems. Theoretical Computer Science, 318:323-354, 2004.
14. R. Geroch. Mathematical Physics. University of Chicago Press, 1985.
15. H. Hansson. Time and Probabilities in Formal Design of Distributed Systems. Real-Time Safety Critical Systems Series. Elsevier, 1994.
16. B. R. Haverkort, L. Cloth, H. Hermanns, J.-P. Katoen, and C. Baier. Model checking performability properties. In 2002 International Conference on Dependable Systems and Networks (DSN 2002), 23-26 June 2002, Bethesda, MD, USA, Proceedings, pages 102-113. IEEE Computer Society, 2002.
17. H. Hermanns. The Quest for Quantified Quality, LNCS 2428. Springer-Verlag, 2002.
18. J. Hillston. A Compositional Approach to Performance Modelling. Cambridge University Press, 1996.
19. C.-C. Jou and S. A. Smolka. Equivalences, congruences, and complete axiomatizations for probabilistic processes. In J. Baeten and J. Klop, editors, CONCUR 90 First International Conference on Concurrency Theory, LNCS 458. Springer-Verlag, 1990.
20. K. G. Larsen and A. Skou. Bisimulation through probablistic testing. Information and Computation, 94:1-28, 1991.
21. P. Lincoln, J. Mitchell, M. Mitchell, and A. Scedrov. A probabilistic poly-time framework for protocol analysis. In ACM Computer and Communication Security (CCS5), 1998.
22. A. Philippou, I. Lee, and O. Sokolsky. Weak bisimulation for probabilistic systems. In Proceedings of CONCUR 2000, LNCS 1877. Springer-Verlag, 2000.
23. R. Segala and N. Lynch. Probabilistic simulations for probabilistic processes. Nordic Journal of Computing, 2(2):250-273, 1995.
24. G. S. Shedler. Regeneration and networks of queues. Springer-Verlag New York, Inc., 1987.
25. M. Vardi. Automatic verification of probabilistic concurrent finite-state systems. In Foundations of Computer Science, pages 327-338. IEEE Computer Society Press, 1985.
26. W. Whitt. An Introduction to Stochastic-Process Limits and their Application to Queues. Series: Springer Series in Operations Research. Springer-Verlag New York, Inc., 2002.
27. W.Whitt. Continuity of generalized semi markov processes. Mathematics of Operation Research, 5(4):494-501, 1980.