乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,19]],"date-time":"2024-12-19T05:30:10Z","timestamp":1734586210700,"version":"3.30.2"},"reference-count":15,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2002,11,1]],"date-time":"2002-11-01T00:00:00Z","timestamp":1036108800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3923,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2002,11]]},"DOI":"10.1016\/s1571-0661(04)80791-6","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T16:47:47Z","timestamp":1096476467000},"page":"145-161","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Simulation Reduction as Constraint"],"prefix":"10.1016","volume":"76","author":[{"given":"R.","family":"Gentilini","sequence":"first","affiliation":[]},{"given":"C.","family":"Piazza","sequence":"additional","affiliation":[]},{"given":"A.","family":"Policriti","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80791-6_NEWBIB1","unstructured":"B. Bloom. Ready Simulation, Bisimulation and the Semantics of CCS-like Languages. PhD thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, August 1989."},{"issue":"3","key":"10.1016\/S1571-0661(04)80791-6_NEWBIB2","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0167-6423(95)00003-B","article-title":"Transformational design and implementation of a new efficient solution to the ready simulation problem","volume":"24","author":"Bloom","year":"1995","journal-title":"Science of Computer Programming"},{"key":"10.1016\/S1571-0661(04)80791-6_NEWBIB3","doi-asserted-by":"crossref","unstructured":"D. Bustan and O. Grumberg. Simulation based minimization. In D.A. McAllester, editor, Proc. Int'l Conference on Automated Deduction (CADE'00), volume 1831 of LNCS, pages 255\u2013270. Springer, 2000.","DOI":"10.1007\/10721959_20"},{"issue":"1","key":"10.1016\/S1571-0661(04)80791-6_NEWBIB4","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1145\/151646.151648","article-title":"The Concurrency Workbench: A Semantics Based Tool for the Verification of Concurrent Systems","volume":"15","author":"Cleaveland","year":"1993","journal-title":"ACM Transactions on Porgramming Languages and Systems"},{"key":"10.1016\/S1571-0661(04)80791-6_NEWBIB5","doi-asserted-by":"crossref","unstructured":"R. Cleaveland and B. Steffen. A linear-time model-checking algorithm for the alternation-free modal mu-calculus. In K.G. Larsen and A. Skou, editors, Proc. of Int'l Conference Computer Aided Verification (CAV'91), volume 575 of LNCS, pages 48\u201358. Springer, 1992.","DOI":"10.1007\/3-540-55179-4_6"},{"key":"10.1016\/S1571-0661(04)80791-6_NEWBIB6","doi-asserted-by":"crossref","unstructured":"R. Cleaveland and L. Tan. Simulation revised. In T. Margaria and W. Yi, editors, Proc. Int'l Conference on Tools and Algorithms for the Constructin and Analysis of Systems (TACAS'01), volume 2031 of LNCS, pages 480\u2013495 Springer, 2001.","DOI":"10.1007\/3-540-45319-9_33"},{"issue":"1","key":"10.1016\/S1571-0661(04)80791-6_NEWBIB7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0743-1066(95)00147-6","article-title":"{log}: A language for programming in logic with finite sets","volume":"28","author":"Dovier","year":"1996","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/S1571-0661(04)80791-6_NEWBIB8","doi-asserted-by":"crossref","unstructured":"A. Dovier, C. Piazza, and A. Policriti. A fast bisimulation algorithm. In G. Berry, H. Comon, and A. Finkel, editors, Proc. of Int'l Conference Computer Aided Verification (CAV'01), volume 2102 of LNCS, pages 79\u201390. Springer, 2001.","DOI":"10.1007\/3-540-44585-4_8"},{"issue":"5","key":"10.1016\/S1571-0661(04)80791-6_NEWBIB9","doi-asserted-by":"crossref","first-page":"861","DOI":"10.1145\/365151.365169","article-title":"Sets and constraint logic programming","volume":"22","author":"Dovier","year":"2001","journal-title":"Transaction on Programming Languages and Systems"},{"key":"10.1016\/S1571-0661(04)80791-6_NEWBIB10","doi-asserted-by":"crossref","unstructured":"R. Gentilini, C. Piazza, and A. policriti. Simulation as stable coarsest partition problem. In J. P. Katoen and P. Stevens, editors, Proc. of Int.l Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'02), volume 2280 of LNCS, pages 415\u2013430. Springer, 2002.","DOI":"10.1007\/3-540-46002-0_29"},{"key":"10.1016\/S1571-0661(04)80791-6_NEWBIB11","unstructured":"C. Gervet. Conjunto: constraint logic programming with finite set domains. In M. Bruynooghe editor, Proc. Int'l Symposium on Logic Programming (ILPS'94), pages 339\u2013358. The MIT Press, 1994."},{"key":"10.1016\/S1571-0661(04)80791-6_NEWBIB12","doi-asserted-by":"crossref","unstructured":"M. R. Henzinger, T.A. Henzinger, and P. W. Kopke. Computing simulations on finite and infinite graphs. In 36th Annual Symposium on Foundations of Computer Science (FOCS'95), pages 453\u2013462. IEEE Computer Society Press, 1995.","DOI":"10.1109\/SFCS.1995.492576"},{"year":"1993","series-title":"Symbolic mode checking: an approach to the state explosion problem","author":"McMillan","key":"10.1016\/S1571-0661(04)80791-6_NEWBIB13"},{"issue":"3","key":"10.1016\/S1571-0661(04)80791-6_NEWBIB14","doi-asserted-by":"crossref","first-page":"843","DOI":"10.1145\/177492.177725","article-title":"Model checking and modular verification","volume":"16","author":"Grumberg","year":"1994","journal-title":"ACM Transactions on Programming Languages and systems"},{"key":"10.1016\/S1571-0661(04)80791-6_NEWBIB15","unstructured":"C. Piazza and A. Policriti. Ackermann encoding, bisimulation, and obdd's In Proc. of Workshop on Verification and Computational Logic (VCL'01), 2001."}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104807916?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104807916?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,18]],"date-time":"2024-12-18T20:06:14Z","timestamp":1734552374000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104807916"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,11]]},"references-count":15,"alternative-id":["S1571066104807916"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80791-6","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2002,11]]}}}