[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Logic in Computer Science

arXiv:2205.04392 (cs)
[Submitted on 9 May 2022 (v1), last revised 19 Jul 2024 (this version, v4)]

Title:$ω$-Regular Energy Problems

Authors:Sven Dziadek, Uli Fahrenberg, Philipp Schlehuber-Caissier
View PDF HTML (experimental)
Abstract:We show how to efficiently solve problems involving a quantitative measure, here called energy, as well as a qualitative acceptance condition, expressed as a Büchi or Parity objective, in finite weighted automata and in one-clock weighted timed automata. Solving the former problem and extracting the corresponding witness is our main contribution and is handled by a modified version of the Bellman-Ford algorithm 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 platforms TChecker and~Spot.
Subjects: Logic in Computer Science (cs.LO)
Cite as: arXiv:2205.04392 [cs.LO]
  (or arXiv:2205.04392v4 [cs.LO] for this version)
  https://doi.org/10.48550/arXiv.2205.04392

Submission history

From: Uli Fahrenberg [view email]
[v1] Mon, 9 May 2022 15:52:16 UTC (31 KB)
[v2] Thu, 22 Dec 2022 14:13:16 UTC (41 KB)
[v3] Tue, 5 Mar 2024 14:35:28 UTC (64 KB)
[v4] Fri, 19 Jul 2024 16:19:00 UTC (64 KB)
Full-text links:

Access Paper:

view license
Current browse context:
cs.LO
< prev   |   next >
new | recent | 2022-05
Change to browse by:
cs

References & Citations

export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)