Experimental evaluation of explicit and symbolic automata-theoretic algorithms

Simple item page
dc.contributor.advisorVardi, Moshe Y.en_US
dc.creatorTabakov, Deianen_US
dc.date.accessioned2009-06-04T06:47:26Zen_US
dc.date.available2009-06-04T06:47:26Zen_US
dc.date.issued2006en_US
dc.description.abstractThe automata-theoretic approach to the problem of program verification requires efficient minimization and complementation of nondeterministic finite automata. This work presents a direct empirical comparison of well-known automata minimization algorithms, and also of a symbolic and an explicit approach to complementing automata. I propose a probabilistic framework for testing the performance of automata-theoretic algorithms, and use it to compare empirically Brzozowski's and Hopcroft's minimization algorithms. While Hopcroft's algorithm has better overall performance, the experimental results show that Brzozowski's algorithm performs better for "high-density" automata. In this work I also analyze complementation by considering automaton universality as a model-checking problem. A novel encoding presented here allows this problem to be solved symbolically via a model-checker. I compare the performance of this approach to that of the standard explicit algorithm which is based on the subset construction, and show that the explicit approach unexpectedly performs an order of magnitude better.en_US
dc.format.extent67 p.en_US
dc.format.mimetypeapplication/pdfen_US
dc.identifier.callnoTHESIS COMP.SCI. 2006 TABAKOVen_US
dc.identifier.citationTabakov, Deian. "Experimental evaluation of explicit and symbolic automata-theoretic algorithms." (2006) Master’s Thesis, Rice University. <a href="https://hdl.handle.net/1911/17923">https://hdl.handle.net/1911/17923</a>.en_US
dc.identifier.urihttps://hdl.handle.net/1911/17923en_US
dc.language.isoengen_US
dc.rightsCopyright is held by the author, unless otherwise indicated. Permission to reuse, publish, or reproduce the work beyond the bounds of fair use or other exemptions to copyright law must be obtained from the copyright holder.en_US
dc.subjectComputer scienceen_US
dc.titleExperimental evaluation of explicit and symbolic automata-theoretic algorithmsen_US
dc.typeThesisen_US
dc.type.materialTexten_US
thesis.degree.departmentComputer Scienceen_US
thesis.degree.disciplineEngineeringen_US
thesis.degree.grantorRice Universityen_US
thesis.degree.levelMastersen_US
thesis.degree.nameMaster of Scienceen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
1435771.PDF
Size:
2.87 MB
Format:
Adobe Portable Document Format
Download
Collections
Rice University Theses and Dissertations