{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:36:03Z","timestamp":1753889763181,"version":"3.41.2"},"reference-count":1,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2015,9,22]],"date-time":"2015-09-22T00:00:00Z","timestamp":1442880000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>We study decidability of verification problems for timed automata extended\nwith unbounded discrete data structures. More detailed, we extend timed\nautomata with a pushdown stack. In this way, we obtain a strong model that may\nfor instance be used to model real-time programs with procedure calls. It is\nlong known that the reachability problem for this model is decidable. The goal\nof this paper is to identify subclasses of timed pushdown automata for which\nthe language inclusion problem and related problems are decidable.<\/jats:p>","DOI":"10.2168\/lmcs-11(3:20)2015","type":"journal-article","created":{"date-parts":[[2016,11,21]],"date-time":"2016-11-21T13:46:02Z","timestamp":1479735962000},"source":"Crossref","is-referenced-by-count":1,"title":["Verification for Timed Automata extended with Unbounded Discrete Data Structures"],"prefix":"10.46298","volume":"Volume 11, Issue 3","author":[{"given":"Karin","family":"Quaas","sequence":"first","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2015,9,22]]},"reference":[{"key":"1040:not-found"}],"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/1596\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/1596\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T20:07:34Z","timestamp":1681243654000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/1596"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,22]]},"references-count":1,"URL":"https:\/\/doi.org\/10.2168\/lmcs-11(3:20)2015","relation":{"is-same-as":[{"id-type":"arxiv","id":"1403.6303","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1403.6303","asserted-by":"subject"}],"is-referenced-by":[{"id-type":"arxiv","id":"1905.04486","asserted-by":"subject"},{"id-type":"doi","id":"10.1007\/978-3-030-25540-4_30","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arxiv.1905.04486","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2015,9,22]]},"article-number":"1596"}}