{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:50:36Z","timestamp":1725562236522},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540220947"},{"type":"electronic","value":"9783540247739"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24773-9_12","type":"book-chapter","created":{"date-parts":[[2010,8,4]],"date-time":"2010-08-04T04:08:27Z","timestamp":1280894907000},"page":"161-168","source":"Crossref","is-referenced-by-count":0,"title":["Observations on the Decidability of Transitions"],"prefix":"10.1007","author":[{"given":"Yuri","family":"Gurevich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rostislav","family":"Yavorskiy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","unstructured":"Foundations of Software Engineering group, Microsoft Research, \n                    \n                      http:\/\/research.microsoft.com\/fse\/"},{"key":"12_CR2","unstructured":"AsmL: The Abstract State Machine Language. Reference Manual. Modeled Computation LLC (2002), \n                    \n                      http:\/\/research.microsoft.com\/fse\/asml\/"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Grieskamp, W., Gurevich, Y., Schulte, W., Veanes, M.: Generating Finite State Machines from Abstract State Machines. In: ISSTA 2002, International Symposium on Software Testing and Analysis (July 2002)","DOI":"10.1145\/566172.566190"},{"key":"12_CR4","unstructured":"Veanes, M., Yavorsky, R.: Combined Algorithm for Approximating a Finite State Abstraction of a Large System. In: SCESM 2003, 2-nd International Workshop on Scenarios and State Machines: Models, Algorithms, and Tools (May 2003)"},{"key":"12_CR5","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139164931","volume-title":"Computability and Logic","author":"G.S. Boolos","year":"2002","unstructured":"Boolos, G.S., Burgess, J.P., Jeffrey, R.C.: Computability and Logic. Cambridge University Press, Cambridge (2002)"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1016\/S0049-237X(08)71116-9","volume-title":"Handbook of Mathematical Logic","author":"M.O. Rabin","year":"1977","unstructured":"Rabin, M.O.: Decidable theories. In: Barwise, J. (ed.) Handbook of Mathematical Logic, pp. 595\u2013627. North Holland, Amsterdam (1977)"}],"container-title":["Lecture Notes in Computer Science","Abstract State Machines 2004. Advances in Theory and Practice"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24773-9_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:09:18Z","timestamp":1620011358000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24773-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540220947","9783540247739"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24773-9_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}