{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T09:24:40Z","timestamp":1760606680670,"version":"3.40.5"},"reference-count":34,"publisher":"Cambridge University Press (CUP)","issue":"5","license":[{"start":{"date-parts":[[2022,3,4]],"date-time":"2022-03-04T00:00:00Z","timestamp":1646352000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":["cambridge.org"],"crossmark-restriction":true},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2023,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper introduces a formal definition of a Cyber-Physical System (CPS) in the spirit of the CPS Framework proposed by the National Institute of Standards and Technology (NIST). It shows that using this definition, various problems related to concerns in a CPS can be precisely formalized and implemented using Answer Set Programming (ASP). These include problems related to the dependency or conflicts between concerns, how to mitigate an issue, and what the most suitable mitigation strategy for a given issue would be. It then shows how ASP can be used to develop an implementation that addresses the aforementioned problems. The paper concludes with a discussion of the potentials of the proposed methodologies.<\/jats:p>","DOI":"10.1017\/s1471068422000035","type":"journal-article","created":{"date-parts":[[2022,3,4]],"date-time":"2022-03-04T09:27:22Z","timestamp":1646386042000},"page":"1029-1069","update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":5,"title":["Specifying and Reasoning about CPS through the Lens of the NIST CPS Framework"],"prefix":"10.1017","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9996-4720","authenticated-orcid":false,"given":"THANH HAI","family":"NGUYEN","sequence":"first","affiliation":[]},{"given":"MATTHEW","family":"BUNDAS","sequence":"additional","affiliation":[]},{"given":"TRAN CAO","family":"SON","sequence":"additional","affiliation":[]},{"given":"MARCELLO","family":"BALDUCCINI","sequence":"additional","affiliation":[]},{"given":"KATHLEEN CAMPBELL","family":"GARWOOD","sequence":"additional","affiliation":[]},{"given":"EDWARD R.","family":"GRIFFOR","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2022,3,4]]},"reference":[{"key":"S1471068422000035_ref29","doi-asserted-by":"publisher","DOI":"10.1002\/sec.299"},{"key":"S1471068422000035_ref1","first-page":"287","article-title":"Cyber-Physical Systems - Foundations, Principles and Applications, chapter 19. Model-Based Testing of Cyber-Physical Systems. Intelligent Data-Centric","author":"Aerts","year":"2017","journal-title":"Systems"},{"key":"S1471068422000035_ref27","first-page":"4","article-title":"ASP modulo CSP: The clingcon system","volume":"12","author":"Ostrowski","year":"2012","journal-title":"Journal of Theory and Practice of Logic Programming (TPLP)"},{"key":"S1471068422000035_ref8","doi-asserted-by":"crossref","unstructured":"Eiter, T. 2007. Answer set programming for the semantic web. In Logic Programming, 23rd International Conference, ICLP 2007, Porto, Portugal, September 8\u201313, 2007, Proceedings, V. Dahl and I. Niemel\u00e4, Eds., Lecture Notes in Computer Science, vol. 4670. Springer, 23\u201326.","DOI":"10.1007\/978-3-540-74610-2_3"},{"key":"S1471068422000035_ref2","doi-asserted-by":"crossref","unstructured":"Balas, E. 1975. Disjunctive programming: Cutting planes from logical conditions. In Nonlinear Programming 2. Elsevier, 279\u2013312.","DOI":"10.1016\/B978-0-12-468650-2.50015-8"},{"key":"S1471068422000035_ref3","doi-asserted-by":"crossref","unstructured":"Balduccini, M. , Griffor, E. , Huth, M. , Vishik, C. , Burns, M. and Wollman, D. A. 2018. Ontology-based reasoning about the trustworthiness of cyber-physical systems. ArXiv, abs\/1803.07438, 1.","DOI":"10.1049\/cp.2018.0012"},{"key":"S1471068422000035_ref34","doi-asserted-by":"publisher","DOI":"10.6028\/NIST.SP.1500-203"},{"key":"S1471068422000035_ref24","doi-asserted-by":"crossref","unstructured":"Nguyen, T. H. , Son, T. C. and Pontelli, E. 2018b. Automatic web services composition for phylotastic. In PADL, Los Angeles, CA, USA, January 8\u20139, 2018, Proceedings, 186\u2013202.","DOI":"10.1007\/978-3-319-73305-0_13"},{"key":"S1471068422000035_ref23","doi-asserted-by":"crossref","unstructured":"Nguyen, T. H. , Potelli, E. and Son, T. C. 2018a. Phylotastic: An experiment in creating, manipulating, and evolving phylogenetic biology workflows using logic programming. Theory and Practice of Logic Programming, 18a, 3-4, 656\u2013672.","DOI":"10.1017\/S1471068418000236"},{"key":"S1471068422000035_ref6","unstructured":"Baral, C. , Tran, N. and Tuan, L.-C. Reasoning about actions in a probabilistic setting. In AAAI\/IAAI 2002, 507\u2013512."},{"key":"S1471068422000035_ref10","unstructured":"Gelfond, M. and Lifschitz, V. 1990. Logic programs with classical negation. In Logic Programming: Proceedings of the Seventh International Conference, D. Warren and P. Szeredi, Eds, 579\u2013597."},{"key":"S1471068422000035_ref25","doi-asserted-by":"crossref","unstructured":"Niemel\u00e4, I. 1999. Logic programming with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence, 25, 3,4, 241\u2013273.","DOI":"10.1023\/A:1018930122475"},{"key":"S1471068422000035_ref18","doi-asserted-by":"crossref","unstructured":"Marek, V. and Truszczy\u0144ski, M. 1999. Stable models and an alternative logic programming paradigm. In The Logic Programming Paradigm: A 25-year Perspective, 375\u2013398.","DOI":"10.1007\/978-3-642-60085-2_17"},{"key":"S1471068422000035_ref33","first-page":"2","article-title":"A system-level behavioral detection framework for compromised CPS devices: Smart-grid case","volume":"4","author":"Uluagac","year":"2019","journal-title":"ACM Transactions on Cyber-Physical Systems"},{"key":"S1471068422000035_ref16","doi-asserted-by":"publisher","DOI":"10.6028\/NIST.SP.1500-202"},{"key":"S1471068422000035_ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2912149"},{"key":"S1471068422000035_ref26","unstructured":"Niemel\u00e4, I. , Simons, P. and Soininen, T. 1999. Stable model semantics for weight constraint rules. In Proceedings of the 5th International Conference on on Logic Programming and Nonmonotonic Reasoning, 315\u2013332."},{"first-page":"37","year":"2020","author":"Nguyen","key":"S1471068422000035_ref22"},{"key":"S1471068422000035_ref15","doi-asserted-by":"publisher","DOI":"10.6028\/NIST.SP.1500-201"},{"key":"S1471068422000035_ref21","doi-asserted-by":"crossref","unstructured":"Nguyen, T. , Son, T. C. , Bundas, M. , Balduccini, M. , Garwood, K. C. and Griffor, E. 2020a. Reasoning about trustworthiness in cyber-physical systems using ontology-based representation and asp. In PRIMA.","DOI":"10.1007\/978-3-030-69322-0_4"},{"key":"S1471068422000035_ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.compchemeng.2018.03.004"},{"key":"S1471068422000035_ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcde.2019.04.002"},{"key":"S1471068422000035_ref11","doi-asserted-by":"crossref","unstructured":"Gelfond, M. and Lifschitz, V. 1993. Representing actions and change by logic programs. Journal of Logic Programming, 17, 2,3,4, 301\u2013323.","DOI":"10.1016\/0743-1066(93)90035-F"},{"key":"S1471068422000035_ref31","doi-asserted-by":"publisher","DOI":"10.1145\/1183278.1183279"},{"key":"S1471068422000035_ref20","doi-asserted-by":"publisher","DOI":"10.1016\/S1474-6670(17)35112-1"},{"key":"S1471068422000035_ref13","doi-asserted-by":"crossref","unstructured":"Gelfond, M. and Son, T. C. 1998. Prioritized default theory. In Selected Papers from the Workshop on Logic Programming and Knowledge Representation 1997, LNAI, vol. 1471. Springer Verlag, 164\u2013223.","DOI":"10.1007\/BFb0054795"},{"key":"S1471068422000035_ref5","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068408003645"},{"key":"S1471068422000035_ref9","doi-asserted-by":"crossref","unstructured":"Gebser, M. , Kaufmann, B. , Neumann, A. and Schaub, T. clasp: A conflict-driven answer set solver. In Proceedings of the Ninth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR\u201907), C. Baral, G. Brewka and J. Schlipf, Eds., Lecture Notes in Artificial Intelligence, vol. 4483. Springer-Verlag, 260\u2013265.","DOI":"10.1007\/978-3-540-72200-7_23"},{"key":"S1471068422000035_ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3078621"},{"key":"S1471068422000035_ref7","unstructured":"D\u2019Iddio, A. C. and Huth, M. 2017. ManyOpt: An Extensible Tool for Mixed, Non-Linear Optimization Through SMT Solving. CoRR, abs\/1702.01332."},{"key":"S1471068422000035_ref4","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068417000102"},{"volume-title":"Automated Planning: Theory and Practice","year":"2004","author":"Ghallab","key":"S1471068422000035_ref14"},{"key":"S1471068422000035_ref12","first-page":"6","article-title":"Action languages","volume":"3","author":"Gelfond","year":"1998","journal-title":"Electronic Transactions on Artificial Intelligence"},{"key":"S1471068422000035_ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3306157"}],"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068422000035","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T19:31:58Z","timestamp":1726774318000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068422000035\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,4]]},"references-count":34,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["S1471068422000035"],"URL":"https:\/\/doi.org\/10.1017\/s1471068422000035","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"type":"print","value":"1471-0684"},{"type":"electronic","value":"1475-3081"}],"subject":[],"published":{"date-parts":[[2022,3,4]]},"assertion":[{"value":"\u00a9 The Author(s), 2022. Published by Cambridge University Press","name":"copyright","label":"Copyright","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}}]}}