Difference between revisions of "Publications/baarir.15.lpar"
From LRDE
m |
|||
(15 intermediate revisions by 2 users not shown) | |||
Line 5: | Line 5: | ||
| booktitle = Proceedings of the 20th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR'15) |
| booktitle = Proceedings of the 20th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR'15) |
||
| title = SAT-based Minimization of Deterministic ω-Automata |
| title = SAT-based Minimization of Deterministic ω-Automata |
||
− | | pages = |
+ | | pages = 79 to 87 |
| publisher = Springer |
| publisher = Springer |
||
− | | volume = |
+ | | volume = 9450 |
+ | | series = Lecture Notes in Computer Science |
||
− | | abstract = We describe a tool that inputs a deterministic |
+ | | abstract = We describe a tool that inputs a deterministic <math>\omega</math>-automaton with any acceptance condition, and synthesizes an equivalent <math>\omega</math>-automaton with another arbitrary acceptance condition and a given number of states, if such an automaton exists. This tool, that relies on a SAT-based encoding of the problem, can be used to provide minimal <math>\omega</math>-automata equivalent to given properties, for different acceptance conditions. |
− | | note = To appear. |
||
− | | urllrde = 201511-LPAR |
||
| lrdeprojects = Spot |
| lrdeprojects = Spot |
||
| lrdenewsdate = 2015-09-01 |
| lrdenewsdate = 2015-09-01 |
||
+ | | lrdepaper = http://www.lrde.epita.fr/dload/papers/baarir.15.lpar.pdf |
||
| type = inproceedings |
| type = inproceedings |
||
| id = baarir.15.lpar |
| id = baarir.15.lpar |
||
+ | | identifier = doi:10.1007/978-3-662-48899-7_6 |
||
| bibtex = |
| bibtex = |
||
@InProceedings<nowiki>{</nowiki> baarir.15.lpar, |
@InProceedings<nowiki>{</nowiki> baarir.15.lpar, |
||
Line 25: | Line 26: | ||
year = <nowiki>{</nowiki>2015<nowiki>}</nowiki>, |
year = <nowiki>{</nowiki>2015<nowiki>}</nowiki>, |
||
month = nov, |
month = nov, |
||
− | pages = <nowiki>{</nowiki> |
+ | pages = <nowiki>{</nowiki>79--87<nowiki>}</nowiki>, |
publisher = <nowiki>{</nowiki>Springer<nowiki>}</nowiki>, |
publisher = <nowiki>{</nowiki>Springer<nowiki>}</nowiki>, |
||
− | + | doi = <nowiki>{</nowiki>10.1007/978-3-662-48899-7_6<nowiki>}</nowiki>, |
|
⚫ | |||
+ | series = <nowiki>{</nowiki>Lecture Notes in Computer Science<nowiki>}</nowiki>, |
||
abstract = <nowiki>{</nowiki>We describe a tool that inputs a deterministic |
abstract = <nowiki>{</nowiki>We describe a tool that inputs a deterministic |
||
$\omega$-automaton with any acceptance condition, and |
$\omega$-automaton with any acceptance condition, and |
||
synthesizes an equivalent $\omega$-automaton with another |
synthesizes an equivalent $\omega$-automaton with another |
||
arbitrary acceptance condition and a given number of |
arbitrary acceptance condition and a given number of |
||
− | states, if such an automaton |
+ | states, if such an automaton exists. This tool, that relies |
on a SAT-based encoding of the problem, can be used to |
on a SAT-based encoding of the problem, can be used to |
||
provide minimal $\omega$-automata equivalent to given |
provide minimal $\omega$-automata equivalent to given |
||
− | properties, for different acceptance conditions.<nowiki>}</nowiki> |
+ | properties, for different acceptance conditions.<nowiki>}</nowiki> |
⚫ | |||
<nowiki>}</nowiki> |
<nowiki>}</nowiki> |
||
Latest revision as of 11:29, 1 April 2019
- Authors
- Souheib Baarir, Alexandre Duret-Lutz
- Where
- Proceedings of the 20th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR'15)
- Type
- inproceedings
- Publisher
- Springer
- Projects
- Spot
- Date
- 2015-09-01
Abstract
We describe a tool that inputs a deterministic -automaton with any acceptance condition, and synthesizes an equivalent -automaton with another arbitrary acceptance condition and a given number of states, if such an automaton exists. This tool, that relies on a SAT-based encoding of the problem, can be used to provide minimal -automata equivalent to given properties, for different acceptance conditions.
Documents
Bibtex (lrde.bib)
@InProceedings{ baarir.15.lpar, author = {Souheib Baarir and Alexandre Duret-Lutz}, booktitle = {Proceedings of the 20th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR'15)}, title = {{SAT}-based Minimization of Deterministic $\omega$-Automata}, year = {2015}, month = nov, pages = {79--87}, publisher = {Springer}, doi = {10.1007/978-3-662-48899-7_6}, volume = {9450}, series = {Lecture Notes in Computer Science}, abstract = {We describe a tool that inputs a deterministic $\omega$-automaton with any acceptance condition, and synthesizes an equivalent $\omega$-automaton with another arbitrary acceptance condition and a given number of states, if such an automaton exists. This tool, that relies on a SAT-based encoding of the problem, can be used to provide minimal $\omega$-automata equivalent to given properties, for different acceptance conditions.} }