{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:09:38Z","timestamp":1725664178260},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540600459"},{"type":"electronic","value":"9783540494133"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60045-0_37","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:36:45Z","timestamp":1330259805000},"page":"16-30","source":"Crossref","is-referenced-by-count":6,"title":["Generating BDD models for process algebra terms"],"prefix":"10.1007","author":[{"given":"Ashvin","family":"Dsouza","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bard","family":"Bloom","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"issue":"1","key":"3_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.1994.1040","volume":"111","author":"L. Aceto","year":"1994","unstructured":"Luca Aceto, Bard Bloom, and Frits Vaandrager. Turning SOS rules into equations. Information and Computation, 111(1):1\u201352, May 1994. (Special Issue for LICS '92).","journal-title":"Information and Computation"},{"key":"3_CR2","volume-title":"Technical Report 6\/93","author":"L. Aceto","year":"1993","unstructured":"Luca Aceto. GSOS and finite labelled transition systems. Technical Report 6\/93, University of Sussex at Brighton, March 1993."},{"key":"3_CR3","unstructured":"J. Burch, E. Clarke, and D. Long. Symbolic model checking with partitioned transition relations. In VLSI 91, Edinburgh, Scotland, 1991."},{"key":"3_CR4","unstructured":"J. Burch, E. Clarke, K. McMillan, D. Dill, and L. Hwang. Symbolic model checking: 1020 states and beyond. In Logic in Computer Science, 1990."},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"A. Bouali and R. de Simone. Symbolic bisimulation minimization. In Computer Aided Verification, volume 663 of LNCS, 1992.","DOI":"10.1007\/3-540-56496-9_9"},{"key":"3_CR6","volume-title":"PhD thesis","author":"B. Bloom","year":"1990","unstructured":"Bard Bloom. Ready Simulation, Bisimulation and the semantics of CCS-like languages. PhD thesis, MIT, Cambridge, Massachusetts, October 1990."},{"issue":"8","key":"3_CR7","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"R. Bryant","year":"1986","unstructured":"R. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, 35(8):677\u2013691, 8 1986.","journal-title":"IEEE Transactions on Computers"},{"key":"3_CR8","unstructured":"The Edinburgh Concurrency Workbench, version 6.1, 1992. Available by ftp from ftp.dcs.ed.ac.uk, directory export\/cwb\/CWB6.1."},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Mads Dam. Model checking mobile processes. CONCUR 93, 1993.","DOI":"10.1007\/3-540-57208-2_3"},{"key":"3_CR10","unstructured":"A. Dsouza and B. Bloom. Applying symbolic model checking to process algebras, 1995. http: \/\/www.cs.cornell.edu\/Info\/People\/dsouza\/pa2bdd.ps."},{"issue":"3","key":"3_CR11","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0304-3975(85)90093-3","volume":"37","author":"R. Simone de","year":"1985","unstructured":"R. de Simone. Higher-level synchronizing devices in MEIJE-SCCS. Theoretical Computer Science, 37(3):245\u2013267, 1985.","journal-title":"Theoretical Computer Science"},{"key":"3_CR12","volume-title":"Technical Report Rapports Techniques 111","author":"R. Simone de","year":"1989","unstructured":"R. de Simone and D. Vergamini. Aboard Auto. Technical Report Rapports Techniques 111, INRIA, Sophia Antipolis, 1989."},{"key":"3_CR13","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF02242704","volume":"6","author":"R. Enders","year":"1993","unstructured":"R. Enders, T. Filkhorn, and D. Taubner. Generating BDDs for symbolic model checking in CCS. Distributed Computing, 6:155\u2013164, 1993.","journal-title":"Distributed Computing"},{"key":"3_CR14","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0167-6423(90)90071-K","volume":"13","author":"J-C. Fernandez","year":"1989","unstructured":"J-C. Fernandez. An implementation of an efficient algorithm for bisimulation equivalence. Science of Computer Programming, 13:219\u2013236, 1989.","journal-title":"Science of Computer Programming"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"J-C. Fernandez, A. Kerbrat, and L. Mounier. Symbolic equivalence checking. In Computer Aided Verification, 1993.","DOI":"10.1007\/3-540-56922-7_8"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"J.F. Groote and F. Vandraager. An efficient algorithm for branching bisimulation and stuttering equivalence. In ICALP '90, Lecture Notes in Computer Science. Springer Verlag, 1990.","DOI":"10.1007\/BFb0032063"},{"key":"3_CR17","unstructured":"David Long, bdd: A Binary Decision Diagram (BDD) package, 1993. Available by FTP from emc.cs.cmu.edu (pub\/bdd\/bddlib.tar.Z)."},{"key":"3_CR18","unstructured":"LOTOSphere is available by FTP from ftp.cs.utwente.nl."},{"key":"3_CR19","volume-title":"Prentice Hall International Series in Computer Science","author":"R. Milner","year":"1989","unstructured":"Robin Milner. Communication and Concurrency. Prentice Hall International Series in Computer Science. Prentice Hall, New York, 1989."},{"key":"3_CR20","unstructured":"G. Milne and G. McCaskill. Sequential circuit analysis with a BDD based process algebra system. Technical Report HDV-25-93, University of Strathclyde, 1993."},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"D. Park. Concurrency and automata on infinite sequences. In P. Deussen, editor, Theoretical Computer Science, Lect. Notes in Computer Sci., page 261. Springer-Verlag, 1981.","DOI":"10.1007\/BFb0017309"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60045-0_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:28:48Z","timestamp":1605630528000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60045-0_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540600459","9783540494133"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-60045-0_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}