1 citations · 1 across the 3 of their papers we have counts for
8 papers
Approximate Learning of Limit-Average Automata
Jakub Michaliszyn, Jan Otop
Limit-average automata are weighted automata on infinite words that use average to aggregate the weights seen in infinite runs. We study approximate learning problems for limit-ave…
Long-Run Average Behavior of 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 configuration is a state and a value for each counter; a transition changes the state…
Average Stack Cost of Buechi Pushdown Automata
Jakub Michaliszyn, Jan Otop
We study the average stack cost of Buechi pushdown automata (Buechi PDA). We associate a non-negative price with each stack symbol and define the cost of a stack as the sum of cost…
Querying Best Paths in Graph Databases
Jakub Michaliszyn, Jan Otop, Piotr Wieczorek
Querying graph databases has recently received much attention. We propose a new approach to this problem, which balances competing goals of expressive power, language clarity and c…
Bidirectional Nested Weighted Automata
Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop
Nested weighted automata (NWA) present a robust and convenient automata-theoretic formalism for quantitative specifications. Previous works have considered NWA that processed input…
Nested Weighted Limit-Average Automata of Bounded Width
Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop
While weighted automata provide a natural framework to express quantitative properties, many basic properties like average response time cannot be expressed with weighted automata.…