{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:11:25Z","timestamp":1760202685368,"version":"3.41.2"},"reference-count":1,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2014,12,3]],"date-time":"2014-12-03T00:00:00Z","timestamp":1417564800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>We introduce Priority Channel Systems, a new class of channel systems where\nmessages carry a numeric priority and where higher-priority messages can\nsupersede lower-priority messages preceding them in the fifo communication\nbuffers. The decidability of safety and inevitability properties is shown via\nthe introduction of a priority embedding, a well-quasi-ordering that has not\npreviously been used in well-structured systems. We then show how Priority\nChannel Systems can compute Fast-Growing functions and prove that the\naforementioned verification problems are\n$\\mathbf{F}_{\\varepsilon_{0}}$-complete.<\/jats:p>","DOI":"10.2168\/lmcs-10(4:4)2014","type":"journal-article","created":{"date-parts":[[2015,5,18]],"date-time":"2015-05-18T07:32:47Z","timestamp":1431934367000},"source":"Crossref","is-referenced-by-count":11,"title":["The Power of Priority Channel Systems"],"prefix":"10.46298","volume":"Volume 10, Issue 4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5452-936X","authenticated-orcid":false,"given":"Christoph","family":"Haase","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4101-4308","authenticated-orcid":false,"given":"Sylvain","family":"Schmitz","sequence":"additional","affiliation":[]},{"given":"Philippe","family":"Schnoebelen","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2014,12,3]]},"reference":[{"key":"998:not-found"}],"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/1049\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/1049\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T20:02:09Z","timestamp":1681243329000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/1049"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,3]]},"references-count":1,"URL":"https:\/\/doi.org\/10.2168\/lmcs-10(4:4)2014","relation":{"is-same-as":[{"id-type":"arxiv","id":"1301.5500","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1301.5500","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2014,12,3]]},"article-number":"1049"}}