{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:19:14Z","timestamp":1726409954104},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642285394"},{"type":"electronic","value":"9783642285400"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-28540-0_10","type":"book-chapter","created":{"date-parts":[[2012,3,8]],"date-time":"2012-03-08T14:48:22Z","timestamp":1331218102000},"page":"136-150","source":"Crossref","is-referenced-by-count":5,"title":["Probabilistic CSP: Preserving the Laws via Restricted Schedulers"],"prefix":"10.1007","author":[{"given":"Sonja","family":"Georgievska","sequence":"first","affiliation":[]},{"given":"Suzana","family":"Andova","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"28","key":"10_CR1","doi-asserted-by":"publisher","first-page":"3072","DOI":"10.1016\/j.tcs.2011.02.045","volume":"412","author":"M.E. Andr\u00e9s","year":"2011","unstructured":"Andr\u00e9s, M.E., Palamidessi, C., van Rossum, P., Sokolova, A.: Information hiding in probabilistic concurrent systems. Theor. Comp. Sc.\u00a0412(28), 3072\u20133089 (2011)","journal-title":"Theor. Comp. Sc."},{"issue":"6","key":"10_CR2","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1093\/comjnl\/30.6.498","volume":"30","author":"J.C.M. Baeten","year":"1987","unstructured":"Baeten, J.C.M., Bergstra, J.A., Klop, J.W.: Ready-trace semantics for concrete process algebra with the priority operator. The Comp. Journal\u00a030(6), 498\u2013506 (1987)","journal-title":"The Comp. Journal"},{"issue":"3","key":"10_CR3","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":"34","key":"10_CR4","doi-asserted-by":"publisher","first-page":"4373","DOI":"10.1016\/j.tcs.2011.05.010","volume":"412","author":"B. Caillaud","year":"2011","unstructured":"Caillaud, B., Delahaye, B., Larsen, K., Legay, A., Pedersen, M., Wasowski, A.: Constraint markov chains. Theor. Comp. Sc.\u00a0412(34), 4373\u20134404 (2011)","journal-title":"Theor. Comp. Sc."},{"issue":"6","key":"10_CR5","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1016\/j.ic.2009.06.006","volume":"208","author":"K. Chatzikokolakis","year":"2010","unstructured":"Chatzikokolakis, K., Palamidessi, C.: Making random choices invisible to the scheduler. Information and Computation\u00a0208(6), 694\u2013715 (2010)","journal-title":"Information and Computation"},{"issue":"1-2","key":"10_CR6","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. Theor. Comp. Sc.\u00a0365(1-2), 83\u2013108 (2006)","journal-title":"Theor. Comp. Sc."},{"key":"10_CR7","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)"},{"issue":"4:4","key":"10_CR8","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 Comp. Sc.\u00a04(4:4), 1\u201333 (2008)","journal-title":"Logical Methods in Comp. Sc."},{"key":"10_CR9","volume-title":"Stochastic Processes","author":"J.L. Doob","year":"1953","unstructured":"Doob, J.L.: Stochastic Processes. John Wiley and Sons, New York (1953)"},{"key":"10_CR10","unstructured":"Georgievska, S.: Probability and Hiding in Concurrent Processes. PhD thesis, Eindhoven University of Technology (2011)"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/978-3-642-15784-4_18","volume-title":"Computer Performance Engineering","author":"S. Georgievska","year":"2010","unstructured":"Georgievska, S., Andova, S.: Composing Systems While Preserving Probabilities. In: Aldini, A., Bernardo, M., Bononi, L., Cortellessa, V. (eds.) EPEW 2010. LNCS, vol.\u00a06342, pp. 268\u2013283. Springer, Heidelberg (2010)"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-642-12032-9_7","volume-title":"Foundations of Software Science and Computational Structures","author":"S. Georgievska","year":"2010","unstructured":"Georgievska, S., Andova, S.: Retaining the Probabilities in Probabilistic Testing Theory. In: Ong, L. (ed.) FOSSACS 2010. LNCS, vol.\u00a06014, pp. 79\u201393. Springer, Heidelberg (2010)"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Georgievska, S., Andova, S.: Probabilistic CSP: Preserving the laws via restricted schedulers. Technical Report (2011), http:\/\/www.win.tue.nl\/~sgeorgie\/axioms2011_long.pdf","DOI":"10.1007\/978-3-642-28540-0_10"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Giro, S., D\u2019Argenio, P.: On the expressive power of schedulers in distributed probabilistic systems. In: QAPL 2009. ENTCS, vol.\u00a0253(3), pp. 45\u201371 (2009)","DOI":"10.1016\/j.entcs.2009.10.005"},{"key":"10_CR15","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. LNCS, vol.\u00a05710, pp. 338\u2013353. Springer, Heidelberg (2009)"},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-540-75454-1_14","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"S. Giro","year":"2007","unstructured":"Giro, S., D\u2019Argenio, P.R.: Quantitative Model Checking Revisited: Neither Decidable Nor Approximable. In: Raskin, J.-F., Thiagarajan, P.S. (eds.) FORMATS 2007. LNCS, vol.\u00a04763, pp. 179\u2013194. Springer, Heidelberg (2007)"},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/3-540-63010-4_23","volume-title":"Transformation-Based Reactive Systems Development","author":"F.C. Gomez","year":"1997","unstructured":"Gomez, F.C., De Frutos Escrig, D., Ruiz, V.V.: A Sound and Complete Proof System for Probabilistic Processes. In: Rus, T., Bertr\u00e1n, M. (eds.) AMAST-ARTS 1997, ARTS 1997, and AMAST-WS 1997. LNCS, vol.\u00a01231, pp. 340\u2013352. Springer, Heidelberg (1997)"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes. Prentice Hall (1985)","DOI":"10.1007\/978-3-642-82921-5_4"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Kwiatkowska, M., Norman, G.: A testing equivalence for reactive probabilistic processes. In: EXPRESS 1998. ENTCS, vol.\u00a016(2), pp. 1\u201319 (1998)","DOI":"10.1016\/S1571-0661(04)00121-5"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Kwiatkowska, M.Z., Norman, G.J.: A fully abstract metric-space denotational semantics for reactive probabilistic processes. In: COMPROX 1998. ENTCS, vol.\u00a013, pp. 1\u201333 (1998)","DOI":"10.1016\/S1571-0661(05)80222-1"},{"key":"10_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(91)90030-6","volume":"94","author":"K.G. Larsen","year":"1991","unstructured":"Larsen, K.G., Skou, A.: Bisimulation through probabilistic testing. Information and Computation\u00a094, 1\u201328 (1991)","journal-title":"Information and Computation"},{"key":"10_CR22","unstructured":"Lindley, D.V.: Introduction to Probability and Statistics from a Bayesian Viewpoint. Cambridge University Press (1980)"},{"key":"10_CR23","unstructured":"Lowe, G.: Representing nondeterministic and probabilistic behaviour in reactive processes. Technical Report PRG-TR-11-93, Oxford University Computing Labs (1993)"},{"key":"10_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-10235-3","volume-title":"A Calculus of Communicating Systems","author":"R. Milner","year":"1980","unstructured":"Milner, R.: A Calculus of Communicating Systems. Springer, Heidelberg (1980)"},{"issue":"6","key":"10_CR25","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"},{"key":"10_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/BFb0015727","volume-title":"Automata, Languages and Programming","author":"A. Pnueli","year":"1985","unstructured":"Pnueli, A.: Linear and Branching Structures in the Semantics and Logics of Reactive Systems. In: Brauer, W. (ed.) ICALP 1985. LNCS, vol.\u00a0194, pp. 15\u201332. Springer, Heidelberg (1985)"},{"key":"10_CR27","unstructured":"Roscoe, A.W.: The Theory and Practice of Concurrency. Prentice Hall (1998)"},{"key":"10_CR28","unstructured":"Segala, R.: Modeling and Verification of Randomized Distributed Real-time Systems. PhD thesis, MIT (1995)"},{"key":"10_CR29","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0304-3975(94)00286-0","volume":"152","author":"K. Seidel","year":"1995","unstructured":"Seidel, K.: Probabilistic communicating processes. Theor. Comp. Sc.\u00a0152, 219\u2013249 (1995)","journal-title":"Theor. Comp. Sc."},{"key":"10_CR30","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","Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28540-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,2]],"date-time":"2022-01-02T03:39:42Z","timestamp":1641094782000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28540-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642285394","9783642285400"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28540-0_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}