{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:59:20Z","timestamp":1762459160934,"version":"3.41.2"},"reference-count":1,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2012,11,19]],"date-time":"2012-11-19T00:00:00Z","timestamp":1353283200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"funder":[{"DOI":"10.13039\/501100000780","name":"European Commission","doi-asserted-by":"crossref","award":["231620"],"award-info":[{"award-number":["231620"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>We propose the concept of adaptable processes as a way of overcoming the\nlimitations that process calculi have for describing patterns of dynamic\nprocess evolution. Such patterns rely on direct ways of controlling the\nbehavior and location of running processes, and so they are at the heart of the\nadaptation capabilities present in many modern concurrent systems. Adaptable\nprocesses have a location and are sensible to actions of dynamic update at\nruntime; this allows to express a wide range of evolvability patterns for\nconcurrent processes. We introduce a core calculus of adaptable processes and\npropose two verification problems for them: bounded and eventual adaptation.\nWhile the former ensures that the number of consecutive erroneous states that\ncan be traversed during a computation is bound by some given number k, the\nlatter ensures that if the system enters into a state with errors then a state\nwithout errors will be eventually reached. We study the (un)decidability of\nthese two problems in several variants of the calculus, which result from\nconsidering dynamic and static topologies of adaptable processes as well as\ndifferent evolvability patterns. Rather than a specification language, our\ncalculus intends to be a basis for investigating the fundamental properties of\nevolvable processes and for developing richer languages with evolvability\ncapabilities.<\/jats:p>","DOI":"10.2168\/lmcs-8(4:13)2012","type":"journal-article","created":{"date-parts":[[2013,11,29]],"date-time":"2013-11-29T13:21:33Z","timestamp":1385731293000},"source":"Crossref","is-referenced-by-count":23,"title":["Adaptable processes"],"prefix":"10.46298","volume":"Volume 8, Issue 4","author":[{"given":"Mario","family":"Bravetti","sequence":"first","affiliation":[]},{"given":"Cinzia","family":"Di Giusto","sequence":"additional","affiliation":[]},{"given":"Jorge A","family":"Perez","sequence":"additional","affiliation":[]},{"given":"Gianluigi","family":"Zavattaro","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2012,11,19]]},"reference":[{"key":"700:not-found"}],"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/982\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/982\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T20:00:41Z","timestamp":1681243241000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/982"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11,19]]},"references-count":1,"URL":"https:\/\/doi.org\/10.2168\/lmcs-8(4:13)2012","relation":{"is-same-as":[{"id-type":"arxiv","id":"1210.6379","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1210.6379","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2012,11,19]]},"article-number":"982"}}