Reachability results for timed automata with unbounded data structures

Ruggero Lanotte, Andrea Maggiolo-Schettini, Angelo Troina. Reachability results for timed automata with unbounded data structures. Acta Informatica, 47(5-6):279-311, 2010. [doi]

@article{LanotteMT10-0,
  title = {Reachability results for timed automata with unbounded data structures},
  author = {Ruggero Lanotte and Andrea Maggiolo-Schettini and Angelo Troina},
  year = {2010},
  doi = {10.1007/s00236-010-0121-8},
  url = {http://dx.doi.org/10.1007/s00236-010-0121-8},
  tags = {data-flow},
  researchr = {https://researchr.org/publication/LanotteMT10-0},
  cites = {0},
  citedby = {0},
  journal = {Acta Informatica},
  volume = {47},
  number = {5-6},
  pages = {279-311},
}