{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T04:49:20Z","timestamp":1764305360941,"version":"3.41.2"},"reference-count":1,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2014,12,30]],"date-time":"2014-12-30T00:00:00Z","timestamp":1419897600000},"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 session automata, an automata model to process data words, i.e.,\nwords over an infinite alphabet. Session automata support the notion of fresh\ndata values, which are well suited for modeling protocols in which sessions\nusing fresh values are of major interest, like in security protocols or ad-hoc\nnetworks. Session automata have an expressiveness partly extending, partly\nreducing that of classical register automata. We show that, unlike register\nautomata and their various extensions, session automata are robust: They (i)\nare closed under intersection, union, and (resource-sensitive) complementation,\n(ii) admit a symbolic regular representation, (iii) have a decidable inclusion\nproblem (unlike register automata), and (iv) enjoy logical characterizations.\nUsing these results, we establish a learning algorithm to infer session\nautomata through membership and equivalence queries.<\/jats:p>","DOI":"10.2168\/lmcs-10(4:19)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":7,"title":["A Robust Class of Data Languages and an Application to Learning"],"prefix":"10.46298","volume":"Volume 10, Issue 4","author":[{"given":"Benedikt","family":"Bollig","sequence":"first","affiliation":[]},{"given":"Peter","family":"Habermehl","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3696-9222","authenticated-orcid":false,"given":"Martin","family":"Leucker","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4717-9955","authenticated-orcid":false,"given":"Benjamin","family":"Monmege","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2014,12,30]]},"reference":[{"key":"968:not-found"}],"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/1030\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/1030\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T20:01:42Z","timestamp":1681243302000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/1030"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,30]]},"references-count":1,"URL":"https:\/\/doi.org\/10.2168\/lmcs-10(4:19)2014","relation":{"is-same-as":[{"id-type":"arxiv","id":"1411.6646","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1411.6646","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2014,12,30]]},"article-number":"1030"}}