Rie Kubota Ando
CoNLL 2006
A model of Communications protocols based on finite-state machines is investigated. The problem addressed is how to ensure certain generally desirable properties, which make protocols “wellformed,” that is, specify a response to those and only those events that can actually occur. It is determined to what extent the problem is solvable, and one approach to solving it ts described. © 1983, ACM. All rights reserved.
Rie Kubota Ando
CoNLL 2006
Albert Atserias, Anuj Dawar, et al.
Journal of the ACM
Rei Odaira, Jose G. Castanos, et al.
IISWC 2013
Joxan Jaffar
Journal of the ACM