{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:30:37Z","timestamp":1761597037986},"reference-count":35,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[2007,6,1]],"date-time":"2007-06-01T00:00:00Z","timestamp":1180656000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":2250,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2007,6]]},"DOI":"10.1016\/j.entcs.2006.11.040","type":"journal-article","created":{"date-parts":[[2007,6,8]],"date-time":"2007-06-08T16:54:36Z","timestamp":1181321676000},"page":"71-93","source":"Crossref","is-referenced-by-count":8,"title":["Proving Approximate Implementations for Probabilistic I\/O Automata"],"prefix":"10.1016","volume":"174","author":[{"given":"Sayan","family":"Mitra","sequence":"first","affiliation":[]},{"given":"Nancy","family":"Lynch","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.entcs.2006.11.040_bib001","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","article-title":"A theory of timed automata","volume":"126","author":"Alur","year":"1994","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/j.entcs.2006.11.040_bib002","series-title":"Proceedings of the Eighth International Conference on Computer Aided Verification","first-page":"50","article-title":"Polynomial-time algorithms for testing probabilistic bisimulation and simulation","volume":"volume 1102","author":"Baier","year":"1996"},{"key":"10.1016\/j.entcs.2006.11.040_bib003","doi-asserted-by":"crossref","unstructured":"M. Ben-Or. Another advantage of free choice: Completely asynchronous agreement protocols. In PODC, pages 27\u201330, Montreal, Canada, August 1983","DOI":"10.1145\/800221.806707"},{"key":"10.1016\/j.entcs.2006.11.040_bib004","doi-asserted-by":"crossref","unstructured":"M.L. Bujorianu, J. Lygeros, and M.C. Bujorianu. Bisimulation for general stochastic hybrid systems. In Morari and Thiele [25], pages 198\u2013214","DOI":"10.1007\/978-3-540-31954-2_13"},{"key":"10.1016\/j.entcs.2006.11.040_bib005","unstructured":"R. Canetti, L. Cheung, D. Kaynar, M. Liskov, N. Lynch, O. Pereira, and R. Segala. Task-structured probabilistic I\/O automata. Technical Report MIT-CSAIL-TR-2006-060, Massachusetts Institute of Technology, Cambridge, MA, September 2006"},{"key":"10.1016\/j.entcs.2006.11.040_bib006","unstructured":"R. Canetti, L. Cheung, D. Kaynar, M. Liskov, N. Lynch, O. Pereira, and R. Segala. Using task-structured probabilistic I\/O automata to analyze an oblivious transfer protocol. Technical Report MIT-CSAIL-TR-2006-019, Massachusetts Institute of Technology, Cambridge, MA, March 2006. Available from http:\/\/theory.csail.mit.edu\/tds\/papers\/Kirli\/TR-2006-019.pdf"},{"key":"10.1016\/j.entcs.2006.11.040_bib007","unstructured":"L. Cheung. Reconciling nondeterministic and probabilistic choices. PhD thesis, ICIS, Radboud University Nijmegen, The Netherlands, 2006"},{"issue":"1","key":"10.1016\/j.entcs.2006.11.040_bib008","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/S0890-5401(03)00051-8","article-title":"Approximating labelled markov processes","volume":"184","author":"Desharnais","year":"2003","journal-title":"Inf. Comput."},{"issue":"3","key":"10.1016\/j.entcs.2006.11.040_bib009","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/j.tcs.2003.09.013","article-title":"Metrics for labelled markov processes","volume":"318","author":"Desharnais","year":"2004","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.entcs.2006.11.040_bib010","series-title":"Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science","first-page":"413","article-title":"The metric analogue of weak bisimulation for probabilistic processes","author":"Desharnais","year":"2002"},{"key":"10.1016\/j.entcs.2006.11.040_bib011","article-title":"Probabilities and Metrics:Convergence of laws on metric spaces, with a view to statistical testing","volume":"Number 45","author":"Dudley","year":"1976"},{"key":"10.1016\/j.entcs.2006.11.040_bib012","doi-asserted-by":"crossref","unstructured":"A. Girard, A.A. Julius, and G.J. Pappas. Approximate simulation relations for hybrid systems. In IFAC Analysis and Design of Hybrid Systems, Alghero, Italy, June 2006","DOI":"10.3182\/20060607-3-IT-3902.00022"},{"key":"10.1016\/j.entcs.2006.11.040_bib013","unstructured":"A. Girard and G.J. Pappas. Approximation metrics for discrete and continuous systems. In IEEE Transactions on Automatic Control, 2005"},{"key":"10.1016\/j.entcs.2006.11.040_bib014","series-title":"MobiHoc '04: Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing","first-page":"163","article-title":"Towards mobility as a network control primitive","author":"Goldenberg","year":"2004"},{"key":"10.1016\/j.entcs.2006.11.040_bib015","doi-asserted-by":"crossref","unstructured":"V. Gupta, R. Jagadeesan, and P. Panangaden. Approximate reasoning for real-time probabilistic processes. The Quantitative Evaluation of Systems, First International Conference on (QEST'04), 00:304\u2013313, 2004","DOI":"10.1109\/QEST.2004.1348044"},{"key":"10.1016\/j.entcs.2006.11.040_bib016","series-title":"CONCUR 90","article-title":"Equivalences, congruences and complete approximations for probabilistic processes","volume":"number 458","author":"Jou","year":"1990"},{"key":"10.1016\/j.entcs.2006.11.040_bib017","doi-asserted-by":"crossref","unstructured":"D.K. Kaynar, N. Lynch, R. Segala, and F. Vaandrager. The Theory of Timed I\/O Automata. Synthesis Lectures on Computer Science. Morgan Claypool, November 2005. Also available as Technical Report MIT-LCS-TR-917","DOI":"10.1007\/978-3-031-01794-0"},{"key":"10.1016\/j.entcs.2006.11.040_bib018","series-title":"MFCS '96: Proceedings of the 21st International Symposium on Mathematical Foundations of Computer Science","first-page":"419","article-title":"Probabilistic metric semantics for a simple language with recursion","author":"Kwiatkowska","year":"1996"},{"issue":"1","key":"10.1016\/j.entcs.2006.11.040_bib019","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(91)90030-6","article-title":"Bisimulation through probabilistic testing","volume":"94","author":"Larsen","year":"1991","journal-title":"Inf. Comput."},{"key":"10.1016\/j.entcs.2006.11.040_bib020","series-title":"CCS '98: Proceedings of the 5th ACM conference on Computer and communications security","first-page":"112","article-title":"A probabilistic poly-time framework for protocol analysis","author":"Lincoln","year":"1998"},{"key":"10.1016\/j.entcs.2006.11.040_bib021","series-title":"Proceedings of FOSSACS 04","article-title":"Duality for labelled markov processes","volume":"volume 2987","author":"Mislove","year":"2004"},{"key":"10.1016\/j.entcs.2006.11.040_bib022","article-title":"Axioms for probability and nondeterminism","author":"Mislove","year":"2004","journal-title":"ENTCS"},{"key":"10.1016\/j.entcs.2006.11.040_bib023","unstructured":"S. Mitra and N. Lynch. Approximate simulations for task-structured probabilistic I\/O automata. In LICS workshop on Probabilistic Automata and Logics (PAul06), Seattle, WA, August 2006"},{"key":"10.1016\/j.entcs.2006.11.040_bib024","unstructured":"S. Mitra and N. Lynch. Probabilistic timed I\/O automata, October 2006. Submitted for review"},{"key":"10.1016\/j.entcs.2006.11.040_bib025","series-title":"Hybrid Systems: Computation and Control, 8th International Workshop, HSCC 2005, Zurich, Switzerland, March 9-11, 2005, Proceedings","volume":"volume 3414","year":"2005"},{"key":"10.1016\/j.entcs.2006.11.040_bib026","series-title":"Probability metrics and the stability of stochastic models","author":"Rachev","year":"1991"},{"key":"10.1016\/j.entcs.2006.11.040_bib027","unstructured":"R. Segala. Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, Laboratory for Computer Science, Massachusetts Institute of Technology, June 1995"},{"key":"10.1016\/j.entcs.2006.11.040_bib028","doi-asserted-by":"crossref","unstructured":"S. Strubbe and A.J. van der Schaft. Bisimulation for communicating piecewise deterministic markov processes (cpdps). In Morari and Thiele [25], pages 623\u2013639","DOI":"10.1007\/978-3-540-31954-2_40"},{"key":"10.1016\/j.entcs.2006.11.040_bib029","doi-asserted-by":"crossref","unstructured":"P. Tabuada, G.J. Pappas, and P.U. Lima. Composing abstractions of hybrid systems. In Tomlin and Greenstreet [31], pages 436\u2013450","DOI":"10.1007\/3-540-45873-5_34"},{"key":"10.1016\/j.entcs.2006.11.040_bib030","doi-asserted-by":"crossref","unstructured":"A. Tiwari and G. Khanna. Series of abstractions for hybrid automata. In Tomlin and Greenstreet [31], pages 465\u2013478","DOI":"10.1007\/3-540-45873-5_36"},{"key":"10.1016\/j.entcs.2006.11.040_bib031","series-title":"Hybrid Systems: Computation and Control, 5th International Workshop, HSCC 2002, Stanford, CA, USA, March 25-27, 2002, Proceedings","volume":"volume 2289","year":"2002"},{"key":"10.1016\/j.entcs.2006.11.040_bib032","series-title":"Proceedings of FOSSACS 03","article-title":"An intrinsic characterization of approximate probabilistic bisimilarity","author":"van Breugel","year":"2003"},{"key":"10.1016\/j.entcs.2006.11.040_bib033","doi-asserted-by":"crossref","DOI":"10.1016\/j.tcs.2004.10.021","article-title":"Domain theory, testing and simulation for labelled markov processes","author":"van Breugel","year":"2005","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/j.entcs.2006.11.040_bib034","series-title":"CONCUR '01: Proceedings of the 12th International Conference on Concurrency Theory","first-page":"336","article-title":"An algorithm for quantitative verification of probabilistic transition systems","author":"van Breugel","year":"2001"},{"key":"10.1016\/j.entcs.2006.11.040_bib035","series-title":"ICALP '01: Proceedings of the 28th International Colloquium on Automata, Languages and Programming","first-page":"421","article-title":"Towards quantitative verification of probabilistic transition systems","author":"van Breugel","year":"2001"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157106610700343X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157106610700343X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T08:34:57Z","timestamp":1683880497000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S157106610700343X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6]]},"references-count":35,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2007,6]]}},"alternative-id":["S157106610700343X"],"URL":"https:\/\/doi.org\/10.1016\/j.entcs.2006.11.040","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2007,6]]}}}