Axiomatization of trace semantics for stochastic nondeterministic processes

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

Volumn , Issue , 2004, Pages 294-303

  Parma, Augusto ^a   Segala, Roberto ^a  

^a UNIVERSITY OF VERONA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

AXIOMATIZATION; PROCESS ALGEBRA; STOCHASTIC LAWS; STOCHASTIC NONDETERMINISTIC PROCESSES;

ALGORITHMS; COMPUTER SCIENCE; COMPUTER SIMULATION; LINEAR ALGEBRA; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; PROBABILISTIC LOGICS; PROBABILITY; SEMANTICS; THEOREM PROVING;

RANDOM PROCESSES;

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

References (33)

1. L. de Alfaro. Formal Verification of Probabilistic Systems. PhD thesis, Stanford University, 1997. Available as Technical report STAN-CS-TR-98-1601.
2. J.C.M. Baeten, J.A. Bergstra, and S.A. Smolka. Axiomatizing probabilistic processes: ACP with generative probabilities. Information and Computation, 122:234-255, 1995.
3. th ICALP, Crete, Greece, volume 2076 of Lecture Notes in Computer Science, pages 370-381. Springer-Verlag, 2001.
4. S. Cattani and R. Segala. Decision algorithms for probabilistic bisimulation. In P. Jankar and M. Kretinsky, editors, Proceedings of CONCUR 2002, Brno, Czech Republic, volume 2421 of Lecture Notes in Computer Science, pages 371-385. Springer-Verlag, 2002.
5. L. de Alfaro, T.A. Henzinger, and R. Jhala. Compositional methods for probabilistic systems. In K.G. Larsen and M. Nielsen, editors, Proceedings of CONCUR 2001, Aalborg, Denmark, volume 2154 of Lecture Notes in Computer Science. Springer-Verlag, 2001.
6. C. Derman. Finite State Markovian Decision Processes. Acedemic Press, 1970.
7. Y.A. Feldman and D. Harel. A probabilistic dynamic logic. Journal of Computer and System Sciences, 28(2):193-215, 1984.
8. U. Frendrup and J.N. Jensen. A complete axiomatization of simulation for regular ces expressions. Technical report, BRIGS, Aalborg University, department of Computer science, Denmark, 2001.
9. th Annual Symposium on Logic in Computer Science, Philadelphia, USA, pages 130-141. IEEE Computer Society Press, 1990.
10. H. Hansson. Time and Probability in Formal Design of Distributed Systems. PhD thesis, Department of Computer Science, Uppsala University, 1991.
11. S. Hart, M. Sharir, and A. Pnueli. Termination of probabilistic concurrent programs. ACM Transactions on Programming Languages and Systems, 5(3):356-380, 1983.
12. th Annual Symposium on Logic in Computer Science, Asilomar, California, pages 186-195. IEEE Computer Society Press, 1989.
13. B. Jonsson and K.G. Larsen. Specification and refinement of probabilistic processes. In Proceedings of the 6th IEEE Symposium on Logic in Computer Science, pages 266-277, Amsterdam, July 1991.
14. 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, Proceedings of CONCUR 90, Amsterdam, volume 458 of Lecture Notes in Computer Science, pages 367-383. Springer-Verlag, 1990.
15. R. Keller. Formal verification of parallel programs. Communications of the ACM, 7(19):561-572, 1976.
16. G. Lowe. Representing nondeterminism and probabilistic behavior in reactive proceses. Technical Report PRG-TR-11-93, Oxford University Computing Laboratory - Programming Research Group, 1993.
17. N. Lynch, R. Segala, and F. Vaandrager. Compositionality for probabilistic automata. In D. Lugiez R. Amadio, editor, Proceedings of CONCUR 2003, Marseille, France, volume 2761 of Lecture Notes in Computer Science, pages 208-221. Springer-Verlag, 2003.
18. R. Milner. A complete inference system for a class of regular behaviours. Journal of Computer and System Sciences, 28:439-466, 1984.
19. R. Milner. Communication and Concurrency. PrenticeHall International, Englewood Cliffs, 1989.
20. Carroll Morgan, Annabelle Mclver, and Karen Seidel. Probabilistic predicate transformers. ACM Transactions on Programming Languages and Systems, 18(3):325-353, May 1996.
21. M. Nunez. An axiomatization of probabilistic testing. In Proceedings of 5th AM AST Workshop on Real-Time and Probabilistic Systems, Lecture Notes in Computer Science, pages 130-150, 1999.
22. A. Philippou, I. Lee, and O. Sokolsky. Weak bisimulation for probabilistic systems. In C. Palamidessi, editor, Proceedings of CONCUR 2000, University Park, PA, USA, volume 1877 of Lecture Notes in Computer Science, pages 334-349. Springer-Verlag, 2000.
23. A. Pnueli and L. Zuck. Verification of multiprocess probabilistic protocols. Distributed Computing, 1(1):53-72, 1986.
24. th Annual ACM Symposium on Principles of Distributed Computing, Quebec, Canada, August 1990.
25. R. Segala. A compositional trace-based semantics for probabilistic automata. In I. Lee and S.A. Smolka, editors, Proceedings of CONCUR 95, Philadelphia, PA, USA, volume 962 of Lecture Notes in Computer Science, pages 234-248. Springer-Verlag, 1995.
26. R. Segala. Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, MIT, Dept. of Electrical Engineering and Computer Science, 1995. Also appears as technical report MIT/LCS/TR-676.
27. R. Segala. Testing probabilistic automata. In U. Montanari and V. Sassone, editors, Proceedings of CONCUR 05,.Pisa, Italy, volume 1119 of Lecture Notes in Computer Science, pages 299-314. Springer-Verlag, 1996.
28. R. Segala and N.A. Lynch. Probabilistic simulations for probabilistic processes. Nordic Journal of Computing, 2(2):250-273, 1995.
29. K. Seidel. Probabilistic communicating processes. Technical Report PRG-102, Ph.D. Thesis, Programming Research Group, Oxford University Computing Laboratory, 1992.
30. E.W. Stark and S.A. Smolka. A complete axiom system for finite-state probabilistic processes. In G. Plotkin, C.P. Stirling, and M. Tofte, editors, Proof, Language and Interaction: Essays in Honour of Robin Milner. MIT Press, 1999.
31. M.I.A. Stoelinga. Alea jacta est: Verification of Probabilistic, Real-Time and Parametric Systems. PhD thesis, University of Nijmegen, 2002.
32. th ICALP, Crete, Greece, volume 2719 of Lecture Notes in Computer Science. Springer-Verlag, 2003.
33. M.Y. Vardi. Automatic verification of probabilistic concurrent finite-state programs. In Proceedings of 26th IEEE Symposium on Foundations of Computer Science, pages 327-338, Portland, OR, 1985.