Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDJan Otop
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[c27]Jakub Michaliszyn, Jan Otop:
Minimization of Limit-Average Automata. IJCAI 2021: 2819-2825- 2020
- [j8]Jakub Michaliszyn
, Jan Otop:
Non-deterministic weighted automata evaluated over Markov chains. J. Comput. Syst. Sci. 108: 118-136 (2020) - [c26]Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop:
Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States. CONCUR 2020: 23:1-23:22 - [c25]Jakub Michaliszyn, Jan Otop:
Learning Deterministic Automata on Infinite Words. ECAI 2020: 2370-2377 - [i14]Jakub Michaliszyn, Jan Otop, Piotr Wieczorek:
Modular Path Queries with Arithmetic. CoRR abs/2002.04460 (2020) - [i13]Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop:
Multi-dimensional Long-Run Average Problems for Vector Addition Systems with States. CoRR abs/2007.08917 (2020)
2010 – 2019
- 2019
- [j7]Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop:
Quantitative Automata under Probabilistic Semantics. Log. Methods Comput. Sci. 15(3) (2019) - [c24]Jakub Michaliszyn, Jan Otop:
Approximate Learning of Limit-Average Automata. CONCUR 2019: 17:1-17:16 - [c23]Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop:
Long-Run Average Behavior of Vector Addition Systems with States. CONCUR 2019: 27:1-27:16 - [i12]Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop:
Long-Run Average Behavior of Vector Addition Systems with States. CoRR abs/1905.05537 (2019) - [i11]Jakub Michaliszyn, Jan Otop:
Approximate Learning of Limit-Average Automata. CoRR abs/1906.11104 (2019) - [i10]Jakub Michaliszyn, Jan Otop:
Non-deterministic weighted automata evaluated over Markov chains. CoRR abs/1908.04625 (2019) - 2018
- [j6]Jakub Michaliszyn, Jan Otop, Piotr Witkowski:
Satisfiability versus Finite Satisfiability in Elementary Modal Logics. Fundam. Informaticae 163(2): 165-188 (2018) - [c22]Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop:
Computing Average Response Time. Principles of Modeling 2018: 143-161 - [c21]Jakub Michaliszyn, Jan Otop:
Non-deterministic Weighted Automata on Random Words. CONCUR 2018: 10:1-10:16 - 2017
- [j5]Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop, Yaron Velner:
Quantitative fair simulation games. Inf. Comput. 254: 143-166 (2017) - [j4]Krishnendu Chatterjee, Thomas A. Henzinger, Rasmus Ibsen-Jensen, Jan Otop:
Edit Distance for Pushdown Automata. Log. Methods Comput. Sci. 13(3) (2017) - [j3]Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop:
Nested Weighted Automata. ACM Trans. Comput. Log. 18(4): 31:1-31:44 (2017) - [c20]Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop:
Bidirectional Nested Weighted Automata. CONCUR 2017: 5:1-5:16 - [c19]Jakub Michaliszyn, Jan Otop:
Average Stack Cost of Büchi Pushdown Automata. FSTTCS 2017: 42:1-42:13 - [c18]Jakub Michaliszyn, Jan Otop, Piotr Wieczorek:
Querying Best Paths in Graph Databases. FSTTCS 2017: 43:1-43:15 - [i9]Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop:
Bidirectional Nested Weighted Automata. CoRR abs/1706.08316 (2017) - [i8]Jakub Michaliszyn, Jan Otop, Piotr Wieczorek:
Querying Best Paths in Graph Databases. CoRR abs/1710.04419 (2017) - [i7]Jakub Michaliszyn, Jan Otop:
Average Stack Cost of Buechi Pushdown Automata. CoRR abs/1710.04490 (2017) - 2016
- [c17]Maciej Grabon, Jakub Michaliszyn, Jan Otop, Piotr Wieczorek:
Querying Data Graphs with Arithmetical Regular Expressions. IJCAI 2016: 1088-1094 - [c16]Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop:
Quantitative Automata under Probabilistic Semantics. LICS 2016: 76-85 - [c15]Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop:
Nested Weighted Limit-Average Automata of Bounded Width. MFCS 2016: 24:1-24:14 - [c14]Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop:
Quantitative Monitor Automata. SAS 2016: 23-38 - [c13]Thomas A. Henzinger, Jan Otop, Roopsha Samanta:
Lipschitz Robustness of Timed I/O Systems. VMCAI 2016: 250-267 - [i6]Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop:
Quantitative Automata under Probabilistic Semantics. CoRR abs/1604.06764 (2016) - [i5]Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop:
Nested Weighted Limit-Average Automata of Bounded Width. CoRR abs/1606.03598 (2016) - 2015
- [j2]Jakub Michaliszyn, Jan Otop, Emanuel Kieronski:
On the Decidability of Elementary Modal Logics. ACM Trans. Comput. Log. 17(1): 2:1-2:47 (2015) - [c12]Krishnendu Chatterjee, Thomas A. Henzinger, Rasmus Ibsen-Jensen, Jan Otop:
Edit Distance for Pushdown Automata. ICALP (2) 2015: 121-133 - [c11]Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop:
Nested Weighted Automata. LICS 2015: 725-737 - [c10]Udi Boker, Thomas A. Henzinger, Jan Otop:
The Target Discounted-Sum Problem. LICS 2015: 750-761 - [i4]Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop:
Nested Weighted Automata. CoRR abs/1504.06117 (2015) - [i3]Krishnendu Chatterjee, Thomas A. Henzinger, Rasmus Ibsen-Jensen, Jan Otop:
Edit Distance for Pushdown Automata. CoRR abs/1504.08259 (2015) - [i2]Thomas A. Henzinger, Jan Otop, Roopsha Samanta:
Lipschitz Robustness of Timed I/O Systems. CoRR abs/1506.01233 (2015) - 2014
- [c9]Thomas A. Henzinger, Jan Otop, Roopsha Samanta:
Lipschitz Robustness of Finite-state Transducers. FSTTCS 2014: 431-443 - [c8]Thomas A. Henzinger, Jan Otop:
Model measuring for hybrid systems. HSCC 2014: 213-222 - [i1]Thomas A. Henzinger, Jan Otop, Roopsha Samanta:
Lipschitz Robustness of Finite-state Transducers. CoRR abs/1404.6452 (2014) - 2013
- [c7]Thomas A. Henzinger, Jan Otop:
From Model Checking to Model Measuring. CONCUR 2013: 273-287 - [c6]Jakub Michaliszyn, Jan Otop:
Elementary Modal Logics over Transitive Structures. CSL 2013: 563-577 - [c5]Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop, Andreas Pavlogiannis:
Distributed synthesis for LTL fragments. FMCAD 2013: 18-25 - 2012
- [j1]Jan Otop:
E-unification with Constants vs. General E-unification. J. Autom. Reason. 48(3): 363-390 (2012) - [c4]Jakub Michaliszyn, Jan Otop:
Decidable Elementary Modal Logics. LICS 2012: 491-500 - [c3]Jakub Michaliszyn, Jan Otop, Piotr Witkowski:
Satisfiability vs. Finite Satisfiability in Elementary Modal Logics. GandALF 2012: 141-154 - 2011
- [c2]Emanuel Kieronski, Jakub Michaliszyn, Jan Otop:
Modal Logics Definable by Universal Three-Variable Formulas. FSTTCS 2011: 264-275
2000 – 2009
- 2004
- [c1]Jerzy Marcinkowski, Jan Otop, Grzegorz Stelmaszek:
On a Semantic Subsumption Test. LPAR 2004: 142-153
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
Tweets on dblp homepage
Show tweets from 
on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter account. At the same time, Twitter will persistently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
last updated on 2021-09-18 00:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp has been originally created in 1993 at:
since 2018, dblp is operated and maintained by:
the dblp computer science bibliography is funded and supported by:
