Comparison of Algorithms for Checking Emptiness on Buechi Automata

@article{Gaiser2009ComparisonOA,
  title={Comparison of Algorithms for Checking Emptiness on Buechi Automata},
  author={Andreas Gaiser and Stefan Schwoon},
  journal={CoRR},
  year={2009},
  volume={abs/0910.3766}
}
We re-investigate the problem of LTL model-checking for finite-state systems. Typical solutions, like in Spin, work on the fly, reducing the problem to Büchi emptiness. This can be done in linear time, and a variety of algorithms with this property exist. Nonetheless, subtle design decisions can make a great difference to their actual performance in practice, especially when used on-the-fly. We compare a number of algorithms experimentally on a large benchmark suite, measure their actual run… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 22 CITATIONS, ESTIMATED 40% COVERAGE

55 Citations

0510'11'13'15'17'19
Citations per Year
Semantic Scholar estimates that this publication has 55 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
SHOWING 1-10 OF 19 REFERENCES

Comparison of algorithms for checking emptiness on Büchi automata

  • Andreas Gaiser, Stefan Schwoon
  • Technical report, arxiv.org (arXiv:0910.3766),
  • 2009
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…