4 citations · 5 across the 4 of their papers we have counts for
8 papers
"Most of" leads to undecidability: Failure of adding frequencies to LTL
Bartosz Bednarczyk, Jakub Michaliszyn
Linear Temporal Logic (LTL) interpreted on finite traces is a robust specification framework popular in formal verification. However, despite the high interest in the logic in rece…
Non-deterministic weighted automata evaluated over Markov chains
Jakub Michaliszyn, Jan Otop
We present the first study of non-deterministic weighted automata under probabilistic semantics. In this semantics words are random events, generated by a Markov chain, and functio…
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…
Elementary Multimodal Logics
Jakub Michaliszyn
We study multimodal logics over universally first-order definable classes of frames. We show that even for bimodal logics, there are universal Horn formulas that define set of fram…
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…