A uniform definition of stochastic process calculi

ACM Computing Surveys

Volumn 46, Issue 1, 2013, Pages

  Nicola, Rocco De ^a   Latella, Diego ^b   Loreti, Michele ^c   Massink, Mieke ^b  

^a IMT SCHOOL FOR ADVANCED STUDIES LUCCA   (Italy)

^b ISTI CNR   (Italy)

^c UNIVERSITY OF FLORENCE   (Italy)

Author keywords

Continuous time Markov chains; Stochastic process calculi; Structured operational semantics

Indexed keywords

ALGEBRA; BIOMINERALIZATION; CHAINS; CONTINUOUS TIME SYSTEMS; MARKOV PROCESSES; PATHOLOGY; STOCHASTIC SYSTEMS;

CONTINOUS TIME MARKOV CHAIN; LABELLED TRANSITION SYSTEMS; ON STATE; PROCESS ALGEBRAS; PROCESS CALCULI; STATE TRANSITIONS; STOCHASTIC PROCESS ALGEBRAS; STOCHASTIC PROCESS CALCULUS; STRUCTURED OPERATIONAL SEMANTICS; TRANSITION STRUCTURES;

SEMANTICS;

EID: 84887414523     PISSN: 03600300     EISSN: 15577341     Source Type: Journal    
DOI: 10.1145/2522968.2522973     Document Type: Article

References (48)

1. ACETO, L., FOKKING, W., AND VERHOEF, C. 2001. Structural operational semantics. In Handbook of Process Algebra. Elsevier, 197-292.
2. ALDINI, A., BERNARDO, M., AND CORRADINI, F. 2010. A Process Algebraic Approach to Software Architecture Design. Springer.
3. BARTELS, F. 2002. GSOS for probabilistic transition systems. Electron. Notes Theor. Comput. Syst. 65, 1, 1-25.
4. BARTELS, F., SOKOLOVA, A., AND DE VINK, E. P. 2003. A hierarchy of probabilistic system types. Electron. Notes Theor. Comput. Syst. 82, 1, 1-19.
5. BERGSTRA, J., PONSE, A., AND SMOLKA, S., EDS. 2001. Handbook of Process Algebra. Elsevier.
6. BERNARDO, M. 2010. On the expressiveness of markovian process calculi with durational and durationless actions. In Proceedings of the 1st International Symposium on Games, Automata, Logics and Formal Verification (GandALF10). 199-213.
7. BERNARDO, M., DE NICOLA, R., AND LORETI, M. 2010. Uniform labeled transition systems for nondeterministic, probabilistic, and stochastic processes. In Proceedings of the 5th International Symposium on Trustworthly Global Computing (TGC10).
8. Lecture Notes in Computer Science, vol. 6084, Springer, 35-56.
9. BLOM, S., FOKKINK, W., GROOTE, J. F., VAN LANGEVELDE, I., LISSER, B., AND VAN DE POL, J. 2001. crl: A toolset for analysing algebraic specifications. In Proceedings of the 13th International Conference on Computer Aided Verification (CAV01).
10. Lecture Notes in Computer Science, vol. 2102, Springer, 250-254.
11. BOHNENKAMP, H., DARGENIO, P., HERMANNS, H., AND KATOEN, J.-P. 2006. MODEST: A compositional modeling formalism for hard and softly timed systems. IEEE Trans. Softw. Engin. 32, 10, 812-830.
12. BRINKSMA, E. AND HERMANNS, H. 2001. Process algebra and markov chains. In Lectures on Formal Methods and Performance Analysis, Lecture Notes in Computer Science, vol. 2090, Springer, 181-231.
13. BUCHHOLZ, P. 1994. Markovian process algebra: Composition and equivalence. In Proceedings of the 2nd International Workshop on Process Algebras and Probabilistic Modeling (PAPM94). 11-30.
14. CARDELLI, L. AND MARDARE, R. 2010. The measurable space of stochastic processes. In Proceedings of the 7th International Conference on the Quantitative Evaluation of Systems (QEST10). 171-180.
15. DE NICOLA, R., KATOEN, J.-P., LATELLA, D., LORETI, M., AND MASSINK, M. 2006. Klaim and its stochastic semantics. Tech. rep. 6, Dipartimento di Sistemi e Informatica, Universit̀a di Firenze. http://rap.dsi. unifi.it/loreti/papers/TR062006.pdf.
16. DE NICOLA, R., LATELLA, D., LORETI, M., AND MASSINK, M. 2009a. MarCaSPiS: A markovian extension of a calculus for services. Electron. Notes Theor. Comput. Sci. 229, 4, 11-26.
17. DE NICOLA, R., LATELLA, D., LORETI, M., AND MASSINK, M. 2009b. On a uniform framework for the definition of stochastic process languages. In Proceedings of the 14th International Workshop on Formal Methods for Industrial Critical Systems. Lecture Notes in Computer Science, vol. 5825, Springer, 9-25.
18. DE NICOLA, R., LATELLA, D., LORETI, M., AND MASSINK, M. 2009c. Rate-based transition systems for stochastic process calculi. In Proceedings of the 36th International Colloquium on Automata, Languages and Programming, Part II. Lecture Notes in Computer Science, vol. 5556, Springer, 435-446.
19. DE NICOLA, R., LATELLA, D., AND MASSINK, M. 2005. Formal modeling and quantitative analysis of klaim-based mobile systems. In Proceedings of the ACM Symposium on Applied Computing (SAC05). ACM Press, New York, 428-435.
20. DENG, Y., VAN GLABBEEK, R.,HENNESSY,M.,MORGAN, C., AND ZHANG, C. 2007. Characterising testing preorders for finite probabilistic processes. In Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science (LICS07). 313-325.
21. EISENTRAUT, C.,HERMANNS, H., AND ZHANG, L. 2010. On probabilistic automata in continuous time. In Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science (LICS10). 342-351.
22. FAHRENBERG, U., THRANE, C., AND LARSEN, K. 2011. Distances for weighted transition systems: Games and properties. In Proceedings of the 9th Workshop on Quantitative Aspects of Programming Languages (QAPL11). 134-147.
23. GOTZ, N., HERZOG, U., AND RETTELBACH, M. 1993. Multiprocessor and distributed systems design: The integration of functional specification and performance analysis using stochastic process algebras. In Performance Evaluation of Computer and Communication Systems. Lecture Notes in Computer Science, vol. 729, Springer, 121-146.
24. HERMANNS, H. 2002. Interactive Markov Chains. Lecture Notes in Computer Science, vol. 2428, Springer.
25. HERMANNS, H.,HERZOG, U., AND KATOEN, J.-P. 2002. Process algebra for performance evaluation. Theor. Comput. Sci. 274, 1-2, 43-87.
26. HERMANNS, H.,HERZOG, U., ANDMERTSIOTAKIS, V. 1998. Stochastic process algebras-Between lotos and markov chains. Comput. Netw. Isdn Syst. 30, 901-924.
27. HERMANNS, H. AND JOHR, S. 2007. Uniformity by construction in the analysis of nondeterministic stochastic systems. In Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN07). 718-728.
28. HERMANNS, H. AND KATOEN, J. 2010. The how and why of interactive markov chains. In Proceedings of the 8th International Symposium on Formal Methods for Components and Objects (FMCO09).
29. Lecture Notes in Computer Science, vol. 6286, Springer, 311-337.
30. HILLSTON, J. 1994. The nature of synchronisation. In Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods (PAPM94). 51-70.
31. HILLSTON, J. 1996. A Compositional Approach to Performance Modelling. Distinguished Dissertation in Computer Science, Cambridge University Press.
32. HOJJAT, H., REZA, MOUSAVI, M., AND SIRJANI, M. 2008. A framework for performance evaluation and functional verification in stochastic process algebras. In Proceedings of the ACM Symposium on Applied Computing (SAC08). ACM Press, New York, 339-346.
33. HUNG, D. V. AND ZHOU, C. 1999. Probabilistic duration calculus for continuous time. Formal Aspects Comput. 11, 1, 21-44.
34. KLIN, B. 2009. Structural operational semantics for weighted transition systems. In Semantics and Algebraic Specification. Lecture Notes in Computer Science, vol. 5700, Springer, 121-139.
35. KLIN, B. AND SASSONE, V. 2008. Structural operational semantics for stochastic process calculi. In Proceedings of the 11th International Conference on Foundations of Software Science and Computational Structures (FoSSaCS08).
36. Lecture Notes in Computer Science, vol. 4962, Springer, 428-442.
37. KNAST, R. 1969. Continuous-time probabilistic automata. In Information and Control 15. Elsevier, 335-352.
38. LATELLA, D.,MASSINK M., AND DE VINK, E. P. 2012. Bisimulation of labeled state-to-function transition systems of stochastic process languages. In Proceedings of the 7th ACCAT Workshop on Applied and Computational and Category Theory. Vol. 93, 23-43.
39. MILNER, R. 1989. Communication and Concurrency. Series in Computer Science.Prentice Hall.
40. NEUTS, M. 1981. Matrix-Geometric Solutions in Stochastic Models-An Algorithmic Approach. The Johns Hopkins University Press, Baltimore, MD.
41. PLOTKIN, G. D. 2004. A structural approach to operational semantics. J. Logic Algebraic Program. 60-61, 17-139.
42. PRIAMI, C. 1995. Stochastic TT-calculus. The Comput. J. 38, 7, 578-589.
43. SEGALA, R. 1995. Modeling and verification of randomized distributed real-time systems. Ph.D thesis, MIT. http://profs.sci.univr.it/segala/www/phd. html.
44. SOKOLOVA, A. AND DE VINK, E. P. 2004. Probabilistic automata: System types, parallel composition and comparison. In Validation of Stochastic Systems. A Guide to Current Research. Lecture Notes in Computer Science, vol. 2925, Springer, 1-43.
45. TIMMER, M.,KATOEN, J-P., VAN DE POL, J., AND STOELINGA,M. 2012. Efficient modelling and generation of markov automata. In Proceedings of the 23rd International Conference on Concurrency Theory (CONCUR12).
46. Lecture Notes in Computer Science, vol. 7454, Springer, 364-379.
47. VAN GLABBEEK, R. 2001. The linear time-Branching time spectrum i. In Handbook of Process Algebra, Elsevier, 3-99.
48. ZHANG, L., HERMANNS, H., EISENBRAND, F., AND JANSEN, D. 2008. Flow faster: Efficient decision algorithms for probabilistic simulations. Logical Methods Comput. Sci. 4, 6, 1-43.