University of Twente Student Theses
Converting binary decision diagrams to and-inverter graphs using prime-irredundant covers
Tomov, N. (2022) Converting binary decision diagrams to and-inverter graphs using prime-irredundant covers.
|
PDF
676kB |
| Abstract: | Reactive synthesis is the automatic generation of a state machine from a high level specification, such as a linear temporal logic formula. In a recent development in this field, symbolic reasoning using binary decision diagrams has been proposed as a method to drastically reduce computational complexity of reactive synthesis. We have researched a potential improvement to this symbolic reactive synthesis, in which irredundant sum of products is used to convert binary decision diagrams into and-inverter graphs. The principle objective was to reduce the size of the resulting graphs.The results range from sizeable improvements to dramatic setbacks. |
| Item Type: | Essay (Bachelor) |
| Faculty: | EEMCS: Electrical Engineering, Mathematics and Computer Science |
| Subject: | 54 computer science |
| Programme: | Computer Science BSc (56964) |
| Link to this item: | https://purl.utwente.nl/essays/91688 |
| Export this item as: | BibTeX EndNote HTML Citation Reference Manager |
Show download statistics for this publication
Show download statistics for this publicationRepository Staff Only: item control page