Lecture

Symbolic Synthesis via BDDs

Description

This lecture covers the efficient symbolic reactive synthesis for finite-horizon tasks using Binary Decision Diagrams (BDDs) to compactly represent Boolean functions and sets, as demonstrated by Keliang He, Andrew Wells, Lydia E. Kavraki, and Moshe Y. Vardi from Rice University. The presentation delves into the main parts of the problem, including Transition System and DFA, given with respect to Boolean variables, and computations involving Boolean functions and sets. The lecture also includes an example from Wikipedia and references a paper by R. E. Bryant on graph-based algorithms for Boolean function manipulation.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.