Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Partition Testing Does Not Inspire Confidence (Program Testing)
IEEE Transactions on Software Engineering
Software testing and reliability
Handbook of software reliability engineering
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Machine Learning
On the Sufficiency of Limited Testing for Knowledge Based Systems
ICTAI '99 Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence
Testing Nondeterminate Systems
ISSRE '00 Proceedings of the 11th International Symposium on Software Reliability Engineering
On Two Problems in the Generation of Program Test Paths
IEEE Transactions on Software Engineering
| Hi-index | 0.00 |
Studies of human conversation suggest that agents whose world models are in consensus can work well together using only very narrow bandwidths. The total bandwidth required between agents could hence be minimized if we could recognize when model consensus breaks down. At the breakdown point, the communication policy could switch from some usual-case low value to a temporary high value while the model conflict is resolved. To effectively recognize the breakdown point, we need tools that recognize model conflicts without requiring extensive bandwidth. A mathematical model of probing and-or graphs suggests that, for a large range of interesting models, the number of probes required to detect consensus breakdown is quite low.