{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T05:17:05Z","timestamp":1767158225721,"version":"build-2238731810"},"reference-count":51,"publisher":"Informa UK Limited","issue":"1","funder":[{"name":"Bulgarian NSF","award":["DN02\/15\/19.12.2016"],"award-info":[{"award-number":["DN02\/15\/19.12.2016"]}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Journal of Applied Non-Classical Logics"],"published-print":{"date-parts":[[2022,1,2]]},"DOI":"10.1080\/11663081.2022.2050135","type":"journal-article","created":{"date-parts":[[2022,4,21]],"date-time":"2022-04-21T05:38:50Z","timestamp":1650519530000},"page":"28-54","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":1,"title":["A separation theorem for discrete-time interval temporal logic"],"prefix":"10.1080","volume":"32","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3101-7433","authenticated-orcid":false,"given":"Dimitar P.","family":"Guelev","sequence":"first","affiliation":[{"name":"Department of Algebra and Logic, Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, Sofia, Bulgaria"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8965-9308","authenticated-orcid":false,"given":"Ben","family":"Moszkowski","sequence":"additional","affiliation":[{"name":"School of Computing, Newcastle University, Newcastle upon Tyne, UK"}]}],"member":"301","published-online":{"date-parts":[[2022,4,21]]},"reference":[{"key":"CIT0001","doi-asserted-by":"publisher","DOI":"10.1145\/182.358434"},{"key":"CIT0002","doi-asserted-by":"crossref","unstructured":"Boul\u00e9, M. & Zilic, Z. (2008). Psl and sva assertion languages. In\n                      Generating hardware assertion checkers: For hardware verification, emulation, post-fabrication debugging and on-line monitoring\n                      (pp. 55\u201382). Springer Netherlands.","DOI":"10.1007\/978-1-4020-8586-4_4"},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-9586-5_22"},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/13.2.195"},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.17265\/2159-5313\/2016.09.003"},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1145\/3281028"},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2018.04.011"},{"key":"CIT0008","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2019.11.028"},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1016\/j.apal.2009.07.003"},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70918-3_47"},{"key":"CIT0011","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.10.043"},{"key":"CIT0012","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-006-9051-0"},{"key":"CIT0013","doi-asserted-by":"publisher","DOI":"10.1145\/321239.321249"},{"key":"CIT0014","unstructured":"Cau, A., Moszkowski, B. & Zedan, H. (2022). ITL web pages. http:\/\/www.antonio-cau.co.uk\/ITL\/"},{"key":"CIT0017","doi-asserted-by":"publisher","DOI":"10.1016\/B978-044450813-3\/50026-6"},{"key":"CIT0018","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00315-1"},{"key":"CIT0019","unstructured":"Farwer, B. (2001).\n                      \u03c9\n                      -automata. In E. Gr\u00e4del, W. Thomas, &\u00a0T. Wilke (Eds.),\n                      Automata, logics, and infinite games: A guide to current research\n                      (Vol. 2500 of LNCS, pp. 3\u201320). Springer."},{"key":"CIT0020","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(79)90046-1"},{"key":"CIT0021","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/7.4.429"},{"key":"CIT0022","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0013976"},{"key":"CIT0023","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-51803-7_36"},{"issue":"9","key":"CIT0024","first-page":"1137","volume":"9","author":"Goranko V.","year":"2003","journal-title":"Journal of Universal Computer Science"},{"key":"CIT0025","doi-asserted-by":"publisher","DOI":"10.3166\/jancl.14.9-54"},{"key":"CIT0026","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-3(3:3)2007"},{"key":"CIT0027","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/exn002"},{"key":"CIT0028","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0036915"},{"key":"CIT0029","unstructured":"Halpern, J. Y. & Shoham, Y. (1986). A propositional logic of time intervals. In\n                      Proceedings of LICS'86\n                      (pp. 279\u2013292). IEEE Computer Society Press."},{"key":"CIT0030","volume-title":"Standard for property specification language (PSL), standard 1850\u20132010","author":"IEEE.","year":"2010"},{"key":"CIT0031","volume-title":"Standard for SystemVerilog\u2013Unified hardware design, specification, and verification language, standard 1800\u20132017","author":"IEEE.","year":"2018"},{"key":"CIT0032","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1965-0188316-1"},{"key":"CIT0033","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2002.1029846"},{"key":"CIT0034","unstructured":"Lomuscio, A. & Michaliszyn, J. (2013). An epistemic Halpern-Shoham logic. In F. Rossi (Ed.),\n                      Proceedings of IJCAI 2013\n                      (pp. 1010\u20131016). IJCAI\/AAAI."},{"key":"CIT0035","doi-asserted-by":"publisher","DOI":"10.17265\/2159-5313\/2016.09.003"},{"key":"CIT0036","unstructured":"Lomuscio, A. R. & Michaliszyn, J. (2014). Decidability of model checking multi-agent systems against a class of EHS specifications. In T. Schaub, G. Friedrich, &\u00a0B. O'Sullivan (Eds.),\n                      Proceedings of ECAI 2014\n                      (Vol. 263 of Frontiers in Artificial Intelligence and Applications, pp. 543\u2013548). IOS Press."},{"key":"CIT0037","doi-asserted-by":"publisher","DOI":"10.1109\/FSCS.1990.89589"},{"key":"CIT0038","doi-asserted-by":"crossref","unstructured":"Manna, Z. & Pnueli, A. (1990). A hierarchy of temporal properties. In C. Dwork (Ed.),\n                      9th Symposium on Principles of Distributed Computing\n                      (pp. 377\u2013408). ACM Press.","DOI":"10.1145\/93385.93442"},{"key":"CIT0039","doi-asserted-by":"publisher","DOI":"10.1007\/s00236-015-0250-1"},{"key":"CIT0040","first-page":"73","volume":"105","author":"Monica D. D.","year":"2011","journal-title":"Bulletin of the EATCS"},{"key":"CIT0041","doi-asserted-by":"publisher","DOI":"10.1109\/TIME.2014.24"},{"key":"CIT0042","unstructured":"Moszkowski, B. (1983).\n                      Reasoning about digital circuits\n                      [Ph.D. thesis, Department of Computer Science, Stanford University]. http:\/\/www.antonio-cau.co.uk\/ITL\/publications\/reports\/thesis-ben.pdf, Accessed in March, 2022."},{"key":"CIT0043","doi-asserted-by":"publisher","DOI":"10.1109\/MC.1985.1662795"},{"key":"CIT0044","volume-title":"Executing temporal logic programs","author":"Moszkowski B","year":"1986"},{"key":"CIT0045","doi-asserted-by":"publisher","DOI":"10.3166\/jancl.14.55-104"},{"key":"CIT0046","doi-asserted-by":"crossref","unstructured":"Pandya, P. K. (1995). Some extensions to propositional mean-value calculus: Expressiveness and decidability. In H. K. B\u00fcning (Ed.),\n                      CSL '95, selected papers\n                      (Vol. 1092 of LNCS, pp. 434\u2013451). Springer.","DOI":"10.1007\/3-540-61377-3_52"},{"key":"CIT0047","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1977.32"},{"key":"CIT0048","doi-asserted-by":"publisher","DOI":"10.1145\/567752.567761"},{"key":"CIT0049","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48168-0_12"},{"key":"CIT0050","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/1.4.453"},{"key":"CIT0015","volume-title":"Duration calculus. A formal approach to real-Time systems","author":"Zhou C.","year":"2004"},{"key":"CIT0016","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(91)90122-X"},{"key":"CIT0051","unstructured":"Zuck, L. (1986).\n                      Past temporal logic\n                      [Ph.D. thesis, Weizmann Institute of Science]."}],"updated-by":[{"DOI":"10.1080\/11663081.2023.2188041","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2023,3,14]],"date-time":"2023-03-14T00:00:00Z","timestamp":1678752000000}}],"container-title":["Journal of Applied Non-Classical Logics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/11663081.2022.2050135","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,14]],"date-time":"2023-03-14T03:29:38Z","timestamp":1678764578000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/11663081.2022.2050135"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,2]]},"references-count":51,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1,2]]}},"alternative-id":["10.1080\/11663081.2022.2050135"],"URL":"https:\/\/doi.org\/10.1080\/11663081.2022.2050135","relation":{},"ISSN":["1166-3081","1958-5780"],"issn-type":[{"value":"1166-3081","type":"print"},{"value":"1958-5780","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,2]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=tncl20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=tncl20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2021-06-27","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-02-14","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-04-21","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}