Search


Volume

Author

Year

  • < Previous
  • 1
  • Next >
1 result

A Robust Class of Data Languages and an Application to Learning

Benedikt Bollig ; Peter Habermehl ; Martin Leucker ; Benjamin Monmege.
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&nbsp;[&hellip;]
Published on December 30, 2014

  • < Previous
  • 1
  • Next >