1 citations · 1 across the 4 of their papers we have counts for
4 papers
Computing Fixpoints of Learned Functions: Chaotic Iteration and Simple Stochastic Games
Paolo Baldan, Sebastian Gurke, Barbara König +1
The problem of determining the (least) fixpoint of (higher-dimensional) functions over the non-negative reals frequently occurs when dealing with systems endowed with a quantitativ…
Approximating Fixpoints of Approximated Functions
Paolo Baldan, Sebastian Gurke, Barbara König +2
Fixpoints are ubiquitous in computer science and when dealing with quantitative semantics and verification one often considers least fixpoints of (higher-dimensional) functions ove…
Stochastic Decision Petri Nets
Florian Wittbold, Rebecca Bernemann, Reiko Heckel +2
We introduce stochastic decision Petri nets (SDPNs), which are a form of stochastic Petri nets equipped with rewards and a control mechanism via the deactivation of controllable tr…
Unsupervised Automata Learning via Discrete Optimization
Simon Lutz, Daniil Kaminskyi, Florian Wittbold +5
Automata learning is a successful tool for many application domains such as robotics and automatic verification. Typically, automata learning techniques operate in a supervised lea…