University of Twente Student Theses
Modifying tangle learning to find smaller solutions
Kooiker, R. (2024) Modifying tangle learning to find smaller solutions.
|
PDF
446kB |
| Abstract: | LTL-synthesis is the process of converting a linear temporal logic (LTL) specification to a circuit. One way to synthesise a circuit is to convert the specification to a parity game, and to convert the solution of the parity game to a circuit. Because a parity game can admit many different solutions the resulting circuit can also be different. Ideally this circuit is as small as possible because smaller circuits are more efficient than bigger circuits. One algorithm that solves parity games is tangle learning. A downside of this algorithm is that it often finds worse solutions than other solvers. We implement two algorithms that aim to increase the quality of solutions from tangle learning and we benchmark the algorithms to verify whether or not they actually find higher quality solutions. We also perform an analysis comparing different parity games, and parity game solvers. |
| Item Type: | Essay (Bachelor) |
| Faculty: | EEMCS: Electrical Engineering, Mathematics and Computer Science |
| Subject: | 54 computer science |
| Programme: | Business & IT BSc (56066) |
| Link to this item: | https://purl.utwente.nl/essays/100797 |
| 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