In his graduation work, Sander Thuijsman worked on performance measurements of data-based synthesis in CIF. He proposed to use the following two metrics to measure computational effort:
- Total BDD operations. This is the total number of BDD operations performed by the tool excluding cache hits, which relates to time effort.
- Max BDD nodes. This is the maximum number of nodes of the BDD encountered during synthesis, which relates to space effort.
More information on these statistics can be found in his Master Thesis or in the paper Thuijsman et al., Computational Effort of BDD-Based Supervisor Synthesis of Extended Finite Automata, IEEE Conference on Automation Science and Engineering, 2019, DOI:10.1109/COASE.2019.8843327.
During his thesis project, Sander adopted the JavaBDD package to collect these statistics. I have cleaned up and enhanced Sander's code such that, for example, an end user can request these statistics (and not by changing hard coded variables in the source code as Sander originally did).
In his graduation work, Sander Thuijsman worked on performance measurements of data-based synthesis in CIF. He proposed to use the following two metrics to measure computational effort:
More information on these statistics can be found in his Master Thesis or in the paper Thuijsman et al., Computational Effort of BDD-Based Supervisor Synthesis of Extended Finite Automata, IEEE Conference on Automation Science and Engineering, 2019, DOI:10.1109/COASE.2019.8843327.
During his thesis project, Sander adopted the JavaBDD package to collect these statistics. I have cleaned up and enhanced Sander's code such that, for example, an end user can request these statistics (and not by changing hard coded variables in the source code as Sander originally did).