{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:41:14Z","timestamp":1742913674522,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642214608"},{"type":"electronic","value":"9783642214615"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-21461-5_2","type":"book-chapter","created":{"date-parts":[[2011,6,10]],"date-time":"2011-06-10T09:25:36Z","timestamp":1307697936000},"page":"29-43","source":"Crossref","is-referenced-by-count":4,"title":["Linear-Time and May-Testing in a Probabilistic Reactive Setting"],"prefix":"10.1007","author":[{"given":"Lucia","family":"Acciai","sequence":"first","affiliation":[]},{"given":"Michele","family":"Boreale","sequence":"additional","affiliation":[]},{"given":"Rocco","family":"De Nicola","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","unstructured":"Acciai, L., Boreale, M., De Nicola, R.: Linear-Time and May-Testing in a Probabilistic Reactive Setting. Full version, http:\/\/rap.dsi.unifi.it\/~acciai\/papers\/prob-may.pdf"},{"key":"2_CR2","unstructured":"Baier, C.: On the algorithmic verification of probabilistic systems. Universit\u00e4t Mannheim, Habilitation Thesis (1998)"},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1006\/inco.2001.3080","volume":"172","author":"M. Boreale","year":"2002","unstructured":"Boreale, M., De Nicola, R., Pugliese, R.: Trace and Testing Equivalence in Asynchronous Processes. Information and Computation\u00a0172, 139\u2013164 (2002)","journal-title":"Information and Computation"},{"key":"2_CR4","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)"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Cleaveland, R., Iyer, S.P., Narasimha, M.: Probabilistic temporal logics via the modal mu-calculus. Theor. Comput. Sci.\u00a0342(2-3) (2005)","DOI":"10.1016\/j.tcs.2005.03.048"},{"key":"2_CR6","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":"D. Deng","year":"2009","unstructured":"Deng, D., van Glabbeek, R., Hennessy, M., Morgan, C.: Testing finitary probabilistic processes. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol.\u00a05710, pp. 274\u2013288. Springer, Heidelberg (2009)"},{"issue":"4","key":"2_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-4(4:4)2008","volume":"4","author":"D. Deng","year":"2008","unstructured":"Deng, D., van Glabbeek, R., Hennessy, M., Morgan, C.: Characterising testing preorders for finite probabilistic processes. Logical Methods in Computer Science\u00a04(4), 1\u201333 (2008)","journal-title":"Logical Methods in Computer Science"},{"issue":"2","key":"2_CR8","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":"2_CR9","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.: Testing equivalences for processes. Theoretical Computer Science\u00a034, 83\u2013133 (1984)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"2_CR10","first-page":"219","volume":"8","author":"Z. \u00c9sik","year":"2003","unstructured":"\u00c9sik, Z., Kuich, W.: Formal Tree Series. Journal of Automata, Languages and Combinatorics\u00a08(2), 219\u2013285 (2003)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"2_CR11","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)"},{"issue":"1","key":"2_CR12","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1006\/inco.1995.1123","volume":"121","author":"R. Glabbeek van","year":"1995","unstructured":"van Glabbeek, R., Smolka, S., Steffen, B., Tofts, C.: Reactive, generative, and stratified models of probabilistic processes. Information and Computation\u00a0121(1), 59\u201380 (1995)","journal-title":"Information and Computation"},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1007\/BFb0039066","volume-title":"CONCUR \u201990","author":"R.J. Glabbeek van","year":"1990","unstructured":"van Glabbeek, R.J.: The linear time-branching time spectrum. In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol.\u00a0458, pp. 278\u2013297. Springer, Heidelberg (1990)"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Halmos, P.: Measure theory. Litton Educational Publishing, Inc. (1950)","DOI":"10.1007\/978-1-4684-9440-2"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Hansson, H., Jonsson, B.: A Calculus for Communicating Systems with Time and Probabilities. In: Proc. of IEEE Real-Time Systems Symposium, pp. 278\u2013287 (1990)","DOI":"10.1109\/REAL.1990.128759"},{"issue":"1","key":"2_CR16","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/2455.2460","volume":"32","author":"M. Hennessy","year":"1985","unstructured":"Hennessy, M., Milner, R.: Algebraic laws for nondeterminism and concurrency. Journal of the ACM\u00a032(1), 137\u2013161 (1985)","journal-title":"Journal of the ACM"},{"issue":"1","key":"2_CR17","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., Yi, W.: Testing Preorders for Probabilistic Processes can be Characterized by Simulations. TCS\u00a0282(1), 33\u201351 (2002)","journal-title":"TCS"},{"issue":"1","key":"2_CR18","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. Inf. and Comp.\u00a094(1), 1\u201328 (1991)","journal-title":"Inf. and Comp."},{"key":"2_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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)"},{"issue":"2","key":"2_CR20","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1137\/0221017","volume":"21","author":"W.-G. Tzeng","year":"1992","unstructured":"Tzeng, W.-G.: A polynomial time algorithm for the equivalence of probabilistic automata. SIAM Journal on Computing\u00a021(2), 216\u2013227 (1992)","journal-title":"SIAM Journal on Computing"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Wang, Y., Larsen, K.G.: Testing Probabilistic and Nondeterministic Processes. In: Proc. of PSTV, IFIP Transactions C, vol.\u00a08, pp. 47\u201361 (1992)","DOI":"10.1016\/B978-0-444-89874-6.50010-6"}],"container-title":["Lecture Notes in Computer Science","Formal Techniques for Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21461-5_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T12:20:13Z","timestamp":1560255613000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21461-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642214608","9783642214615"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21461-5_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}