{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T15:11:14Z","timestamp":1726413074129},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,12,18]],"date-time":"2016-12-18T00:00:00Z","timestamp":1482019200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Max Planck Institute for Software Systems"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1007\/s00236-016-0290-1","type":"journal-article","created":{"date-parts":[[2016,12,18]],"date-time":"2016-12-18T02:51:54Z","timestamp":1482029514000},"page":"153-189","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Reachability analysis of reversal-bounded automata on series\u2013parallel graphs"],"prefix":"10.1007","volume":"55","author":[{"given":"Rayna","family":"Dimitrova","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rupak","family":"Majumdar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,12,18]]},"reference":[{"key":"290_CR1","doi-asserted-by":"publisher","unstructured":"Abdulla, P.A., Jonsson, B., Nilsson, M., Saksena, M.: A survey of regular model checking. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004\u2014Concurrency Theory, 15th International Conference, London, UK, 31 Aug\u20133 Sept 2004, Proceedings, Lecture Notes in Computer Science, vol. 3170, pp. 35\u201348. Springer (2004). doi:\n                        10.1007\/978-3-540-28644-8_3","DOI":"10.1007\/978-3-540-28644-8_3"},{"key":"290_CR2","doi-asserted-by":"publisher","unstructured":"Alur, R., Yannakakis, M.: Model checking of message sequence charts. In: CONCUR\u201999: Concurrency Theory, 10th International Conference, Eindhoven, The Netherlands, 24\u201327 Aug 1999, Proceedings, Lecture Notes in Computer Science, vol. 1664, pp. 114\u2013129. Springer (1999). doi:\n                        10.1007\/3-540-48320-9_10","DOI":"10.1007\/3-540-48320-9_10"},{"key":"290_CR3","doi-asserted-by":"publisher","unstructured":"Baldan, P., Corradini, A., K\u00f6nig, B.: A static analysis technique for graph transformation systems. In: Proceedings of CONCUR\u201901, LNCS, vol. 2154, pp. 381\u2013395. Springer (2001). doi:\n                        10.1007\/3-540-44685-0_26","DOI":"10.1007\/3-540-44685-0_26"},{"key":"290_CR4","doi-asserted-by":"publisher","unstructured":"Baldan, P., Corradini, A., K\u00f6nig, B., Lluch-Lafuente, A.: A temporal graph logic for verification of graph transformation systems. In: WADT, LNCS, vol. 4409, pp. 1\u201320. Springer (2006). doi:\n                        10.1007\/978-3-540-71998-4_1","DOI":"10.1007\/978-3-540-71998-4_1"},{"key":"290_CR5","doi-asserted-by":"publisher","unstructured":"Bertrand, N., Delzanno, G., K\u00f6nig, B., Sangnier, A., St\u00fcckrath, J.: On the decidability status of reachability and coverability in graph transformation systems. In: RTA, LIPIcs, vol.\u00a015 (2012). doi:\n                        10.4230\/LIPIcs.RTA.2012.101","DOI":"10.4230\/LIPIcs.RTA.2012.101"},{"key":"290_CR6","doi-asserted-by":"publisher","unstructured":"Courcelle, B., Engelfriet, J.: Graph Structure and Monadic Second-Order Logic\u2014A Language-Theoretic Approach, vol. 138. Cambridge University Press (2012). doi:\n                        10.1017\/CBO9780511977619","DOI":"10.1017\/CBO9780511977619"},{"key":"290_CR7","doi-asserted-by":"crossref","unstructured":"Diekert, V., Rozenberg, G.: The Book of Traces. World Scientific (1995)","DOI":"10.1142\/2563"},{"key":"290_CR8","doi-asserted-by":"publisher","unstructured":"Dimitrova, R., Majumdar, R.: Reachability analysis of reversal-bounded automata on series-parallel graphs. In: Esparza, J., Tronci, E. (eds.) Proceedings Sixth International Symposium on Games, Automata, Logics and Formal Verification, GandALF 2015, Genoa, Italy, 21\u201322 Sept 2015. EPTCS, vol. 193, pp. 100\u2013114 (2015). doi:\n                        10.4204\/EPTCS.193.8","DOI":"10.4204\/EPTCS.193.8"},{"key":"290_CR9","doi-asserted-by":"publisher","unstructured":"Drewes, F., Kreowski, H.-J., Habel, A.: Hyperedge replacement graph grammars. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformation. World Scientific Publishing Co., Inc., pp. 95\u2013162 (1997). doi:\n                        10.1142\/9789812384720_0002","DOI":"10.1142\/9789812384720_0002"},{"key":"290_CR10","doi-asserted-by":"publisher","unstructured":"Engelfriet, J., Rozenberg, G.: In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformation, chap. Node Replacement Graph Grammars, pp. 1\u201394. World Scientific Publishing Co., Inc. (1997). doi:\n                        10.1142\/9789812384720_0001","DOI":"10.1142\/9789812384720_0001"},{"key":"290_CR11","doi-asserted-by":"publisher","unstructured":"Esparza, J., Ganty, P., Majumdar, R.: A perfect model for bounded verification. In: LICS 2012, pp. 285\u2013294. IEEE Computer Society (2012). doi:\n                        10.1109\/LICS.2012.39","DOI":"10.1109\/LICS.2012.39"},{"issue":"3","key":"290_CR12","doi-asserted-by":"publisher","first-page":"9:1","DOI":"10.1145\/2629644","volume":"36","author":"J Esparza","year":"2014","unstructured":"Esparza, J., Ganty, P., Poch, T.: Pattern-based verification for multithreaded programs. ACM Trans. Program. Lang. Syst. 36(3), 9:1\u20139:29 (2014). doi:\n                        10.1145\/2629644","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"2","key":"290_CR13","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/0022-0000(81)90028-3","volume":"22","author":"E Gurari","year":"1981","unstructured":"Gurari, E., Ibarra, O.: The complexity of decision problems for finite-turn multicounter machines. J. Comput. Syst. Sci. 22(2), 220\u2013229 (1981). doi:\n                        10.1016\/0022-0000(81)90028-3","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"290_CR14","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1109\/SFCS.1981.52","volume":"29","author":"E Gurari","year":"1982","unstructured":"Gurari, E., Ibarra, O.: Two-way counter machines and Diophantine equations. J. ACM 29(3), 863\u2013873 (1982). doi:\n                        10.1109\/SFCS.1981.52","journal-title":"J. ACM"},{"key":"290_CR15","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-8(3:23)2012","author":"A Heu\u00dfner","year":"2012","unstructured":"Heu\u00dfner, A., Leroux, J., Muscholl, A., Sutre, G.: Reachability analysis of communicating pushdown systems. Log. Methods Comput. Sci. (2012). doi:\n                        10.2168\/LMCS-8(3:23)2012","journal-title":"Log. Methods Comput. Sci."},{"key":"290_CR16","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"JE Hopcroft","year":"2000","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation, 2nd edn. Addison-Wesley, Boston (2000)","edition":"2"},{"issue":"1","key":"290_CR17","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/322047.322058","volume":"25","author":"OH Ibarra","year":"1978","unstructured":"Ibarra, O.H.: Reversal-bounded multicounter machines and their decision problems. J. ACM 25(1), 116\u2013133 (1978). doi:\n                        10.1145\/322047.322058","journal-title":"J. ACM"},{"key":"290_CR18","doi-asserted-by":"publisher","unstructured":"Ibarra, O.H.: Automata with reversal-bounded counters: a survey. In: DCFS 2014, pp. 5\u201322. Springer (2014). doi:\n                        10.1007\/978-3-319-09704-6_2","DOI":"10.1007\/978-3-319-09704-6_2"},{"key":"290_CR19","doi-asserted-by":"publisher","unstructured":"K\u00f6nig, B., Kozioura, V.: Counterexample-guided abstraction refinement for the analysis of graph transformation systems. In: TACAS, LNCS, vol. 3920, pp. 197\u2013211. Springer (2006). doi:\n                        10.1007\/11691372_13","DOI":"10.1007\/11691372_13"},{"key":"290_CR20","doi-asserted-by":"publisher","unstructured":"Lodaya, K., Weil, P.: Series-parallel posets: Algebra, automata and languages. In: Morvan, M., Meinel, C., Krob, D. (eds.) STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, 25\u201327 Feb 1998, Proceedings, Lecture Notes in Computer Science, vol. 1373, pp. 555\u2013565. Springer (1998). doi:\n                        10.1007\/BFb0028590","DOI":"10.1007\/BFb0028590"},{"key":"290_CR21","doi-asserted-by":"publisher","unstructured":"Madhusudan, P., Parlato, G.: The tree width of auxiliary storage. In: Ball, T., Sagiv, M. (eds.) Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2011, Austin, TX, USA, 26\u201328 Jan 2011, pp. 283\u2013294. ACM (2011). doi:\n                        10.1145\/1926385.1926419","DOI":"10.1145\/1926385.1926419"},{"issue":"2","key":"290_CR22","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1147\/rd.32.0114","volume":"3","author":"MO Rabin","year":"1959","unstructured":"Rabin, M.O., Scott, D.: Finite automata and their decision problems. IBM J. Res. Dev. 3(2), 114\u2013125 (1959). doi:\n                        10.1147\/rd.32.0114","journal-title":"IBM J. Res. Dev."},{"key":"290_CR23","doi-asserted-by":"publisher","unstructured":"Rensink, A.: Explicit state model checking for graph grammars. In: Concurrency, Graphs and Models, LNCS, vol. 5065, pp. 114\u2013132. Springer (2008). doi:\n                        10.1007\/978-3-540-68679-8_8","DOI":"10.1007\/978-3-540-68679-8_8"},{"key":"290_CR24","doi-asserted-by":"publisher","unstructured":"Rosenberg, A.L.: On multi-head finite automata. In: 6th Annual Symposium on Switching Circuit Theory and Logical Design, pp. 221\u2013228. IEEE Computer Society (1965). doi:\n                        10.1109\/FOCS.1965.19","DOI":"10.1109\/FOCS.1965.19"},{"key":"290_CR25","doi-asserted-by":"publisher","unstructured":"Vardi, M.: From l\u00f6wenheim to PSL and SVA. In: Language, Culture, Computation. Computing\u2014Theory and Technology\u2014Essays Dedicated to Yaacov Choueka on the Occasion of His 75th Birthday, Part I, Lecture Notes in Computer Science, vol. 8001, pp. 78\u2013102. Springer (2014). doi:\n                        10.1007\/978-3-642-45321-2_5","DOI":"10.1007\/978-3-642-45321-2_5"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-016-0290-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-016-0290-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-016-0290-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,2,24]],"date-time":"2018-02-24T07:26:48Z","timestamp":1519457208000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-016-0290-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,18]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,3]]}},"alternative-id":["290"],"URL":"https:\/\/doi.org\/10.1007\/s00236-016-0290-1","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"type":"print","value":"0001-5903"},{"type":"electronic","value":"1432-0525"}],"subject":[],"published":{"date-parts":[[2016,12,18]]}}}