The design and implementation of INGRES
ACM Transactions on Database Systems (TODS)
On Communicating Finite-State Machines
Journal of the ACM (JACM)
A relational model of data for large shared data banks
Communications of the ACM
A note on reliable full-duplex transmission over half-duplex links
Communications of the ACM
Theory of Relational Databases
Theory of Relational Databases
Computational Complexity of Sorting and Joining Relations with Duplicates
IEEE Transactions on Knowledge and Data Engineering
Duplicate removal on Hypercube engines: An experimental analysis
Parallel Computing
| Hi-index | 0.01 |
Communications protocols are usually modeled by a pair of finite-state machines that generate the interaction between processes. Protocol verification is a procedure to validate the logical correctness of these interaction sequences and to detect potential design errors. A relational approach is proposed to represent a finite-state machine as a transition table. On this basis, the well-established theory of relational databases can be utilized to derive the global-state transitions of the system. Furthermore, logical errors of a protocol such as deadlocks, incomplete specifications and nonexecutable interactions can be formulated in terms of relational algebra. This approach has been implemented on the INGRES database system and applied to the verification of several protocols.