Systems of data management timed automata (SDM-TAs) are networks of communicating timed automata with structures to store messages and functions to manipulate them. We prove the decidability of reachability. As an application, we model and analyze a cryptographic protocol.
['Ruggero Lanotte', 'Andrea Maggiolo-Schettini', 'Angelo Troina']
Timed automata with data structures for distributed systems design and analysis