Approximate reasoning for real-time probabilistic processes

Logical Methods in Computer Science

Volumn 2, Issue 1, 2006, Pages

  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

APPROXIMATION THEORY; CONTINUOUS TIME SYSTEMS; MARKOV PROCESSES;

APPROXIMATE REASONING; CLASS OF DISTRIBUTIONS; EXPONENTIAL DISTRIBUTIONS; FIXED-POINT CHARACTERIZATION; GENERALIZED SEMI-MARKOV PROCESSES; LOGICAL CHARACTERIZATION; REAL-TIME PROBABILISTIC PROCESS; REAL-VALUED MODAL LOGIC;

PROBABILITY DISTRIBUTIONS;

EID: 85017499307     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-2(1:4)2006     Document Type: Article

References (30)

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 G. Huizing, W. P. de Roever, and G. Rozenberg, editors, REX workshop Real-time, theory and practice, number 600 in Lecture Notes In Computer Science. Springer-Verlag, 1992.
3. E. J. Anderson and P. Nash. Linear Programming in Infinite-dimensional Spaces. Discrete Mathematics and Computation. Wiley-Interscience, 1987.
4. R. Blute, J. Desharnais, A. Edalat, and P. Panangaden. Bisimulation for labelled Markov processes. In Proceedings of the Twelfth IEEE Symposium On Logic In Computer Science, Warsaw, Poland., 1997.
5. M. Bravetti and R. Gorreiri. The theory of interactive semi-Markov processes. Theoretical Computer Science, 281(2):5-32, 2002.
6. C. Baier, H. Hermans, and J-P. Katonen. Approximative symbolic model checking of continuoustime Markov chains. In J. C. M. Baeten and S. Mauw, editors, Proceedings of the Tenth International Conference on Concurrency Theory, CONCUR99, number 1664 in Lecture Notes In Computer Science, pages 146-161. Springer-Verlag, 1999.
7. P. Billingsley. Convergence of Probability Measures. Wiley Interscience, 2nd edition edition, 1999.
8. R. Cleaveland, S. Smolka, and A. Zwarico. Testing preorders for probabilistic processes. In W. Kuich, editor, Automata, Languages and Programming (ICALP 92), number 623 in Lecture Notes in Computer Science, pages 708-719. Springer-Verlag, 1992.
9. L. de Alfaro, T. Henzinger, and R. Majumdar. Discounting the future in systems theory. In J. Baeten, J. K. Lenstra, J. Parrow, and G. J. Woeginger, editors, Thirtieth International Colloquium On Automata Languages And Programming, number 2719 in Lecture Notes In Computer Science, pages 1022-1037. Springer-Verlag, 2003.
10. J. Desharnais, A. Edalat, and P. Panangaden. Bisimulation for labeled Markov processes. Information and Computation, 179(2):163-193, Dec 2002.
11. J. Desharnais, V. Gupta, R. Jagadeesan, and P. Panangaden. Metrics for labeled Markov systems. In Proceedings of CONCUR99, number 1664 in Lecture Notes in Computer Science. Springer-Verlag, 1999.
12. J. Desharnais, V. Gupta, R. Jagadeesan, and P. Panangaden. The metric analogue of weak bisimulation for labelled Markov processes. In Proceedings of the Seventeenth Annual IEEE Symposium On Logic In Computer Science, pages 413-422, July 2002.
13. Jos´ee Desharnais, Vineet Gupta, Radhakrishnan Jagadeesan, and Prakash Panangaden. A metric for labelled Markov processes. Theoretical Computer Science, 318(3):323-354, June 2004.
14. Robert Geroch. Mathematical Physics. Chicago Lectures in Physics. University of Chicago Press, 1985.
15. Alison L. Gibbs and Francis Edward Su. On choosing and bounding probability metrics. International Statistical Review, 70:419-435, 2001.
16. Hans A. Hansson. Time and Probability in Formal Design of Distributed Systems, volume 1 of Real-time Safety-critical Systems. Elseiver, 1994.
17. B. R. Haverkort, L. Cloth, H. Hermans, J.-P. Katoen, and C. Baier. Model checking performability properties. In Proceedings of the International COnference on Dependable Systems and Networks 2002, pages 102-113. IEEE Computer Society, June 2002.
18. H. Hermanns. The Quest for Quantified Quality. Number 2428 in Lecture Notes In Computer Science. Springer-Verlag, 2002.
19. J. Hillston. A Compositional Approach to Performance Modelling. PhD thesis, University of Edinburgh, 1994. Published as a Distinguished Dissertation by Cambridge University Press in 1996.
20. C.-C. Jou and S. A. Smolka. Equivalences, congruences, and complete axiomatizations for probabilistic processes. In J.C.M. Baeten and J.W. Klop, editors, CONCUR 90 First International Conference on Concurrency Theory, number 458 in Lecture Notes In Computer Science. Springer-Verlag, 1990.
21. P. D. Lincoln, J.C. Mitchell, M. Mitchell, and A. Scedrov. A probabilistic poly-time framework for protocol analysis. In ACM Computer and Communication Security (CCS-5), 1998.
22. K. G. Larsen and A. Skou. Bisimulation through probablistic testing. Information and Computation, 94:1-28, 1991.
23. A. Philippou, I. Lee, and O. Sokolsky. Weal bisimulation for probabilistic processes. In C. Palamidessi, editor, Proceedings of CONCUR 2000, number 1877 in Lecture Notes In Computer Science, pages 334-349. Springer-Verlag, 2000.
24. G. S. Shedler. Regeneration and Networks of Queues. Springer-Verlag, 1987.
25. A. V. Skorohod. Limit theorems for stochastic processes. Theory of Probability and Applications, 1:261-290, 1956.
26. R. Segala and N. Lynch. Probabilistic simulations for probabilistic processes. Nordic Journal of Computing, 2(2):250-273, 1995.
27. Franck van Breugel and James Worrell. An algorithm for quantitative verification of probabilistic systems. In K. G. Larsen and M. Nielsen, editors, Proceedings of the Twelfth International Conference on Concurrency Theory-CONCUR’01, number 2154 in Lecture Notes In Computer Science, pages 336-350. Springer-Verlag, 2001.
28. Franck van Breugel and James Worrell. Towards quantitative verification of probabilistic systems. In Proceedings of the Twenty-eighth International Colloquium on Automata, Languages and Programming. Springer-Verlag, July 2001.
29. W. Whitt. Continuity of generalized semi-Markov processes. Mathematics of Operations Research, 5(4):494-501, 1980.
30. W. Whitt. An Introduction to Stochastic-Process Limits and their Applications to Queues. Springer Series in Operations Research. Springer-Verlag, 2002.