{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T01:25:55Z","timestamp":1778808355881,"version":"3.51.4"},"reference-count":31,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,4,1]],"date-time":"2001-04-01T00:00:00Z","timestamp":986083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4490,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2001,4]]},"DOI":"10.1016\/s0304-3975(00)00103-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T21:51:54Z","timestamp":1027633914000},"page":"93-112","source":"Crossref","is-referenced-by-count":82,"title":["Symbolic model checking with rich assertional languages"],"prefix":"10.1016","volume":"256","author":[{"given":"Y.","family":"Kesten","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"O.","family":"Maler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Marcus","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Pnueli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Shahar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"6","key":"10.1016\/S0304-3975(00)00103-1_BIB1","doi-asserted-by":"crossref","DOI":"10.1016\/0020-0190(86)90071-2","article-title":"Limits for automatic program verification of finite-state concurrent systems","volume":"22","author":"Apt","year":"1986","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(00)00103-1_BIB2","first-page":"31","article-title":"Hardware verification using 2nd-order logic","volume":"vol. 939","author":"Basin","year":"1995"},{"key":"10.1016\/S0304-3975(00)00103-1_BIB3","series-title":"String-Rewriting Systems","author":"Book","year":"1993"},{"key":"10.1016\/S0304-3975(00)00103-1_BIB4","unstructured":"A. Bouajjani, O. Maler, Reachability analysis of push-down automata, Workshop on Infinite-state systems, Pisa, 1996."},{"key":"10.1016\/S0304-3975(00)00103-1_BIB5","doi-asserted-by":"crossref","unstructured":"M.C. Browne, E.M. Clarke, O. Grumberg, Reasoning about networks with many finite state processes, Proc. 5th ACM Symp. Princ. of Dist. Comp., 1986, pp. 240\u2013248.","DOI":"10.1145\/10590.10611"},{"issue":"12","key":"10.1016\/S0304-3975(00)00103-1_BIB6","first-page":"1035","article-title":"Graph-based algorithms for Boolean function manipulation","volume":"C-35","author":"Bryant","year":"1986","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"10.1016\/S0304-3975(00)00103-1_BIB7","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/0890-5401(92)90017-A","article-title":"Symbolic model checking: 1020 states and beyond","volume":"98","author":"Burch","year":"1992","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(00)00103-1_BIB8","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1145\/5397.5399","article-title":"Automatic verification of finite state concurrent systems using temporal logic specifications","volume":"8","author":"Clarke","year":"1986","journal-title":"ACM Trans. Programming Language Systems"},{"key":"10.1016\/S0304-3975(00)00103-1_BIB9","unstructured":"E.M. Clarke, O. Grumberg, H. Hiraishi, S. Jha, D.E. Long, K.L. McMillan, L.A. Ness, Verification of the futurebus+ cache coherence protocol, in: L. Claesen (Ed.), Proc. 11th Internat. Symp. Computer Hardware Description Languages and their Applications, North-Holland, Amsterdam, April 1993."},{"key":"10.1016\/S0304-3975(00)00103-1_BIB10","doi-asserted-by":"crossref","unstructured":"E.M. Clarke, O. Grumberg, S. Jha, Verifying parameterized networks using abstraction and regular languages, Proc. 6th Internat. Conf. on Concurrency Theory (CONCUR\u201995), Philadelphia, PA, August 1995, pp. 395\u2013407.","DOI":"10.1007\/3-540-60218-6_30"},{"key":"10.1016\/S0304-3975(00)00103-1_BIB11","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1016\/S0022-0000(70)80041-1","article-title":"Tree acceptors and some of their applications","volume":"4","author":"Doner","year":"1970","journal-title":"J. Comput. Systems Sci."},{"key":"10.1016\/S0304-3975(00)00103-1_BIB12","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0167-6423(83)90017-5","article-title":"Using branching time temporal logic to synthesize synchronization skeletons","volume":"2","author":"Emerson","year":"1982","journal-title":"Sci. Comput. Prog."},{"key":"10.1016\/S0304-3975(00)00103-1_BIB13","doi-asserted-by":"crossref","unstructured":"E.A. Emerson, K.S. Namjoshi, Reasoning about rings, Proc. 22th ACM Conf. on Principles of Programming Languages, POPL\u201995, San Francisco, 1995.","DOI":"10.1145\/199448.199468"},{"key":"10.1016\/S0304-3975(00)00103-1_BIB14","doi-asserted-by":"crossref","unstructured":"E.A. Emerson, K.S. Namjoshi, Automatic verification of parameterized synchronous systems, in: R. Alur, T. Henzinger (Eds.), Proc. 8th Internat. Conf. on Computer Aided Verification (CAV\u201996), Lecture Notes in Computer Science, Springer, Berlin, 1996.","DOI":"10.1007\/3-540-61474-5_60"},{"key":"10.1016\/S0304-3975(00)00103-1_BIB15","unstructured":"F. G\u00e9cseg, M. Steinby, Tree automata, Akad\u00e9miai Kiad\u00f3, (Publishing House of the Hungarian Academy of Sciences), Budapest, 1984."},{"issue":"6\/7","key":"10.1016\/S0304-3975(00)00103-1_BIB16","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1007\/BF01185559","article-title":"An experience in proving regular networks of processes by modular model checking","volume":"29","author":"Halbwachs","year":"1992","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(00)00103-1_BIB17","doi-asserted-by":"crossref","unstructured":"J.G. Henriksen, J. Jensen, M. J\u00f8rgensen, N. Klarlund, B. Paige, T. Rauhe, A. Sandholm, Mona: Monadic second-order logic in practice, Tools and Algorithms for the Construction and Analysis of Systems, First International Workshop, TACAS \u201995, Lecture Notes in Computer Science, vol. 1019, 1996.","DOI":"10.1007\/3-540-60630-0_5"},{"key":"10.1016\/S0304-3975(00)00103-1_BIB18","doi-asserted-by":"crossref","unstructured":"C.N. Ip, D. Dill, Verifying systems with replicated components in Mur\u03d5, in: R. Alur, T. Henzinger (Eds.), Proc. 8th Internat. Conf. on Computer Aided Verification (CAV\u201996), Lecture Notes in Computer Science, Springer, Berlin, 1996.","DOI":"10.1007\/3-540-61474-5_65"},{"issue":"1","key":"10.1016\/S0304-3975(00)00103-1_BIB19","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1006\/inco.1996.0021","article-title":"Branching time temporal logic and amorphous tree automata","volume":"125","author":"Kupferman","year":"1996","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(00)00103-1_BIB20","doi-asserted-by":"crossref","unstructured":"R.P. Kurshan, K. McMillan, A structural induction theorem for processes, in: P. Rudnicki, Proc. 8th Ann. Symp. on Principles of Distributed Computing, Edmonton, AB, Canada, ACM Press, New York, August 1989, 239\u2013248.","DOI":"10.1145\/72981.72998"},{"key":"10.1016\/S0304-3975(00)00103-1_BIB21","doi-asserted-by":"crossref","unstructured":"D. Lesens, N. Halbwachs, P. Raymond, Automatic verification of parameterized linear networks of processes, Proc. 24th ACM Symp. Principles of Programming Languages, POPL\u201997, Paris, 1997.","DOI":"10.1145\/263699.263747"},{"key":"10.1016\/S0304-3975(00)00103-1_BIB22","series-title":"The Temporal Logic of Reactive and Concurrent Systems","author":"Manna","year":"1991"},{"key":"10.1016\/S0304-3975(00)00103-1_BIB23","series-title":"Symbolic Model Checking","author":"McMillan","year":"1993"},{"key":"10.1016\/S0304-3975(00)00103-1_BIB24","series-title":"Proc. 8th Internat. Conf. on Computer Aided Verification (CAV\u201996), Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1007\/3-540-61474-5_68","article-title":"A platform for combining deductive with algorithmic verification","author":"Pnueli","year":"1996"},{"key":"10.1016\/S0304-3975(00)00103-1_BIB25","first-page":"337","article-title":"Specification and verification of concurrent systems in cesar","volume":"vol. 137","author":"Queille","year":"1982"},{"key":"10.1016\/S0304-3975(00)00103-1_BIB26","first-page":"151","article-title":"Network grammars, communication behaviors and automatic verification","volume":"vol. 407","author":"Shtadler","year":"1989"},{"key":"10.1016\/S0304-3975(00)00103-1_BIB27","first-page":"675","article-title":"Reasoning about systems with many processes","volume":"39","author":"Sistla","year":"1992","journal-title":"J. Appl. Comput. Math."},{"key":"10.1016\/S0304-3975(00)00103-1_BIB28","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF01691346","article-title":"Generalized finite automata theory with an application to a decision problem of second-order logic","volume":"2","author":"Thatcher","year":"1968","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0304-3975(00)00103-1_BIB29","doi-asserted-by":"crossref","unstructured":"W. Thomas, Automata on infinite objects, Handbook of Theoretical Computer Science, 1990, pp. 165\u2013191.","DOI":"10.1016\/B978-0-444-88074-1.50009-3"},{"key":"10.1016\/S0304-3975(00)00103-1_BIB30","first-page":"55","article-title":"Symbolic verification with periodic sets","volume":"vol. 818","author":"Wolper","year":"1994"},{"key":"10.1016\/S0304-3975(00)00103-1_BIB31","first-page":"68","article-title":"Verifying properties of large sets of processes with network invariants","volume":"vol. 407","author":"Wolper","year":"1989"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500001031?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500001031?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,5]],"date-time":"2024-12-05T15:18:26Z","timestamp":1733411906000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500001031"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,4]]},"references-count":31,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,4]]}},"alternative-id":["S0304397500001031"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00103-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,4]]}}}