{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:24:42Z","timestamp":1761596682742,"version":"build-2065373602"},"reference-count":33,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,5,1]],"date-time":"2001-05-01T00:00:00Z","timestamp":988675200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2001,5,1]],"date-time":"2001-05-01T00:00:00Z","timestamp":988675200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4460,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["The Journal of Logic and Algebraic Programming"],"published-print":{"date-parts":[[2001,5]]},"DOI":"10.1016\/s1567-8326(01)00005-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T07:28:14Z","timestamp":1027582094000},"page":"39-70","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":24,"title":["Linearization in parallel pCRL"],"prefix":"10.1016","volume":"48","author":[{"given":"J.F.","family":"Groote","sequence":"first","affiliation":[]},{"given":"A.","family":"Ponse","sequence":"additional","affiliation":[]},{"given":"Y.S.","family":"Usenko","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/S1567-8326(01)00005-4_BIBBBK93","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1145\/174130.174141","article-title":"Decidability of bisimulation equivalence for processes generating context-free languages","volume":"40","author":"Baeten","year":"1993","journal-title":"Journal of the ACM"},{"year":"1990","series-title":"Process Algebra, Cambridge Tracts in Theoretical Computer Science, vol. 18","author":"Baeten","key":"10.1016\/S1567-8326(01)00005-4_BIBBW90"},{"key":"10.1016\/S1567-8326(01)00005-4_BIBBG87","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/0022-0000(87)90020-1","article-title":"Algebraic solutions to recursion schemes","volume":"35","author":"Benson","year":"1987","journal-title":"Journal of Computer and System Sciences"},{"issue":"1\/3","key":"10.1016\/S1567-8326(01)00005-4_BIBBK84B","first-page":"109","article-title":"Process algebra for synchronous communication","volume":"60","author":"Bergstra","year":"1984","journal-title":"Information and Computation"},{"key":"10.1016\/S1567-8326(01)00005-4_BIBBK88","unstructured":"J.A.Bergstra,J.W.Klop,Acompleteinferencesystemforregularprocesseswithsilentmoves,in:F.R.Drake,J.K.Truss(Eds.),ProceedingsLogicColloquiumHull1986,North-Holland,Amsterdam1988,pp. 21\u201381. First appeared as: Report CS-R8420, CWI, Amsterdam, 1984"},{"key":"10.1016\/S1567-8326(01)00005-4_BIBBP91","unstructured":"J.A. Bergstra, A. Ponse, Translation of a muCRL-fragment to I-CRL, in: Methods for the Transformation and Analysis of CRL. Deliverable 46\/SPE\/WP5\/DS\/A\/007\/b1, SPECS RACE Project no. 1046, pp. 125\u2013148, Available through GSI Tecsi, May 1991"},{"key":"10.1016\/S1567-8326(01)00005-4_BIBBG94A","doi-asserted-by":"crossref","unstructured":"M.A. Bezem, J.F. Groote, Invariants in process algebra with data, in: B. Jonsson, J. Parrow, (Eds.), CONCUR'94, Lecture Notes in Computer Science, vol. 836, Springer, Berlin, 1994, pp. 401\u2013416","DOI":"10.1007\/978-3-540-48654-1_30"},{"key":"10.1016\/S1567-8326(01)00005-4_BIBBP95","unstructured":"D.J.B. Bosscher, A. Ponse, Translating a process algebra with symbolic data values to linear format, in: U.H. Engberg, K.G. Larsen,, A. Skou (Eds.), Proceedings of the Workshop on Tools and Algorithms for the Construction and Analysis of Systems, Aarhus, Denmark, volume NS-95-2 of BRICS Notes Series, Department of Computer Science, University of Aarhus, May 1995, pp. 119\u2013130"},{"key":"10.1016\/S1567-8326(01)00005-4_BIBBR95","doi-asserted-by":"crossref","unstructured":"J.J. Brunekreef, Process specification in a UNITY format, in: A. Ponse, C. Verhoef, S.F.M. van Vlijmen (Eds.), Algebra of Communicating Processes, Utrecht 1994, Workshops in Computing, Springer, Berlin, 1995, pp. 319\u2013337","DOI":"10.1007\/978-1-4471-2120-6_14"},{"year":"1981","series-title":"A Course in Universal Algebra, Graduate Texts in Mathematics, vol. 78","author":"Burris","key":"10.1016\/S1567-8326(01)00005-4_BIBBS81"},{"year":"1988","series-title":"Parallel Program Design. A Foundation","author":"Chandy","key":"10.1016\/S1567-8326(01)00005-4_BIBCHMI88"},{"key":"10.1016\/S1567-8326(01)00005-4_BIBCOU86","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(86)90050-2","article-title":"Equivalences and transformations of regular systems-applications to recursive program schemes and grammars","volume":"42","author":"Courcelle","year":"1986","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1567-8326(01)00005-4_BIBCOU90","doi-asserted-by":"crossref","unstructured":"B. Courcelle, Recursive applicative program schemes, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, vol. B, chapter 9, Elsevier, Amsterdam, 1990, pp. 459\u2013492","DOI":"10.1016\/B978-0-444-88074-1.50014-7"},{"year":"2000","series-title":"Introduction to Process Algebra, Texts in Theoretical Computer Science. An EATCS Series","author":"Fokkink","key":"10.1016\/S1567-8326(01)00005-4_BIBFOK00"},{"key":"10.1016\/S1567-8326(01)00005-4_BIBVG93B","doi-asserted-by":"crossref","unstructured":"R.J. van Glabbeek, The linear time-branching time spectrum II; the semantics of sequential systems with silent moves, Manuscript. Preliminary version available by ftp at ftp:\/\/boole.stanford.edu\/pub\/spectrum.ps.gz, 1993. Extended abstract, in: E. Best (Ed.), Proceedings CONCUR'93, 4th International Conference on Concurrency Theory, Hildesheim, Germany, August 1993, Lecture Notes in Computer Science, vol. 715, Springer, Berlin, pp. 66\u201381","DOI":"10.1007\/3-540-57208-2_6"},{"key":"10.1016\/S1567-8326(01)00005-4_BIBGRO97","unstructured":"J.F. Groote, The syntax and semantics of timed \u03bcCRL, Report SEN-R9709, CWI, The Netherlands, 1997"},{"key":"10.1016\/S1567-8326(01)00005-4_BIBGL99","unstructured":"J.F. Groote, B. Lisser, Tutorial and Reference Guide for the \u03bcCRL toolset version 1.0, CWI, 1999. Available from http:\/\/www.cwi.nl\/\u223cmcrl\/mutool.html"},{"key":"10.1016\/S1567-8326(01)00005-4_BIBGL98","unstructured":"J.F. Groote, S.P. Luttik, Undecidability and completeness results for process algebras with alternative quantification over data, Report SEN-R9806, CWI, The Netherlands, July 1998. Available from http:\/\/www.cwi.nl\/\u223cluttik\/; submitted for publication"},{"key":"10.1016\/S1567-8326(01)00005-4_BIBGP94B","doi-asserted-by":"crossref","unstructured":"J.F. Groote, A. Ponse, Proof theory for \u03bcCRL: a language for processes with data, in: D.J. Andrews, J.F. Groote, C.A. Middelburg (Eds.), Semantics of Specification Languages, Workshop in Computing Series, Springer, Berlin, 1994, pp. 232\u2013251","DOI":"10.1007\/978-1-4471-3229-5_13"},{"key":"10.1016\/S1567-8326(01)00005-4_BIBGP94A","doi-asserted-by":"crossref","unstructured":"J.F. Groote, A. Ponse, The syntax and semantics of \u03bcCRL, in: A. Ponse, C. Verhoef, S.F.M. van Vlijmen (Eds.), Algebra of Communicating Processes1994, Workshop in Computing Series, Springer, Berlin, 1995, pp. 26\u201362","DOI":"10.1007\/978-1-4471-2120-6_2"},{"key":"10.1016\/S1567-8326(01)00005-4_BIBGS95","unstructured":"J.F. Groote, J. Springintveld, Focus points and convergent process operators. A proof strategy for protocol verification, Technical Report 142, Department of Philosophy, Utrecht University, 1995. Available from ftp:\/\/ftp.phil.uu.nl\/pub\/logic\/PREPRINTS\/preprint142.ps.Z"},{"key":"10.1016\/S1567-8326(01)00005-4_BIBGVW94","unstructured":"J.F. Groote, J.J. van Wamel, Algebraic data types and induction in \u03bcCRL, Technical Report P9409, University of Amsterdam, Programming Research Group, 1994"},{"key":"10.1016\/S1567-8326(01)00005-4_BIBHM96","doi-asserted-by":"crossref","unstructured":"Y. Hirshfeld, F. Moller. Decidability results in automata and process theory, in: F. Moller, G. Birtwistle (Eds.), Logics for Concurrency: Structure versus Automata, Lecture Notes in Computer Science, vol. 1043, Springer, Berlin, 1996, pp. 102\u2013148","DOI":"10.1007\/3-540-60915-6_4"},{"key":"10.1016\/S1567-8326(01)00005-4_BIBISO87","unstructured":"ISO\/IEC, LOTOS\u2013a formal description technique based on the temporal ordering of observational behaviour, International Standard 8807, International Organization for Standardization\u2013Information Processing Systems\u2013Open Systems Interconection, Gen\u00e8ve, September 1988"},{"key":"10.1016\/S1567-8326(01)00005-4_BIBMM94","doi-asserted-by":"crossref","unstructured":"S. Mauw, J.C. Mulder, Regularity of BPA-systems is decidable, in: B. Jonsson, J. Parrow (Eds.), Proc. CONCUR '94, Lecture Notes in Computer Science, vol. 836, Springer, Berlin, 1994, pp. 34\u201347","DOI":"10.1007\/978-3-540-48654-1_4"},{"key":"10.1016\/S1567-8326(01)00005-4_BIBMAVE90","doi-asserted-by":"crossref","first-page":"85","DOI":"10.3233\/FI-1990-13202","article-title":"A process specification formalism","volume":"13","author":"Mauw","year":"1990","journal-title":"Fundamenta Informaticae"},{"key":"10.1016\/S1567-8326(01)00005-4_BIBMV93","doi-asserted-by":"crossref","unstructured":"S. Mauw, G.J. Veltink (Eds.), Algebraic Specification of Communication Protocols, Cambridge Tracts in Theoretical Computer Science, vol. 36, Cambridge University Press, Cambridge, 1993","DOI":"10.1017\/CBO9780511721625"},{"key":"10.1016\/S1567-8326(01)00005-4_BIBMI84","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1016\/0022-0000(84)90023-0","article-title":"A complete inference system for a class of regular behaviours","volume":"28","author":"Milner","year":"1984","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/S1567-8326(01)00005-4_BIBVO00","unstructured":"V. van Oostrom, Personal communications, 2000"},{"issue":"6","key":"10.1016\/S1567-8326(01)00005-4_BIBPONSE96","doi-asserted-by":"crossref","first-page":"648","DOI":"10.1007\/BF01213493","article-title":"Computable processes and bisimulation equivalence","volume":"8","author":"Ponse","year":"1996","journal-title":"Formal Aspects of Computing"},{"key":"10.1016\/S1567-8326(01)00005-4_BIBPU01","unstructured":"A. Ponse, Y.S. Usenko, Equivalence of recursive specifications in process algebra, Information Processing Letters, to appear"},{"key":"10.1016\/S1567-8326(01)00005-4_BIBCRL90","unstructured":"SPECS-Semantics and Analysis, Definition of MR and CRL Version 2.1. Deliverable 46\/SPE\/WP5\/DS\/A\/017\/b1, SPECS RACE Project no. 1046. Available through GSI Tecsi, 1990"},{"key":"10.1016\/S1567-8326(01)00005-4_BIBSDL92","unstructured":"Specification and description language (SDL). ITU-T Recommendation Z. 100, 1994"}],"container-title":["The Journal of Logic and Algebraic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1567832601000054?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1567832601000054?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T18:33:19Z","timestamp":1761589999000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1567832601000054"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,5]]},"references-count":33,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,5]]}},"alternative-id":["S1567832601000054"],"URL":"https:\/\/doi.org\/10.1016\/s1567-8326(01)00005-4","relation":{},"ISSN":["1567-8326"],"issn-type":[{"type":"print","value":"1567-8326"}],"subject":[],"published":{"date-parts":[[2001,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Linearization in parallel pCRL","name":"articletitle","label":"Article Title"},{"value":"The Journal of Logic and Algebraic Programming","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1567-8326(01)00005-4","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2001 Elsevier Science Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}