Name
Abstract | ||
|---|---|---|
The authors propose a synthetic technique to derive a correct protocol specification from a given service specification modeled as a nondeterministic extended finite state machine (EFSM). Each EFSM has a finite state control and a finite number of registers. In the model, the next state and the next values of the registers are determined depending on not only the current state and input but also the current values of the registers. The registers correspond to the system resources and they are allocated to some of the protocol entities in a distributed system. The derived protocol entities' specifications satisfy the resource allocation specified by the designer. A procedure solving 0-1 integer linear programming problems is used to reduce the number of the messages exchanged among the protocol entities |
Year | DOI | Venue |
|---|---|---|
1993 | 10.1109/ICDCS.1993.287714 | Pittsburgh, PA |
Keywords | Field | DocType |
finite state machines,formal specification,integer programming,protocols,0-1 integer linear programming problems,extended FSM models,finite state control,nondeterministic extended finite state machine,protocol specifications,service specifications | Finite set,Nondeterministic algorithm,Computer science,Protocol specification,Extended finite-state machine,Theoretical computer science,Formal specification,Finite-state machine,Integer programming,Resource allocation,Distributed computing | Conference |
ISBN | Citations | PageRank |
0-8186-3770-6 | 12 | 0.91 |
References | Authors | |
6 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Teruo Higashino | 1 | 1086 | 119.60 |
| Kozo Okano | 2 | 37 | 10.93 |
| Hiroshi Imajo | 3 | 12 | 0.91 |
| kenichi taniguchi | 4 | 256 | 35.56 |