{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T14:48:39Z","timestamp":1725547719220},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642118104"},{"type":"electronic","value":"9783642118111"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11811-1_37","type":"book-chapter","created":{"date-parts":[[2010,2,19]],"date-time":"2010-02-19T11:57:22Z","timestamp":1266580642000},"page":"403-403","source":"Crossref","is-referenced-by-count":1,"title":["Code Synthesis for Timed Automata: A Comparison Using Case Study"],"prefix":"10.1007","author":[{"given":"Anaheed","family":"Ayoub","sequence":"first","affiliation":[]},{"given":"Ayman","family":"Wahba","sequence":"additional","affiliation":[]},{"given":"Ashraf","family":"Salem","sequence":"additional","affiliation":[]},{"given":"Mohamed","family":"Sheirah","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"37_CR1","unstructured":"http:\/\/www.it.uu.se\/research\/group\/darts\/times\/papers\/manual.pdf"},{"key":"37_CR2","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511624162","volume-title":"The B-Book: Assigning Programs to Meanings","author":"J.-R. Abrial","year":"1996","unstructured":"Abrial, J.-R.: The B-Book: Assigning Programs to Meanings. Cambridge University Press, Cambridge (1996)"},{"key":"37_CR3","unstructured":"http:\/\/www.tools.clearsy.com\/index.php5?title=Tutorial_ComenC"},{"key":"37_CR4","doi-asserted-by":"crossref","unstructured":"Ayoub, A., Wahba, A., Salem, A., Taher, M., Sheirah, M.: Automatic Code Generation from Verified Timed Automata Model. To be appear in proceeding of IADIS Applied Computing, Italy (2009)","DOI":"10.1109\/IDT.2008.4802508"},{"key":"37_CR5","unstructured":"Amnell, T., Fersman, E., Pettersson, P., Sun, H., Yi, W.: Code Synthesis for Timed Automata. Nordic Journal of Computing\u00a09(4) (2002)"},{"key":"37_CR6","unstructured":"http:\/\/www.it.uu.se\/research\/group\/darts\/papers\/texts\/new-tutorial.pdf"}],"container-title":["Lecture Notes in Computer Science","Abstract State Machines, Alloy, B and Z"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11811-1_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:44:19Z","timestamp":1606185859000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11811-1_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642118104","9783642118111"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11811-1_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}