AI Chat AI Image Generator AI Video Text to Speech

Energy Büchi Problems

05/09/2022

∙

by Sven Dziadek, et al.

∙

∙

We show how to efficiently solve energy Büchi problems in finite weighted Büchi automata and in one-clock weighted timed Büchi automata; all our algorithms are implemented in a pipeline based on TChecker and Spot. Solving the latter problem is done by using the corner-point abstraction; the former problem is handled by a modified version of Bellman-Ford interleaved with Couvreur's algorithm.

Sven Dziadek
1 publication
Uli Fahrenberg
9 publications
Philipp Schlehuber-Caissier
5 publications

page 1

page 2

page 3

page 4

research

∙ 09/17/2021

A Nivat Theorem for Weighted Alternating Automata over Commutative Semirings

In this paper, we give a Nivat-like characterization for weighted altern...

0 Gustav Grabolle, et al. ∙

research

∙ 04/11/2020

Genetic Algorithm for the Weight Maximization Problem on Weighted Automata

The weight maximization problem (WMP) is the problem of finding the word...

0 Elena Gutiérrez, et al. ∙

research

∙ 06/07/2020

Probabilistic Timed Automata with One Clock and Initialised Clock-Dependent Probabilities

Clock-dependent probabilistic timed automata extend classical timed auto...

0 Jeremy Sproston, et al. ∙

research

∙ 04/07/2021

Finite Automata Encoding Functions

Finite automata are used to describe functions, geometric figures, fract...

0 Dmitry Berdinsky, et al. ∙

research

∙ 03/28/2018

Unreasonable Effectivness of Deep Learning

We show how well known rules of back propagation arise from a weighted c...

0 Finn Macleod, et al. ∙

research

∙ 09/13/2017

Neural Network Based Nonlinear Weighted Finite Automata

Weighted finite automata (WFA) can expressively model functions defined ...

0 Tianyu Li, et al. ∙

research

∙ 05/21/2019

Approximating probabilistic models as weighted finite automata

Weighted finite automata (WFA) are often used to represent probabilistic...

0 Ananda Theertha Suresh, et al. ∙