Three partition refinement algorithms
SIAM Journal on Computing
Creating user manuals for using in collaborative design
Conference Companion on Human Factors in Computing Systems
Model checking
Communication and Concurrency
Model Checking Interactor Specifications
Automated Software Engineering
An Efficient Algorithm for Branching Bisimulation and Stuttering Equivalence
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Models of interactive systems: a case study on programmable user modelling
International Journal of Human-Computer Studies
Taming HAL: Designing Interfaces Beyond 2001
Taming HAL: Designing Interfaces Beyond 2001
Concurrency Theory: Calculi an Automata for Modelling Untimed and Timed Concurrent Systems
Concurrency Theory: Calculi an Automata for Modelling Untimed and Timed Concurrent Systems
An approach to formal verification of human–computer interaction
Formal Aspects of Computing
Learning system abstractions for human operators
Proceedings of the International Workshop on Machine Learning Technologies in Software Engineering
Hi-index | 0.00 |
This paper discusses the use of formal methods for analysing human-computer interaction. We focus on the mode confusion problem that arises whenever the user thinks that the system is doing something while it is in fact doing another thing. We consider two kinds of models: the system model describes the actual behaviour of the system and the mental model represents the user's knowledge of the system. The user interface is modelled as a subset of system transitions that the user can control or observe. We formalize a full-control property which holds when a mental model and associated user interface are complete enough to allow proper control of the system. This property can be verified using model-checking techniques on the parallel composition of the two models. We propose a bisimulation-based equivalence relation on the states of the system and show that, if the system satisfies a determinism condition with respect to that equivalence, then minimization modulo that equivalence produces a minimal mental model that allows full-control of the system. We enrich our approach to take operating modes into account. We give experimental results obtained by applying a prototype implementation of the proposed techniques to a simple model of an air-conditioner.