{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:38:23Z","timestamp":1753889903625,"version":"3.41.2"},"reference-count":1,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2012,9,20]],"date-time":"2012-09-20T00:00:00Z","timestamp":1348099200000},"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>We address the verification problem of ordered multi-pushdown automata: A\nmulti-stack extension of pushdown automata that comes with a constraint on\nstack transitions such that a pop can only be performed on the first non-empty\nstack. First, we show that the emptiness problem for ordered multi-pushdown\nautomata is in 2ETIME. Then, we prove that, for an ordered multi-pushdown\nautomata, the set of all predecessors of a regular set of configurations is an\neffectively constructible regular set. We exploit this result to solve the\nglobal model-checking which consists in computing the set of all configurations\nof an ordered multi-pushdown automaton that satisfy a given w-regular property\n(expressible in linear-time temporal logics or the linear-time \\mu-calculus).\nAs an immediate consequence, we obtain an 2ETIME upper bound for the\nmodel-checking problem of w-regular properties for ordered multi-pushdown\nautomata (matching its lower-bound).<\/jats:p>","DOI":"10.2168\/lmcs-8(3:20)2012","type":"journal-article","created":{"date-parts":[[2013,11,29]],"date-time":"2013-11-29T08:17:46Z","timestamp":1385713066000},"source":"Crossref","is-referenced-by-count":10,"title":["Model-Checking of Ordered Multi-Pushdown Automata"],"prefix":"10.46298","volume":"Volume 8, Issue 3","author":[{"given":"Mohamed Faouzi","family":"Atig","sequence":"first","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2012,9,20]]},"reference":[{"key":"606:not-found"}],"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/871\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/871\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T19:58:15Z","timestamp":1681243095000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/871"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,20]]},"references-count":1,"URL":"https:\/\/doi.org\/10.2168\/lmcs-8(3:20)2012","relation":{"is-same-as":[{"id-type":"arxiv","id":"1209.1916","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1209.1916","asserted-by":"subject"}],"is-referenced-by":[{"id-type":"arxiv","id":"1405.5593","asserted-by":"subject"},{"id-type":"doi","id":"10.4204\/eptcs.151.1","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arxiv.1405.5593","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2012,9,20]]},"article-number":"871"}}