{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T02:45:47Z","timestamp":1764557147012},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540374060"},{"type":"electronic","value":"9783540374114"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11817963_25","type":"book-chapter","created":{"date-parts":[[2006,8,5]],"date-time":"2006-08-05T05:07:51Z","timestamp":1154754471000},"page":"263-277","source":"Crossref","is-referenced-by-count":30,"title":["Allen Linear (Interval) Temporal Logic \u2013 Translation to LTL and Monitor Synthesis"],"prefix":"10.1007","author":[{"given":"Grigore","family":"Ro\u015fu","sequence":"first","affiliation":[]},{"given":"Saddek","family":"Bensalem","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"25_CR1","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0004-3702(84)90008-0","volume":"23","author":"J. Allen","year":"1984","unstructured":"Allen, J.: Towards a general theory of actions and time. Artificial Intelligence\u00a023(2), 123\u2013154 (1984)","journal-title":"Artificial Intelligence"},{"key":"25_CR2","unstructured":"Calvanese, D., De Giacomo, G., Vardi, M.Y.: Reasoning about actions and planning in LTL action theories. In: KR, pp. 593\u2013602 (2002)"},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/11513988_36","volume-title":"Computer Aided Verification","author":"M. D\u2019Amorim","year":"2005","unstructured":"D\u2019Amorim, M., Ro\u015fu, G.: Efficient monitoring of omega-languages. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol.\u00a03576, pp. 364\u2013378. Springer, Heidelberg (2005)"},{"key":"25_CR4","unstructured":"Ghallab, M., Alaoui, A.M.: Managing efficiently temporal relations through indexed spanning trees. In: IJCAI, pp. 1297\u20131303 (1989)"},{"issue":"5","key":"25_CR5","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1145\/876638.876639","volume":"50","author":"A.A. Krokhin","year":"2003","unstructured":"Krokhin, A.A., Jeavons, P., Jonsson, P.: Reasoning about temporal relations: The tractable subalgebras of Allen\u2019s interval algebra. J. ACM\u00a050(5), 591\u2013640 (2003)","journal-title":"J. ACM"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Lacroix, S., Mallet, A., Bonnafous, D., Bauzil, G., Fleury, S., Herrb, M., Chatila, R.: Autonomous rover navigation on unknown terrains, functions and integration. International Journal of Robotics Research (2003)","DOI":"10.1177\/027836402128964152"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an Efficient SAT Solver. In: Design Automation Conference (DAC 2001) (June 2001)","DOI":"10.1145\/378239.379017"},{"key":"25_CR8","volume-title":"Proceedings of the 18th Annual Symposium on Foundations of Computer Science","author":"A. Pnueli","year":"1977","unstructured":"Pnueli, A.: The temporal logic of programs. In: Proceedings of the 18th Annual Symposium on Foundations of Computer Science, New York. IEEE, Los Alamitos (1977)"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Ro\u015fu, G., Bensalem, S.: Allen linear (interval) temporal logic \u2013 translation to LTL and monitor synthesis. Technical Report UIUCDCS-R-2006-2681, University of Illinois at Urbana-Champaign (January 2006)","DOI":"10.1007\/11817963_25"},{"issue":"2","key":"25_CR10","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s10515-005-6205-y","volume":"12","author":"G. Ro\u015fu","year":"2005","unstructured":"Ro\u015fu, G., Havelund, K.: Rewriting-based techniques for runtime verification. J. of Automated Software Engineering\u00a012(2), 151\u2013197 (2005)","journal-title":"J. of Automated Software Engineering"},{"issue":"3","key":"25_CR11","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1145\/3828.3837","volume":"32","author":"A.P. Sistla","year":"1985","unstructured":"Sistla, A.P., Clarke, E.M.: The complexity of propositional linear temporal logics. J. ACM\u00a032(3), 733\u2013749 (1985)","journal-title":"J. ACM"},{"key":"25_CR12","volume-title":"Readings in Qualitative Reasoning about Phyisical Systems","author":"M. Vilain","year":"1989","unstructured":"Vilain, M., Kautz, H., van Beek, P.: Constraint propagation algorithms for temporal reasoning: a revised report. In: Readings in Qualitative Reasoning about Phyisical Systems. Morgan Kaufmann, Los Altos (1989)"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11817963_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:15:57Z","timestamp":1605644157000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11817963_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540374060","9783540374114"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11817963_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}