Abstract
Entities in communication systems behave under sets of communication rules (protocols) and their behaviours are related to each other. Using this relationship, we present a synthesis algorithm to derive a structured protocol model by generating a peer entity from a given entity automatically. The given entity is in the form of a communicating process, which is natural in the context of communication protocols. We prove that the synthesized protocol model consisting of the generated entity and the peer entity is safe, i.e. logical errors free, collectively represented as deadlock free and is bisimulated by both entities. Unlike many previous works, where FSMs (Finite State Machines) are used to synthesize protocol model, we present our synthesis algorithm for the process-algebraic language LOTOS, which is one of the FDTs developed by ISO.
| Original language | English |
|---|---|
| Title of host publication | International Conference on Network Protocols |
| Place of Publication | Los Alamitos, CA, United States |
| Publisher | IEEE |
| Pages | 66-73 |
| Number of pages | 8 |
| Publication status | Published - 1995 |
| Event | Proceedings of the 1995 International Conference on Network Protocols - Tokyo, Jpn Duration: 1995 Nov 7 → 1995 Nov 10 |
Other
| Other | Proceedings of the 1995 International Conference on Network Protocols |
|---|---|
| City | Tokyo, Jpn |
| Period | 95/11/7 → 95/11/10 |
Fingerprint
ASJC Scopus subject areas
- Software
Cite this
Extension of protocol synthesis to structured entities. / Bahadur Bista, Bhed; Togashi, Atsushi; Shiratori, Norio.
International Conference on Network Protocols. Los Alamitos, CA, United States : IEEE, 1995. p. 66-73.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Extension of protocol synthesis to structured entities
AU - Bahadur Bista, Bhed
AU - Togashi, Atsushi
AU - Shiratori, Norio
PY - 1995
Y1 - 1995
N2 - Entities in communication systems behave under sets of communication rules (protocols) and their behaviours are related to each other. Using this relationship, we present a synthesis algorithm to derive a structured protocol model by generating a peer entity from a given entity automatically. The given entity is in the form of a communicating process, which is natural in the context of communication protocols. We prove that the synthesized protocol model consisting of the generated entity and the peer entity is safe, i.e. logical errors free, collectively represented as deadlock free and is bisimulated by both entities. Unlike many previous works, where FSMs (Finite State Machines) are used to synthesize protocol model, we present our synthesis algorithm for the process-algebraic language LOTOS, which is one of the FDTs developed by ISO.
AB - Entities in communication systems behave under sets of communication rules (protocols) and their behaviours are related to each other. Using this relationship, we present a synthesis algorithm to derive a structured protocol model by generating a peer entity from a given entity automatically. The given entity is in the form of a communicating process, which is natural in the context of communication protocols. We prove that the synthesized protocol model consisting of the generated entity and the peer entity is safe, i.e. logical errors free, collectively represented as deadlock free and is bisimulated by both entities. Unlike many previous works, where FSMs (Finite State Machines) are used to synthesize protocol model, we present our synthesis algorithm for the process-algebraic language LOTOS, which is one of the FDTs developed by ISO.
UR - http://www.scopus.com/inward/record.url?scp=0029486383&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0029486383&partnerID=8YFLogxK
M3 - Conference contribution
SP - 66
EP - 73
BT - International Conference on Network Protocols
PB - IEEE
CY - Los Alamitos, CA, United States
ER -