Automated verification of care pathways using constraint programming

• Autor(a) principal: Figueiredo, Renan Pereira de
• Data de Publicação: 2019
• Tipo de documento: Dissertação
• Idioma: por
• Título da fonte: Repositório Institucional da Universidade Federal do Ceará (UFC)
• Texto Completo: http://www.repositorio.ufc.br/handle/riufc/47937
• topic: Clinical pathway; Constraint programming; Data-dependent transition system; DSL; Satisfiability problems

Clinical Pathways are used to standardize medical treatments. Specialists define these pathways using process-like notations that can ultimately be translated to formally defined languages. 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 113 real care pathways used both in hospitals and surgeries. Using our algorithms, we were able to find 295 problems taking less than 1 second to complete the verification on most pathways.