Explaining Control Policies through Predicate Decision Diagrams
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) has 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.
Authors
- Christoph Weinhuber (ORCID: https://orcid.org/0000-0002-1600-4933)
- Clemens Dubslaff (ORCID: https://orcid.org/0000-0001-5718-8276)
- Jan Křetínský (ORCID: https://orcid.org/0000-0002-8122-2881)
- Sudeep Kanav (ORCID: https://orcid.org/0000-0001-6078-4175)
- Debraj Chakraborty (ORCID: https://orcid.org/0000-0003-0978-4457)
Institutions
- Masaryk University (CZ)
- University of Oxford (GB)
- Technical University of Munich (DE)
- Eindhoven University of Technology (NL)
Publication Details
- Published
- 2025-05-06
- DOI
- https://doi.org/10.1145/3716863.3718049
- Citations
- 1
- Primary Topic
- Formal Methods in Verification
- Type
- article
- Field-Weighted Citation Impact
- 1.50
Funders
- Deutsche Forschungsgemeinschaft
- Nederlandse Organisatie voor Wetenschappelijk Onderzoek
- Masarykova Univerzita