{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:13Z","timestamp":1725558973755},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540251095"},{"type":"electronic","value":"9783540318484"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"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":[[2005]]},"DOI":"10.1007\/978-3-540-31848-4_4","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T15:24:53Z","timestamp":1278343493000},"page":"49-63","source":"Crossref","is-referenced-by-count":0,"title":["Testing of Symbolic-Probabilistic Systems"],"prefix":"10.1007","author":[{"given":"Natalia","family":"L\u00f3pez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manuel","family":"N\u00fa\u00f1ez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ismael","family":"Rodr\u00edguez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","volume-title":"EATCS Monograph","author":"J.C.M. Baeten","year":"2002","unstructured":"Baeten, J.C.M., Middelburg, C.A.: Process algebra with timing. In: EATCS Monograph. Springer, Heidelberg (2002)"},{"issue":"5","key":"4_CR2","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1145\/362946.362970","volume":"12","author":"K.A. Bartlett","year":"1969","unstructured":"Bartlett, K.A., Scantlebury, R.A., Wilkinson, P.T.: A note on reliable full-duplex transmission over half-duplex links. Communications of the ACM\u00a012(5), 260\u2013261 (1969)","journal-title":"Communications of the ACM"},{"key":"4_CR3","volume-title":"Black Box Testing","author":"B. Beizer","year":"1995","unstructured":"Beizer, B.: Black Box Testing. John Wiley and Sons, Chichester (1995)"},{"issue":"1","key":"4_CR4","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/S0304-3975(01)00344-9","volume":"290","author":"M. Bravetti","year":"2003","unstructured":"Bravetti, M., Aldini, A.: Discrete time generative-reactive probabilistic processes with different advancing speeds. Theoretical Computer Science\u00a0290(1), 355\u2013406 (2003)","journal-title":"Theoretical Computer Science"},{"issue":"1-2","key":"4_CR5","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 non-deterministic processes. Journal of Logic and Algebraic Programming\u00a055(1-2), 57\u2013103 (2003)","journal-title":"Journal of Logic and Algebraic Programming"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1007\/BFb0039056","volume-title":"CONCUR \u201990","author":"I. Christoff","year":"1990","unstructured":"Christoff, I.: Testing equivalences and fully abstract models for probabilistic processes. In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol.\u00a0458, pp. 126\u2013140. Springer, Heidelberg (1990)"},{"issue":"2","key":"4_CR7","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1006\/inco.1999.2808","volume":"154","author":"R. Cleaveland","year":"1999","unstructured":"Cleaveland, R., Dayar, Z., Smolka, S.A., Yuen, S.: Testing preorders for probabilistic processes. Information and Computation\u00a0154(2), 93\u2013148 (1999)","journal-title":"Information and Computation"},{"key":"4_CR8","volume-title":"Handbook of process algebra, ch.\u00a012","author":"R. Cleaveland","year":"2001","unstructured":"Cleaveland, R., L\u00fcttgen, G., Natarajan, V.: Priority in process algebra. In: Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.) Handbook of process algebra, ch.\u00a012. North-Holland, Amsterdam (2001)"},{"key":"4_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.C.B.: Testing equivalences for processes. Theoretical Computer Science\u00a034, 83\u2013133 (1984)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"4_CR10","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.A., Steffen, B.: Reactive, generative and stratified models of probabilistic processes. Information and Computation\u00a0121(1), 59\u201380 (1995)","journal-title":"Information and Computation"},{"key":"4_CR11","volume-title":"Algebraic Theory of Processes","author":"M. Hennessy","year":"1988","unstructured":"Hennessy, M.: Algebraic Theory of Processes. MIT Press, Cambridge (1988)"},{"issue":"1","key":"4_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(91)90030-6","volume":"94","author":"K. Larsen","year":"1991","unstructured":"Larsen, K., Skou, A.: Bisimulation through probabilistic testing. Information and Computation\u00a094(1), 1\u201328 (1991)","journal-title":"Information and Computation"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-540-24611-4_3","volume-title":"Validation of Stochastic Systems","author":"N. L\u00f3pez","year":"2004","unstructured":"L\u00f3pez, N., N\u00fa\u00f1ez, M.: An overview of probabilistic process algebras and their equivalences. In: Baier, C., Haverkort, B.R., Hermanns, H., Katoen, J.-P., Siegle, M. (eds.) Validation of Stochastic Systems. LNCS, vol.\u00a02925, pp. 89\u2013123. Springer, Heidelberg (2004)"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-540-30233-9_9","volume-title":"Applying Formal Methods: Testing, Performance, and M\/E-Commerce","author":"N. L\u00f3pez","year":"2004","unstructured":"L\u00f3pez, N., N\u00fa\u00f1ez, M., Rodr\u00edguez, I.: Formal specification of symbolic-probabilistic systems. In: N\u00fa\u00f1ez, M., Maamar, Z., Pelayo, F.L., Pousttchi, K., Rubio, F. (eds.) FORTE 2004. LNCS, vol.\u00a03236, pp. 114\u2013127. Springer, Heidelberg (2004) (In Press)"},{"key":"4_CR15","volume-title":"The Art of Software Testing","author":"G.J. Myers","year":"1979","unstructured":"Myers, G.J.: The Art of Software Testing. John Wiley and Sons, Chichester (1979)"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/3-540-55179-4_36","volume-title":"Computer Aided Verification","author":"X. Nicollin","year":"1991","unstructured":"Nicollin, X., Sifakis, J.: An overview and synthesis on timed process algebras. In: Larsen, K.G., Skou, A. (eds.) CAV 1991. LNCS, vol.\u00a0575, pp. 376\u2013398. Springer, Heidelberg (1991)"},{"issue":"1-2","key":"4_CR17","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/S1567-8326(02)00069-3","volume":"56","author":"M. N\u00fa\u00f1ez","year":"2003","unstructured":"N\u00fa\u00f1ez, M.: Algebraic theory of probabilistic processes. Journal of Logic and Algebraic Programming\u00a056(1-2), 117\u2013177 (2003)","journal-title":"Journal of Logic and Algebraic Programming"},{"key":"4_CR18","first-page":"365","volume-title":"Formal Description Techniques VIII","author":"M. N\u00fa\u00f1ez","year":"1995","unstructured":"N\u00fa\u00f1ez, M., de Frutos, D.: Testing semantics for probabilistic LOTOS. In: Formal Description Techniques VIII, pp. 365\u2013380. Chapman and Hall, Boca Raton (1995)"},{"key":"4_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-540-39979-7_22","volume-title":"Formal Techniques for Networked and Distributed Systems - FORTE 2003","author":"M. N\u00fa\u00f1ez","year":"2003","unstructured":"N\u00fa\u00f1ez, M., Rodr\u00edguez, I.: Towards testing stochastic timed systems. In: K\u00f6nig, H., Heiner, M., Wolisz, A. (eds.) FORTE 2003. LNCS, vol.\u00a02767, pp. 335\u2013350. Springer, Heidelberg (2003)"},{"key":"4_CR20","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0304-3975(88)90030-8","volume":"58","author":"G.M. Reed","year":"1988","unstructured":"Reed, G.M., Roscoe, A.W.: A timed model for communicating sequential processes. Theoretical Computer Science\u00a058, 249\u2013261 (1988)","journal-title":"Theoretical Computer Science"},{"key":"4_CR21","unstructured":"Rodr\u00edguez, I.: Especificaci\u00f3n de sistemas concurrentes usando conceptos de teor\u00eda econ\u00f3mica: Sintaxis, sem\u00e1ntica, aplicaciones y extensiones del lenguaje formal PAMR. PhD thesis, Universidad Complutense de Madrid (2004)"},{"key":"4_CR22","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)"},{"key":"4_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/3-540-45061-0_38","volume-title":"Automata, Languages and Programming","author":"M. Stoelinga","year":"2003","unstructured":"Stoelinga, M., Vaandrager, F.: A testing scenario for probabilistic automata. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 464\u2013477. Springer, Heidelberg (2003)"},{"issue":"3","key":"4_CR24","first-page":"103","volume":"17","author":"J. Tretmans","year":"1996","unstructured":"Tretmans, J.: Test generation with inputs, outputs and repetitive quiescence. Software \u2013 Concepts and Tools\u00a017(3), 103\u2013120 (1996)","journal-title":"Software \u2013 Concepts and Tools"},{"key":"4_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/3-540-48320-9_6","volume-title":"CONCUR\u201999. Concurrency Theory","author":"J. Tretmans","year":"1999","unstructured":"Tretmans, J.: Testing concurrent systems: A formal approach. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol.\u00a01664, pp. 46\u201365. Springer, Heidelberg (1999)"},{"key":"4_CR26","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/B978-0-444-89874-6.50010-6","volume-title":"Protocol Specification, Testing and Verification XII","author":"W. Yi","year":"1992","unstructured":"Yi, W., Larsen, K.G.: Testing probabilistic and nondeterministic processes. In: Protocol Specification, Testing and Verification XII, pp. 47\u201361. North-Holland, Amsterdam (1992)"}],"container-title":["Lecture Notes in Computer Science","Formal Approaches to Software Testing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31848-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T06:35:33Z","timestamp":1552631733000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31848-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540251095","9783540318484"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31848-4_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}