Difference between revisions of "Publications/blahoudek.14.spin"
From LRDE
(Created page with "{{Publication | published = true | date = 2014-06-16 | authors = František Blahoudek, Alexandre Duret-Lutz, Mojmír Křetínský, Jan Strejček | title = Is There a Best Büc...") |
|||
Line 22: | Line 22: | ||
booktitle = <nowiki>{</nowiki>Proceedings of the 21th International SPIN Symposium on |
booktitle = <nowiki>{</nowiki>Proceedings of the 21th International SPIN Symposium on |
||
Model Checking of Software (SPIN'14)<nowiki>}</nowiki>, |
Model Checking of Software (SPIN'14)<nowiki>}</nowiki>, |
||
− | year = |
+ | year = 2014, |
publisher = <nowiki>{</nowiki>ACM<nowiki>}</nowiki>, |
publisher = <nowiki>{</nowiki>ACM<nowiki>}</nowiki>, |
||
abstract = <nowiki>{</nowiki> LTL to B\"uchi automata (BA) translators are |
abstract = <nowiki>{</nowiki> LTL to B\"uchi automata (BA) translators are |
Revision as of 09:00, 25 June 2014
- Authors
- František Blahoudek, Alexandre Duret-Lutz, Mojmír Křetínský, Jan Strejček
- Where
- Proceedings of the 21th International SPIN Symposium on Model Checking of Software (SPIN'14)
- Type
- inproceedings
- Publisher
- ACM
- Projects
- Spot
- Date
- 2014-06-16
Abstract
LTL to Büchi automata (BA) translators are traditionally optimized to produce automata with a small number of states or a small number of non-deterministic states. In this paper, we search for properties of Büchi automata that really influence the performance of explicit model checkers. We do that by manual analysis of several automata and by experiments with common LTL-to-BA translators and realistic verification tasks. As a result of these experiences, we gain a better insight into the characteristics of automata that work well with Spin.
Documents
Bibtex (lrde.bib)
@InProceedings{ blahoudek.14.spin, author = {Franti\v{s}ek Blahoudek and Alexandre Duret-Lutz and Mojm\'{i}r K\v{r}et\'{i}nsk\'{y} and Jan Strej\v{c}ek}, title = {Is There a Best {B\"u}chi Automaton for Explicit Model Checking?}, booktitle = {Proceedings of the 21th International SPIN Symposium on Model Checking of Software (SPIN'14)}, year = 2014, publisher = {ACM}, abstract = { LTL to B\"uchi automata (BA) translators are traditionally optimized to produce automata with a small number of states or a small number of non-deterministic states. In this paper, we search for properties of B\"uchi automata that really influence the performance of explicit model checkers. We do that by manual analysis of several automata and by experiments with common LTL-to-BA translators and realistic verification tasks. As a result of these experiences, we gain a better insight into the characteristics of automata that work well with Spin. }, note = {To appear} }