Dougherty, Daniel J.
We examined a discrepancy between direct translation of timing diagrams into Buchi automata and the translation using Linear Temporal Logic (LTL) as an intermediate representation and then using an existing LTL to Buchi algorithm. We improved the number of states generated to within a factor of two by using a newer LTL to Buchi algorithm called Wring. We examined which combination of Wring's optimization cause the improvement, and under what conditions Wring outperforms the direct translation.
Worcester Polytechnic Institute
Major Qualifying Project
Restricted-WPI community only