Learning regular sets from queries and counterexamples
Information and Computation
Three partition refinement algorithms
SIAM Journal on Computing
A new algorithm for the reduction of incompletely specified finite state machines
Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design
ASE '00 Proceedings of the 15th IEEE international conference on Automated software engineering
CCS expressions, finite state processes, and three problems of equivalence
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Taming HAL: Designing Interfaces Beyond 2001
Taming HAL: Designing Interfaces Beyond 2001
Synthesis of interface specifications for Java classes
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proceedings of the 10th European software engineering conference held jointly with 13th ACM SIGSOFT international symposium on Foundations of software engineering
Assume-Guarantee Verification for Interface Automata
FM '08 Proceedings of the 15th international symposium on Formal Methods
Systematic Analysis of Control Panel Interfaces Using Formal Tools
Interactive Systems. Design, Specification, and Verification
Applying Graph Theory to Interaction Design
Engineering Interactive Systems
Learning Minimal Separating DFA's for Compositional Verification
TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
Interface Generation and Compositional Verification in JavaPathfinder
FASE '09 Proceedings of the 12th International Conference on Fundamental Approaches to Software Engineering: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
A bisimulation-based approach to the analysis of human-computer interaction
Proceedings of the 1st ACM SIGCHI symposium on Engineering interactive computing systems
International Journal of Human-Computer Studies
Hi-index | 0.00 |
This paper is concerned with the use of formal techniques for the analysis of human-machine interactions (HMI). The focus is on generating system abstractions for human operators. Such abstractions, once expressed in rigorous, formal notations, can be used for analysis or for user training. They should ideally be minimal in order to concisely capture the system behaviour. They should also contain enough information to allow full-control of the system. This work addresses the problem of automatically generating abstractions, based on formal descriptions of system behaviour. Previous work presented a bisimulation-based technique for constructing minimal full-control abstractions. This paper proposes an alternative approach based on the use of the L* learning algorithm. In particular, minimal abstractions are generated from learned three-valued deterministic finite-state automata. The learning-based approach is applied on a number of examples and compared to the bisimulation-based approach. The result of these comparisons is that there is no clear winner. However, the proposed approach has wider applicability since it can handle more types of systems than the bisimulation-based technique. Moreover, if no full-control abstraction can be generated due to a form of non-determinism in the system, the learning-based approach provides counterexamples that allow to detect and analyze that non-determinism. We also discuss how the well-known HMI issue of mode confusion can be analyzed through this approach.