{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T07:03:34Z","timestamp":1725606214351},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642231773"},{"type":"electronic","value":"9783642231780"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23178-0_9","type":"book-chapter","created":{"date-parts":[[2011,9,10]],"date-time":"2011-09-10T03:15:58Z","timestamp":1315624558000},"page":"98-109","source":"Crossref","is-referenced-by-count":1,"title":["Symbolic Algorithm for Generation B\u00fcchi Automata from LTL Formulas"],"prefix":"10.1007","author":[{"given":"Irina V.","family":"Shoshmina","sequence":"first","affiliation":[]},{"given":"Alexey B.","family":"Belyaev","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Muller, D., Schupp, P.E.: Alternating Automata on Infinite Objects, Determinacy and Rabin\u2019s Theorem. In: Perrin, D., Nivat, M. (eds.) Proc. Automata on Infinite Words\u00a0\u2013 \u00c9cole de Printemps d\u2019Informatique Th\u00e9orique (EPIT 1984). LNCS, vol.\u00a0192, pp. 99\u2013107 (1985)","DOI":"10.1007\/3-540-15641-0_27"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/3-540-57887-0_116","volume-title":"Theoretical Aspects of Computer Software","author":"M. Vardi","year":"1994","unstructured":"Vardi, M.: Nontraditional Applications of Automata Theory. In: Hagiya, M., Mitchell, J.C. (eds.) TACS 1994. LNCS, vol.\u00a0789, pp. 575\u2013597. Springer, Heidelberg (1994)"},{"key":"9_CR3","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":"9_CR4","unstructured":"Tauriainen, H.: Automata and Linear Temporal Logic: Translations with Trace-Based Acceptance. PhD.Thesis, Helsinki University of Technology (2006)"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/3-540-36135-9_20","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, pp. 308\u2013326. Springer, Heidelberg (2002)"},{"key":"9_CR6","unstructured":"Rohde, G.S.: Alternating Automata and the Temporal Logic of Ordinals. PhD. Thesis in Mathematics, University of Illinois at Urbana-Champaign (1997)"},{"key":"9_CR7","unstructured":"Karpov, Y.G.: Model Checking: Verification of Parallel and Distributed Program Systems, p. 560. SPb:BHV-Petersburg (2010) (in Russian)"},{"key":"9_CR8","first-page":"608","volume-title":"Spin Model Checker. The Primer and Reference Manual","author":"G. Holzmann","year":"2003","unstructured":"Holzmann, G.: Spin Model Checker. The Primer and Reference Manual, p. 608. Addison-Wesley, Reading (2003)"},{"key":"9_CR9","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 temporal logic. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol.\u00a01633, pp. 249\u2013260. Springer, Heidelberg (1999)"},{"key":"9_CR10","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":"9_CR11","unstructured":"The BuDDy Project, http:\/\/sourceforge.net\/projects\/buddy\/"}],"container-title":["Lecture Notes in Computer Science","Parallel Computing Technologies"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23178-0_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,15]],"date-time":"2019-06-15T03:52:39Z","timestamp":1560570759000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23178-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642231773","9783642231780"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23178-0_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}