{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:36:35Z","timestamp":1753889795551,"version":"3.41.2"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2017,11,27]],"date-time":"2017-11-27T00:00:00Z","timestamp":1511740800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"},{"start":{"date-parts":[[2017,11,27]],"date-time":"2017-11-27T00:00:00Z","timestamp":1511740800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"},{"start":{"date-parts":[[2017,11,27]],"date-time":"2017-11-27T00:00:00Z","timestamp":1511740800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"accepted":{"date-parts":[[2025,3,31]]},"abstract":"<jats:p>A universal process of a process calculus is one that, given the G\\&amp;quot;{o}del index of a process of a certain type, produces a process equivalent to the encoded process. This paper demonstrates how universal processes can be formally defined and how a universal process of the value-passing calculus can be constructed. The existence of such a universal process in a process model can be explored to implement higher order communications, security protocols, and programming languages in the process model. A process version of the S-m-n theorem is stated to showcase how to embed the recursion theory in a process calculus.<\/jats:p>","DOI":"10.23638\/lmcs-13(4:11)2017","type":"journal-article","created":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T17:35:05Z","timestamp":1743701705000},"source":"Crossref","is-referenced-by-count":0,"title":["The Universal Process"],"prefix":"10.23638","volume":"Volume 13, Issue 4","author":[{"given":"Yuxi","family":"Fu","sequence":"first","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2017,11,27]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/arxiv.org\/pdf\/1708.06010v3","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/arxiv.org\/pdf\/1708.06010v3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T17:35:05Z","timestamp":1743701705000},"score":1,"resource":{"primary":{"URL":"http:\/\/lmcs.episciences.org\/4073"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,27]]},"references-count":0,"URL":"https:\/\/doi.org\/10.23638\/lmcs-13(4:11)2017","relation":{"has-preprint":[{"id-type":"arxiv","id":"1708.06010v2","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"1708.06010","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1708.06010","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2017,11,27]]},"article-number":"4073"}}