{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T20:57:39Z","timestamp":1725742659719},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642401831"},{"type":"electronic","value":"9783642401848"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40184-8_23","type":"book-chapter","created":{"date-parts":[[2013,7,22]],"date-time":"2013-07-22T21:50:56Z","timestamp":1374529856000},"page":"319-333","source":"Crossref","is-referenced-by-count":4,"title":["The Power of Priority Channel Systems"],"prefix":"10.1007","author":[{"given":"Christoph","family":"Haase","sequence":"first","affiliation":[]},{"given":"Sylvain","family":"Schmitz","sequence":"additional","affiliation":[]},{"given":"Philippe","family":"Schnoebelen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","unstructured":"Abdulla, P.A., Atig, M.F., Cederberg, J.: Timed lossy channel systems. In: FST&TCS 2012. LIPIcs, vol.\u00a018, pp. 374\u2013386. Leibniz-Zentrum f\u00fcr Informatik (2012)"},{"issue":"1-2","key":"23_CR2","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1006\/inco.1999.2843","volume":"160","author":"P.A. Abdulla","year":"2000","unstructured":"Abdulla, P.A., \u010cer\u0101ns, K., Jonsson, B., Tsay, Y.K.: Algorithmic analysis of programs with well quasi-ordered domains. Inform. and Comput.\u00a0160(1-2), 109\u2013127 (2000)","journal-title":"Inform. and Comput."},{"key":"23_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"2","key":"23_CR4","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. Inform. and Comput.\u00a0127(2), 91\u2013101 (1996)","journal-title":"Inform. and Comput."},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Bansal, K., Koskinen, E., Wies, T., Zufferey, D.: Structural counter abstraction. In: Piterman, N., Smolka, S.A. (eds.) TACAS 2013. LNCS, vol.\u00a07795, pp. 62\u201377. Springer, Heidelberg (2013)","DOI":"10.1007\/978-3-642-36742-7_5"},{"issue":"3","key":"23_CR6","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1023\/A:1008719024240","volume":"14","author":"B. Boigelot","year":"1999","unstructured":"Boigelot, B., Godefroid, P.: Symbolic verification of communication protocols with infinite state spaces using QDDs. Form. Methods in Syst. Des.\u00a014(3), 237\u2013255 (1999)","journal-title":"Form. Methods in Syst. Des."},{"issue":"1-2","key":"23_CR7","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0304-3975(99)00033-X","volume":"221","author":"A. Bouajjani","year":"1999","unstructured":"Bouajjani, A., Habermehl, P.: Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations. Theor. Comput. Sci.\u00a0221(1-2), 211\u2013250 (1999)","journal-title":"Theor. Comput. Sci."},{"issue":"4-6","key":"23_CR8","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/s00165-012-0234-7","volume":"24","author":"P. Bouyer","year":"2012","unstructured":"Bouyer, P., Markey, N., Ouaknine, J., Schnoebelen, P., Worrell, J.: On termination and invariance for faulty channel machines. Form. Asp. Comput.\u00a024(4-6), 595\u2013607 (2012)","journal-title":"Form. Asp. Comput."},{"issue":"2","key":"23_CR9","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.ic.2005.05.006","volume":"202","author":"G. C\u00e9c\u00e9","year":"2005","unstructured":"C\u00e9c\u00e9, G., Finkel, A.: Verification of programs with half-duplex communication. Inform. and Comput.\u00a0202(2), 166\u2013190 (2005)","journal-title":"Inform. and Comput."},{"issue":"1","key":"23_CR10","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1006\/inco.1996.0003","volume":"124","author":"G. C\u00e9c\u00e9","year":"1996","unstructured":"C\u00e9c\u00e9, G., Finkel, A., Purushothaman Iyer, S.: Unreliable channels are easier to verify than perfect channels. Inform. and Comput.\u00a0124(1), 20\u201331 (1996)","journal-title":"Inform. and Comput."},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Chambart, P., Schnoebelen, P.: The ordinal recursive complexity of lossy channel systems. In: LICS\u00a02008, pp. 205\u2013216. IEEE Press (2008)","DOI":"10.1109\/LICS.2008.47"},{"key":"23_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-642-15375-4_22","volume-title":"CONCUR 2010 - Concurrency Theory","author":"G. Delzanno","year":"2010","unstructured":"Delzanno, G., Sangnier, A., Zavattaro, G.: Parameterized verification of ad hoc networks. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol.\u00a06269, pp. 313\u2013327. Springer, Heidelberg (2010)"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Fairtlough, M., Wainer, S.S.: Hierarchies of provably recursive functions. In: Handbook of Proof Theory, ch. III, pp. 149\u2013207. Elsevier (1998)","DOI":"10.1016\/S0049-237X(98)80018-9"},{"issue":"1-2","key":"23_CR14","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0304-3975(00)00102-X","volume":"256","author":"A. Finkel","year":"2001","unstructured":"Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere! Theor. Comput. Sci.\u00a0256(1-2), 63\u201392 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"23_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/978-3-540-88387-6_29","volume-title":"Automated Technology for Verification and Analysis","author":"B. Genest","year":"2008","unstructured":"Genest, B., Muscholl, A., Serre, O., Zeitoun, M.: Tree pattern rewriting systems. In: Cha, S(S.), Choi, J.-Y., Kim, M., Lee, I., Viswanathan, M. (eds.) ATVA 2008. LNCS, vol.\u00a05311, pp. 332\u2013346. Springer, Heidelberg (2008)"},{"key":"23_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/BFb0023872","volume-title":"Logical Foundations of Computer Science - Tver \u201992","author":"A. Gupta","year":"1992","unstructured":"Gupta, A.: A constructive proof that trees are well-quasi-ordered under minors. In: Nerode, A., Taitslin, M.A. (eds.) LFCS 1992. LNCS, vol.\u00a0620, pp. 174\u2013185. Springer, Heidelberg (1992)"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Haddad, S., Schmitz, S., Schnoebelen, P.: The ordinal-recursive complexity of timed-arc Petri nets, data nets, and other enriched nets. In: LICS 2012, pp. 355\u2013364. IEEE Press (2012)","DOI":"10.1109\/LICS.2012.46"},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"Kurucz, A.: Combining modal logics. In: Handbook of Modal Logics, ch. 15, pp. 869\u2013926. Elsevier (2006)","DOI":"10.1016\/S1570-2464(07)80018-8"},{"key":"23_CR19","doi-asserted-by":"crossref","unstructured":"Lasota, S., Walukiewicz, I.: Alternating timed automata. ACM Trans. Comput. Logic\u00a09(2) (2008)","DOI":"10.1145\/1342991.1342994"},{"key":"23_CR20","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF01967649","volume":"13","author":"M. L\u00f6b","year":"1970","unstructured":"L\u00f6b, M., Wainer, S.: Hierarchies of number theoretic functions. I. Arch. Math. Logic\u00a013, 39\u201351 (1970)","journal-title":"I. Arch. Math. Logic"},{"key":"23_CR21","doi-asserted-by":"crossref","unstructured":"Ossona de Mendez, P., Ne\u0161et\u0159il, J.: Sparsity, ch. 6. Bounded height trees and tree-depth, pp. 115\u2013144. Springer (2012)","DOI":"10.1007\/978-3-642-27875-4_6"},{"key":"23_CR22","series-title":"IFIP","first-page":"477","volume-title":"IFIP TCS 2008","author":"R. Meyer","year":"2008","unstructured":"Meyer, R.: On boundedness in depth in the \u03c0-calculus. In: Ausiello, G., Karhum\u00e4ki, J., Mauri, G., Ong, L. (eds.) IFIP TCS 2008. IFIP, vol.\u00a0273, pp. 477\u2013489. Springer, Boston (2008)"},{"issue":"1","key":"23_CR23","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. Logic. Meth. Logic. Meth. in Comput. Sci.\u00a03(1), 1\u201327 (2007)","journal-title":"Logic. Meth. in Comput. Sci."},{"key":"23_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/978-3-642-22012-8_35","volume-title":"Automata, Languages and Programming","author":"S. Schmitz","year":"2011","unstructured":"Schmitz, S., Schnoebelen, P.: Multiply-recursive upper bounds with Higman\u2019s lemma. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol.\u00a06756, pp. 441\u2013452. Springer, Heidelberg (2011)"},{"key":"23_CR25","unstructured":"Schmitz, S., Schnoebelen, P.: Algorithmic aspects of WQO theory. Lecture notes (2012), \n                    \n                      http:\/\/cel.archives-ouvertes.fr\/cel-00727025"},{"key":"23_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-642-15349-5_4","volume-title":"Reachability Problems","author":"P. Schnoebelen","year":"2010","unstructured":"Schnoebelen, P.: Lossy counter machines decidability cheat sheet. In: Ku\u010dera, A., Potapov, I. (eds.) RP 2010. LNCS, vol.\u00a06227, pp. 51\u201375. Springer, Heidelberg (2010)"},{"key":"23_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1007\/978-3-642-15155-2_54","volume-title":"Mathematical Foundations of Computer Science 2010","author":"P. Schnoebelen","year":"2010","unstructured":"Schnoebelen, P.: Revisiting Ackermann-hardness for lossy counter machines and reset Petri nets. In: Hlin\u011bn\u00fd, P., Ku\u010dera, A. (eds.) MFCS 2010. LNCS, vol.\u00a06281, pp. 616\u2013628. Springer, Heidelberg (2010)"},{"issue":"1","key":"23_CR28","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/BF02007558","volume":"25","author":"K. Sch\u00fctte","year":"1985","unstructured":"Sch\u00fctte, K., Simpson, S.G.: Ein in der reinen Zahlentheorie unbeweisbarer Satz \u00fcber endliche Folgen von nat\u00fcrlichen Zahlen. Arch. Math. Logic\u00a025(1), 75\u201389 (1985)","journal-title":"Arch. Math. Logic"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2013 \u2013 Concurrency Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40184-8_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T22:08:37Z","timestamp":1558303717000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40184-8_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642401831","9783642401848"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40184-8_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}