{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T10:08:15Z","timestamp":1761905295598,"version":"build-2065373602"},"reference-count":51,"publisher":"Open Publishing Association","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. Proc. Theor. Comput. Sci.","EPTCS"],"DOI":"10.4204\/eptcs.433.4","type":"journal-article","created":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T11:01:24Z","timestamp":1761562884000},"page":"23-45","source":"Crossref","is-referenced-by-count":0,"title":["An Adequacy Theorem Between Mixed Powerdomains and Probabilistic Concurrency"],"prefix":"10.4204","volume":"433","author":[{"given":"Renato","family":"Neves","sequence":"first","affiliation":[{"name":"University of Minho and INESC-TEC"}]}],"member":"2720","published-online":{"date-parts":[[2025,10,28]]},"reference":[{"volume-title":"Abstract and Concrete Categories - The Joy of Cats","year":"2009","author":"Ad\u00e1mek","key":"adamek09"},{"issue":"4","key":"apt86","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1145\/6490.6494","article-title":"Countable nondeterminism and random assignment","volume":"33","author":"Apt","year":"1986","journal-title":"J. ACM"},{"issue":"6","key":"baier00","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1017\/S0960129599002984","article-title":"Domain equations for probabilistic processes","volume":"10","author":"Baier","year":"2000","journal-title":"Math. Struct. Comput. Sci."},{"key":"brookes96","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1109\/LICS.1996.561315","article-title":"The Essence of Parallel Algol","volume-title":"Proceedings, 11th Annual IEEE Symposium on Logic in Computer Science, New Brunswick, New Jersey, USA, July 27-30, 1996","author":"Brookes","year":"1996"},{"key":"deng15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-45198-4","volume-title":"Semantics of Probabilistic Processes: An Operational Approach","author":"Deng","year":"2015"},{"key":"escardo04","series-title":"Electronic Notes in Theoretical Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/J.ENTCS.2004.09.017","article-title":"Synthetic Topology: of Data Types and Classical Spaces","volume-title":"Proceedings of the Workshop on Domain Theoretic Methods for Probabilistic Processes, DTMPP 2003, Barbados, April 21-25, 2003","volume":"87","author":"Escard\u00f3","year":"2003"},{"key":"escardo09","series-title":"Electronic Notes in Theoretical Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/J.ENTCS.2009.07.092","article-title":"Semi-decidability of May, Must and Probabilistic Testing in a Higher-type Setting","volume-title":"Proceedings of the 25th Conference on Mathematical Foundations of Programming Semantics, MFPS 2009, Oxford, UK, April 3-7, 2009","volume":"249","author":"Escard\u00f3","year":"2009"},{"key":"feng11","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1145\/1926385.1926446","article-title":"Bisimulation for quantum processes","volume-title":"Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2011, Austin, TX, USA, January 26-28, 2011","author":"Feng","year":"2011"},{"key":"feng23","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1145\/3582016.3582039","article-title":"Verification of Nondeterministic Quantum Programs","volume-title":"Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 3, ASPLOS 2023, Vancouver, BC, Canada, March 25-29, 2023","author":"Feng","year":"2023"},{"key":"feng23b","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.2311.14215","article-title":"Refinement calculus of quantum programs with projective assertions","volume":"abs\/2311.14215","author":"Feng","year":"2023","journal-title":"CoRR"},{"key":"franchella97","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF00376449","article-title":"On the origins of D\u00e9nes K\u00f6nig's infinity lemma","volume":"51","author":"Franchella","year":"1997","journal-title":"Archive for history of exact sciences"},{"key":"fu24","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.2402.15827","article-title":"Algorithmic Analysis of Termination Problems for Nondeterministic Quantum Programs","volume":"abs\/2402.15827","author":"Fu","year":"2024","journal-title":"CoRR"},{"key":"gierz03","series-title":"Encyclopedia of Mathematics and its Applications","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511542725","volume-title":"Continuous lattices and domains","author":"Gierz","year":"2003"},{"key":"goncharov16","series-title":"Electronic Notes in Theoretical Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/J.ENTCS.2016.09.036","article-title":"Complete Elgot Monads and Coalgebraic Resumptions","volume-title":"The Thirty-second Conference on the Mathematical Foundations of Programming Semantics, MFPS 2016, Carnegie Mellon University, Pittsburgh, PA, USA, May 23-26, 2016","volume":"325","author":"Goncharov","year":"2016"},{"key":"larrecq13","series-title":"New Mathematical Monographs","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139524438","volume-title":"Non-Hausdorff Topology and Domain Theory - Selected Topics in Point-Set Topology","volume":"22","author":"Goubault-Larrecq","year":"2013"},{"issue":"1","key":"gobault15","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/J.JLAMP.2014.09.003","article-title":"Full abstraction for non-deterministic and probabilistic extensions of PCF I: The angelic cases","volume":"84","author":"Goubault-Larrecq","year":"2015","journal-title":"J. Log. Algebraic Methods Program."},{"key":"larrecq19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/LICS.2019.8785809","article-title":"A Probabilistic and Non-Deterministic Call-by-Push-Value Language","volume-title":"34th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2019, Vancouver, BC, Canada, June 24-27, 2019","author":"Goubault-Larrecq","year":"2019"},{"key":"goubault20","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.2007.04189","article-title":"Probabilistic Powerdomains and Quasi-Continuous Domains","volume":"abs\/2007.04189","author":"Goubault-Larrecq","year":"2020","journal-title":"CoRR"},{"issue":"3","key":"hart83","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1145\/2166.357214","article-title":"Termination of Probabilistic Concurrent Program","volume":"5","author":"Hart","year":"1983","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"hennessy79","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/3-540-09526-8_8","article-title":"Full Abstraction for a Simple Parallel Programming Language","volume-title":"Mathematical Foundations of Computer Science 1979, Proceedings, 8th Symposium, Olomouc, Czechoslovakia, September 3-7, 1979","volume":"74","author":"Hennessy","year":"1979"},{"key":"jones89","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1109\/LICS.1989.39173","article-title":"A Probabilistic Powerdomain of Evaluations","volume-title":"Proceedings of the Fourth Annual Symposium on Logic in Computer Science (LICS '89), Pacific Grove, California, USA, June 5-8, 1989","author":"Jones","year":"1989"},{"issue":"3","key":"keimel09","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1017\/S0960129509007555","article-title":"Predicate transformers for extended probability and non-determinism","volume":"19","author":"Keimel","year":"2009","journal-title":"Math. Struct. Comput. Sci."},{"issue":"25","key":"keimel11","doi-asserted-by":"publisher","first-page":"2701","DOI":"10.1016\/J.TCS.2010.12.029","article-title":"Relating direct and predicate transformer partial correctness semantics for an imperative probabilistic-nondeterministic language","volume":"412","author":"Keimel","year":"2011","journal-title":"Theor. Comput. Sci."},{"key":"lengal17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/978-3-662-54577-5_29","article-title":"Fair Termination for Parameterized Probabilistic Concurrent Systems","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems - 23rd International Conference, TACAS 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22-29, 2017, Proceedings, Part I","volume":"10205","author":"Leng\u00e1l","year":"2017"},{"key":"majumdar24","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.2404.19724","article-title":"Sound and Complete Proof Rules for Probabilistic Termination","volume":"abs\/2404.19724","author":"Majumdar","year":"2024","journal-title":"CoRR"},{"key":"mciver01","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1016\/S0304-3975(00)00208-5","article-title":"Partial correctness for probabilistic demonic programs","volume":"266","author":"McIver","year":"2001","journal-title":"Theor. Comput. Sci."},{"key":"mciver05","series-title":"Monographs in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/B138392","volume-title":"Abstraction, Refinement and Proof for Probabilistic Systems","author":"McIver","year":"2005"},{"key":"mciver13","series-title":"EPTCS","doi-asserted-by":"publisher","first-page":"97","DOI":"10.4204\/EPTCS.117.7","article-title":"Probabilistic Concurrent Kleene Algebra","volume-title":"Proceedings 11th International Workshop on Quantitative Aspects of Programming Languages and Systems, QAPL 2013, Rome, Italy, March 23-24, 2013","volume":"117","author":"McIver","year":"2013"},{"key":"milner75","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/S0049-237X(08)71948-7","article-title":"Processes: a mathematical model of computing agents","volume-title":"Studies in Logic and the Foundations of Mathematics","volume":"80","author":"Milner","year":"1975"},{"key":"mislove00","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/3-540-44618-4_26","article-title":"Nondeterminism and Probabilistic Choice: Obeying the Laws","volume-title":"CONCUR 2000 - Concurrency Theory, 11th International Conference, University Park, PA, USA, August 22-25, 2000, Proceedings","volume":"1877","author":"Mislove","year":"2000"},{"key":"mislove04","series-title":"Electronic Notes in Theoretical Computer Science","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/j.entcs.2004.04.019","article-title":"Axioms for Probability and Nondeterminism","volume-title":"Proceedings of the 10th International Workshop on Expressiveness in Concurrency, EXPRESS 2003, Marseille, France, September 2, 2003","volume":"96","author":"Mislove","year":"2003"},{"key":"neves24","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.2409.15920","article-title":"An adequacy theorem between mixed powerdomains and probabilistic concurrency","volume":"abs\/2409.15920","author":"Neves","year":"2024","journal-title":"CoRR"},{"key":"nielsen02","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511976667","volume-title":"Quantum Computation and Quantum Information (10th Anniversary edition)","author":"Nielsen","year":"2016"},{"key":"pirog14","series-title":"Electronic Notes in Theoretical Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/J.ENTCS.2014.10.015","article-title":"The Coinductive Resumption Monad","volume-title":"Proceedings of the 30th Conference on the Mathematical Foundations of Programming Semantics, MFPS 2014, Ithaca, NY, USA, June 12-15, 2014","volume":"308","author":"Pir\u00f3g","year":"2014"},{"key":"plotkin01","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45315-6_1","article-title":"Adequacy for Algebraic Effects","volume-title":"Foundations of Software Science and Computation Structures, 4th International Conference, FOSSACS 2001 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2001 Genova, Italy, April 2-6, 2001, Proceedings","volume":"2030","author":"Plotkin","year":"2001"},{"issue":"1","key":"plotkin03","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1023\/A:1023064908962","article-title":"Algebraic Operations and Generic Effects","volume":"11","author":"Plotkin","year":"2003","journal-title":"Appl. Categorical Struct."},{"key":"plotkin08","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1109\/LICS.2008.45","article-title":"A Logic for Algebraic Effects","volume-title":"Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, LICS 2008, 24-27 June 2008, Pittsburgh, PA, USA","author":"Plotkin","year":"2008"},{"key":"reynolds98","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511626364","volume-title":"Theories of programming languages","author":"Reynolds","year":"1998"},{"key":"smyth83","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1007\/BFB0036946","article-title":"Power Domains and Predicate Transformers: A Topological View","volume-title":"Automata, Languages and Programming, 10th Colloquium, Barcelona, Spain, July 18-22, 1983, Proceedings","volume":"154","author":"Smyth","year":"1983"},{"key":"stark96","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1109\/LICS.1996.561301","article-title":"A Fully Abstract Domain Model for the pi-Calculus","volume-title":"Proceedings, 11th Annual IEEE Symposium on Logic in Computer Science, New Brunswick, New Jersey, USA, July 27-30, 1996","author":"Stark","year":"1996"},{"key":"tix09","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.entcs.2009.01.002","article-title":"Semantic domains for combining probability and non-determinism","volume":"222","author":"Tix","year":"2009","journal-title":"Electronic Notes in Theoretical Computer Science"},{"issue":"1","key":"uustalu99","doi-asserted-by":"publisher","first-page":"5","DOI":"10.3233\/INF-1999-10102","article-title":"Primitive (Co)Recursion and Course-of-Value (Co)Iteration, Categorically","volume":"10","author":"Uustalu","year":"1999","journal-title":"Informatica"},{"key":"varacca06b","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/J.TCS.2006.01.015","article-title":"Probabilistic event structures and domains","volume":"358","author":"Varacca","year":"2006","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"varacca07","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1017\/S0960129505005074","article-title":"Distributing probability over non-determinism","volume":"16","author":"Varacca","year":"2006","journal-title":"Math. Struct. Comput. Sci."},{"key":"vickers89","series-title":"Cambridge Tracts in Theoretical Computer Science","volume-title":"Topology via logic","author":"Vickers","year":"1989"},{"key":"visme19","series-title":"LIPIcs","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.CONCUR.2019.11","article-title":"Event Structures for Mixed Choice","volume-title":"30th International Conference on Concurrency Theory, CONCUR 2019, August 27-30, 2019, Amsterdam, the Netherlands","volume":"140","author":"de Visme","year":"2019"},{"key":"watrous18","doi-asserted-by":"publisher","DOI":"10.1017\/9781316848142","volume-title":"The theory of quantum information","author":"Watrous","year":"2018"},{"key":"winskel85","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0304-3975(85)90037-4","article-title":"On Powerdomains and Modality","volume":"36","author":"Winskel","year":"1985","journal-title":"Theor. Comput. Sci."},{"key":"winskel93","series-title":"Foundations of Computing","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/3054.001.0001","volume-title":"The formal semantics of programming languages: an introduction","author":"Winskel","year":"1993"},{"key":"ying18","article-title":"Reasoning about Parallel Quantum Programs","volume":"abs\/1810.11334","author":"Ying","year":"2018","journal-title":"CoRR"},{"key":"ying22","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/J.TCS.2021.10.025","article-title":"A proof system for disjoint parallel quantum programs","volume":"897","author":"Ying","year":"2022","journal-title":"Theor. Comput. Sci."}],"container-title":["Electronic Proceedings in Theoretical Computer Science"],"original-title":[],"language":"en","deposited":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T10:03:42Z","timestamp":1761905022000},"score":1,"resource":{"primary":{"URL":"http:\/\/arxiv.org\/abs\/2510.24204v1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,28]]},"references-count":51,"URL":"https:\/\/doi.org\/10.4204\/eptcs.433.4","relation":{},"ISSN":["2075-2180"],"issn-type":[{"type":"electronic","value":"2075-2180"}],"subject":[],"published":{"date-parts":[[2025,10,28]]}}}