{"created":"2023-07-27T06:24:46.677969+00:00","id":7823,"links":{},"metadata":{"_buckets":{"deposit":"19264193-becf-435d-af0f-ed3473a5076b"},"_deposit":{"created_by":3,"id":"7823","owners":[3],"pid":{"revision_id":0,"type":"depid","value":"7823"},"status":"published"},"_oai":{"id":"oai:kanazawa-u.repo.nii.ac.jp:00007823","sets":["934:935:936"]},"author_link":["10661","10660","397"],"item_4_biblio_info_8":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2005-11-01","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"11","bibliographicPageEnd":"2981","bibliographicPageStart":"2972","bibliographicVolumeNumber":"E88-A","bibliographic_titles":[{"bibliographic_title":"IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"}]}]},"item_4_description_21":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"We can model embedded systems as hybrid systems. Moreover, they are distributed and real-time systems. Therefore, it is important to specify and verify randomness and soft real-time properties. For the purpose of system verification, we formally define probabilistic linear hybrid automaton and its symbolic reachability analysis method. It can describe uncertainties and soft real-time characteristics. Copyright © 2005 The Institute of Electronics, Information and Communication Engineers","subitem_description_type":"Abstract"}]},"item_4_description_5":{"attribute_name":"提供者所属","attribute_value_mlt":[{"subitem_description":"金沢大学理工研究域電子情報学系","subitem_description_type":"Other"}]},"item_4_publisher_17":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"IEICE 電子情報通信学会"}]},"item_4_relation_12":{"attribute_name":"DOI","attribute_value_mlt":[{"subitem_relation_type":"isIdenticalTo","subitem_relation_type_id":{"subitem_relation_type_id_text":"10.1093/ietfec/e88-a.11.2972","subitem_relation_type_select":"DOI"}}]},"item_4_relation_28":{"attribute_name":"関連URI","attribute_value_mlt":[{"subitem_relation_type_id":{"subitem_relation_type_id_text":"http://www.ieice.org/jpn/index.html","subitem_relation_type_select":"URI"}},{"subitem_relation_type_id":{"subitem_relation_type_id_text":"http://ci.nii.ac.jp/naid/110003500451","subitem_relation_type_select":"URI"}}]},"item_4_rights_23":{"attribute_name":"権利","attribute_value_mlt":[{"subitem_rights":"(c) 2005 IEICE 電子情報通信学会"}]},"item_4_source_id_11":{"attribute_name":"NCID","attribute_value_mlt":[{"subitem_source_identifier":"AN10467885","subitem_source_identifier_type":"NCID"}]},"item_4_source_id_9":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"0916-8508","subitem_source_identifier_type":"ISSN"}]},"item_4_version_type_25":{"attribute_name":"著者版フラグ","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_970fb48d4fbd8a85","subitem_version_type":"VoR"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Mutsuda, Yosuke"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Kato, Takaaki"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Yamane, Satoshi"}],"nameIdentifiers":[{},{},{}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2017-10-03"}],"displaytype":"detail","filename":"TE-PR-YAMANE-S-2972.pdf","filesize":[{"value":"978.5 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"TE-PR-YAMANE-S-2972.pdf","url":"https://kanazawa-u.repo.nii.ac.jp/record/7823/files/TE-PR-YAMANE-S-2972.pdf"},"version_id":"4f9a5715-16e5-485f-9960-1a243e85da4a"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"journal article","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"Symbolic Reachability Analysis of Probabilistic Linear Hybrid Automata(<Special Section>Concurrent/Hybrid Systems : Theory and Applications)","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Symbolic Reachability Analysis of Probabilistic Linear Hybrid Automata(<Special Section>Concurrent/Hybrid Systems : Theory and Applications)"}]},"item_type_id":"4","owner":"3","path":["936"],"pubdate":{"attribute_name":"公開日","attribute_value":"2017-10-03"},"publish_date":"2017-10-03","publish_status":"0","recid":"7823","relation_version_is_last":true,"title":["Symbolic Reachability Analysis of Probabilistic Linear Hybrid Automata(<Special Section>Concurrent/Hybrid Systems : Theory and Applications)"],"weko_creator_id":"3","weko_shared_id":-1},"updated":"2023-07-28T02:19:06.758349+00:00"}