{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T03:06:23Z","timestamp":1725505583857},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540784975"},{"type":"electronic","value":"9783540784999"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78499-9_8","type":"book-chapter","created":{"date-parts":[[2008,4,1]],"date-time":"2008-04-01T23:02:25Z","timestamp":1207090945000},"page":"97-111","source":"Crossref","is-referenced-by-count":8,"title":["The \u03c9-Regular Post Embedding Problem"],"prefix":"10.1007","author":[{"given":"P.","family":"Chambart","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ph.","family":"Schnoebelen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1089","DOI":"10.1007\/11523468_88","volume-title":"Automata, Languages and Programming","author":"P.A. Abdulla","year":"2005","unstructured":"Abdulla, P.A., Deneux, J., Ouaknine, J., Worrell, J.: Decidability and complexity results for timed automata via channel machines. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 1089\u20131101. Springer, Heidelberg (2005)"},{"issue":"1","key":"8_CR2","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1006\/inco.1996.0083","volume":"130","author":"P.A. Abdulla","year":"1996","unstructured":"Abdulla, P.A., Jonsson, B.: Undecidable verification problems for programs with unreliable channels. Information and Computation\u00a0130(1), 71\u201390 (1996)","journal-title":"Information and Computation"},{"issue":"2","key":"8_CR3","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1006\/inco.1996.0053","volume":"127","author":"P.A. Abdulla","year":"1996","unstructured":"Abdulla, P.A., Jonsson, B.: Verifying programs with unreliable channels. Information and Computation\u00a0127(2), 91\u2013101 (1996)","journal-title":"Information and Computation"},{"issue":"2","key":"8_CR4","first-page":"70","volume":"9","author":"R. Amadio","year":"2002","unstructured":"Amadio, R., Meyssonnier, C.: On decidability of the control reachability problem in the asynchronous \u03c0-calculus. Nordic Journal of Computing\u00a09(2), 70\u2013101 (2002)","journal-title":"Nordic Journal of Computing"},{"key":"8_CR5","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/11916277_24","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"C. Baier","year":"2006","unstructured":"Baier, C., Bertrand, N., Schnoebelen, P.: On computing fixpoints in well-structured regular model checking, with applications to lossy channel systems. In: Hermann, M., Voronkov, A. (eds.) LPAR 2006. LNCS (LNAI), vol.\u00a04246, pp. 347\u2013361. Springer, Heidelberg (2006)"},{"key":"8_CR6","unstructured":"Chambart, P.: Canaux fiables et non-fiables: fronti\u00e8res de la d\u00e9cidabilit\u00e9. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France (September 2007)"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-540-77050-3_22","volume-title":"FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science","author":"P. Chambart","year":"2007","unstructured":"Chambart, P., Schnoebelen, P.: Post embedding problem is not primitive recursive, with applications to channel systems. In: Arvind, V., Prasad, S. (eds.) FSTTCS 2007. LNCS, vol.\u00a04855, pp. 265\u2013276. Springer, Heidelberg (2007)"},{"issue":"1\u20132","key":"8_CR8","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1017\/S1471068406002821","volume":"7","author":"G. Delzanno","year":"2007","unstructured":"Delzanno, G.: Constraint-based automatic verification of abstract models of multithreaded programs. Theory and Practice of Logic Programming\u00a07(1\u20132), 67\u201391 (2007)","journal-title":"Theory and Practice of Logic Programming"},{"key":"8_CR9","first-page":"17","volume-title":"Proc. LICS 2006","author":"S. Demri","year":"2006","unstructured":"Demri, S., Lazi\u0107, R.: LTL with the freeze quantifier and register automata. In: Proc. LICS 2006, pp. 17\u201326. IEEE Comp. Soc. Press, Los Alamitos (2006)"},{"issue":"1","key":"8_CR10","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/0304-3975(85)90216-6","volume":"38","author":"A. Finkel","year":"1985","unstructured":"Finkel, A.: Une g\u00e9n\u00e9ralisation des th\u00e9or\u00e8mes de Higman et de Simon aux mots infinis. Theoretical Computer Science\u00a038(1), 137\u2013142 (1985)","journal-title":"Theoretical Computer Science"},{"issue":"1\u20133","key":"8_CR11","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/j.apal.2006.01.001","volume":"142","author":"D. Gabelaia","year":"2006","unstructured":"Gabelaia, D., Kurucz, A., Wolter, F., Zakharyaschev, M.: Non-primitive recursive decidability of products of modal logics with expanding domains. Annals of Pure and Applied Logic\u00a0142(1\u20133), 245\u2013268 (2006)","journal-title":"Annals of Pure and Applied Logic"},{"key":"8_CR12","first-page":"131","volume-title":"Proc. LICS 2007","author":"M. Jurdzi\u0144ski","year":"2007","unstructured":"Jurdzi\u0144ski, M., Lazi\u0107, R.: Alternation-free modal mu-calculus for data trees. In: Proc. LICS 2007, pp. 131\u2013140. IEEE Comp. Soc. Press, Los Alamitos (2007)"},{"key":"8_CR13","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1007\/11532231_14","volume-title":"Automated Deduction \u2013 CADE-20","author":"B. Konev","year":"2005","unstructured":"Konev, B., Wolter, F., Zakharyaschev, M.: Temporal logics over transitive states. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS (LNAI), vol.\u00a03632, pp. 182\u2013203. Springer, Heidelberg (2005)"},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1016\/S1570-2464(07)80018-8","volume-title":"Handbook of Modal Logics","author":"A. Kurucz","year":"2006","unstructured":"Kurucz, A.: Combining modal logics. In: Blackburn, P., van Benthem, J., Wolter, F. (eds.) Handbook of Modal Logics, vol.\u00a03, ch. 15, pp. 869\u2013926. Elsevier, Amsterdam (2006)"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1007\/978-3-540-31982-5_16","volume-title":"Foundations of Software Science and Computational Structures","author":"S. Lasota","year":"2005","unstructured":"Lasota, S., Walukiewicz, I.: Alternating timed automata. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol.\u00a03441, pp. 250\u2013265. Springer, Heidelberg (2005)"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/978-3-540-73094-1_19","volume-title":"Petri Nets and Other Models of Concurrency \u2013 ICATPN 2007","author":"R. Lazi\u0107","year":"2007","unstructured":"Lazi\u0107, R., Newcomb, T., Ouaknine, J., Roscoe, A.W., Worrell, J.: Nets with tokens which carry data. In: Kleijn, J., Yakovlev, A. (eds.) ICATPN 2007. LNCS, vol.\u00a04546, pp. 301\u2013320. Springer, Heidelberg (2007)"},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/11690634_15","volume-title":"Foundations of Software Science and Computation Structures","author":"J. Ouaknine","year":"2006","unstructured":"Ouaknine, J., Worrell, J.: On metric temporal logic and faulty Turing machines. In: Aceto, L., Ing\u00f3lfsd\u00f3ttir, A. (eds.) FOSSACS 2006. LNCS, vol.\u00a03921, pp. 217\u2013230. Springer, Heidelberg (2006)"},{"issue":"1","key":"8_CR18","first-page":"1","volume":"3","author":"J. Ouaknine","year":"2007","unstructured":"Ouaknine, J., Worrell, J.: On the decidability and complexity of Metric Temporal Logic over finite words. Logical Methods in Comp. Science\u00a03(1), 1\u201327 (2007)","journal-title":"Logical Methods in Comp. Science"},{"key":"8_CR19","first-page":"207","volume-title":"Proc. PSTV 1987","author":"J.K. Pachl","year":"1987","unstructured":"Pachl, J.K.: Protocol description and analysis based on a state transition model with channel expressions. In: Proc. PSTV 1987, pp. 207\u2013219. North-Holland, Amsterdam (1987)"},{"issue":"5","key":"8_CR20","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0020-0190(01)00337-4","volume":"83","author":"P.. Schnoebelen","year":"2002","unstructured":"Schnoebelen, P.: Verifying lossy channel systems has nonprimitive recursive complexity. Information Processing Letters\u00a083(5), 251\u2013261 (2002)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78499-9_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:11:38Z","timestamp":1619521898000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78499-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540784975","9783540784999"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78499-9_8","relation":{},"subject":[]}}