{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:09:24Z","timestamp":1750306164706,"version":"3.41.0"},"reference-count":22,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2016,12,19]],"date-time":"2016-12-19T00:00:00Z","timestamp":1482105600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"CFQCU","award":["167671"],"award-info":[{"award-number":["167671"]}]},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["13321"],"award-info":[{"award-number":["13321"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003150","name":"FQRNT","doi-asserted-by":"crossref","award":["167440"],"award-info":[{"award-number":["167440"]}],"id":[{"id":"10.13039\/501100003150","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Embed. Comput. Syst."],"published-print":{"date-parts":[[2017,5,31]]},"abstract":"<jats:p>\n            Non-interference (NI) is a property of systems stating that confidential actions should not cause effects observable by unauthorized users. Several variants of NI have been studied for many types of models but rarely for true concurrency or unbounded models. This work investigates NI for High-level Message Sequence Charts (HMSCs), a scenario language for the description of distributed systems, based on composition of partial orders. We first propose a general definition of security properties in terms of equivalence among observations of behaviors. Observations are naturally captured by partial order automata, a formalism that generalizes HMSCs and permits assembling partial orders. We show that equivalence or inclusion properties for HMSCs (and hence for partial order automata) are undecidable, which means in particular that NI is undecidable for HMSCs. We hence consider decidable subclasses of partial order automata and HMSCs. Finally, we define weaker local properties, describing situations where a system is attacked by a single agent, and show that\n            <jats:italic>local NI<\/jats:italic>\n            is decidable. We then refine local NI to a finer notion of\n            <jats:italic>causal NI<\/jats:italic>\n            that emphasizes causal dependencies between confidential actions and observations and extend it to causal NI with (selective) declassification of confidential events. Checking whether a system satisfies local and causal NI and their declassified variants are PSPACE-complete problems.\n          <\/jats:p>","DOI":"10.1145\/2984639","type":"journal-article","created":{"date-parts":[[2016,12,19]],"date-time":"2016-12-19T17:06:31Z","timestamp":1482167191000},"page":"1-34","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Non-interference in Partial Order Models"],"prefix":"10.1145","volume":"16","author":[{"given":"B\u00e9atrice","family":"B\u00e9rard","sequence":"first","affiliation":[{"name":"Sorbonne Universit\u00e9s, UPMC Univ. Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lo\u00efc","family":"H\u00e9lou\u00ebt","sequence":"additional","affiliation":[{"name":"INRIA Rennes, Rennes Cedex, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Mullins","sequence":"additional","affiliation":[{"name":"\u00c9cole Polytechnique de Montr\u00e9al, Montreal(QC) Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,12,19]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11936-6_1"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/646734.701456"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07734-5_11"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACSD.2015.11"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28641-4_16"},{"key":"e_1_2_1_6_1","volume-title":"Proc. of 8th International Workshop on Security Issues in Concurrency (SecCo'10)","volume":"51","author":"Best E.","unstructured":"E. Best , P. Darondeau , and R. Gorrieri . 2010. On the decidability of non interference over unbounded Petri nets . In Proc. of 8th International Workshop on Security Issues in Concurrency (SecCo'10) , Vol. 51 . 16--33. E. Best, P. Darondeau, and R. Gorrieri. 2010. On the decidability of non interference over unbounded Petri nets. In Proc. of 8th International Workshop on Security Issues in Concurrency (SecCo'10), Vol. 51. 16--33."},{"volume-title":"Proc. of 14th Int. Workshop on Automated Verification of Critical Systems (AVoCS'14)","author":"B\u00e9rard B.","key":"e_1_2_1_7_1","unstructured":"B. B\u00e9rard and J. Mullins . 2014. Verification of information flow properties under rational observation . In Proc. of 14th Int. Workshop on Automated Verification of Critical Systems (AVoCS'14) . ECEASST 70. B. B\u00e9rard and J. Mullins. 2014. Verification of information flow properties under rational observation. In Proc. of 14th Int. Workshop on Automated Verification of Critical Systems (AVoCS'14). ECEASST 70."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129509990120"},{"key":"e_1_2_1_9_1","unstructured":"B. Caillaud P. Darondeau L. H\u00e9lou\u00ebt and G. Lesventes. 2000. HMSCs en tant que Sp\u00e9cifications Partielles et Leurs Compl\u00e9tions Dans Les R\u00e9seaux de Petri. RR-3970. INRIA.  B. Caillaud P. Darondeau L. H\u00e9lou\u00ebt and G. Lesventes. 2000. HMSCs en tant que Sp\u00e9cifications Partielles et Leurs Compl\u00e9tions Dans Les R\u00e9seaux de Petri. RR-3970. INRIA."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.3233\/JCS-2010-0400"},{"key":"e_1_2_1_11_1","volume-title":"Foundations of Security Analysis and Design (LNCS)","volume":"2171","author":"Focardi R.","unstructured":"R. Focardi and R. Gorrieri . 2001. Classification of security properties (Part I: Information flow) . In Foundations of Security Analysis and Design (LNCS) , Vol. 2171 . Springer-Vale, 331--396. R. Focardi and R. Gorrieri. 2001. Classification of security properties (Part I: Information flow). In Foundations of Security Analysis and Design (LNCS), Vol. 2171. Springer-Vale, 331--396."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45187-7_21"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.1982.10014"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23082-0_5"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10626-013-0158-2"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/794200.795152"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/647540.730014"},{"key":"e_1_2_1_19_1","volume-title":"Proc. Int. Workshop on Parallel and Distributed Algorithms. 215--226","author":"Mattern F.","year":"1988","unstructured":"F. Mattern . 1988 . Time and global states of distributed systems . In Proc. Int. Workshop on Parallel and Distributed Algorithms. 215--226 . F. Mattern. 1988. Time and global states of distributed systems. In Proc. Int. Workshop on Parallel and Distributed Algorithms. 215--226."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/645728.667694"},{"volume-title":"Proc. of 2nd Workshop on SDL and MSC (SAM\u201900)","author":"Muscholl A.","key":"e_1_2_1_21_1","unstructured":"A. Muscholl and D. Peled . 2000. Analyzing message sequence charts . In Proc. of 2nd Workshop on SDL and MSC (SAM\u201900) . 3--17. A. Muscholl and D. Peled. 2000. Analyzing message sequence charts. In Proc. of 2nd Workshop on SDL and MSC (SAM\u201900). 3--17."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30555-2_32"},{"key":"e_1_2_1_23_1","unstructured":"J. Rushby. 1992. Noninterference Transitivity and Channel-control Security Policies. Technical Report CSL-92-02. SRI International.  J. Rushby. 1992. Noninterference Transitivity and Channel-control Security Policies. Technical Report CSL-92-02. SRI International."}],"container-title":["ACM Transactions on Embedded Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2984639","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2984639","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:39:58Z","timestamp":1750217998000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2984639"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,19]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,5,31]]}},"alternative-id":["10.1145\/2984639"],"URL":"https:\/\/doi.org\/10.1145\/2984639","relation":{},"ISSN":["1539-9087","1558-3465"],"issn-type":[{"type":"print","value":"1539-9087"},{"type":"electronic","value":"1558-3465"}],"subject":[],"published":{"date-parts":[[2016,12,19]]},"assertion":[{"value":"2016-02-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-08-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-12-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}