On a Semantic Subsumption Test. - Jerzy Marcinkowski; Jan Otop; Grzegorz Stelmaszek (LPAR, 2004)

Modal Logics Definable by Universal Three-Variable Formulas. - Emanuel Kieronski; Jakub Michaliszyn; Jan Otop (FSTTCS, 2011)

Unification of anti-terms. - Jan Otop (UNIF, 2011)

Decidable Elementary Modal Logics. - Jakub Michaliszyn; Jan Otop (LICS, 2012)

Satisfiability vs. Finite Satisfiability in Elementary Modal Logics - Jakub Michaliszyn; Jan Otop; Piotr Witkowski 001 (GandALF, 2012)

E-unification with Constants vs. General E-unification. - Jan Otop (J. Autom. Reason., 2012)

From Model Checking to Model Measuring. - Thomas A. Henzinger; Jan Otop (CONCUR, 2013)

Elementary Modal Logics over Transitive Structures. - Jakub Michaliszyn; Jan Otop (CSL, 2013)

Distributed synthesis for LTL fragments. - Krishnendu Chatterjee; Thomas A. Henzinger; Jan Otop; Andreas Pavlogiannis (FMCAD, 2013)

Lipschitz Robustness of Finite-state Transducers. - Thomas A. Henzinger; Jan Otop; Roopsha Samanta (FSTTCS, 2014)

Model measuring for hybrid systems. - Thomas A. Henzinger; Jan Otop (HSCC, 2014)

The Target Discounted-Sum Problem. - Udi Boker; Thomas A. Henzinger; Jan Otop (LICS, 2015)

On the Decidability of Elementary Modal Logics. - Jakub Michaliszyn; Jan Otop; Emanuel Kieronski (ACM Trans. Comput. Log., 2015)

Querying Data Graphs with Arithmetical Regular Expressions. - Maciej Grabon; Jakub Michaliszyn; Jan Otop; Piotr Wieczorek (IJCAI, 2016)

Nested Weighted Limit-Average Automata of Bounded Width. - Krishnendu Chatterjee; Thomas A. Henzinger; Jan Otop (MFCS, 2016)

Quantitative Monitor Automata. - Krishnendu Chatterjee; Thomas A. Henzinger; Jan Otop (SAS, 2016)

Lipschitz Robustness of Timed I/O Systems. - Thomas A. Henzinger; Jan Otop; Roopsha Samanta (VMCAI, 2016)

Bidirectional Nested Weighted Automata. - Krishnendu Chatterjee; Thomas A. Henzinger; Jan Otop (CONCUR, 2017)

Average Stack Cost of Büchi Pushdown Automata. - Jakub Michaliszyn; Jan Otop (FSTTCS, 2017)

Querying Best Paths in Graph Databases. - Jakub Michaliszyn; Jan Otop; Piotr Wieczorek (FSTTCS, 2017)

Average Stack Cost of Buechi Pushdown Automata. - Jakub Michaliszyn; Jan Otop (CoRR, 2017)

Quantitative fair simulation games. - Krishnendu Chatterjee; Thomas A. Henzinger; Jan Otop; Yaron Velner (Inf. Comput., 2017)

Edit Distance for Pushdown Automata. - Krishnendu Chatterjee; Thomas A. Henzinger; Rasmus Ibsen-Jensen; Jan Otop (Log. Methods Comput. Sci., 2017)

Nested Weighted Automata. - Krishnendu Chatterjee; Thomas A. Henzinger; Jan Otop (ACM Trans. Comput. Log., 2017)

Computing Average Response Time. - Krishnendu Chatterjee; Thomas A. Henzinger; Jan Otop (Principles of Modeling, 2018)

Non-deterministic Weighted Automata on Random Words. - Jakub Michaliszyn; Jan Otop (CONCUR, 2018)

Satisfiability versus Finite Satisfiability in Elementary Modal Logics. - Jakub Michaliszyn; Jan Otop; Piotr Witkowski 001 (Fundam. Informaticae, 2018)

Long-Run Average Behavior of Vector Addition Systems with States. - Krishnendu Chatterjee; Thomas A. Henzinger; Jan Otop (CONCUR, 2019)

Approximate Learning of Limit-Average Automata. - Jakub Michaliszyn; Jan Otop (CONCUR, 2019)

Quantitative Automata under Probabilistic Semantics. - Krishnendu Chatterjee; Thomas A. Henzinger; Jan Otop (Log. Methods Comput. Sci., 2019)

Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States. - Krishnendu Chatterjee; Thomas A. Henzinger; Jan Otop (CONCUR, 2020)

Learning Deterministic Automata on Infinite Words. - Jakub Michaliszyn; Jan Otop (ECAI, 2020)

Non-deterministic weighted automata evaluated over Markov chains. - Jakub Michaliszyn; Jan Otop (J. Comput. Syst. Sci., 2020)

Minimization of Limit-Average Automata. - Jakub Michaliszyn; Jan Otop (IJCAI, 2021)

Modular Path Queries with Arithmetic. - Jakub Michaliszyn; Jan Otop; Piotr Wieczorek (Log. Methods Comput. Sci., 2021)

Learning Deterministic Visibly Pushdown Automata Under Accessible Stack. - Jakub Michaliszyn; Jan Otop (MFCS, 2022)

Learning infinite-word automata with loop-index queries. - Jakub Michaliszyn; Jan Otop (Artif. Intell., 2022)

Reachability and Bounded Emptiness Problems of Constraint Automata with Prefix, Suffix and Infix. - Jakub Michaliszyn; Jan Otop; Piotr Wieczorek (CONCUR, 2023)

Deterministic Weighted Automata Under Partial Observability. - Jakub Michaliszyn; Jan Otop (JELIA, 2023)

Anti-pattern Templates. - Jan Otop (CADE, 2025)

Minimization of Deterministic Finite Automata Modulo the Edit Distance. - Jakub Michaliszyn; Jan Otop (MFCS, 2025)