Abstract
Bad construction of modeled care pathways can lead to satisfiability problems during the pathway execution. These problems can ultimately result in medical errors and need to be checked as formally as possible. Therefore, this study proposes a set of algorithms using a free open-source library dedicated to constraint programming allied with a DSL to encode and verify care pathways, checking four possible problems: states in deadlock, non-determinism, inaccessible steps and transitions with logically equivalent guard conditions. We then test our algorithms in 84 real care pathways used both in hospitals and surgeries. Using our algorithms, we were able to find 200 problems taking less than 1 second to complete the verification on most pathways.
| Original language | English |
|---|---|
| Article number | 9017991 |
| Pages (from-to) | 2718-2725 |
| Number of pages | 8 |
| Journal | IEEE Journal of Biomedical and Health Informatics |
| Volume | 24 |
| Issue number | 9 |
| Early online date | 28 Feb 2020 |
| DOIs | |
| Publication status | Published - 1 Sept 2020 |
Bibliographical note
© 2020 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.Keywords
- Clinical pathway
- DSL
- constraint programming
- data-dependent transition system
- satisfiability problems