27 citations · 41 across the 12 of their papers we have counts for
18 papers
Learning Tree Automata with Term Rewriting
Jakub Kopystiański, Jan Otop
We present an extension of the Angluin-style learning algorithm for tree automata that incorporates deductive inference. The learning algorithm is provided with a term rewriting sy…
The Target Discounted-Sum Problem
Udi Boker, Thomas A. Henzinger, Jan Otop
The target discounted-sum problem is the following: Given a rational discount factor and three rational values , and , does there exist a finite or an infinite sequ…
Active Automata Learning with Advice
Michał Fica, Jan Otop
We present an extended automata learning framework that combines active automata learning with deductive inference. The learning algorithm asks membership and equivalence queries a…
Deterministic Weighted Automata under Partial Observability
Jakub Michaliszyn, Jan Otop
Weighted automata is a basic tool for specification in quantitative verification, which allows to express quantitative features of analysed systems such as resource consumption. Qu…
Multi-dimensional Long-Run Average Problems for Vector Addition Systems with States
Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop
A vector addition system with states (VASS) consists of a finite set of states and counters. A transition changes the current state to the next state, and every counter is either i…
Modular Path Queries with Arithmetic
Jakub Michaliszyn, Jan Otop, Piotr Wieczorek
We propose a new approach to querying graph databases. Our approach balances competing goals of expressive power, language clarity and computational complexity. A distinctive featu…