Immediate observability of discrete event systems with application to user-interface design

A human interacting with a hybrid system is often presented, through information displays, with a simplified representation of the underlying system. This interface should not overwhelm the human with unnecessary information, and thus usually contains only a subset of information about the true system model, yet, if properly designed, represents an abstraction of the true system which the human is able to use to safely interact with the system [M. Heymann and A. Degani, 2002]. For cases in which the human interacts with all or part of the system from a remote location, and communication has a high cost, the need for a simple abstraction, which reduces the amount of information that must be transmitted, is of the utmost importance. The user should be able to immediately determine the actual state of the system, based on the information displayed through the interface. In this paper, we derive conditions for immediate observability in which the current state of the system can be unambiguously reconstructed from the output associated with the current state and the last or next event. Then, we show how to construct a discrete event system output function, which makes a system immediately observable, and apply this to a reduced state machine, which represents an interface.

[1]  Alexandre M. Bayen,et al.  Hybrid verification of an interface for an automatic landing , 2002, Proceedings of the 41st IEEE Conference on Decision and Control, 2002..

[2]  A. Willsky,et al.  Observability of discrete event dynamic systems , 1990 .

[3]  Maurizio Damiani,et al.  The state reduction of nondeterministic finite-state machines , 1997, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[4]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[5]  P. Ramadge.  Observability of discrete event systems , 1986, 1986 25th IEEE Conference on Decision and Control.

[6]  Stephen H. Unger,et al.  Asynchronous sequential switching circuits , 1969 .

[7]  Jun Gu,et al.  An efficient algorithm to search for minimal closed covers in sequential machines , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[8]  Walter Murray Wonham,et al.  On observability of discrete-event systems , 1988, Inf. Sci..

[9]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[10]  Tiziano Villa,et al.  Theory and algorithms for state minimization of nondeterministic FSMs , 1997, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[11]  R. Greiner,et al.  Dynamical logic observers for finite automata , 1988, Proceedings of the 27th IEEE Conference on Decision and Control.

[12]  Fabrizio Luccio,et al.  A Method for Minimizing the Number of Internal States in Incompletely Specified Sequential Networks , 1965, IEEE Trans. Electron. Comput..

[13]  Rodney Teo,et al.  Decentralized overlapping control of a formation of unmanned aerial vehicles , 2004, Autom..

[14]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.

[15]  Michael Heymann,et al.  On Abstractions and Simplifications in the Design of Human-Automation Interfaces , 2002 .

[16]  Asaf Degani,et al.  Formal Aspects of Human-Automation Interaction , 1998 .

[17]  R.W. Butler,et al.  A formal methods approach to the analysis of mode confusion , 1998, 17th DASC. AIAA/IEEE/SAE. Digital Avionics Systems Conference. Proceedings (Cat. No.98CH36267).

[18]  D. Woods,et al.  Automation Surprises , 2001 .

[19]  Nancy G. Leveson,et al.  Designing automation to reduce operator errors , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[20]  Karsten P. Ulland,et al.  Vii. References , 2022 .

[21]  Stephen H. Unger,et al.  Minimizing the Number of States in Incompletely Specified Sequential Switching Functions , 1959, IRE Trans. Electron. Comput..

[22]  Denis Javaux,et al.  Models and Mechanized Methods that Integrate Human Factors into Automation Design , 2000 .

[23]  Arlindo L. Oliveira,et al.  A new algorithm for exact reduction of incompletely specified finite state machines , 1999, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[24]  R. Stephenson.  A and V , 1962, The British journal of ophthalmology.

[25]  Arlindo L. Oliveira,et al.  A new algorithm for the reduction of incompletely specified finite state machines , 1998, 1998 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (IEEE Cat. No.98CB36287).

[26]  Tiziano Villa,et al.  Implicit computation of compatible sets for state minimization of ISFSMs , 1997, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[27]  G. Meyer,et al.  Some Formal Aspects of Human-Automation Interaction , 2002 .

[28]  Seymour Ginsburg.  A Technique for the Reduction of a Given Machine to a Minimal-State Machine , 1959, IRE Trans. Electron. Comput..

[29]  Leonidas J. Guibas,et al.  A Distributed Algorithm for Managing Multi-target Identities in Wireless Ad-hoc Sensor Networks , 2003, IPSN.