{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:13:00Z","timestamp":1725549180054},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642120312"},{"type":"electronic","value":"9783642120329"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12032-9_7","type":"book-chapter","created":{"date-parts":[[2010,3,8]],"date-time":"2010-03-08T01:07:56Z","timestamp":1268010476000},"page":"79-93","source":"Crossref","is-referenced-by-count":10,"title":["Retaining the Probabilities in Probabilistic Testing Theory"],"prefix":"10.1007","author":[{"given":"Sonja","family":"Georgievska","sequence":"first","affiliation":[]},{"given":"Suzana","family":"Andova","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"7_CR1","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1145\/828.833","volume":"31","author":"S.D. Brookes","year":"1984","unstructured":"Brookes, S.D., Hoare, C.A.R., Roscoe, A.W.: A theory of communicating sequential processes. Journal of ACM\u00a031(3), 560\u2013599 (1984)","journal-title":"Journal of ACM"},{"issue":"1-2","key":"7_CR2","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S1567-8326(02)00040-1","volume":"55","author":"D. Cazorla","year":"2003","unstructured":"Cazorla, D., Cuartero, F., Valero, V., Pelayo, F.L., Pardo, J.J.: Algebraic theory of probabilistic and nondeterministic processes. Journal of Logic and Algebraic Programming\u00a055(1-2), 57\u2013103 (2003)","journal-title":"Journal of Logic and Algebraic Programming"},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-540-74407-8_4","volume-title":"CONCUR 2007 \u2013 Concurrency Theory","author":"K. Chatzikokolakis","year":"2007","unstructured":"Chatzikokolakis, K., Palamidessi, C.: Making random choices invisible to the scheduler. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol.\u00a04703, pp. 42\u201358. Springer, Heidelberg (2007)"},{"issue":"6","key":"7_CR4","first-page":"1","volume":"54","author":"L. Cheug","year":"2007","unstructured":"Cheug, L., Stoelinga, M.I.A., Vaandrager, F.W.: A testing scenario for probabilistic processes. Journal of ACM\u00a054(6), 29:1\u201329:45 (2007)","journal-title":"Journal of ACM"},{"issue":"1-2","key":"7_CR5","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.tcs.2006.07.033","volume":"365","author":"L. Cheung","year":"2006","unstructured":"Cheung, L., Lynch, N., Segala, R., Vaandrager, F.: Switched PIOA: Parallel composition via distributed scheduling. Theoret. Comp. Science\u00a0365(1-2), 83\u2013108 (2006)","journal-title":"Theoret. Comp. Science"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/3-540-44685-0_24","volume-title":"CONCUR 2001 - Concurrency Theory","author":"L. Alfaro de","year":"2001","unstructured":"de Alfaro, L., Henzinger, T., Jhala, R.: Compositional methods for probabilistic systems. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol.\u00a02154, pp. 351\u2013365. Springer, Heidelberg (2001)"},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"34","author":"R. Nicola De","year":"1984","unstructured":"De Nicola, R., Hennessy, M.C.B.: Testing equivalences for processes. Theoret. Comp. Science\u00a034, 83\u2013133 (1984)","journal-title":"Theoret. Comp. Science"},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-642-04081-8_19","volume-title":"CONCUR 2009 - Concurrency Theory","author":"Y. Deng","year":"2009","unstructured":"Deng, Y., van Glabbeek, R., Hennessy, M., Morgan, C.: Testing finitary probabilistic processes (extended abstract). In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009 - Concurrency Theory. LNCS, vol.\u00a05710, pp. 274\u2013288. Springer, Heidelberg (2009)"},{"issue":"4:4","key":"7_CR9","first-page":"1","volume":"4","author":"Y. Deng","year":"2008","unstructured":"Deng, Y., van Glabbeek, R.J., Hennessy, M., Morgan, C.: Characterising testing preorders for finite probabilistic processes. Logical Methods in Computer Science\u00a04(4:4), 1\u201333 (2008)","journal-title":"Logical Methods in Computer Science"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Georgievska, S., Andova, S.: Retaining the probabilities in probabilistic testing theory. Technical Report (to appear, 2010), http:\/\/www.win.tue.nl\/~sgeorgie\/general_testing.pdf","DOI":"10.1007\/978-3-642-12032-9_7"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Giro, S., D\u2019Argenio, P.: On the expressive power of schedulers in distributed probabilistic systems. In: Proc. QAPL 2009. ENTCS (2009) (to appear)","DOI":"10.1016\/j.entcs.2009.10.005"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/978-3-642-04081-8_23","volume-title":"CONCUR 2009 - Concurrency Theory","author":"S. Giro","year":"2009","unstructured":"Giro, S., D\u2019Argenio, P., Ferrer Fioriti, L.M.: Partial order reduction for probabilistic systems: A revision for distributed schedulers. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009 - Concurrency Theory. LNCS, vol.\u00a05710, pp. 338\u2013353. Springer, Heidelberg (2009)"},{"key":"7_CR13","volume-title":"Algebraic Theory of Processes","author":"M. Hennessy","year":"1988","unstructured":"Hennessy, M.: Algebraic Theory of Processes. MIT Press, Cambridge (1988)"},{"key":"7_CR14","volume-title":"Communicating Sequential Processes","author":"C.A.R. Hoare","year":"1985","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes. Prentice Hall, Englewood Cliffs (1985)"},{"issue":"1","key":"7_CR15","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/S0304-3975(01)00044-5","volume":"282","author":"B. Jonsson","year":"2002","unstructured":"Jonsson, B., Wang, Y.: Testing preorders for probabilistic processes can be characterized by simulations. Theoret. Comp. Science\u00a0282(1), 33\u201351 (2002)","journal-title":"Theoret. Comp. Science"},{"key":"7_CR16","volume-title":"Introduction to Probability and Statistics from a Bayesian Viewpoint","author":"D.V. Lindley","year":"1980","unstructured":"Lindley, D.V.: Introduction to Probability and Statistics from a Bayesian Viewpoint. Cambridge University Press, Cambridge (1980)"},{"key":"7_CR17","unstructured":"Lowe, G.: Representing nondeterministic and probabilistic behaviour in reactive processes. Technical Report PRG-TR-11-93, Oxford Univ. Comp. Labs (1993)"},{"issue":"4","key":"7_CR18","doi-asserted-by":"publisher","first-page":"977","DOI":"10.1137\/S0097539704446487","volume":"37","author":"N. Lynch","year":"2007","unstructured":"Lynch, N., Segala, R., Vaandrager, F.: Observing branching structure through probabilistic contexts. SIAM Journal on Computing\u00a037(4), 977\u20131013 (2007)","journal-title":"SIAM Journal on Computing"},{"issue":"6","key":"7_CR19","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/BF01213492","volume":"8","author":"C. Morgan","year":"1996","unstructured":"Morgan, C., McIver, A., Seidel, K., Sanders, J.W.: Refinement-oriented probability for CSP. Formal Aspects of Computing\u00a08(6), 617\u2013647 (1996)","journal-title":"Formal Aspects of Computing"},{"issue":"2","key":"7_CR20","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/BF00264365","volume":"24","author":"R. Nicola De","year":"1987","unstructured":"De Nicola, R.: Extensional equivalences for transition systems. Acta Informatica\u00a024(2), 211\u2013237 (1987)","journal-title":"Acta Informatica"},{"key":"7_CR21","first-page":"189","volume-title":"Proc. QEST 2007","author":"M.C. Palmeri","year":"2007","unstructured":"Palmeri, M.C., De Nicola, R., Massink, M.: Basic observables for probabilistic testing. In: Proc. QEST 2007, pp. 189\u2013200. IEEE Computer Society, Los Alamitos (2007)"},{"key":"7_CR22","unstructured":"Segala, R.: Modeling and verification of randomized distributed real-time systems. PhD thesis. MIT (1995)"},{"key":"7_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/3-540-61604-7_62","volume-title":"CONCUR \u201996: Concurrency Theory","author":"R. Segala","year":"1996","unstructured":"Segala, R.: Testing probabilistic automata. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol.\u00a01119, pp. 299\u2013314. Springer, Heidelberg (1996)"},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"Wang, Y., Larsen, K.G.: Testing probabilistic and nondeterministic processes. In: Proceedings of the IFIP TC6\/WG6.1 Twelth International Symposium on Protocol Specification, Testing and Verification XII, pp. 47\u201361 (1992)","DOI":"10.1016\/B978-0-444-89874-6.50010-6"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12032-9_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,30]],"date-time":"2023-05-30T19:56:55Z","timestamp":1685476615000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12032-9_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642120312","9783642120329"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12032-9_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}