A Novel Graph Reduction Algorithm to Identify Structural Conflicts
HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9 - Volume 9
Evaluating the Process Control-Flow Complexity Measure
ICWS '05 Proceedings of the IEEE International Conference on Web Services
Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Business Process Management: Concepts, Languages, Architectures
Business Process Management: Concepts, Languages, Architectures
Model-Based Diagnosability Analysis for Web Services
AI*IA '07 Proceedings of the 10th Congress of the Italian Association for Artificial Intelligence on AI*IA 2007: Artificial Intelligence and Human-Oriented Computing
An Approach for Diagnosing Unexpected Faults in Web Service Flows
GCC '09 Proceedings of the 2009 Eighth International Conference on Grid and Cooperative Computing
A Model-Based Approach to Fault Diagnosis in Service Oriented Architectures
ECOWS '09 Proceedings of the 2009 Seventh IEEE European Conference on Web Services
A Method for Sensor Placement Taking into Account Diagnosability Criteria
International Journal of Applied Mathematics and Computer Science - Issues in Fault Diagnosis and Fault Tolerant Control
The time complexity of constraint satisfaction
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
An integer programming based approach for verification and diagnosis of workflows
Data & Knowledge Engineering
An optimal sensor placement algorithm taking into account diagnosability specifications
AQTR '10 Proceedings of the 2010 IEEE International Conference on Automation, Quality and Testing, Robotics (AQTR) - Volume 02
Soundness of workflow nets: classification, decidability, and analysis
Formal Aspects of Computing
Verifying workflow processes: a transformation-based approach
Software and Systems Modeling (SoSyM)
History-aware, real-time risk detection in business processes
OTM'11 Proceedings of the 2011th Confederated international conference on On the move to meaningful internet systems - Volume Part I
A topological-based method for allocating sensors by using CSP techniques
CAEPIA'05 Proceedings of the 11th Spanish association conference on Current Topics in Artificial Intelligence
Diagnosability Analysis Based on Component-Supported Analytical Redundancy Relations
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
| Hi-index | 0.00 |
Diagnosability analysis aims to determine whether observations available during the execution of a system are sufficient to precisely locate the source of a problem. Previous work deals with the diagnosability problem in contexts such as circuits and systems, but no with the adaptation of the diagnosability problem to business processes. In order to improve the diagnosability, a set of test points needs to be allocated. Therefore, the aim of this contribution is to determine a test-point allocation to obtain sufficient observable data in the dataflow to allow the discrimination of faults for a later diagnosis process. The allocation of test points depends on the strategies of the companies, for this reason we defined two possibilities: to improve the diagnosability of a business process for a fixed number of test points and the minimization of the number of test points for a given level of diagnosability. Both strategies have been implemented in the Test-Point Allocator tool in order to facilitate the integration of the test points in the business process model life cycle. Experimental results indicate that diagnosability of business processes can be improved by allocating test points in an acceptable time.