The Experts below are selected from a list of 360 Experts worldwide ranked by ideXlab platform
Thierry Morineau - One of the best experts on this subject based on the ideXlab platform.
-
Verification and validation of a Work Domain Analysis with Turing Machine task analysis
Applied Ergonomics, 2015Co-Authors: J. Rechard, Pascal Berruet, Thierry MorineauAbstract:While the use of Work Domain Analysis as a methodological framework in cognitive engineering is increasing rapidly, verification and validation of work domain models produced by this method are becoming a significant issue. In this article, we propose the use of a method based on Turing Machine formalism named "Turing Machine Task Analysis" to verify and validate work domain models. The application of this method on two work domain analyses, one of car driving which is an "intentional" domain, and the other of a ship water system which is a "causal domain" showed the possibility of highlighting improvements needed by these models. More precisely, the step by step analysis of a degraded task scenario in each work domain model pointed out unsatisfactory aspects in the first modelling, like overspecification, underspecification, omission of work domain affordances, or unsuitable inclusion of objects in the work domain model.
-
verification and validation of a work domain analysis with Turing Machine task analysis
Proceedings of the 2014 Ergonomie et Informatique Avancée Conference - Design Ergonomie et IHM: quelle articulation pour la co-conception de l'interac, 2014Co-Authors: J. Rechard, Pascal Berruet, Alain Bignon, Thierry MorineauAbstract:Whereas the use of work domain analysis as a methodological framework in cognitive engineering increases rapidly in frequency, verification and validation of work domain models produced by this method become yet a significant issue. In this article, we propose to use a method based on Turing Machine formalism and named "Turing Machine Task Analysis" to verify and validate work domain models. The application of this method on a work domain analysis, a ship fresh water system which is a "causal domain" showed the possibility to highlight improvements that are needed by this model. More precisely, the step by step analysis of a degraded task scenario on the work domain model pointed out unsatisfactory aspects in first modelling, like over specification, under specification, omission of work domain affordances, or unsuitable inclusion of properties in the work domain model.
-
Turing Machine as an ecological model for task analysis
Theoretical Issues in Ergonomics Science, 2009Co-Authors: Thierry Morineau, Emmanuel Frenod, Caroline Blanche, Laurence TobinAbstract:A new model for task analysis is presented based on the ecological approach initiated by cognitive work analysis (CWA). This model aims to improve the implementation of the theoretical principles involved in the ecological approach of a work system. More precisely, under current CWA, task analysis uses Rasmussen's ladder. However, this approach fails to highlight the contextual constraints on the task. This model is based on the Turing Machine formalism and takes into account the variety of situations that can be experienced by an agent and especially degraded situations of work. Moreover, it can model the concept of affordance-specifying information. It is shown that this formalism can be applied to a prototypical task, such as opening a door.
Peter Gacs - One of the best experts on this subject based on the ideXlab platform.
-
A fault-tolerant Turing Machine
2013Co-Authors: Peter Gacs, Ilir CapuniAbstract:The Turing Machine is the most studied universal model of computation. This thesis studies the question if there is a Turing Machine that can compute reliably even when violations of its transition function occur independently of each other with some small probability. In this thesis, we prove the existence of a Turing Machine that—with a polynomial overhead—can simulate any other Turing Machine, even when it is subject to faults of the above type, thereby answering the question that was open for 25 years.
-
a Turing Machine resisting isolated bursts of faults
arXiv: Computational Complexity, 2012Co-Authors: Ilir Capuni, Peter GacsAbstract:We consider computations of a Turing Machine under noise that causes consecutive violations of the Machine's transition function. Given a constant upper bound B on the size of bursts of faults, we construct a Turing Machine M(B) subject to faults that can simulate any fault-free Machine under the condition that bursts are not closer to each other than V for an appropriate V = O(B^2).
-
a Turing Machine resisting isolated bursts of faults
Conference on Current Trends in Theory and Practice of Informatics, 2012Co-Authors: Ilir Capuni, Peter GacsAbstract:We consider computations of a Turing Machine under noise that causes consecutive violations of the Machine's transition function. Given a constant upper bound β on the size of bursts of faults, we construct a Turing Machine M (β ) subject to faults that can simulate any fault-free Machine under the condition that bursts not closer to each other than V for an appropriate V =O (β ).
J. Rechard - One of the best experts on this subject based on the ideXlab platform.
-
Verification and validation of a Work Domain Analysis with Turing Machine task analysis
Applied Ergonomics, 2015Co-Authors: J. Rechard, Pascal Berruet, Thierry MorineauAbstract:While the use of Work Domain Analysis as a methodological framework in cognitive engineering is increasing rapidly, verification and validation of work domain models produced by this method are becoming a significant issue. In this article, we propose the use of a method based on Turing Machine formalism named "Turing Machine Task Analysis" to verify and validate work domain models. The application of this method on two work domain analyses, one of car driving which is an "intentional" domain, and the other of a ship water system which is a "causal domain" showed the possibility of highlighting improvements needed by these models. More precisely, the step by step analysis of a degraded task scenario in each work domain model pointed out unsatisfactory aspects in the first modelling, like overspecification, underspecification, omission of work domain affordances, or unsuitable inclusion of objects in the work domain model.
-
verification and validation of a work domain analysis with Turing Machine task analysis
Proceedings of the 2014 Ergonomie et Informatique Avancée Conference - Design Ergonomie et IHM: quelle articulation pour la co-conception de l'interac, 2014Co-Authors: J. Rechard, Pascal Berruet, Alain Bignon, Thierry MorineauAbstract:Whereas the use of work domain analysis as a methodological framework in cognitive engineering increases rapidly in frequency, verification and validation of work domain models produced by this method become yet a significant issue. In this article, we propose to use a method based on Turing Machine formalism and named "Turing Machine Task Analysis" to verify and validate work domain models. The application of this method on a work domain analysis, a ship fresh water system which is a "causal domain" showed the possibility to highlight improvements that are needed by this model. More precisely, the step by step analysis of a degraded task scenario on the work domain model pointed out unsatisfactory aspects in first modelling, like over specification, under specification, omission of work domain affordances, or unsuitable inclusion of properties in the work domain model.
Ilir Capuni - One of the best experts on this subject based on the ideXlab platform.
-
A fault-tolerant Turing Machine
2013Co-Authors: Peter Gacs, Ilir CapuniAbstract:The Turing Machine is the most studied universal model of computation. This thesis studies the question if there is a Turing Machine that can compute reliably even when violations of its transition function occur independently of each other with some small probability. In this thesis, we prove the existence of a Turing Machine that—with a polynomial overhead—can simulate any other Turing Machine, even when it is subject to faults of the above type, thereby answering the question that was open for 25 years.
-
a Turing Machine resisting isolated bursts of faults
arXiv: Computational Complexity, 2012Co-Authors: Ilir Capuni, Peter GacsAbstract:We consider computations of a Turing Machine under noise that causes consecutive violations of the Machine's transition function. Given a constant upper bound B on the size of bursts of faults, we construct a Turing Machine M(B) subject to faults that can simulate any fault-free Machine under the condition that bursts are not closer to each other than V for an appropriate V = O(B^2).
-
a Turing Machine resisting isolated bursts of faults
Conference on Current Trends in Theory and Practice of Informatics, 2012Co-Authors: Ilir Capuni, Peter GacsAbstract:We consider computations of a Turing Machine under noise that causes consecutive violations of the Machine's transition function. Given a constant upper bound β on the size of bursts of faults, we construct a Turing Machine M (β ) subject to faults that can simulate any fault-free Machine under the condition that bursts not closer to each other than V for an appropriate V =O (β ).
Pascal Berruet - One of the best experts on this subject based on the ideXlab platform.
-
Verification and validation of a Work Domain Analysis with Turing Machine task analysis
Applied Ergonomics, 2015Co-Authors: J. Rechard, Pascal Berruet, Thierry MorineauAbstract:While the use of Work Domain Analysis as a methodological framework in cognitive engineering is increasing rapidly, verification and validation of work domain models produced by this method are becoming a significant issue. In this article, we propose the use of a method based on Turing Machine formalism named "Turing Machine Task Analysis" to verify and validate work domain models. The application of this method on two work domain analyses, one of car driving which is an "intentional" domain, and the other of a ship water system which is a "causal domain" showed the possibility of highlighting improvements needed by these models. More precisely, the step by step analysis of a degraded task scenario in each work domain model pointed out unsatisfactory aspects in the first modelling, like overspecification, underspecification, omission of work domain affordances, or unsuitable inclusion of objects in the work domain model.
-
verification and validation of a work domain analysis with Turing Machine task analysis
Proceedings of the 2014 Ergonomie et Informatique Avancée Conference - Design Ergonomie et IHM: quelle articulation pour la co-conception de l'interac, 2014Co-Authors: J. Rechard, Pascal Berruet, Alain Bignon, Thierry MorineauAbstract:Whereas the use of work domain analysis as a methodological framework in cognitive engineering increases rapidly in frequency, verification and validation of work domain models produced by this method become yet a significant issue. In this article, we propose to use a method based on Turing Machine formalism and named "Turing Machine Task Analysis" to verify and validate work domain models. The application of this method on a work domain analysis, a ship fresh water system which is a "causal domain" showed the possibility to highlight improvements that are needed by this model. More precisely, the step by step analysis of a degraded task scenario on the work domain model pointed out unsatisfactory aspects in first modelling, like over specification, under specification, omission of work domain affordances, or unsuitable inclusion of properties in the work domain model.
