Difference between revisions of "Publications/dziadek.23.fm"
From LRDE
(Created page with "{{Publication | published = true | date = 2022-12-08 | authors = Sven Dziadek, Uli Fahrenberg, Philipp Schlehuber-Caissier | title = Energy Problems in Finite and Timed Automa...") |
|||
| (4 intermediate revisions by the same user not shown) | |||
| Line 6: | Line 6: | ||
| series = Lecture Notes in Computer Science |
| series = Lecture Notes in Computer Science |
||
| publisher = Springer |
| publisher = Springer |
||
| − | | booktitle = FM |
+ | | booktitle = International Symposium on Formal Methods (FM) |
| lrdeprojects = AA, Spot |
| lrdeprojects = AA, Spot |
||
| abstract = We show how to efficiently solve energy Büchi problems in finite weighted automata and in one-clock weighted timed automata. Solving the former problem is our main contribution and is handled by a modified version of Bellman-Ford interleaved with Couvreur's algorithm. The latter problem is handled via a reduction to the former relying on the corner-point abstraction. All our algorithms are freely available and implemented in a tool based on the open-source tools TChecker and Spot. |
| abstract = We show how to efficiently solve energy Büchi problems in finite weighted automata and in one-clock weighted timed automata. Solving the former problem is our main contribution and is handled by a modified version of Bellman-Ford interleaved with Couvreur's algorithm. The latter problem is handled via a reduction to the former relying on the corner-point abstraction. All our algorithms are freely available and implemented in a tool based on the open-source tools TChecker and Spot. |
||
| lrdenewsdate = 2022-12-08 |
| lrdenewsdate = 2022-12-08 |
||
| + | | note = Accepted |
||
| type = inproceedings |
| type = inproceedings |
||
| id = dziadek.23.fm |
| id = dziadek.23.fm |
||
| + | | identifier = doi:10.1007/978-3-031-27481-7_14 |
||
| bibtex = |
| bibtex = |
||
@InProceedings<nowiki>{</nowiki> dziadek.23.fm, |
@InProceedings<nowiki>{</nowiki> dziadek.23.fm, |
||
| Line 20: | Line 22: | ||
series = <nowiki>{</nowiki>Lecture Notes in Computer Science<nowiki>}</nowiki>, |
series = <nowiki>{</nowiki>Lecture Notes in Computer Science<nowiki>}</nowiki>, |
||
publisher = <nowiki>{</nowiki>Springer<nowiki>}</nowiki>, |
publisher = <nowiki>{</nowiki>Springer<nowiki>}</nowiki>, |
||
| − | booktitle = <nowiki>{</nowiki>FM<nowiki>}</nowiki>, |
+ | booktitle = <nowiki>{</nowiki>International Symposium on Formal Methods (FM)<nowiki>}</nowiki>, |
year = 2023, |
year = 2023, |
||
month = mar, |
month = mar, |
||
| + | doi = <nowiki>{</nowiki>10.1007/978-3-031-27481-7_14<nowiki>}</nowiki>, |
||
abstract = <nowiki>{</nowiki>We show how to efficiently solve energy B<nowiki>{</nowiki>\"u<nowiki>}</nowiki>chi problems |
abstract = <nowiki>{</nowiki>We show how to efficiently solve energy B<nowiki>{</nowiki>\"u<nowiki>}</nowiki>chi problems |
||
in finite weighted automata and in one-clock weighted timed |
in finite weighted automata and in one-clock weighted timed |
||
| Line 31: | Line 34: | ||
relying on the corner-point abstraction. All our algorithms |
relying on the corner-point abstraction. All our algorithms |
||
are freely available and implemented in a tool based on the |
are freely available and implemented in a tool based on the |
||
| − | open-source tools TChecker and Spot.<nowiki>}</nowiki> |
+ | open-source tools TChecker and Spot.<nowiki>}</nowiki>, |
| + | note = <nowiki>{</nowiki>Accepted<nowiki>}</nowiki> |
||
<nowiki>}</nowiki> |
<nowiki>}</nowiki> |
||
Latest revision as of 17:09, 12 July 2023
- Authors
- Sven Dziadek, Uli Fahrenberg, Philipp Schlehuber-Caissier
- Where
- International Symposium on Formal Methods (FM)
- Type
- inproceedings
- Publisher
- Springer
- Projects
- AA"AA" is not in the list (Vaucanson, Spot, URBI, Olena, APMC, Tiger, Climb, Speaker ID, Transformers, Bison, ...) of allowed values for the "Related project" property., Spot
- Date
- 2022-12-08
Abstract
We show how to efficiently solve energy Büchi problems in finite weighted automata and in one-clock weighted timed automata. Solving the former problem is our main contribution and is handled by a modified version of Bellman-Ford interleaved with Couvreur's algorithm. The latter problem is handled via a reduction to the former relying on the corner-point abstraction. All our algorithms are freely available and implemented in a tool based on the open-source tools TChecker and Spot.
Bibtex (lrde.bib)
@InProceedings{ dziadek.23.fm,
author = {Sven Dziadek and Uli Fahrenberg and Philipp
Schlehuber-Caissier},
title = {Energy Problems in Finite and Timed Automata with
{B{\"u}chi} Conditions},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
booktitle = {International Symposium on Formal Methods (FM)},
year = 2023,
month = mar,
doi = {10.1007/978-3-031-27481-7_14},
abstract = {We show how to efficiently solve energy B{\"u}chi problems
in finite weighted automata and in one-clock weighted timed
automata. Solving the former problem is our main
contribution and is handled by a modified version of
Bellman-Ford interleaved with Couvreur's algorithm. The
latter problem is handled via a reduction to the former
relying on the corner-point abstraction. All our algorithms
are freely available and implemented in a tool based on the
open-source tools TChecker and Spot.},
note = {Accepted}
}