{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:35:31Z","timestamp":1761597331171},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540616047"},{"type":"electronic","value":"9783540706250"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61604-7_62","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:03:09Z","timestamp":1330293789000},"page":"299-314","source":"Crossref","is-referenced-by-count":38,"title":["Testing probabilistic automata"],"prefix":"10.1007","author":[{"given":"Roberto","family":"Segala","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"S. Aggarwal. Time optimal self-stabilizing spanning tree algorithms. Technical Report MIT\/LCS\/TR-632, MIT Laboratory for Computer Science, 1994. Master's thesis.","DOI":"10.1007\/3-540-57529-4_72"},{"issue":"3","key":"19_CR2","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/828.833","volume":"31","author":"S.D. Brookes","year":"1984","unstructured":"S.D. Brookes, C.A.R. Hoare, and A.W. Roscoe. A theory of communicating sequential processes. Journal of the ACM, 31(3):560\u2013599, 1984.","journal-title":"Journal of the ACM"},{"key":"19_CR3","doi-asserted-by":"crossref","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":"19_CR4","unstructured":"H. Hansson. Time and Probability in Formal Design of Distributed Systems, volume 1 of Real-Time Safety Critical Systems. Elsevier, 1994."},{"key":"19_CR5","volume-title":"Algebraic Theory of Processes","author":"M. Hennessy","year":"1988","unstructured":"M. Hennessy. Algebraic Theory of Processes. MIT Press, Cambridge, MA, 1988."},{"key":"19_CR6","volume-title":"Communicating Sequential Processes","author":"C.A.R. Hoare","year":"1985","unstructured":"C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall International, Englewood Cliffs, 1985."},{"key":"19_CR7","first-page":"418","volume":"863","author":"B. Jonsson","year":"1994","unstructured":"B. Jonsson, C. Ho-Stuart, and W. Yi. Testing and refinement for nondeterministic and probabilistic processes. In Proceedings of the Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems, LNCS 863, pages 418\u2013430, 1994.","journal-title":"LNCS"},{"key":"19_CR8","volume-title":"Compositional testing preorders for probabilistic processes","author":"B. Jonsson","year":"1995","unstructured":"B. Jonsson and W. Yi. Compositional testing preorders for probabilistic processes. In Proceedings 10 th Annual Symposium on Logic in Computer Science, San Diego, California. IEEE Computer Society Press, 1995."},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"N.A. Lynch, I. Saias, and R. Segala. Proving time bounds for randomized distributed algorithms. In Proceedings of the 13 th Annual ACM Symposium on Principles of Distributed Computing, Los Angeles, CA, pages 314\u201323, 1994.","DOI":"10.1145\/197917.198117"},{"key":"19_CR10","unstructured":"G.D. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Computer science Department, Aarhus University, 1981."},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"A. Pogosyants and R. Segala. Formal verification of timed properties of randomized distributed algorithms. In Proceedings of the 14 th Annual ACM Symposium on Principles of Distributed Computing, Ottawa, Ontario, Canada, pages 174\u2013283, August 1995.","DOI":"10.1145\/224964.224984"},{"key":"19_CR12","first-page":"234","volume":"962","author":"R. Segala","year":"1995","unstructured":"R. Segala. A compositional trace-based semantics for probabilistic automata. In Proceedings of CONCUR 95, Philadelphia, PA, USA, LNCS 962, pages 234\u2013248, 1995.","journal-title":"LNCS"},{"key":"19_CR13","unstructured":"R. Segala. Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, MIT, Dept. of Electrical Engineering and Computer Science, 1995."},{"issue":"2","key":"19_CR14","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"}],"container-title":["Lecture Notes in Computer Science","CONCUR '96: Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61604-7_62.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:08:31Z","timestamp":1605647311000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61604-7_62"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540616047","9783540706250"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-61604-7_62","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}