We stand with Ukraine  

Jan Otop

Orcid: 0000-0002-8804-8011

According to our database1, Jan Otop authored at least 39 papers between 2004 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Deterministic Weighted Automata Under Partial Observability.
[BibTeX]
[DOI]
Jakub Michaliszyn
,
Jan Otop
Proceedings of the Logics in Artificial Intelligence - 18th European Conference, 2023

Reachability and Bounded Emptiness Problems of Constraint Automata with Prefix, Suffix and Infix.
[BibTeX]
[DOI]
Jakub Michaliszyn
,
Jan Otop
,
Piotr Wieczorek
Proceedings of the 34th International Conference on Concurrency Theory, 2023

2022
Learning infinite-word automata with loop-index queries.
[BibTeX]
[DOI]
Jakub Michaliszyn
,
Jan Otop
Artif. Intell., 2022

Learning Deterministic Visibly Pushdown Automata Under Accessible Stack.
[BibTeX]
[DOI]
Jakub Michaliszyn
,
Jan Otop
Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

2021
Modular Path Queries with Arithmetic.
[BibTeX]
[DOI]
Jakub Michaliszyn
,
Jan Otop
,
Piotr Wieczorek
Log. Methods Comput. Sci., 2021

Minimization of Limit-Average Automata.
[BibTeX]
[DOI]
Jakub Michaliszyn
,
Jan Otop
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

2020
Non-deterministic weighted automata evaluated over Markov chains.
[BibTeX]
[DOI]
Jakub Michaliszyn
,
Jan Otop
J. Comput. Syst. Sci., 2020

Learning Deterministic Automata on Infinite Words.
[BibTeX]
[DOI]
Jakub Michaliszyn
,
Jan Otop
Proceedings of the ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020, 2020

Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States.
[BibTeX]
[DOI]
Krishnendu Chatterjee
,
Thomas A. Henzinger
,
Jan Otop
Proceedings of the 31st International Conference on Concurrency Theory, 2020

2019
Quantitative Automata under Probabilistic Semantics.
[BibTeX]
[DOI]
Krishnendu Chatterjee
,
Thomas A. Henzinger
,
Jan Otop
Log. Methods Comput. Sci., 2019

Approximate Learning of Limit-Average Automata.
[BibTeX]
[DOI]
Jakub Michaliszyn
,
Jan Otop
Proceedings of the 30th International Conference on Concurrency Theory, 2019

Long-Run Average Behavior of Vector Addition Systems with States.
[BibTeX]
[DOI]
Krishnendu Chatterjee
,
Thomas A. Henzinger
,
Jan Otop
Proceedings of the 30th International Conference on Concurrency Theory, 2019

2018
Satisfiability versus Finite Satisfiability in Elementary Modal Logics.
[BibTeX]
[DOI]
Jakub Michaliszyn
,
Jan Otop
,
Piotr Witkowski
Fundam. Informaticae, 2018

Non-deterministic Weighted Automata on Random Words.
[BibTeX]
[DOI]
Jakub Michaliszyn
,
Jan Otop
Proceedings of the 29th International Conference on Concurrency Theory, 2018

Computing Average Response Time.
[BibTeX]
[DOI]
Krishnendu Chatterjee
,
Thomas A. Henzinger
,
Jan Otop
Proceedings of the Principles of Modeling, 2018

2017
Nested Weighted Automata.
[BibTeX]
[DOI]
Krishnendu Chatterjee
,
Thomas A. Henzinger
,
Jan Otop
ACM Trans. Comput. Log., 2017

Edit Distance for Pushdown Automata.
[BibTeX]
[DOI]
Krishnendu Chatterjee
,
Thomas A. Henzinger
,
Rasmus Ibsen-Jensen
,
Jan Otop
Log. Methods Comput. Sci., 2017

Quantitative fair simulation games.
[BibTeX]
[DOI]
Krishnendu Chatterjee
,
Thomas A. Henzinger
,
Jan Otop
,
Yaron Velner
Inf. Comput., 2017

Average Stack Cost of Buechi Pushdown Automata.
[BibTeX]
[DOI]
Jakub Michaliszyn
,
Jan Otop
CoRR, 2017

Querying Best Paths in Graph Databases.
[BibTeX]
[DOI]
Jakub Michaliszyn
,
Jan Otop
,
Piotr Wieczorek
Proceedings of the 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2017

Average Stack Cost of Büchi Pushdown Automata.
[BibTeX]
[DOI]
Jakub Michaliszyn
,
Jan Otop
Proceedings of the 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2017

Bidirectional Nested Weighted Automata.
[BibTeX]
[DOI]
Krishnendu Chatterjee
,
Thomas A. Henzinger
,
Jan Otop
Proceedings of the 28th International Conference on Concurrency Theory, 2017

2016
Lipschitz Robustness of Timed I/O Systems.
[BibTeX]
[DOI]
Thomas A. Henzinger
,
Jan Otop
,
Roopsha Samanta
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2016

Quantitative Monitor Automata.
[BibTeX]
[DOI]
Krishnendu Chatterjee
,
Thomas A. Henzinger
,
Jan Otop
Proceedings of the Static Analysis - 23rd International Symposium, 2016

Nested Weighted Limit-Average Automata of Bounded Width.
[BibTeX]
[DOI]
Krishnendu Chatterjee
,
Thomas A. Henzinger
,
Jan Otop
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Querying Data Graphs with Arithmetical Regular Expressions.
[BibTeX]
[DOI]
Maciej Grabon
,
Jakub Michaliszyn
,
Jan Otop
,
Piotr Wieczorek
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

2015
On the Decidability of Elementary Modal Logics.
[BibTeX]
[DOI]
Jakub Michaliszyn
,
Jan Otop
,
Emanuel Kieronski
ACM Trans. Comput. Log., 2015

The Target Discounted-Sum Problem.
[BibTeX]
[DOI]
Udi Boker
,
Thomas A. Henzinger
,
Jan Otop
Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

2014
Model measuring for hybrid systems.
[BibTeX]
[DOI]
Thomas A. Henzinger
,
Jan Otop
Proceedings of the 17th International Conference on Hybrid Systems: Computation and Control (part of CPS Week), 2014

Lipschitz Robustness of Finite-state Transducers.
[BibTeX]
[DOI]
Thomas A. Henzinger
,
Jan Otop
,
Roopsha Samanta
Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

2013
Distributed synthesis for LTL fragments.
[BibTeX]
[DOI]
Krishnendu Chatterjee
,
Thomas A. Henzinger
,
Jan Otop
,
Andreas Pavlogiannis
Proceedings of the Formal Methods in Computer-Aided Design, 2013

Elementary Modal Logics over Transitive Structures.
[BibTeX]
[DOI]
Jakub Michaliszyn
,
Jan Otop
Proceedings of the Computer Science Logic 2013 (CSL 2013), 2013

From Model Checking to Model Measuring.
[BibTeX]
[DOI]
Thomas A. Henzinger
,
Jan Otop
Proceedings of the CONCUR 2013 - Concurrency Theory - 24th International Conference, 2013

2012
E-unification with Constants vs. General E-unification.
[BibTeX]
[DOI]
Jan Otop
J. Autom. Reason., 2012

Satisfiability vs. Finite Satisfiability in Elementary Modal Logics
[BibTeX]
[DOI]
Jakub Michaliszyn
,
Jan Otop
,
Piotr Witkowski
Proceedings of the Proceedings Third International Symposium on Games, 2012

Decidable Elementary Modal Logics.
[BibTeX]
[DOI]
Jakub Michaliszyn
,
Jan Otop
Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

2011
Unification of anti-terms.
[BibTeX]
[DOI]
Jan Otop
Proceedings of the 25th International Workshop on Unification, 2011

Modal Logics Definable by Universal Three-Variable Formulas.
[BibTeX]
[DOI]
Emanuel Kieronski
,
Jakub Michaliszyn
,
Jan Otop
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

2004
On a Semantic Subsumption Test.
[BibTeX]
[DOI]
Jerzy Marcinkowski
,
Jan Otop
,
Grzegorz Stelmaszek
Proceedings of the Logic for Programming, 2004


  Loading...