{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:51:52Z","timestamp":1750308712883,"version":"3.41.0"},"reference-count":24,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2012,10,1]],"date-time":"2012-10-01T00:00:00Z","timestamp":1349049600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Comput. Logic"],"published-print":{"date-parts":[[2012,10]]},"abstract":"<jats:p>We develop a game semantics for process algebra with two interacting agents. The purpose of our semantics is to make manifest the role of knowledge and information flow in the interactions between agents and to control the information available to interacting agents. We define games and strategies on process algebras, so that two agents interacting according to their strategies determine the execution of the process, replacing the traditional scheduler. We show that different restrictions on strategies represent different amounts of information being available to a scheduler. We also show that a certain class of strategies corresponds to the syntactic schedulers of Chatzikokolakis and Palamidessi, which were developed to overcome problems with traditional schedulers modelling interaction. The restrictions on these strategies have an explicit epistemic flavour.<\/jats:p>","DOI":"10.1145\/2362355.2362356","type":"journal-article","created":{"date-parts":[[2012,10,22]],"date-time":"2012-10-22T18:18:24Z","timestamp":1350929904000},"page":"1-35","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Epistemic Strategies and Games on Concurrent Processes"],"prefix":"10.1145","volume":"13","author":[{"given":"Konstantinos","family":"Chatzikokolakis","sequence":"first","affiliation":[{"name":"Ecole Polytechnique, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sophia","family":"Knight","sequence":"additional","affiliation":[{"name":"Ecole Polytechnique, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Catuscia","family":"Palamidessi","sequence":"additional","affiliation":[{"name":"Ecole Polytechnique, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prakash","family":"Panangaden","sequence":"additional","affiliation":[{"name":"McGill University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,10]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/360204.360213"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.2307\/2275407"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2000.2930"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.06.008"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02138-1_12"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2009.06.006"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2007.07.003"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/3266641.3266675"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/647851.737394"},{"key":"e_1_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Dechesne F. Mousavi M. and Orzan S . 2007 . Operational and epistemic approaches to protocol analysis: Bridging the gap. In Proceedings of the 14th International Conference on Logic for Programming Artificial Intelligence and Reasoning (LPAR\u201907). N. Dershowitz and A. Voronkov Eds. Lecture Notes in Computer Science vol. 4790 Springer 226--241. Dechesne F. Mousavi M. and Orzan S. 2007. Operational and epistemic approaches to protocol analysis: Bridging the gap. In Proceedings of the 14th International Conference on Logic for Programming Artificial Intelligence and Reasoning (LPAR\u201907) . N. Dershowitz and A. Voronkov Eds. Lecture Notes in Computer Science vol. 4790 Springer 226--241.","DOI":"10.1007\/978-3-540-75560-9_18"},{"key":"e_1_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Fagin R. Halpern J. Y. Moses Y. and Vardi M. Y. 1995. Reasoning about Knowledge. MIT Press. Fagin R. Halpern J. Y. Moses Y. and Vardi M. Y. 1995. Reasoning about Knowledge. MIT Press.","DOI":"10.7551\/mitpress\/5803.001.0001"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/800222.806735"},{"key":"e_1_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Hennessy M. and Milner R . 1980 . On observing nondeterminism and concurrency. In Proceedings of the 7th Colloquium on Automata Languages and Programming. J. de Bakker and J. van Leeuwen Eds. Lecture Notes in Computer Science vol. 85 Springer 299--309. Hennessy M. and Milner R. 1980. On observing nondeterminism and concurrency. In Proceedings of the 7th Colloquium on Automata Languages and Programming . J. de Bakker and J. van Leeuwen Eds. Lecture Notes in Computer Science vol. 85 Springer 299--309.","DOI":"10.1007\/3-540-10003-2_79"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2455.2460"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/1297689.1297694"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2000.2917"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.3166\/jancl.19.489-516"},{"volume-title":"Proceedings of the International Syposium on Methodologies for Intelligent Systems. 1--8.","author":"Krasucki P.","key":"e_1_2_1_18_1","unstructured":"Krasucki , P. , Ndjatou , G. , and Parikh , R . 1990. Probabilistic knowledge and probabilistic common knowledge . In Proceedings of the International Syposium on Methodologies for Intelligent Systems. 1--8. Krasucki, P., Ndjatou, G., and Parikh, R. 1990. Probabilistic knowledge and probabilistic common knowledge. In Proceedings of the International Syposium on Methodologies for Intelligent Systems. 1--8."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1002\/malq.19630090502"},{"key":"e_1_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Mohalik S. and Walukiewicz I . 2003 . Distributed games. In Proceedings of the Conference on Foundations of Software Technology and Theoretical Computer Science. P. Pandya and J. Radhakrishnan Eds. Lecture Notes in Computer Science vol. 2914 Springer 338--351. Mohalik S. and Walukiewicz I. 2003. Distributed games. In Proceedings of the Conference on Foundations of Software Technology and Theoretical Computer Science. P. Pandya and J. Radhakrishnan Eds. Lecture Notes in Computer Science vol. 2914 Springer 338--351.","DOI":"10.1007\/978-3-540-24597-1_29"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1755020311000190"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/646646.699200"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"e_1_2_1_25_1","unstructured":"van Benthem J. 1983. Modal Logic and Classical Logic. Bibliopolis. van Benthem J. 1983. Modal Logic and Classical Logic . Bibliopolis."}],"container-title":["ACM Transactions on Computational Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2362355.2362356","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2362355.2362356","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:14:16Z","timestamp":1750277656000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2362355.2362356"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,10]]}},"alternative-id":["10.1145\/2362355.2362356"],"URL":"https:\/\/doi.org\/10.1145\/2362355.2362356","relation":{},"ISSN":["1529-3785","1557-945X"],"issn-type":[{"type":"print","value":"1529-3785"},{"type":"electronic","value":"1557-945X"}],"subject":[],"published":{"date-parts":[[2012,10]]},"assertion":[{"value":"2010-05-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2011-09-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2012-10-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}