{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T20:21:54Z","timestamp":1751660514848},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2016,1,21]],"date-time":"2016-01-21T00:00:00Z","timestamp":1453334400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Softw Tools Technol Transfer"],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1007\/s10009-015-0411-0","type":"journal-article","created":{"date-parts":[[2016,1,21]],"date-time":"2016-01-21T18:18:40Z","timestamp":1453400320000},"page":"517-534","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Counting dynamically synchronizing processes"],"prefix":"10.1007","volume":"18","author":[{"given":"Zeinab","family":"Ganjei","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ahmed","family":"Rezine","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petru","family":"Eles","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zebo","family":"Peng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,1,21]]},"reference":[{"key":"411_CR1","doi-asserted-by":"crossref","unstructured":"Abdulla, P., Annichini, A., Bensalem, S., Bouajjani, A., Habermehl, P., Lakhnech, Y.: Verification of infinite-state systems by combining abstraction and reachability analysis. In: Halbwachs, N., Peled, D. (eds.) Computer Aided Verification, Volume of 1633 Lecture Notes in Computer Science, pp. 146-159. Springer, Berlin (1999)","DOI":"10.1007\/3-540-48683-6_15"},{"key":"411_CR2","doi-asserted-by":"crossref","unstructured":"Abdulla, P., Haziza, F., Holk, L.: All for the price of few. In: Giacobazzi, R., Berdine, J., Mastroeni, I. (eds.) Verification, Model Checking, and Abstract Interpretation, Volume of 7737 Lecture Notes in Computer Science, pp. 476-495. Springer, Berlin (2013)","DOI":"10.1007\/978-3-642-35873-9_28"},{"key":"411_CR3","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., \u010cer\u0101ns, K., Jonsson, B., Tsay, Y.-K.: General decidability theorems for infinite-state systems. In: Proceedings of the LICS \u201996, 11th IEEE International Symposium on Logic in Computer Science, pp. 313-321 (1996)","DOI":"10.1109\/LICS.1996.561359"},{"key":"411_CR4","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1006\/inco.1999.2843","volume":"160","author":"PA Abdulla","year":"2000","unstructured":"Abdulla, P.A., \u010cer\u0101ns, K., Jonsson, B., Tsay, Y.-K.: Algorithmic analysis of programs with well quasi-ordered domains. Inf. Comput. 160, 109\u2013127 (2000)","journal-title":"Inf. Comput."},{"key":"411_CR5","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., Chen, Y.-F., Delzanno, G., Haziza, F., Hong, C.-D., Rezine, A.: Constrained monotonic abstraction: a cegar for parameterized verification. In: Proceedings of the CONCUR 2010, 21th International Conference on Concurrency Theory, pp. 86-101 (2010)","DOI":"10.1007\/978-3-642-15375-4_7"},{"key":"411_CR6","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., Delzanno, G., Henda, N.B., Rezine, A.: Regular model checking without transducers (on efficient verification of parameterized systems). In: Tools and Algorithms for the Construction and Analysis of Systems, pp. 721-736. Springer, Berlin (2007)","DOI":"10.1007\/978-3-540-71209-1_56"},{"key":"411_CR7","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., Haziza, F., Hol\u00edk L.: Block me if you can! In: Static Analysis, pp. 1-17. Springer, Berlin (2014)","DOI":"10.1007\/978-3-319-10936-7_1"},{"key":"411_CR8","doi-asserted-by":"crossref","unstructured":"Bansal, K., Koskinen, E., Wies, T., Zufferey, D.: Structural counter abstraction. In: Piterman, N., Smolka, S. (eds.) Tools and Algorithms for the Construction and Analysis of Systems, Volume of 7795 Lecture Notes in Computer Science, pp. 62-77. Springer, Berlin (2013)","DOI":"10.1007\/978-3-642-36742-7_5"},{"key":"411_CR9","first-page":"145","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems, Volume of 6015 Lecture Notes in Computer Science","author":"G Basler","year":"2010","unstructured":"Basler, G., Hague, M., Kroening, D., Ong, C.-H., Wahl, T., Zhao, H.: BOOM: Taking Boolean program model checking one step further. In: Esparza, J., Majumdar, R. (eds.) Tools and Algorithms for the Construction and Analysis of Systems, Volume of 6015 Lecture Notes in Computer Science, pp. 145\u2013149. Springer, Berlin (2010)"},{"key":"411_CR10","doi-asserted-by":"crossref","first-page":"413","DOI":"10.2307\/2370405","volume":"35","author":"LE Dickson","year":"1913","unstructured":"Dickson, L.E.: Finiteness of the odd perfect and primitive abundant numbers with $$n$$ n distinct prime factors. Am. J. Math. 35, 413\u2013422 (1913)","journal-title":"Am. J. Math."},{"key":"411_CR11","doi-asserted-by":"crossref","unstructured":"Donaldson, A., Kaiser, A., Kroening, D., Wahl, T.: Symmetry-aware predicate abstraction for shared-variable concurrent programs. In: Gopalakrishnan, G., Qadeer, S. (eds.) Computer Aided Verification, Volume of 6806 Lecture Notes in Computer Science, pp. 356-371. Springer, Berlin (2011)","DOI":"10.1007\/978-3-642-22110-1_28"},{"key":"411_CR12","doi-asserted-by":"crossref","unstructured":"Esparza, J., Ledesma-Garza, R., Majumdar, R., Meyer, P., Niksic F.: An SMT-based approach to coverability analysis. In: Computer Aided Verification, pp. 603-619. Springer, Berlin (2014)","DOI":"10.1007\/978-3-319-08867-9_40"},{"key":"411_CR13","doi-asserted-by":"crossref","unstructured":"Farzan, A., Kincaid, Z., Podelski, A.: Proofs that count. In: Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. POPL \u201914, pp. 151-164. ACM, New York, NY (2014)","DOI":"10.1145\/2535838.2535885"},{"issue":"1\u20132","key":"411_CR14","doi-asserted-by":"crossref","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. 256(1\u20132), 63\u201392 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"411_CR15","doi-asserted-by":"crossref","unstructured":"Ganjei, Z., Rezine, A., Eles, P., Peng, Z.: Abstracting and counting synchronizing processes. Verification, Model Checking, and Abstract Interpretation, pp. 227-244. Springer, Berlin (2014)","DOI":"10.1007\/978-3-662-46081-8_13"},{"key":"411_CR16","doi-asserted-by":"crossref","unstructured":"Henzinger, T.A., Jhala, R., Majumdar, R., Qadeer, S.: Thread-modular abstraction refinement. In: Computer Aided Verification, pp. 262-274. Springer, Berlin (2003)","DOI":"10.1007\/978-3-540-45069-6_27"},{"key":"411_CR17","doi-asserted-by":"crossref","unstructured":"Kaiser, A., Kroening, D., Wahl, T.: Dynamic cutoff detection in parameterized concurrent programs. In: Proceedings of CAV, Volume 6174 of LNCS, pp. 654-659. Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-14295-6_55"},{"key":"411_CR18","doi-asserted-by":"crossref","unstructured":"Kaiser, A., Kroening, D., Wahl, T.: Lost in abstraction: monotonicity in multi-threaded programs. In: Baldan, P., Gorla, D. (eds.) CONCUR 2014 Concurrency Theory, Volume of 8704 Lecture Notes in Computer Science, pp. 141-155. Springer, Berlin (2014)","DOI":"10.1007\/978-3-662-44584-6_11"},{"issue":"34","key":"411_CR19","first-page":"139","volume":"30","author":"L Zuck","year":"2004","unstructured":"Zuck, L., Pnueli, A.: Model checking and abstraction to the aid of parameterized systems (a survey). Comput. Lang. Syst. Struct. 30(34), 139\u2013169 (2004)","journal-title":"Comput. Lang. Syst. Struct."},{"issue":"34","key":"411_CR20","first-page":"139","volume":"30","author":"L Zuck","year":"2004","unstructured":"Zuck, L., Pnueli, A.: Model checking and abstraction to the aid of parameterized systems (a survey). Comput. Lang. Syst. Struct. 30(34), 139\u2013169 (2004)","journal-title":"Comput. Lang. Syst. Struct."}],"container-title":["International Journal on Software Tools for Technology Transfer"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10009-015-0411-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10009-015-0411-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10009-015-0411-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,3]],"date-time":"2019-09-03T22:13:15Z","timestamp":1567548795000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10009-015-0411-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,21]]},"references-count":20,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["411"],"URL":"https:\/\/doi.org\/10.1007\/s10009-015-0411-0","relation":{},"ISSN":["1433-2779","1433-2787"],"issn-type":[{"value":"1433-2779","type":"print"},{"value":"1433-2787","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,1,21]]}}}