Synthesis of Protocol Specifications from Service Specifications of Distributed Systems in a Marked Graph Model

Yamaguchi, Hirozumi; Taniguchi, Kenichi; Okano, Kozo et al.

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences, 1994, E77-A(10), 1623-1633

Number of Access:521（2025-08-15 10:58 Counts）

Identifier to cite or link to this item: https://hdl.handle.net/11094/27455

Link to primary information 

File Format Terms of use Size Views Date.Available Description information
IEICE_E77-A_10_1623 pdf None 953 KB 101 2014.04.11  

Item Information

Output File Export EndNote Basic Export Mendeley

Title
Synthesis of Protocol Specifications from Service Specifications of Distributed Systems in a Marked Graph Model
Creator
NRID
1000080314409 1000080314409
ORCID
0000-0003-2273-4876 0000-0003-2273-4876
researchmap permalink
hirozumi.yamaguchi hirozumi.yamaguchi
Scopus Author ID
7404274201 7404274201
CreatorName
Yamaguchi, Hirozumi
NRID
1000000029513 1000000029513
CreatorName
Taniguchi, Kenichi
NRID
1000070252632 1000070252632
CreatorName
Okano, Kozo
NRID
1000080173144 1000080173144
researchmap permalink
teruo.higashino teruo.higashino
Scopus Author ID
7005648670 7005648670
CreatorName
Higashino, Teruo
Subject
Petri net
marked graph
protocol synthesis
parallel events
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.
Publisher
電子情報通信学会
The Institute of Electronics, Information and Communication Engineers
デンシ　ジョウホウ　ツウシン　ガッカイ
Source Title
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Volume (Issue)
E77-A(10)
Page
1623-1633
Date of Issued
1994-10-25
Language
English
Handle URL
https://hdl.handle.net/11094/27455
PISSN
09168508
NCID
AA10826239
Relation.references
URI
http://search.ieice.org/
Access Rights
open access
CopyRight
Copyright © 1994 The Institute of Electronics, Information and Communication Engineers
oaire:version
Version of Record
Category
学術雑誌論文 Journal Article