{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T03:17:37Z","timestamp":1773717457974,"version":"3.50.1"},"reference-count":45,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1995,6,1]],"date-time":"1995-06-01T00:00:00Z","timestamp":801964800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1995,6,1]],"date-time":"1995-06-01T00:00:00Z","timestamp":801964800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2000,1,20]],"date-time":"2000-01-20T00:00:00Z","timestamp":948326400000},"content-version":"vor","delay-in-days":1694,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[1995,6]]},"DOI":"10.1016\/0167-6423(95)00003-b","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T15:32:00Z","timestamp":1049729520000},"page":"189-220","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":51,"title":["Transformational design and implementation of a new efficient solution to the ready simulation problem"],"prefix":"10.1016","volume":"24","author":[{"given":"Bard","family":"Bloom","sequence":"first","affiliation":[]},{"given":"Robert","family":"Paige","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-6423(95)00003-B_BIB1","series-title":"Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0167-6423(95)00003-B_BIB2","series-title":"Data Structures and Algorithms","author":"Aho","year":"1983"},{"issue":"1","key":"10.1016\/0167-6423(95)00003-B_BIB3","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0304-3975(84)90067-7","article-title":"Alg\u00e8bre de processus et synchronisation","volume":"30","author":"Austry","year":"1984","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10.1016\/0167-6423(95)00003-B_BIB4","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1145\/320064.320066","article-title":"Computational problems related to the design of normal form relation schemes","volume":"4","author":"Beeri","year":"1979","journal-title":"ACM Trans. Database System"},{"issue":"1\u20133","key":"10.1016\/0167-6423(95)00003-B_BIB5","first-page":"109","article-title":"Process algebra for synchronous communication","volume":"60","author":"Bergstra","year":"1984","journal-title":"Inform. and Comput."},{"key":"10.1016\/0167-6423(95)00003-B_BIB6","article-title":"Ready simulation, bisimulation, and the semantics of CCS-like languages","author":"Bloom","year":"1989"},{"key":"10.1016\/0167-6423(95)00003-B_BIB7","series-title":"Conference Record of the Fifteenth Annual ACM Symposium on Principles of Programming Languages","first-page":"229","article-title":"Bisimulation cannot be traced (preliminary report)","author":"Bloom","year":"1988"},{"key":"10.1016\/0167-6423(95)00003-B_BIB8","article-title":"Bisimulation cannot be traced","author":"Bloom","year":"1990"},{"issue":"1","key":"10.1016\/0167-6423(95)00003-B_BIB9","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1145\/321992.321996","article-title":"A transformation system for developing recursive programs","volume":"24","author":"Burstall","year":"1977","journal-title":"J. ACM"},{"key":"10.1016\/0167-6423(95)00003-B_BIB10","series-title":"Conference Record of the Fourteenth Annual ACM Symposium on Principles of Programming Languages","first-page":"85","article-title":"Binding performance at language design time","author":"Cai","year":"1987"},{"issue":"3","key":"10.1016\/0167-6423(95)00003-B_BIB11","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0167-6423(88)90033-0","article-title":"Program derivation by fixed point computation","volume":"11","author":"Cai","year":"1988","journal-title":"Sci. Comput. Programming"},{"key":"10.1016\/0167-6423(95)00003-B_BIB12","series-title":"Algebraic Methodology and Software Technology","first-page":"287","article-title":"Languages polynomial in the input plus output","author":"Cai","year":"1992"},{"issue":"1","key":"10.1016\/0167-6423(95)00003-B_BIB13","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0304-3975(92)90277-M","article-title":"More efficient bottom-up multi-pattern matching in trees","volume":"106","author":"Cai","year":"1992","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"10.1016\/0167-6423(95)00003-B_BIB14","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","article-title":"Universal classes of hash functions","volume":"18","author":"Carter","year":"1979","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0167-6423(95)00003-B_BIB15","series-title":"Proc. Combinatorial Pattern Matching '92","first-page":"88","article-title":"From regular expressions to dfa's using compressed nfa's","volume":"Vol. 644","author":"Chang","year":"1992"},{"key":"10.1016\/0167-6423(95)00003-B_BIB16","series-title":"Proceedings of the Workshop on Automated Verification Methods for Finite State Systems","article-title":"The concurrency workbench","volume":"Vol. 407","author":"Cleaveland","year":"1989"},{"key":"10.1016\/0167-6423(95)00003-B_BIB45","unstructured":"to appear in ACM TOPLAS."},{"key":"10.1016\/0167-6423(95)00003-B_BIB17","series-title":"Automata, Languages and Programming: 18th International Colloqium","first-page":"127","article-title":"Computing behavioural relations, logically","volume":"Vol. 510","author":"Cleaveland","year":"1991"},{"key":"10.1016\/0167-6423(95)00003-B_BIB18","author":"Cocke","year":"1969"},{"issue":"1","key":"10.1016\/0167-6423(95)00003-B_BIB19","doi-asserted-by":"crossref","first-page":"43","DOI":"10.2140\/pjm.1979.82.43","article-title":"Constructive versions of Tarski's fixed point theorems","volume":"82","author":"Cousot","year":"1979","journal-title":"Pacific J. Math."},{"issue":"2\/3","key":"10.1016\/0167-6423(95)00003-B_BIB20","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","article-title":"Testing equivalences for processes","volume":"34","author":"de Nicola","year":"1984","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"10.1016\/0167-6423(95)00003-B_BIB21","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0304-3975(85)90093-3","article-title":"Higher-level synchronising devices in MEIJE-SCCS","volume":"37","author":"de Simone","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0167-6423(95)00003-B_BIB22","series-title":"A Discipline of Programming","author":"Dijkstra","year":"1976"},{"issue":"4","key":"10.1016\/0167-6423(95)00003-B_BIB23","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0096-0551(75)90019-3","article-title":"High level iterators and a method for automatically designing data structure representation","volume":"1","author":"Earley","year":"1976","journal-title":"J. Comput. Languages"},{"key":"10.1016\/0167-6423(95)00003-B_BIB24","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0167-6423(90)90071-K","article-title":"An implementation of an efficient algorithm for bisimulation equivalence","volume":"13","author":"Fernandez","year":"1989","journal-title":"Sci. Comput. Programming"},{"key":"10.1016\/0167-6423(95)00003-B_BIB25","series-title":"Conference Record of the Third Annual ACM Symposium on Principles of Programming Languages","first-page":"104","article-title":"Induction variables in very high level languages","author":"Fong","year":"1976"},{"key":"10.1016\/0167-6423(95)00003-B_BIB26","series-title":"The Science of Programming","author":"Gries","year":"1981"},{"key":"10.1016\/0167-6423(95)00003-B_BIB27","series-title":"Automata, Languages and Programming: 16th International Colloquium","first-page":"423","article-title":"Structured operational semantics and bisimulation as a congruence (extended abstract)","volume":"Vol. 372","author":"Groote","year":"1989"},{"key":"10.1016\/0167-6423(95)00003-B_BIB28","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1145\/359576.359585","article-title":"Communicating sequential processes","volume":"21","author":"Hoare","year":"1978","journal-title":"Commun. ACM"},{"key":"10.1016\/0167-6423(95)00003-B_BIB29","article-title":"Yacc \u2014 Yet another compiler compiler","author":"Johnson","year":"1975"},{"key":"10.1016\/0167-6423(95)00003-B_BIB30","author":"Larsen","year":"1988"},{"key":"10.1016\/0167-6423(95)00003-B_BIB31","article-title":"A Calculus of Communicating Systems","volume":"Vol. 92","author":"Milner","year":"1980"},{"issue":"3","key":"10.1016\/0167-6423(95)00003-B_BIB32","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0304-3975(83)90114-7","article-title":"Calculi for synchrony and asynchrony","volume":"25","author":"Milner","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0167-6423(95)00003-B_BIB33","article-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"key":"10.1016\/0167-6423(95)00003-B_BIB34","article-title":"The lazy lambda calculus: an investigation into the foundations of functional programming","author":"Ong","year":"1988"},{"key":"10.1016\/0167-6423(95)00003-B_BIB35","first-page":"69","article-title":"Real-time simulation of a set machine on a ram","volume":"Vol. II","author":"Paige","year":"1989"},{"key":"10.1016\/0167-6423(95)00003-B_BIB36","series-title":"Technology and Foundations \u2014 Information Processing 94","first-page":"603","article-title":"Efficient translation of external input in a dynamically typed language","volume":"Vol. 1","author":"Paige","year":"1994"},{"issue":"2","key":"10.1016\/0167-6423(95)00003-B_BIB37","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0747-7171(87)80066-4","article-title":"Mechanical translation of set theoretic problem specifications into efficient ram code \u2014 a case study","volume":"4","author":"Paige","year":"1987","journal-title":"J. Symbolic Comput."},{"issue":"3","key":"10.1016\/0167-6423(95)00003-B_BIB38","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1145\/357172.357177","article-title":"Finite differencing of computable expressions","volume":"4","author":"Paige","year":"1982","journal-title":"ACM Trans. Programming Languages and Systems"},{"key":"10.1016\/0167-6423(95)00003-B_BIB39","doi-asserted-by":"crossref","first-page":"973","DOI":"10.1137\/0216062","article-title":"Three partition refinement algorithms","volume":"16","author":"Paige","year":"1987","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/0167-6423(95)00003-B_BIB40","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0304-3975(85)90159-8","article-title":"A linear time solution to the single function coarsest partition problem","volume":"40","author":"Paige","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0167-6423(95)00003-B_BIB41","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0304-3975(87)90117-4","article-title":"Refusal testing","volume":"50","author":"Phillips","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0167-6423(95)00003-B_BIB42","series-title":"Programming with Sets: An Introduction to SETL","author":"Schwartz","year":"1986"},{"key":"10.1016\/0167-6423(95)00003-B_BIB43","author":"Snyder","year":"1990"},{"key":"10.1016\/0167-6423(95)00003-B_BIB44","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","article-title":"A lattice-theoretical fixpoint theorem and its application","volume":"5","author":"Tariski","year":"1955","journal-title":"Pacific J. Math."}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016764239500003B?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016764239500003B?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T21:20:46Z","timestamp":1757452846000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016764239500003B"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,6]]},"references-count":45,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1995,6]]}},"alternative-id":["016764239500003B"],"URL":"https:\/\/doi.org\/10.1016\/0167-6423(95)00003-b","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[1995,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Transformational design and implementation of a new efficient solution to the ready simulation problem","name":"articletitle","label":"Article Title"},{"value":"Science of Computer Programming","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0167-6423(95)00003-B","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1995 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}