Verification for Timed Automata Extended with Unbounded Discrete Data Structures

Karin Quaas. Verification for Timed Automata Extended with Unbounded Discrete Data Structures. In Paolo Baldan, Daniele Gorla, editors, CONCUR 2014 - Concurrency Theory - 25th International Conference, CONCUR 2014, Rome, Italy, September 2-5, 2014. Proceedings. Volume 8704 of Lecture Notes in Computer Science, pages 512-526, Springer, 2014. [doi]

Abstract

Abstract is missing.