{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:53:06Z","timestamp":1762458786411,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642047602"},{"type":"electronic","value":"9783642047619"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-04761-9_5","type":"book-chapter","created":{"date-parts":[[2009,10,10]],"date-time":"2009-10-10T06:43:53Z","timestamp":1255157033000},"page":"54-68","source":"Crossref","is-referenced-by-count":13,"title":["State Space Reduction of Linear Processes Using Control Flow Reconstruction"],"prefix":"10.1007","author":[{"given":"Jaco","family":"van de Pol","sequence":"first","affiliation":[]},{"given":"Mark","family":"Timmer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","volume-title":"Compilers: Principles, Techniques, and Tools","author":"A.V. Aho","year":"1986","unstructured":"Aho, A.V., Sethi, R., Ullman, J.D.: Compilers: Principles, Techniques, and Tools. Addison-Wesley, Reading (1986)"},{"key":"5_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.B., Derrick, J.: Verifying Erlang code: A resource locker case-study. In: Eriksson, L.-H., Lindsay, P.A. (eds.) FME 2002. LNCS, vol.\u00a02391, pp. 184\u2013203. Springer, Heidelberg (2002)"},{"issue":"3","key":"5_CR3","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/s00165-005-0070-0","volume":"17","author":"B. Badban","year":"2005","unstructured":"Badban, B., Fokkink, W., Groote, J.F., Pang, J., van de Pol, J.: Verification of a sliding window protocol in \u03bcCRL and PVS. Formal Aspects of Computing\u00a017(3), 342\u2013388 (2005)","journal-title":"Formal Aspects of Computing"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/BFb0015022","volume-title":"CONCUR \u201994: Concurrency Theory","author":"M. Bezem","year":"1994","unstructured":"Bezem, M., Groote, J.F.: Invariants in process algebra with data. In: Jonsson, B., Parrow, J. (eds.) CONCUR 1994. LNCS, vol.\u00a0836, pp. 401\u2013416. Springer, Heidelberg (1994)"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1007\/3-540-45657-0_50","volume-title":"Computer Aided Verification","author":"S. Blom","year":"2002","unstructured":"Blom, S., van de Pol, J.: State space reduction by proving confluence. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, pp. 596\u2013609. Springer, Heidelberg (2002)"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-540-85762-4_6","volume-title":"Theoretical Aspects of Computing - ICTAC 2008","author":"S. Blom","year":"2008","unstructured":"Blom, S., van de Pol, J.: Symbolic reachability for process algebras with recursive data types. In: Fitzgerald, J.S., Haxthausen, A.E., Yenigun, H. (eds.) ICTAC 2008. LNCS, vol.\u00a05160, pp. 81\u201395. Springer, Heidelberg (2008)"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/3-540-48294-6_11","volume-title":"Static Analysis","author":"M. Bozga","year":"1999","unstructured":"Bozga, M., Fernandez, J.-C., Ghirvu, L.: State space reduction based on live variables analysis. In: Cortesi, A., Fil\u00e9, G. (eds.) SAS 1999. LNCS, vol.\u00a01694, pp. 164\u2013178. Springer, Heidelberg (1999)"},{"key":"5_CR8","volume-title":"Parallel program design: a foundation","author":"K.M. Chandy","year":"1988","unstructured":"Chandy, K.M., Misra, J.: Parallel program design: a foundation. Addison-Wesley, Reading (1988)"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45694-5_1","volume-title":"CONCUR 2002 - Concurrency Theory","author":"W. Fokkink","year":"2002","unstructured":"Fokkink, W., Ioustinova, N., Kesseler, E., van de Pol, J., Usenko, Y.S., Yushtein, Y.A.: Refinement and verification applied to an in-flight data acquisition unit. In: Brim, L., Jan\u010dar, P., K\u0159et\u00ednsk\u00fd, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol.\u00a02421, pp. 1\u201323. Springer, Heidelberg (2002)"},{"issue":"2","key":"5_CR10","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.tcs.2005.09.064","volume":"351","author":"H. Garavel","year":"2006","unstructured":"Garavel, H., Serwe, W.: State space reduction for process algebra specifications. Theoretical Computer Science\u00a0351(2), 131\u2013145 (2006)","journal-title":"Theoretical Computer Science"},{"unstructured":"Groote, J.F., Lisser, B.: Computer assisted manipulation of algebraic process specifications. Technical report, SEN-R0117, CWI (2001)","key":"5_CR11"},{"key":"5_CR12","first-page":"26","volume-title":"Proc. of the 1st Workshop on the Algebra of Communicating Processes (ACP 1994)","author":"J.F. Groote","year":"1994","unstructured":"Groote, J.F., Ponse, A.: The syntax and semantics of \u03bcCRL. In: Proc. of the 1st Workshop on the Algebra of Communicating Processes (ACP 1994), pp. 26\u201362. Springer, Heidelberg (1994)"},{"issue":"1-2","key":"5_CR13","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S1567-8326(01)00005-4","volume":"48","author":"J.F. Groote","year":"2001","unstructured":"Groote, J.F., Ponse, A., Usenko, Y.S.: Linearization in parallel pCRL. Journal of Logic and Algebraic Programming\u00a048(1-2), 39\u201372 (2001)","journal-title":"Journal of Logic and Algebraic Programming"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/3-540-44612-5_34","volume-title":"Mathematical Foundations of Computer Science 2000","author":"J.F. Groote","year":"2000","unstructured":"Groote, J.F., van de Pol, J.: State space reduction using partial \u03c4-confluence. In: Nielsen, M., Rovan, B. (eds.) MFCS 2000. LNCS, vol.\u00a01893, pp. 383\u2013393. Springer, Heidelberg (2000)"},{"issue":"4","key":"5_CR15","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/S0020-0190(98)00158-6","volume":"68","author":"W.H. Hesselink","year":"1998","unstructured":"Hesselink, W.H.: Invariants for the construction of a handshake register. Information Processing Letters\u00a068(4), 173\u2013177 (1998)","journal-title":"Information Processing Letters"},{"issue":"3","key":"5_CR16","first-page":"219","volume":"2","author":"N. Lynch","year":"1989","unstructured":"Lynch, N., Tuttle, M.: An introduction to input\/output automata. CWI-Quarterly\u00a02(3), 219\u2013246 (1989)","journal-title":"CWI-Quarterly"},{"key":"5_CR17","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)"},{"issue":"1","key":"5_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jlap.2006.08.007","volume":"71","author":"J. Pang","year":"2007","unstructured":"Pang, J., Fokkink, W., Hofman, R.F.H., Veldema, R.: Model checking a cache coherence protocol of a Java DSM implementation. Journal of Logic and Algebraic Programming\u00a071(1), 1\u201343 (2007)","journal-title":"Journal of Logic and Algebraic Programming"},{"unstructured":"Usenko, Y.S.: Linearization in \u03bcCRL. PhD thesis, Eindhoven University (2002)","key":"5_CR19"},{"doi-asserted-by":"crossref","unstructured":"van de Pol, J., Timmer, M.: State space reduction of linear processes using control flow reconstruction (extended version). Technical report, TR-CTIT-09-24, CTIT, University of Twente (2009)","key":"5_CR20","DOI":"10.1007\/978-3-642-04761-9_5"},{"doi-asserted-by":"crossref","unstructured":"Winters, B.D., Hu, A.J.: Source-level transformations for improved formal verification. In: Proc. of the 18th IEEE Int. Conference on Computer Design (ICCD 2000), pp. 599\u2013602 (2000)","key":"5_CR21","DOI":"10.1109\/ICCD.2000.878353"},{"issue":"1","key":"5_CR22","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1023\/B:FORM.0000033963.55470.9e","volume":"25","author":"K. Yorav","year":"2004","unstructured":"Yorav, K., Grumberg, O.: Static analysis for state-space reductions preserving temporal logics. Formal Methods in System Design\u00a025(1), 67\u201396 (2004)","journal-title":"Formal Methods in System Design"}],"container-title":["Lecture Notes in Computer Science","Automated Technology for Verification and Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04761-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T17:48:33Z","timestamp":1739382513000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-04761-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642047602","9783642047619"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04761-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}