{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:44:05Z","timestamp":1725558245161},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540407539"},{"type":"electronic","value":"9783540451877"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"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":[[2003]]},"DOI":"10.1007\/978-3-540-45187-7_11","type":"book-chapter","created":{"date-parts":[[2010,6,25]],"date-time":"2010-06-25T18:38:49Z","timestamp":1277491129000},"page":"174-190","source":"Crossref","is-referenced-by-count":2,"title":["Verification of Parametric Concurrent Systems with Prioritized FIFO Resource Management"],"prefix":"10.1007","author":[{"given":"Ahmed","family":"Bouajjani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Habermehl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tom\u00e1\u0161","family":"Vojnar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/3-540-48683-6_14","volume-title":"Computer Aided Verification","author":"P. Abdulla","year":"1999","unstructured":"Abdulla, P., Bouajjani, A., Jonsson, B., Nilsson, M.: Handling Global Conditions in Parameterized System Verification. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol.\u00a01633, pp. 134\u2013145. Springer, Heidelberg (1999)"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/3-540-45614-7_11","volume-title":"FME 2002: Formal Methods - Getting IT Right","author":"T. Arts","year":"2002","unstructured":"Arts, T., Earle, C., Derrick, J.: Verifying Erlang Code: A Resource Locker Case-Study. In: Eriksson, L.-H., Lindsay, P.A. (eds.) FME 2002. LNCS, vol.\u00a02391, p. 184. Springer, Heidelberg (2002)"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/3-540-46419-0_14","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"K. Baukus","year":"2000","unstructured":"Baukus, K., Bensalem, S., Lakhnech, Y., Stahl, K.: Abstracting WS1S Systems to Verify Parameterized Networks. In: Schwartzbach, M.I., Graf, S. (eds.) TACAS 2000. LNCS, vol.\u00a01785, p. 188. Springer, Heidelberg (2000)"},{"key":"11_CR4","unstructured":"Bouajjani, A., Habermehl, P., Vojnar, T.: Verification of Parametric Concurrent Systems with Prioritized FIFO Resource Management, Full version available at \n                    \n                      http:\/\/verif.liafa.jussieu.fr\/~vojnar\/download\/concur03.ps.gz"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/3-540-46002-0_18","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"E. Emerson","year":"2002","unstructured":"Emerson, E., Kahlon, V.: Model Checking Large-Scale and Parameterized Resource Allocation Systems. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol.\u00a02280, p. 251. Springer, Heidelberg (2002)"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Emerson, E., Namjoshi, K.: Reasoning about Rings. In: Proc. of POPL 1995 (1995)","DOI":"10.1145\/199448.199468"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","volume-title":"Computer Aided Verification","author":"E. Emerson","year":"1996","unstructured":"Emerson, E., Namjoshi, K.: Automatic Verification of Parameterized Synchronous Systems. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol.\u00a01102. Springer, Heidelberg (1996)"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Emerson, E., Sistla, A.: Utilizing Symmetry when Model Checking under Fairness Assumptions: An Automata-theoretic Approach. ACM Transactions on Programming Languages and Systems\u00a019(4) (1997)","DOI":"10.1145\/262004.262008"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"German, S., Sistla, A.: Reasoning about Systems with Many Processes. JACM\u00a039(3) (1992)","DOI":"10.1145\/146637.146681"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","volume-title":"Computer Aided Verification","author":"Y. Kesten","year":"1997","unstructured":"Kesten, Y., Maler, O., Marcus, M., Pnueli, A., Shahar, E.: Symbolic Model Checking with Rich Assertional Languages. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol.\u00a01254. Springer, Heidelberg (1997)"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Kurshan, R., McMillan, K.: A Structural Induction Theorem for Processes. Information and Computation\u00a0117(1) (1995)","DOI":"10.1006\/inco.1995.1024"},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/3-540-45319-9_7","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A. Pnueli","year":"2001","unstructured":"Pnueli, A., Ruah, S., Zuck, L.: Automatic Deductive Verification with Invisible Invariants. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol.\u00a02031, p. 82. Springer, Heidelberg (2001)"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"von Zur Gathen, J., Sieveking, M.: A Bound on Solutions of Linear Integer Equalities and Inequalities. In: Proceedings of the American Mathematical Society (1978)","DOI":"10.2307\/2042554"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","volume-title":"Automatic Verification Methods for Finite State Systems","author":"P. Wolper","year":"1990","unstructured":"Wolper, P., Lovinfosse, V.: Verifying Properties of Large Sets of Processes with Network Invariants. In: Sifakis, J. (ed.) CAV 1989. LNCS, vol.\u00a0407. Springer, Heidelberg (1990)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2003 - Concurrency Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45187-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T15:15:42Z","timestamp":1558278942000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45187-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540407539","9783540451877"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45187-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}