TY - JOUR
T1 - A robust class of data languages and an application to learning
AU - Bollig, Benedikt
AU - Habermehl, Peter
AU - Leucker, Martin
AU - Monmege, Benjamin
PY - 2014/12/29
Y1 - 2014/12/29
N2 - We introduce session automata, an automata model to process data words, i.e., words over an infinite alphabet. Session automata support the notion of fresh data values, which are well suited for modeling protocols in which sessions using fresh values are of major interest, like in security protocols or ad-hoc networks. Session automata have an expressiveness partly extending, partly reducing that of classical register automata. We show that, unlike register automata and their various extensions, session automata are robust: They (i) are closed under intersection, union, and (resource-sensitive) complementation, (ii) admit a symbolic regular representation, (iii) have a decidable inclusion problem (unlike register automata), and (iv) enjoy logical characterizations. Using these results, we establish a learning algorithm to infer session automata through membership and equivalence queries.
AB - We introduce session automata, an automata model to process data words, i.e., words over an infinite alphabet. Session automata support the notion of fresh data values, which are well suited for modeling protocols in which sessions using fresh values are of major interest, like in security protocols or ad-hoc networks. Session automata have an expressiveness partly extending, partly reducing that of classical register automata. We show that, unlike register automata and their various extensions, session automata are robust: They (i) are closed under intersection, union, and (resource-sensitive) complementation, (ii) admit a symbolic regular representation, (iii) have a decidable inclusion problem (unlike register automata), and (iv) enjoy logical characterizations. Using these results, we establish a learning algorithm to infer session automata through membership and equivalence queries.
UR - http://www.scopus.com/inward/record.url?scp=84920085825&partnerID=8YFLogxK
U2 - 10.2168/LMCS-10(4:19)2014
DO - 10.2168/LMCS-10(4:19)2014
M3 - Journal articles
AN - SCOPUS:84920085825
SN - 1860-5974
VL - 10
SP - 1
EP - 23
JO - Logical Methods in Computer Science
JF - Logical Methods in Computer Science
IS - 4
ER -