{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T09:57:28Z","timestamp":1776333448989,"version":"3.51.2"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>Event-clock automata (ECA) are a well-known semantic subclass of timed\nautomata (TA) which enjoy admirable theoretical properties, e.g.,\ndeterminizability, and are practically useful to capture timed specifications.\nHowever, unlike for timed automata, there exist no implementations for checking\nnon-emptiness of event-clock automata. As ECAs contain special prophecy clocks\nthat guess and maintain the time to the next occurrence of specific events,\nthey cannot be seen as a syntactic subclass of TA. Therefore, implementations\nfor TA cannot be directly used for ECAs, and moreover the translation of an ECA\nto a semantically equivalent TA is expensive. Another reason for the lack of\nECA implementations is the difficulty in adapting zone-based algorithms,\ncritical in the timed automata setting, to the event-clock automata setting.\nThis difficulty was studied by Geeraerts et al. in 2011, where the authors\nproposed a zone enumeration procedure that uses zone extrapolations for\nfiniteness. In this article, we propose a different zone-based algorithm to\nsolve the reachability problem for event-clock automata, using simulations for\nfiniteness. A surprising consequence of our result is that for event-predicting\nautomata, the subclass of event-clock automata that only use prophecy clocks,\nwe obtain finiteness even without any simulations. For general event-clock\nautomata, our new algorithm exploits the G-simulation framework, which is the\ncoarsest known simulation relation in timed automata literature, and has been\nrecently used for advances in other extensions of timed automata.<\/jats:p>","DOI":"10.46298\/lmcs-20(3:2)2024","type":"journal-article","created":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T15:26:11Z","timestamp":1719933971000},"source":"Crossref","is-referenced-by-count":1,"title":["Simulations for Event-Clock Automata"],"prefix":"10.46298","volume":"Volume 20, Issue 3","author":[{"given":"S","family":"Akshay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Gastin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R","family":"Govind","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B","family":"Srivathsan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"25203","published-online":{"date-parts":[[2024,7,2]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/lmcs.episciences.org\/13861\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/lmcs.episciences.org\/13861\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T15:26:14Z","timestamp":1719933974000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/lmcs.episciences.org\/10408"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,2]]},"references-count":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.46298\/lmcs-20(3:2)2024","relation":{"has-preprint":[{"id-type":"arxiv","id":"2207.02633v3","asserted-by":"subject"},{"id-type":"arxiv","id":"2207.02633v2","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"2207.02633","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.2207.02633","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"value":"1860-5974","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7,2]]},"article-number":"10408"}}