Safety-critical controllers of complex systems are hard to construct manually. Automated approaches such as controller synthesis or learning provide a tempting alternative but usually lack explainability. To this end, learning decision trees (DTs) have been prevalently used towards an interpretable model of the generated controllers. However, DTs do not exploit shared decision-making, a key concept exploited in binary decision diagrams (BDDs) to reduce their size and thus improve explainability. In this work, we introduce predicate decision diagrams (PDDs) that extend BDDs with predicates and thus unite the advantages of DTs and BDDs for controller representation. We establish a synthesis pipeline for efficient construction of PDDs from DTs representing controllers, exploiting reduction techniques for BDDs also for PDDs.
View on arXiv@article{chakraborty2025_2503.06420,
title={ Explaining Control Policies through Predicate Decision Diagrams },
author={ Debraj Chakraborty and Clemens Dubslaff and Sudeep Kanav and Jan Kretinsky and Christoph Weinhuber },
journal={arXiv preprint arXiv:2503.06420},
year={ 2025 }
}