A flexible approach for finding optimal paths with minimal conflicts
MetadataShow full item record
Complex systems are usually modelled through a combination of structural and behavioural models, where separate behavioural models make it easier to design and understand partial behaviour. When partial models are combined, we need to guarantee that they are consistent, and several automated techniques have been developed to check this. We argue that in some cases it is impossible to guarantee total consistency, and instead we want to find execution paths across such models with minimal conflicts with respect to a certain metric of interest. We present an efficient and scalable solution to find optimal paths through a combination of the theorem prover Isabelle with the constraint solver Z3. Our approach has been inspired by a healthcare problem, namely how to detect conflicts between medications taken by patients with multiple chronic conditions, and how to find preferable alternatives automatically.
Bowles , J K F & Caminati , M B 2017 , A flexible approach for finding optimal paths with minimal conflicts . in Z Duan & L Ong (eds) , Formal Methods and Software Engineering : 19th International Conference on Formal Engineering Methods, ICFEM 2017, Xi'an, China, November 13-17, 2017, Proceedings . Lecture Notes in Computer Science (Programming and Software Engineering) , vol. 10610 , Springer , pp. 209-225 , 19th International Conference on Formal Engineering Methods (ICFEM 2017) , Xi’an , China , 13-17 November . DOI: 10.1007/978-3-319-68690-5_13conference
Formal Methods and Software Engineering
© 2017, Springer International Publishing AG. This work has been made available online in accordance with the publisher’s policies. This is the author created, accepted version manuscript following peer review and may differ slightly from the final published version. The final published version of this work is available at 10.1007/978-3-319-68690-5_13
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.