{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:18:17Z","timestamp":1725664697942},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540630456"},{"type":"electronic","value":"9783540690658"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63045-7_42","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T18:00:54Z","timestamp":1330279254000},"page":"419-429","source":"Crossref","is-referenced-by-count":0,"title":["Verification of PLTL formulae by means of monotone disjunctive normal forms"],"prefix":"10.1007","author":[{"given":"Vladimir","family":"Zakharov","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,25]]},"reference":[{"key":"42_CR1","doi-asserted-by":"crossref","unstructured":"Pnueli A.: The temporal logics of programs. Proc. 18th Ann. IEEE Symp. on Foundations of Computer Science, (1977) 46\u201357","DOI":"10.1109\/SFCS.1977.32"},{"key":"42_CR2","unstructured":"Emerson E.A.: Temporal and modal logic. Handbook of theoretical computer science, Ed. by J.van Leeuwen, Elsevier Science Publishers, (1990) 997\u20131072"},{"key":"42_CR3","first-page":"119","volume":"28","author":"P. Wolper","year":"1985","unstructured":"Wolper P.: The tableau method for Temporal Logic: an overview. Logique et Anal., 28 (1985) 119\u2013136","journal-title":"Logique et Anal."},{"key":"42_CR4","doi-asserted-by":"crossref","unstructured":"Vardi M., Wolper P.: Automata theoretic techniques for modal logics of programs. Proc. 16th Ann. ACM Symp. on Theory of Computing, (1984) 446\u2013456","DOI":"10.1145\/800057.808711"},{"key":"42_CR5","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1007\/3-540-15648-8_16","volume":"193","author":"O. Lichtenstain","year":"1985","unstructured":"Lichtenstain O., Pnueli A., Zuck L.: The glory of the past. Lecture Notes in Computer Science, 193 (1985) 196\u2013218","journal-title":"Lecture Notes in Computer Science"},{"key":"42_CR6","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/3-540-56922-7_9","volume":"697","author":"Y. Kesten","year":"1993","unstructured":"Kesten Y., Manna Z., McGuire H., Pnueli A.: A decision algorithm for full propositional temporal logic. Lecture Notes in Computer Science, 697 (1993) 97\u2013109","journal-title":"Lecture Notes in Computer Science"},{"issue":"N2","key":"42_CR7","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R.E. Tarjan","year":"1972","unstructured":"Tarjan R.E.: Depth first search and linear graph algorithms, SIAM J. Comput., 1, N 2, (1972) 146\u2013160","journal-title":"SIAM J. Comput."},{"key":"42_CR8","unstructured":"Aho A.V., Hopcroft J.E., Ullman J.D.: The design and analysis of computer algorithms. Addison-Weslay P.C. (1976)"},{"issue":"N2","key":"42_CR9","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/0890-5401(92)90017-A","volume":"98","author":"J.R. Burch","year":"1992","unstructured":"Burch J.R., Clarke E.M., McMillan K.L., Dill D.L., Hwang H.: Symbolic model checking: 1020 states and beyond. Information and Computation, 98, N 2, (1992) 142\u2013170","journal-title":"Information and Computation"},{"key":"42_CR10","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1007\/3-540-58179-0_72","volume":"818","author":"E.M. Clarke","year":"1994","unstructured":"Clarke E.M., Grumberg O., Hamaguchi K.: Another look at LTL model checking. Lecture Notes in Computer Science, 818 (1994) 415\u2013427","journal-title":"Lecture Notes in Computer Science"},{"key":"42_CR11","unstructured":"Kesten Y., Pnueli A., Raviv L.: Model checking of Linear TL, using OBDD. Manuscript"},{"key":"42_CR12","doi-asserted-by":"crossref","unstructured":"Quine W.V.: On cores and prime implicants of truth functions. Amer. Math. Monthly. 62, N 9, (1959)","DOI":"10.1080\/00029890.1959.11989404"},{"key":"42_CR13","doi-asserted-by":"crossref","unstructured":"Bryant R.E.: Graph-based algorithms for boolean function manipulation, IEEE Trans. Comput. 8 (1986)","DOI":"10.1109\/TC.1986.1676819"},{"issue":"N5","key":"42_CR14","first-page":"909","volume":"100","author":"G.N. Povarov","year":"1955","unstructured":"Povarov G.N.: Mathematical theory of (1, k)-pole contact circuit synthesis. Doklady Akad. Nauk SSSR. 100, N 5, (1955) 909\u2013912.","journal-title":"Doklady Akad. Nauk SSSR"}],"container-title":["Lecture Notes in Computer Science","Logical Foundations of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63045-7_42.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:41:22Z","timestamp":1619559682000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63045-7_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540630456","9783540690658"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-63045-7_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}