{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T01:27:24Z","timestamp":1772242044033,"version":"3.50.1"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2017,12,8]],"date-time":"2017-12-08T00:00:00Z","timestamp":1512691200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"},{"start":{"date-parts":[[2017,12,8]],"date-time":"2017-12-08T00:00:00Z","timestamp":1512691200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"},{"start":{"date-parts":[[2017,12,8]],"date-time":"2017-12-08T00:00:00Z","timestamp":1512691200000},"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>Timed session types formalise timed communication protocols between two participants at the endpoints of a session. They feature a decidable compliance relation, which generalises to the timed setting the progress-based compliance between untimed session types. We show a sound and complete technique to decide when a timed session type admits a compliant one. Then, we show how to construct the most precise session type compliant with a given one, according to the subtyping preorder induced by compliance. Decidability of subtyping follows from these results.<\/jats:p>","DOI":"10.23638\/lmcs-13(4:25)2017","type":"journal-article","created":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T13:35:08Z","timestamp":1743687308000},"source":"Crossref","is-referenced-by-count":1,"title":["Timed Session Types"],"prefix":"10.23638","volume":"Volume 13, Issue 4","author":[{"given":"Massimo","family":"Bartoletti","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8591-4527","authenticated-orcid":false,"given":"Tiziana","family":"Cimoli","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7613-621X","authenticated-orcid":false,"given":"Maurizio","family":"Murgia","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2017,12,8]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/arxiv.org\/pdf\/1710.05388v3","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/arxiv.org\/pdf\/1710.05388v3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T13:35:08Z","timestamp":1743687308000},"score":1,"resource":{"primary":{"URL":"http:\/\/lmcs.episciences.org\/4130"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,8]]},"references-count":0,"URL":"https:\/\/doi.org\/10.23638\/lmcs-13(4:25)2017","relation":{"has-preprint":[{"id-type":"arxiv","id":"1710.05388v2","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"1710.05388","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1710.05388","asserted-by":"subject"}],"is-cited-by":[{"id-type":"doi","id":"10.4204\/EPTCS.304.3","asserted-by":"object"},{"id-type":"doi","id":"10.4204\/EPTCS.279.9","asserted-by":"object"}]},"ISSN":["1860-5974"],"issn-type":[{"value":"1860-5974","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,12,8]]},"article-number":"4130"}}