Publication | Date of Publication | Type |
---|
https://portal.mardi4nfdi.de/entity/Q6187068 | 2024-02-05 | Paper |
https://portal.mardi4nfdi.de/entity/Q6134255 | 2023-08-21 | Paper |
https://portal.mardi4nfdi.de/entity/Q6176097 | 2023-08-21 | Paper |
Linear-Time Model Checking Branching Processes | 2023-08-21 | Paper |
Markov chains and unambiguous automata | 2023-06-12 | Paper |
Image-binary automata | 2022-11-09 | Paper |
https://portal.mardi4nfdi.de/entity/Q5094125 | 2022-08-02 | Paper |
On the Sequential Probability Ratio Test in Hidden Markov Models | 2022-07-28 | Paper |
On the Complexity of Value Iteration | 2022-07-21 | Paper |
https://portal.mardi4nfdi.de/entity/Q5092320 | 2022-07-21 | Paper |
https://portal.mardi4nfdi.de/entity/Q5092446 | 2022-07-21 | Paper |
On Affine Reachability Problems | 2022-07-18 | Paper |
https://portal.mardi4nfdi.de/entity/Q5089306 | 2022-07-18 | Paper |
https://portal.mardi4nfdi.de/entity/Q5089308 | 2022-07-18 | Paper |
On finite monoids over nonnegative integer matrices and short killing words | 2022-07-18 | Paper |
On complementing unambiguous automata and graphs with many cliques and cocliques | 2022-06-03 | Paper |
Strategy Complexity of Reachability in Countable Stochastic 2-Player Games | 2022-03-22 | Paper |
https://portal.mardi4nfdi.de/entity/Q5009434 | 2021-08-04 | Paper |
On Computing the Total Variation Distance of Hidden Markov Models. | 2021-07-28 | Paper |
On Nonnegative Integer Matrices and Short Killing Words | 2021-06-10 | Paper |
Selective monitoring | 2021-02-02 | Paper |
https://portal.mardi4nfdi.de/entity/Q5144636 | 2021-01-19 | Paper |
https://portal.mardi4nfdi.de/entity/Q5144646 | 2021-01-19 | Paper |
https://portal.mardi4nfdi.de/entity/Q5144681 | 2021-01-19 | Paper |
Trace Refinement in Labelled Markov Decision Processes | 2020-06-26 | Paper |
Counting problems for parikh images | 2020-05-26 | Paper |
On the Size of Finite Rational Matrix Semigroups | 2019-09-09 | Paper |
Markov Chains and Unambiguous Büchi Automata | 2019-05-03 | Paper |
B\"uchi Objectives in Countable MDPs | 2019-04-25 | Paper |
https://portal.mardi4nfdi.de/entity/Q4558784 | 2018-11-30 | Paper |
On Rationality of Nonnegative Matrix Factorization | 2018-07-16 | Paper |
Zero-reachability in probabilistic multi-counter automata | 2018-04-23 | Paper |
On the total variation distance of labelled Markov chains | 2018-04-23 | Paper |
Long-Run Average Behaviour of Probabilistic Vector Addition Systems | 2018-04-23 | Paper |
On Restricted Nonnegative Matrix Factorization | 2017-12-19 | Paper |
https://portal.mardi4nfdi.de/entity/Q4598245 | 2017-12-19 | Paper |
Nonnegative Matrix Factorization Requires Irrationality | 2017-07-21 | Paper |
Bisimilarity of Pushdown Automata is Nonelementary | 2017-07-03 | Paper |
Minimisation of Multiplicity Tree Automata | 2017-05-08 | Paper |
Bisimilarity of Probabilistic Pushdown Automata | 2017-01-26 | Paper |
Trace Refinement in Labelled Markov Decision Processes | 2016-06-10 | Paper |
The complexity of the \(K\)th largest subset problem and related problems | 2015-12-01 | Paper |
The Odds of Staying on Budget | 2015-11-04 | Paper |
Minimisation of Multiplicity Tree Automata | 2015-10-01 | Paper |
Efficient Analysis of Probabilistic Programs with an Unbounded Counter | 2015-08-14 | Paper |
Runtime analysis of probabilistic programs with unbounded recursion | 2014-09-22 | Paper |
A strongly polynomial algorithm for criticality of branching processes and consistency of stochastic context-free grammars | 2014-08-13 | Paper |
Language equivalence of probabilistic pushdown automata | 2014-07-18 | Paper |
Stability and Complexity of Minimising Probabilistic Automata | 2014-07-01 | Paper |
Analyzing probabilistic pushdown automata | 2014-06-30 | Paper |
Algorithmic probabilistic game semantics. Playing games with automata | 2014-06-30 | Paper |
Analysis of Probabilistic Basic Parallel Processes | 2014-04-16 | Paper |
On the Complexity of Equivalence and Minimisation for Q-weighted Automata | 2013-04-09 | Paper |
Parikh's theorem: a simple and direct automaton construction | 2013-03-28 | Paper |
Three tokens in Herman's algorithm | 2013-03-22 | Paper |
BPA bisimilarity is EXPTIME-hard | 2013-03-20 | Paper |
Convergence Thresholds of Newton's Method for Monotone Polynomial Equations | 2013-03-19 | Paper |
On the memory consumption of probabilistic pushdown automata | 2012-10-24 | Paper |
Model Checking Stochastic Branching Processes | 2012-09-25 | Paper |
https://portal.mardi4nfdi.de/entity/Q2904789 | 2012-08-23 | Paper |
On the Complexity of the Equivalence Problem for Probabilistic Automata | 2012-06-22 | Paper |
Space-efficient scheduling of stochastically generated tasks | 2012-05-24 | Paper |
COMPUTING LEAST FIXED POINTS OF PROBABILISTIC SYSTEMS OF POLYNOMIALS | 2012-01-23 | Paper |
Derivation tree analysis for accelerated fixed-point computation | 2011-07-07 | Paper |
Runtime Analysis of Probabilistic Programs with Unbounded Recursion | 2011-07-07 | Paper |
On Stabilization in Herman’s Algorithm | 2011-07-07 | Paper |
On Probabilistic Parallel Programs with Process Creation and Synchronisation | 2011-05-19 | Paper |
Newtonian program analysis | 2011-05-16 | Paper |
Computing the Least Fixed Point of Positive Polynomial Systems | 2011-01-17 | Paper |
Space-Efficient Scheduling of Stochastically Generated Tasks | 2010-09-07 | Paper |
https://portal.mardi4nfdi.de/entity/Q5190774 | 2009-07-27 | Paper |
https://portal.mardi4nfdi.de/entity/Q3620428 | 2009-04-14 | Paper |
Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains | 2009-03-31 | Paper |
https://portal.mardi4nfdi.de/entity/Q3549616 | 2009-01-05 | Paper |
Derivation Tree Analysis for Accelerated Fixed-Point Computation | 2008-10-30 | Paper |
Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations | 2008-08-28 | Paper |
Newton’s Method for ω-Continuous Semirings | 2008-08-19 | Paper |
An Extension of Newton’s Method to ω-Continuous Semirings | 2007-11-28 | Paper |
On Fixed Point Equations over Commutative Semirings | 2007-09-03 | Paper |
Tools and Algorithms for the Construction and Analysis of Systems | 2007-05-02 | Paper |