{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:49:03Z","timestamp":1762458543439},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540404934"},{"type":"electronic","value":"9783540450610"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45061-0_38","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T11:54:04Z","timestamp":1184586844000},"page":"464-477","source":"Crossref","is-referenced-by-count":20,"title":["A Testing Scenario for Probabilistic Automata"],"prefix":"10.1007","author":[{"given":"Mari\u00eblle","family":"Stoelinga","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frits","family":"Vaandrager","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,18]]},"reference":[{"issue":"1\/2","key":"38_CR1","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0304-3975(87)90052-1","volume":"51","author":"J.C.M. Baeten","year":"1987","unstructured":"J.C.M. Baeten, J.A. Bergstra, and J.W. Klop. On the consistency of Koomen\u2019s fair abstraction rule. Theoretical Computer Science, 51(1\/2):129\u2013176, 1987.","journal-title":"Theoretical Computer Science"},{"key":"38_CR2","doi-asserted-by":"crossref","unstructured":"J.A. Bergstra and J.W. Klop. Verification of an alternating bit protocol by means of process algebra. In W. Bibel and K.P. Jantke, editors, Math. Methods of Spec. and Synthesis of Software Systems\u2019 85, Math. Research 31, pages 9\u201323, Berlin, 1986. Akademie-Verlag.","DOI":"10.1007\/3-540-16444-8_1"},{"issue":"2","key":"38_CR3","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1006\/inco.1999.2808","volume":"154","author":"R. Cleaveland","year":"1999","unstructured":"R. Cleaveland, Z. Dayar, S. A. Smolka, and S. Yuen. Testing preorders for probabilistic processes. Information and Computation, 154(2):93\u2013148, 1999.","journal-title":"Information and Computation"},{"key":"38_CR4","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings CONCUR 90","author":"I. Christoff","year":"1990","unstructured":"I. Christoff. Testing equivalence and fully abstract models of probabilistic processes. In J.C.M. Baeten and J.W. Klop, editors, Proceedings CONCUR 90, Amsterdam, volume 458 of Lecture Notes in Computer Science. Springer-Verlag, 1990."},{"key":"38_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4899-0399-0","volume-title":"Measure Theory","author":"D.L. Cohn","year":"1980","unstructured":"D.L. Cohn. Measure Theory. Birkh\u00e4user, Boston, 1980."},{"key":"38_CR6","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"34","author":"R. Nicola De","year":"1984","unstructured":"R. De Nicola and M. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34:83\u2013133, 1984.","journal-title":"Theoretical Computer Science"},{"key":"38_CR7","unstructured":"R.J. van Glabbeek. The linear time \u2014 branching time spectrum I. The semantics of concrete, sequential processes. In J.A. Bergstra, A. Ponse, and S.A. Smolka, editors, Handbook of Process Algebra, pages 3\u201399. North-Holland, 2001."},{"key":"38_CR8","doi-asserted-by":"crossref","unstructured":"C. Gregorio-Rodr\u00edgez and M. N\u00fa\u00f1ez. Denotational semantics for probabilistic refusal testing. In M. Huth and M.Z. Kwiatkowska, editors, Proc. ProbMIV\u201998, volume 22 of Electronic Notes in Theoretical Computer Science, 1998.","DOI":"10.1016\/S1571-0661(05)80599-7"},{"key":"38_CR9","unstructured":"B. Jonsson and W. Yi. Compositional testing preorders for probabilistic processes. Theoretical Computer Science, 2001."},{"key":"38_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(91)90030-6","volume":"94","author":"K.G. Larsen","year":"1991","unstructured":"K.G. Larsen and A. Skou. Bisimulation through probabilistic testing. Information and Computation, 94:1\u201328, 1991.","journal-title":"Information and Computation"},{"key":"38_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-10235-3","volume-title":"A Calculus of Communicating Systems","author":"R. Milner","year":"1980","unstructured":"R. Milner. A Calculus of Communicating Systems, volume 92 of Lecture Notes in Computer Science. Springer-Verlag, 1980."},{"key":"38_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1007\/3-540-60218-6_17","volume-title":"Proc. CONCUR\u201995","author":"R. Segala","year":"1995","unstructured":"R. Segala. Compositional trace-based semantics for probabilistic automata. In Proc. CONCUR\u201995, volume 962 of Lecture Notes in Computer Science, pages 234\u2013248, 1995."},{"key":"38_CR13","unstructured":"R. Segala. Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, June 1995. Available as Technical Report MIT\/LCS\/TR-676."},{"key":"38_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/3-540-61604-7_62","volume-title":"Proc. CONCUR\u201996","author":"R. Segala","year":"1996","unstructured":"R. Segala. Testing probabilistic automata. In Proc. CONCUR\u201996, volume 1119 of Lecture Notes in Computer Science, pages 299\u2013314, 1996."},{"issue":"2","key":"38_CR15","first-page":"250","volume":"2","author":"R. Segala","year":"1995","unstructured":"R. Segala and N.A. Lynch. Probabilistic simulations for probabilistic processes. Nordic Journal of Computing, 2(2):250\u2013273, 1995.","journal-title":"Nordic Journal of Computing"},{"key":"38_CR16","volume-title":"Alea jacta est: verification of probabilistic, real-time and parametric systems","author":"M.I.A. Stoelinga","year":"2002","unstructured":"M.I.A. Stoelinga. Alea jacta est: verification of probabilistic, real-time and parametric systems. PhD thesis, University of Nijmegen, the Netherlands, April 2002. Available via http:\/\/www.soe.ucsc.edu\/~marielle."},{"key":"38_CR17","unstructured":"M.I.A. Stoelinga. An introduction to probabilistic automata. In G. Rozenberg, editor, EATCS bulletin, volume 78, pages 176\u2013198, 2002."},{"key":"38_CR18","doi-asserted-by":"crossref","unstructured":"M.I.A. Stoelinga and F.W. Vaandrager. A testing scenario for probabilistic automata. Technical Report NIII-R0307, Nijmegen Institute for Computing and Information Sciences, University of Nijmegen, 2003. Available via http:\/\/www.soe.ucsc.edu\/~marielle.","DOI":"10.1007\/3-540-45061-0_38"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45061-0_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T23:14:07Z","timestamp":1556666047000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45061-0_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540404934","9783540450610"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-45061-0_38","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}