Difference between revisions of "Publications/blahoudek.14.spin"
From LRDE
| (3 intermediate revisions by the same user not shown) | |||
| Line 13: | Line 13: | ||
| type = inproceedings |
| type = inproceedings |
||
| id = blahoudek.14.spin |
| id = blahoudek.14.spin |
||
| + | | identifier = doi:10.1145/2632362.2632377 |
||
| bibtex = |
| bibtex = |
||
@InProceedings<nowiki>{</nowiki> blahoudek.14.spin, |
@InProceedings<nowiki>{</nowiki> blahoudek.14.spin, |
||
| Line 22: | Line 23: | ||
Model Checking of Software (SPIN'14)<nowiki>}</nowiki>, |
Model Checking of Software (SPIN'14)<nowiki>}</nowiki>, |
||
year = 2014, |
year = 2014, |
||
| + | month = jan, |
||
pages = <nowiki>{</nowiki>68--76<nowiki>}</nowiki>, |
pages = <nowiki>{</nowiki>68--76<nowiki>}</nowiki>, |
||
publisher = <nowiki>{</nowiki>ACM<nowiki>}</nowiki>, |
publisher = <nowiki>{</nowiki>ACM<nowiki>}</nowiki>, |
||
| Line 33: | Line 35: | ||
translators and realistic verification tasks. As a result |
translators and realistic verification tasks. As a result |
||
of these experiences, we gain a better insight into the |
of these experiences, we gain a better insight into the |
||
| − | characteristics of automata that work well with Spin. <nowiki>}</nowiki> |
+ | characteristics of automata that work well with Spin. <nowiki>}</nowiki>, |
| + | doi = <nowiki>{</nowiki>10.1145/2632362.2632377<nowiki>}</nowiki> |
||
<nowiki>}</nowiki> |
<nowiki>}</nowiki> |
||
Latest revision as of 10:21, 3 April 2023
- 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,
month = jan,
pages = {68--76},
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. },
doi = {10.1145/2632362.2632377}
}