{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:39:40Z","timestamp":1753889980320,"version":"3.41.2"},"reference-count":1,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2013,6,28]],"date-time":"2013-06-28T00:00:00Z","timestamp":1372377600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>The model checking problem for propositional dynamic logic (PDL) over message\nsequence charts (MSCs) and communicating finite state machines (CFMs) asks,\ngiven a channel bound $B$, a PDL formula $\\varphi$ and a CFM $\\mathcal{C}$,\nwhether every existentially $B$-bounded MSC $M$ accepted by $\\mathcal{C}$\nsatisfies $\\varphi$. Recently, it was shown that this problem is\nPSPACE-complete.\n  In the present work, we consider CRPDL over MSCs which is PDL equipped with\nthe operators converse and repeat. The former enables one to walk back and\nforth within an MSC using a single path expression whereas the latter allows to\nexpress that a path expression can be repeated infinitely often. To solve the\nmodel checking problem for this logic, we define message sequence chart\nautomata (MSCAs) which are multi-way alternating parity automata walking on\nMSCs. By exploiting a new concept called concatenation states, we are able to\ninductively construct, for every CRPDL formula $\\varphi$, an MSCA precisely\naccepting the set of models of $\\varphi$. As a result, we obtain that the model\nchecking problem for CRPDL and CFMs is still in PSPACE.<\/jats:p>","DOI":"10.2168\/lmcs-9(2:12)2013","type":"journal-article","created":{"date-parts":[[2013,11,29]],"date-time":"2013-11-29T13:39:25Z","timestamp":1385732365000},"source":"Crossref","is-referenced-by-count":1,"title":["Propositional Dynamic Logic with Converse and Repeat for Message-Passing Systems"],"prefix":"10.46298","volume":"Volume 9, Issue 2","author":[{"given":"Roy","family":"Mennicke","sequence":"first","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2013,6,28]]},"reference":[{"key":"823:not-found"}],"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/855\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/855\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T19:57:40Z","timestamp":1681243060000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/855"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,28]]},"references-count":1,"URL":"https:\/\/doi.org\/10.2168\/lmcs-9(2:12)2013","relation":{"is-same-as":[{"id-type":"arxiv","id":"1306.3059","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1306.3059","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2013,6,28]]},"article-number":"855"}}