Jan Otop

63 papers A* 6A 3B 17Journal 27Unranked 9
YearRankTypeTitle / Venue / Authors
2026 B ed.
Fundamentals of Computation Theory - 25th International Symposium, FCT 2025, Wrocław, Poland, September 15-17, 2025, Proceedings
FCT
Artur Jez, Jan Otop
2025 A conf
Active Automata Learning with Advice.
ECAI
Michal Fica, Jan Otop
2025 J jnl
Active Automata Learning with Advice.
CoRR
Michal Fica, Jan Otop
2025 A conf
Anti-pattern Templates.
CADE
Jan Otop
2025 B conf
Minimization of Deterministic Finite Automata Modulo the Edit Distance.
MFCS
Jakub Michaliszyn, Jan Otop
2025 J jnl
The Target Discounted-Sum Problem.
CoRR
Udi Boker, Thomas A. Henzinger, Jan Otop
2024 J jnl
Deterministic Weighted Automata under Partial Observability.
CoRR
Jakub Michaliszyn, Jan Otop
2023 B conf
Deterministic Weighted Automata Under Partial Observability.
JELIA
Jakub Michaliszyn, Jan Otop
2023 B conf
Reachability and Bounded Emptiness Problems of Constraint Automata with Prefix, Suffix and Infix.
CONCUR
Jakub Michaliszyn, Jan Otop, Piotr Wieczorek
2022 B conf
Learning Deterministic Visibly Pushdown Automata Under Accessible Stack.
MFCS
Jakub Michaliszyn, Jan Otop
2022 J jnl
Learning infinite-word automata with loop-index queries.
Artif. Intell.
Jakub Michaliszyn, Jan Otop
2021 A* conf
Minimization of Limit-Average Automata.
IJCAI
Jakub Michaliszyn, Jan Otop
2021 J jnl
Modular Path Queries with Arithmetic.
Log. Methods Comput. Sci.
Jakub Michaliszyn, Jan Otop, Piotr Wieczorek
2020 A conf
Learning Deterministic Automata on Infinite Words.
ECAI
Jakub Michaliszyn, Jan Otop
2020 J jnl
Modular Path Queries with Arithmetic.
CoRR
Jakub Michaliszyn, Jan Otop, Piotr Wieczorek
2020 B conf
Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States.
CONCUR
Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop
2020 J jnl
Multi-dimensional Long-Run Average Problems for Vector Addition Systems with States.
CoRR
Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop
2020 J jnl
Non-deterministic weighted automata evaluated over Markov chains.
J. Comput. Syst. Sci.
Jakub Michaliszyn, Jan Otop
2019 B conf
Approximate Learning of Limit-Average Automata.
CONCUR
Jakub Michaliszyn, Jan Otop
2019 J jnl
Approximate Learning of Limit-Average Automata.
CoRR
Jakub Michaliszyn, Jan Otop
2019 B conf
Long-Run Average Behavior of Vector Addition Systems with States.
CONCUR
Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop
2019 J jnl
Long-Run Average Behavior of Vector Addition Systems with States.
CoRR
Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop
2019 J jnl
Non-deterministic weighted automata evaluated over Markov chains.
CoRR
Jakub Michaliszyn, Jan Otop
2019 J jnl
Quantitative Automata under Probabilistic Semantics.
Log. Methods Comput. Sci.
Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop
2018 — conf
Computing Average Response Time.
Principles of Modeling
Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop
2018 B conf
Non-deterministic Weighted Automata on Random Words.
CONCUR
Jakub Michaliszyn, Jan Otop
2018 J jnl
Satisfiability versus Finite Satisfiability in Elementary Modal Logics.
Fundam. Informaticae
Jakub Michaliszyn, Jan Otop, Piotr Witkowski
2017 J jnl
Average Stack Cost of Buechi Pushdown Automata.
CoRR
Jakub Michaliszyn, Jan Otop
2017 — conf
Average Stack Cost of Büchi Pushdown Automata.
FSTTCS
Jakub Michaliszyn, Jan Otop
2017 B conf
Bidirectional Nested Weighted Automata.
CONCUR
Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop
2017 J jnl
Bidirectional Nested Weighted Automata.
CoRR
Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop
2017 J jnl
Edit Distance for Pushdown Automata.
Log. Methods Comput. Sci.
Krishnendu Chatterjee, Thomas A. Henzinger, Rasmus Ibsen-Jensen, Jan Otop
2017 J jnl
Nested Weighted Automata.
ACM Trans. Comput. Log.
Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop
2017 J jnl
Quantitative fair simulation games.
Inf. Comput.
Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop, Yaron Velner
2017 — conf
Querying Best Paths in Graph Databases.
FSTTCS
Jakub Michaliszyn, Jan Otop, Piotr Wieczorek
2017 J jnl
Querying Best Paths in Graph Databases.
CoRR
Jakub Michaliszyn, Jan Otop, Piotr Wieczorek
2016 B conf
Lipschitz Robustness of Timed I/O Systems.
VMCAI
Thomas A. Henzinger, Jan Otop, Roopsha Samanta
2016 B conf
Nested Weighted Limit-Average Automata of Bounded Width.
MFCS
Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop
2016 J jnl
Nested Weighted Limit-Average Automata of Bounded Width.
CoRR
Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop
2016 A* conf
Quantitative Automata under Probabilistic Semantics.
LICS
Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop
2016 J jnl
Quantitative Automata under Probabilistic Semantics.
CoRR
Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop
2016 B conf
Quantitative Monitor Automata.
SAS
Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop
2016 A* conf
Querying Data Graphs with Arithmetical Regular Expressions.
IJCAI
Maciej Grabon, Jakub Michaliszyn, Jan Otop, Piotr Wieczorek
2015 — conf
Edit Distance for Pushdown Automata.
ICALP (2)
Krishnendu Chatterjee, Thomas A. Henzinger, Rasmus Ibsen-Jensen, Jan Otop
2015 J jnl
Edit Distance for Pushdown Automata.
CoRR
Krishnendu Chatterjee, Thomas A. Henzinger, Rasmus Ibsen-Jensen, Jan Otop
2015 J jnl
Lipschitz Robustness of Timed I/O Systems.
CoRR
Thomas A. Henzinger, Jan Otop, Roopsha Samanta
2015 A* conf
Nested Weighted Automata.
LICS
Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop
2015 J jnl
Nested Weighted Automata.
CoRR
Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop
2015 J jnl
On the Decidability of Elementary Modal Logics.
ACM Trans. Comput. Log.
Jakub Michaliszyn, Jan Otop, Emanuel Kieronski
2015 A* conf
The Target Discounted-Sum Problem.
LICS
Udi Boker, Thomas A. Henzinger, Jan Otop
2014 — conf
Lipschitz Robustness of Finite-state Transducers.
FSTTCS
Thomas A. Henzinger, Jan Otop, Roopsha Samanta
2014 J jnl
Lipschitz Robustness of Finite-state Transducers.
CoRR
Thomas A. Henzinger, Jan Otop, Roopsha Samanta
2014 — conf
Model measuring for hybrid systems.
HSCC
Thomas A. Henzinger, Jan Otop
2013 B conf
Distributed synthesis for LTL fragments.
FMCAD
Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop, Andreas Pavlogiannis
2013 B conf
Elementary Modal Logics over Transitive Structures.
CSL
Jakub Michaliszyn, Jan Otop
2013 B conf
From Model Checking to Model Measuring.
CONCUR
Thomas A. Henzinger, Jan Otop
2012 A* conf
Decidable Elementary Modal Logics.
LICS
Jakub Michaliszyn, Jan Otop
2012 J jnl
E-unification with Constants vs. General E-unification.
J. Autom. Reason.
Jan Otop
2012 — conf
Satisfiability vs. Finite Satisfiability in Elementary Modal Logics
GandALF
Jakub Michaliszyn, Jan Otop, Piotr Witkowski
2011 — conf
Modal Logics Definable by Universal Three-Variable Formulas.
FSTTCS
Emanuel Kieronski, Jakub Michaliszyn, Jan Otop
2011 — ed.
Proceedings of the 25th International Workshop on Unification, UNIF 2011, Wroclaw, Poland, July 31, 2011.
UNIF
Franz Baader, Barbara Morawska, Jan Otop
2011 — conf
Unification of anti-terms.
UNIF
Jan Otop
2004 B conf
On a Semantic Subsumption Test.
LPAR
Jerzy Marcinkowski, Jan Otop, Grzegorz Stelmaszek