Abstract
The paper proposes an improvement for SCC-based emptiness checking algorithms,which combines the advantages of SCC-based and nested depth first search for finding a cycle meeting all sets of acceptance conditions.The new algorithm uses the method of bitstate-hashing during emptiness checking for transition-based generalized Buchi automata,and the performance outperforms that of Couvreur′s.Meanwhile,the performance for finding a counterexample is the same as that of SCC-based ones.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
