{"created":"2023-05-15T10:29:21.738487+00:00","id":25328,"links":{},"metadata":{"_buckets":{"deposit":"a67e115b-d4bd-4c1c-9e32-f85438804813"},"_deposit":{"created_by":1,"id":"25328","owners":[1],"pid":{"revision_id":0,"type":"depid","value":"25328"},"status":"published"},"_oai":{"id":"oai:u-fukui.repo.nii.ac.jp:00025328","sets":["2403:2226:2238:2289"]},"author_link":["73316","73318","73317","73319","73315","73320"],"item_10002_biblio_info_7":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2003-03","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicPageEnd":"96","bibliographicPageStart":"89","bibliographicVolumeNumber":"51","bibliographic_titles":[{"bibliographic_title":"福井大学工学部研究報告"}]}]},"item_10002_description_5":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"One of methods to solve integer programming problems consists in the method which uses groebner bases. An arbitrary solution for a state equation Ax=b(A∈Zmxn,b∈Zmx1) of Petri nets means a firing count vector. Then finding a nonnegative integer solution x∈Znx1+ for Ax=b in Petri nets is one of integer programming problems. In this paper, the method to obtain generators of solutions in Petri nets by using groebner bases is proposed and investigated. moreover, Petri nets have an ill property that the number of minimal support T-invariants increases in exponential when places and transitions are increased. Then, the number of groebner bases and calculation time of groebner bases are measured by using a symbolic computation system or a computer algebra system; Maple 7.","subitem_description_type":"Abstract"}]},"item_10002_relation_11":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_relation_type_id":{"subitem_relation_type_id_text":"TD00004714","subitem_relation_type_select":"NCID"}}]},"item_10002_source_id_9":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"4298373","subitem_source_identifier_type":"ISSN"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"高田, 真樹"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"松本, 忠"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"茂呂, 征一郎"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"TAKATA, Maki","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"MATSUMOTO, Tadashi","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"MORO, Seiichiro","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2020-08-05"}],"displaytype":"detail","filename":"AN00215401-051-01-011.pdf","filesize":[{"value":"672.9 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"AN00215401-051-01-011.pdf","url":"https://u-fukui.repo.nii.ac.jp/record/25328/files/AN00215401-051-01-011.pdf"},"version_id":"f8e1f87e-926d-47dd-a2b7-4f05a545df3f"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"Groebner Basis","subitem_subject_scheme":"Other"},{"subitem_subject":"Generators","subitem_subject_scheme":"Other"},{"subitem_subject":"Monomial Order","subitem_subject_scheme":"Other"},{"subitem_subject":"Algorithm for Division","subitem_subject_scheme":"Other"},{"subitem_subject":"Buchberger Algorithm","subitem_subject_scheme":"Other"},{"subitem_subject":"Symbolic ComputationSystem or Computer Algebra System","subitem_subject_scheme":"Other"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"departmental bulletin paper","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"計算機代数システム援用によるグレブナー基底のペトリネットの挙動解析への適用","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"計算機代数システム援用によるグレブナー基底のペトリネットの挙動解析への適用"},{"subitem_title":"An Application of Groebner Bases to Behavioral Analyses for Petri Nets  by Means of Computer Algebra Systems","subitem_title_language":"en"}]},"item_type_id":"10002","owner":"1","path":["2289"],"pubdate":{"attribute_name":"公開日","attribute_value":"2011-04-06"},"publish_date":"2011-04-06","publish_status":"0","recid":"25328","relation_version_is_last":true,"title":["計算機代数システム援用によるグレブナー基底のペトリネットの挙動解析への適用"],"weko_creator_id":"1","weko_shared_id":-1},"updated":"2023-05-15T23:04:34.262229+00:00"}