{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T07:12:03Z","timestamp":1774681923766,"version":"3.50.1"},"reference-count":35,"publisher":"Association for Computing Machinery (ACM)","issue":"6","license":[{"start":{"date-parts":[[2007,12,1]],"date-time":"2007-12-01T00:00:00Z","timestamp":1196467200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["J. ACM"],"published-print":{"date-parts":[[2007,12]]},"abstract":"<jats:p>\n            We introduce a notion of finite testing, based on statistical hypothesis tests, via a variant of the well-known trace machine. Under this scenario, two processes are deemed observationally equivalent if they cannot be distinguished by any finite test. We consider processes modeled as image finite probabilistic automata and prove that our notion of observational equivalence coincides with the trace distribution equivalence proposed by Segala. Along the way, we give an explicit characterization of the set of probabilistic generalize the\n            <jats:italic>Approximation Induction Principle<\/jats:italic>\n            by defining an also prove limit and convex closure properties of trace distributions in an appropriate metric space.\n          <\/jats:p>","DOI":"10.1145\/1314690.1314693","type":"journal-article","created":{"date-parts":[[2007,12,7]],"date-time":"2007-12-07T19:19:01Z","timestamp":1197055141000},"page":"29","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":37,"title":["A testing scenario for probabilistic processes"],"prefix":"10.1145","volume":"54","author":[{"given":"Ling","family":"Cheung","sequence":"first","affiliation":[{"name":"Radboud University Nijmegen, Nijmegen, The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mari\u00eblle","family":"Stoelinga","sequence":"additional","affiliation":[{"name":"University of Twente, Enschede, The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frits","family":"Vaandrager","sequence":"additional","affiliation":[{"name":"Radboud University Nijmegen, Nijmegen, The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2007,12]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"Aggarwal S. 1994. Time optimal self-stabilizing spanning tree algorithms. M.S. dissertation. Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology. (Available as Technical Report MIT\/LCS\/TR-632).   Aggarwal S. 1994. Time optimal self-stabilizing spanning tree algorithms. M.S. dissertation. Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology. (Available as Technical Report MIT\/LCS\/TR-632)."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(87)90052-1"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004460050046"},{"key":"e_1_2_1_4_1","volume-title":"Mathematical Methods of Specification and Synthesis of Software Systems '85","volume":"31","author":"Bergstra J."},{"key":"e_1_2_1_5_1","unstructured":"Casella G. and Berger R. 1990. Statistical Inference. Duxbury Press Belmont UK.  Casella G. and Berger R. 1990. Statistical Inference. Duxbury Press Belmont UK."},{"key":"e_1_2_1_6_1","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings of CONCUR 90","author":"Christoff I."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1999.2808"},{"key":"e_1_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Cohn D. 1980. Measure Theory. Birkh\u00e4user Boston MA.  Cohn D. 1980. Measure Theory. Birkh\u00e4user Boston MA.","DOI":"10.1007\/978-1-4899-0399-0"},{"key":"e_1_2_1_9_1","unstructured":"Davey B. and Priestley H. 1990. Introduction to Lattices and Order. Cambridge University Press Cambridge UK.  Davey B. and Priestley H. 1990. Introduction to Lattices and Order. Cambridge University Press Cambridge UK."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(84)90113-0"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2007.15"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2007.02.013"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2001.2962"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/788017.788770"},{"key":"e_1_2_1_15_1","volume-title":"Handbook of Process Algebra","author":"Van Glabbeek R."},{"key":"e_1_2_1_16_1","volume-title":"Proceedings ProbMIV 98","volume":"22","author":"Gregorio-Rodr\u00edgez C."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00044-5"},{"key":"e_1_2_1_18_1","unstructured":"Kolmogorov A. and Fomin S. 1970. Introductory Real Analysis. Dover Publications Inc. New York.  Kolmogorov A. and Fomin S. 1970. Introductory Real Analysis. Dover Publications Inc. New York."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(91)90030-6"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/197917.198117"},{"key":"e_1_2_1_21_1","volume-title":"Lecture Notes in Computer Science","volume":"92","author":"Milner R.","year":"1980"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00008917"},{"key":"e_1_2_1_23_1","unstructured":"Rudin W. 1987. Real and Complex Analysis. McGraw-Hill Inc. Boston MA.   Rudin W. 1987. Real and Complex Analysis. McGraw-Hill Inc. Boston MA."},{"key":"e_1_2_1_24_1","unstructured":"Segala R. 1995. Modeling and verification of randomized distributed real-time systems. Ph.D. dissertation Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology. (Available as Technical Report MIT\/LCS\/TR-676.)   Segala R. 1995. Modeling and verification of randomized distributed real-time systems. Ph.D. dissertation Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology. (Available as Technical Report MIT\/LCS\/TR-676.)"},{"key":"e_1_2_1_25_1","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings of CONCUR 96","author":"Segala R."},{"key":"e_1_2_1_26_1","first-page":"250","article-title":"Probabilistic simulations for probabilistic processes","volume":"2","author":"Segala R.","year":"1995","journal-title":"Nor. J. Comput."},{"key":"e_1_2_1_27_1","volume-title":"Computer-Aided Verification. Lecture Notes in Computer Science","volume":"3114","author":"Sen K."},{"key":"e_1_2_1_28_1","first-page":"176","article-title":"An introduction to probabilistic automata","volume":"78","author":"Stoelinga M.","year":"2002","journal-title":"Bull. Europ. Assoc. Theoret. Comput. Sci."},{"key":"e_1_2_1_29_1","volume-title":"Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems, J.-P. Katoen, Ed. Lecture Notes in Computer Science","volume":"1601","author":"Stoelinga M."},{"key":"e_1_2_1_30_1","volume-title":"Proceedings of the 30th ICALP. Lecture Notes in Computer Science","volume":"2719","author":"Stoelinga M."},{"key":"e_1_2_1_31_1","unstructured":"Trivedi K. 2002. Probability and Statistics with Reliability Queuing and Computer Science Applications. Wiley New York.   Trivedi K. 2002. Probability and Statistics with Reliability Queuing and Computer Science Applications. Wiley New York."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380872"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/11513988_25"},{"key":"e_1_2_1_34_1","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems. Lecutre Notes in Computer Science","volume":"2988","author":"Younes H."},{"key":"e_1_2_1_35_1","volume-title":"Computer-Aided Verification. Lecture Notes in Computer Science","volume":"2404","author":"Younes H."}],"container-title":["Journal of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1314690.1314693","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1314690.1314693","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:56:11Z","timestamp":1750254971000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1314690.1314693"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,12]]},"references-count":35,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2007,12]]}},"alternative-id":["10.1145\/1314690.1314693"],"URL":"https:\/\/doi.org\/10.1145\/1314690.1314693","relation":{},"ISSN":["0004-5411","1557-735X"],"issn-type":[{"value":"0004-5411","type":"print"},{"value":"1557-735X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,12]]},"assertion":[{"value":"2007-12-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}