ようこそ ゲスト さん
雑誌ブラウズ
雑誌 全て
大阪大学 刊行物
ランキング
アクセスランキング
ダウンロードランキング
博士論文のみをさがす
このアイテムのアクセス数:
56
件
(
2021-01-19
18:23 集計
)
このアイテムへのリンクには次のURLをご利用ください:http://hdl.handle.net/11094/27455
閲覧可能ファイル
ファイル
フォーマット
サイズ
閲覧回数
説明
IEICE_E77-A_10_1623
pdf
953 KB
28
論文情報
タイトル
Synthesis of Protocol Specifications from Service Specifications of Distributed Systems in a Marked Graph Model
著者
Yamaguchi, Hirozumi
Yamaguchi, Hirozumi
Taniguchi, Kenichi
Taniguchi, Kenichi
Okano, Kozo
Okano, Kozo
Higashino, Teruo
Higashino, Teruo
キーワード等
Petri net
marked graph
protocol synthesis
parallel events
抄録
In a distributed system, the protocol entities must exchange some data values and synchronization messages in order to ensure the temporal ordering of the events described in a service specification for the distributed system. It is desirable that a correct protocol specification can be derived automatically from a given service specification. In this paper, we propose an algorithm which synthesizes automatically a correct protocol specification from a service specification described as a Marked Graph with Registers (MGR) model and resources (registers and gates) allocation information. This model has a finite control modeled as a marked graph. Therefore, parallel events can be described. In our method, to minimize the number of the exchanged messages, we use a procedure to calculate an optimum solution for 0-1 integer linear programming problems. The number of the steps which each protocol entity needs to simulate one transition in the service specification is also minimized. Ways to avoiding conflict of registers are also described. Our approach has the following advantages. First, parallel events can be described in a service specification. Secondly, many practical systems can be described in the MGR model. Finally, at the protocol specification level, we can understand what events can be executed in parallel.
公開者
電子情報通信学会
公開者の別表記
The Institute of Electronics, Information and Communication Engineers
公開者 (ヨミ)
デンシ ジョウホウ ツウシン ガッカイ
掲載誌名
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
巻
E77-A
号
10
開始ページ
1623
終了ページ
1633
刊行年月
1994-10-25
ISSN
09168508
NCID
AA10826239
URL
http://hdl.handle.net/11094/27455
関連情報 (references)
http://search.ieice.org/
権利情報
Copyright © 1994 The Institute of Electronics, Information and Communication Engineers
言語
英語
カテゴリ
学術雑誌論文 Journal Article
論文詳細を表示
著者版フラグ
publisher
NII資源タイプ
学術雑誌論文
ローカル資源タイプ
学術雑誌論文
dcmi資源タイプ
text
DCTERMS.bibliographicCitation
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences.E77-A(10) P.1623-P.1633
DC.title
Synthesis of Protocol Specifications from Service Specifications of Distributed Systems in a Marked Graph Model
DC.creator
Yamaguchi, Hirozumi
Taniguchi, Kenichi
Okano, Kozo
Higashino, Teruo
DC.publisher
電子情報通信学会
DC.language" scheme="DCTERMS.RFC1766
英語
DCTERMS.issued" scheme="DCTERMS.W3CDTF
1994-10-25
DC.identifier" scheme="DCTERMS.URI
http://hdl.handle.net/11094/27455
DC.subject
Petri net
marked graph
protocol synthesis
parallel events
DCTERMS.abstract
In a distributed system, the protocol entities must exchange some data values and synchronization messages in order to ensure the temporal ordering of the events described in a service specification for the distributed system. It is desirable that a correct protocol specification can be derived automatically from a given service specification. In this paper, we propose an algorithm which synthesizes automatically a correct protocol specification from a service specification described as a Marked Graph with Registers (MGR) model and resources (registers and gates) allocation information. This model has a finite control modeled as a marked graph. Therefore, parallel events can be described. In our method, to minimize the number of the exchanged messages, we use a procedure to calculate an optimum solution for 0-1 integer linear programming problems. The number of the steps which each protocol entity needs to simulate one transition in the service specification is also minimized. Ways to avoiding conflict of registers are also described. Our approach has the following advantages. First, parallel events can be described in a service specification. Secondly, many practical systems can be described in the MGR model. Finally, at the protocol specification level, we can understand what events can be executed in parallel.
DC.rights
Copyright © 1994 The Institute of Electronics, Information and Communication Engineers
citation_title
Synthesis of Protocol Specifications from Service Specifications of Distributed Systems in a Marked Graph Model
citation_author
Yamaguchi, Hirozumi
Taniguchi, Kenichi
Okano, Kozo
Higashino, Teruo
citation_publisher
電子情報通信学会
citation_language
英語
citation_date
1994-10-25
citation_journal_title
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
citation_volume
E77-A
citation_issue
10
citation_firstpage
1623
citation_lastpage
1633
citation_issn
09168508
citation_public_url
http://hdl.handle.net/11094/27455
citation_keywords
Petri net
marked graph
protocol synthesis
parallel events