{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T09:57:39Z","timestamp":1776333459246,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540203636","type":"print"},{"value":"9783540397243","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39724-3_12","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T21:15:55Z","timestamp":1294434955000},"page":"126-140","source":"Crossref","is-referenced-by-count":42,"title":["\u201cMore Deterministic\u201d vs. \u201cSmaller\u201d B\u00fcchi Automata for Efficient LTL Model Checking"],"prefix":"10.1007","author":[{"given":"Roberto","family":"Sebastiani","sequence":"first","affiliation":[]},{"given":"Stefano","family":"Tonetta","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/3-540-48683-6_23","volume-title":"Computer Aided Verification","author":"M. Daniele","year":"1999","unstructured":"Daniele, M., Giunchiglia, F., Vardi, M.: Improved Automata Generation for Linear Time Temporal Logic. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol.\u00a01633, pp. 249\u2013260. Springer, Heidelberg (1999)"},{"key":"12_CR2","first-page":"995","volume-title":"Handbook of Theoretical Computer Science","author":"E.A. Emerson","year":"1990","unstructured":"Emerson, E.A.: Temporal and Modal Logic. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol.\u00a0B, pp. 995\u20131072. Elsevier Science Publisher B.V., Amsterdam (1990)"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/3-540-44618-4_13","volume-title":"CONCUR 2000 - Concurrency Theory","author":"K. Etessami","year":"2000","unstructured":"Etessami, K., Holtzmann, G.: Optimizing B\u00fcchi Automata. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol.\u00a01877, p. 153. Springer, Heidelberg (2000)"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1007\/3-540-48224-5_57","volume-title":"Automata, Languages and Programming","author":"K. Etessami","year":"2001","unstructured":"Etessami, K., Schuller, R., Wilke, T.: Fair Simulation Relations, Parity Games, and State Space Reduction for Buechi Automata. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, p. 694. Springer, Heidelberg (2001)"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/3-540-44585-4_6","volume-title":"Computer Aided Verification","author":"P. Gastin","year":"2001","unstructured":"Gastin, P., Oddoux, D.: Fast LTL to B\u00fcchi Automata Translation. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol.\u00a02102, pp. 53\u201365. Springer, Heidelberg (2001)"},{"key":"12_CR6","volume-title":"Proc. 15th IFIP\/WG6 .1 Symposium on Protocol Specification, Testing and Verification","author":"R. Gerth","year":"1995","unstructured":"Gerth, R., Peled, D., Vardi, M., Wolper, P.: Simple on-the-fly automatic verification of linear temporal logic. In: Proc. 15th IFIP\/WG6.1 Symposium on Protocol Specification, Testing and Verification, Warzaw, Poland, Chapman & Hall, Boca Raton (1995)"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","volume-title":"Formal Techniques for Networked and Distributed Systems - FORTE 2002","author":"D. Giannakopoulou","year":"2002","unstructured":"Giannakopoulou, D., Lerda, F.: From States to Transitions: Improving Translation of LTL Formulae to B\u00fcchi Automata. In: Peled, D.A., Vardi, M.Y. (eds.) FORTE 2002. LNCS, vol.\u00a02529, Springer, Heidelberg (2002)"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Giunchiglia, F., Sebastiani, R.: Building decision procedures for modal logics from propositional decision procedures \u2013 the case study of modal K(m). Information and Computation\u00a0162(1\/2) (October\/November 2000)","DOI":"10.1006\/inco.1999.2850"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1007\/3-540-45657-0_51","volume-title":"Computer Aided Verification","author":"S. Gurumurty","year":"2002","unstructured":"Gurumurty, S., Bloem, R., Somenzi, F.: Fair Simulation Minimization. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, p. 610. Springer, Heidelberg (2002)"},{"issue":"5","key":"12_CR10","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1109\/32.588521","volume":"23","author":"G. Holtzmann","year":"1997","unstructured":"Holtzmann, G.: The Model Checker Spin. IEEE Trans. on Software Engineering\u00a023(5), 279\u2013295 (1997)","journal-title":"IEEE Trans. on Software Engineering"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Kupferman, O., Vardi, M.Y.: Freedom,Weakness, and Determinism: From Linear-time to Branching-time. In: Proc. 13th IEEE Symposium on Logic in Computer Science (June 1998)","DOI":"10.1109\/LICS.1998.705645"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/10722167_21","volume-title":"Computer Aided Verification","author":"F. Somenzi","year":"2000","unstructured":"Somenzi, F., Bloem, R.: Efficient B\u00fcchi Automata from LTL Formulae. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855, Springer, Heidelberg (2000)"},{"key":"12_CR13","unstructured":"Tauriainen, H.: A Randomized Testbench for Algorithms Translating Linear Temporal Logic Formulae into B\u00fcchi Automata. In: Proceedings of the Concurrency, Specification and Programming 1999 Workshop (CS&P 1999), Warsaw University, September 1999, pp. 251\u2013262 (1999)"}],"container-title":["Lecture Notes in Computer Science","Correct Hardware Design and Verification Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39724-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T10:01:02Z","timestamp":1553335262000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39724-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540203636","9783540397243"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39724-3_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003]]}}}