{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:28:55Z","timestamp":1761596935219,"version":"3.32.0"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1993,4,1]],"date-time":"1993-04-01T00:00:00Z","timestamp":733622400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib Comput"],"published-print":{"date-parts":[[1993,4]]},"DOI":"10.1007\/bf02242704","type":"journal-article","created":{"date-parts":[[2005,11,15]],"date-time":"2005-11-15T07:35:55Z","timestamp":1132040155000},"page":"155-164","source":"Crossref","is-referenced-by-count":34,"title":["Generating BDDs for symbolic model checking in CCS"],"prefix":"10.1007","volume":"6","author":[{"given":"Reinhard","family":"Enders","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Filkorn","sequence":"additional","affiliation":[]},{"given":"Dirk","family":"Taubner","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02242704_CR1","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"8","author":"RE Bryant","year":"1986","unstructured":"Bryant RE: Graph-based algorithms for boolean function manipulation. IEEE Trans Comput C-35 8:677\u2013691 (1986)","journal-title":"IEEE Trans Comput C-35"},{"key":"BF02242704_CR2","doi-asserted-by":"crossref","unstructured":"Burch JR, Clarke EM, McMillan KL, Dill DL, Hwang LJ: Symbolic model checking: 1020 states and beyond. In: Proceedings of the 5th IEEE Symp. on Logic in Computer Science, Philadelphia 1990. Computer, Society Press, 1990, pp 428\u2013439","DOI":"10.1109\/LICS.1990.113767"},{"key":"BF02242704_CR3","series-title":"Proceedings, Grenoble 1989. Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1007\/3-540-52148-8_3","volume-title":"Automatic verification methods for finite state systems","author":"R Cleaveland","year":"1990","unstructured":"Cleaveland R, Parrow J, Steffen B: The concurrency workbench. In: Sifakis J (ed) Automatic verification methods for finite state systems. Proceedings, Grenoble 1989. Lect Notes Comput Sci, vol 407. Springer, Berlin Heidelberg New York 1990, pp 24\u201337"},{"key":"BF02242704_CR4","series-title":"Rapports Techniques","volume-title":"Abord auto","author":"R Simone de","year":"1989","unstructured":"de Simone R, Vergamini D: Abord auto. Rapports Techniques 111, INRIA, Sophia Antipolis 1989"},{"key":"BF02242704_CR5","unstructured":"Emerson EA, Lei C-L: Efficient model checking in fragments of the propositional mu-calculus. In: Proc. of the First Annual Symp. on Logic in Computer Science. Computer Society Press, 1986, pp 267\u2013278"},{"key":"BF02242704_CR6","series-title":"Informatik Fachberichte","first-page":"208","volume-title":"VIS '91 Verl\u00e4\u00dfliche Informationssysteme","author":"K Estenfeld","year":"1991","unstructured":"Estenfeld K, Schneider H-A, Taubner D, Tid\u00e9n E: Computer aided verification of parallel processes. In: Pfitzmann A, Raubold E (eds) VIS '91 Verl\u00e4\u00dfliche Informationssysteme. Proceedings, Darmstadt 1991. Informatik Fachberichte, vol 271. Springer, Berlin Heidelberg New York 1991, pp 208\u2013226"},{"key":"BF02242704_CR7","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0167-6423(90)90071-K","volume":"13","author":"J-C Fernandez","year":"1989\/90","unstructured":"Fernandez J-C: An implementation of an efficient algorithm for bisimulation equivalence. Sci, of Comput Program 13:219\u2013236 (1989\/90)","journal-title":"Sci, of Comput Program"},{"key":"BF02242704_CR8","unstructured":"Filkorn T: Unifikation in endlichen Algebren und ihre Integration in Prolog. Master's Thesis, Techn. Universit\u00e4t M\u00fcnchen 1988"},{"key":"BF02242704_CR9","doi-asserted-by":"crossref","unstructured":"Fischer S, Scholz A, Taubner D: Verification in process algebra of the distributed control of track vehicles \u2014 A case study. In: Proceedings of CAV'92, Workshop on Computer-Aided Verification, Montreal 1992","DOI":"10.1007\/3-540-56496-9_16"},{"key":"BF02242704_CR10","series-title":"ICALP'90. Lect Notes Comput Sci","volume-title":"Automata, languages and programming","author":"JF Groote","year":"1990","unstructured":"Groote JF, Vaandrager F: An efficient algorithm for branching bisimulation and stuttering equivalence. In: Automata, languages and programming, ICALP'90. Lect Notes Comput Sci, vol 443. Springer, berlin Heidelberg New York 1990"},{"key":"BF02242704_CR11","volume-title":"Communication and concurrency","author":"R Milner","year":"1989","unstructured":"Milner R: Communication and concurrency. Prentice Hall, New York 1989"},{"key":"BF02242704_CR12","series-title":"Proceedings, Barcelona 1989. Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/3-540-50939-9_144","volume-title":"TAPSOFT '89. vol 1","author":"C Stirling","year":"1989","unstructured":"Stirling C, Walker D: Local model checking in the modal mucalculus. In: D\u00edaz J, Orejas F (eds) TAPSOFT '89. vol 1. Proceedings, Barcelona 1989. Lect Notes Comput Sci, vol 351. Springer, Berlin Heidelberg New York 1989, pp 369\u2013383"},{"key":"BF02242704_CR13","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/3-540-51525-9_11","volume":"369","author":"D Taubner","year":"1989","unstructured":"Taubner D: Finite representations of CCS and TCSP programs by automata and petri nets. Lect Notes Comput Sci 369:61\u201394 (1989)","journal-title":"Lect Notes Comput Sci"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02242704.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02242704\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02242704","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T15:13:22Z","timestamp":1736090002000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02242704"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,4]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1993,4]]}},"alternative-id":["BF02242704"],"URL":"https:\/\/doi.org\/10.1007\/bf02242704","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"type":"print","value":"0178-2770"},{"type":"electronic","value":"1432-0452"}],"subject":[],"published":{"date-parts":[[1993,4]]}}}