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

Institutions

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

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Explaining Control Policies through Predicate Decision Diagrams

Christoph Weinhuber, Clemens Dubslaff, Jan Křetínský, Sudeep Kanav et al.
1 citations
Formal Methods in Verification
1.50
article

Explaining Control Policies through Predicate Decision Diagrams

Christoph Weinhuber, Clemens Dubslaff, Jan Křetínský, Sudeep Kanav, Debraj Chakraborty
article en
1 citations

Abstract

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.

Masaryk University (CZ), University of Oxford (GB), Technical University of Munich (DE), Eindhoven University of Technology (NL)
Deutsche Forschungsgemeinschaft, Nederlandse Organisatie voor Wetenschappelijk Onderzoek, Masarykova Univerzita
Peace, Justice and strong institutions
Openalex Percentile: Top 17%
Formal Methods in Verification
1.50
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Explaining Control Policies through Predicate Decision Diagrams — Christoph Weinhuber, Clemens Dubslaff, et al. · (2025) | TGRS Research Map | TGRS