The probabilistic model checking landscape
JP Katoen - Proceedings of the 31st Annual ACM/IEEE Symposium …, 2016 - dl.acm.org
Randomization is a key element in sequential and distributed computing. Reasoning about
randomized algorithms is highly non-trivial. In the 1980s, this initiated first proof methods …
randomized algorithms is highly non-trivial. In the 1980s, this initiated first proof methods …
Skolem meets schanuel
The celebrated Skolem-Mahler-Lech Theorem states that the set of zeros of a linear
recurrence sequence is the union of a finite set and finitely many arithmetic progressions …
recurrence sequence is the union of a finite set and finitely many arithmetic progressions …
Research of an integrated decision model for production scheduling and maintenance planning with economic objective
Y Ao, H Zhang, C Wang - Computers & Industrial Engineering, 2019 - Elsevier
Semiconductor production has characteristics of reentry, uncertainty, and high level of
equipment integration, which are different with general machining processes. It involves …
equipment integration, which are different with general machining processes. It involves …
On the skolem problem and the skolem conjecture
It is a longstanding open problem whether there is an algorithm to decide the Skolem
Problem for linear recurrence sequences (LRS) over the integers, namely whether a given …
Problem for linear recurrence sequences (LRS) over the integers, namely whether a given …
MDPs as distribution transformers: affine invariant synthesis for safety objectives
Markov decision processes can be viewed as transformers of probability distributions. While
this view is useful from a practical standpoint to reason about trajectories of distributions …
this view is useful from a practical standpoint to reason about trajectories of distributions …
On the decidability of reachability in linear time-invariant systems
We consider the decidability of state-to-state reachability in linear time-invariant control
systems over discrete time. We analyse this problem with respect to the allowable control …
systems over discrete time. We analyse this problem with respect to the allowable control …
On Skolem-hardness and saturation points in Markov decision processes
J Piribauer, C Baier - arXiv preprint arXiv:2004.11441, 2020 - arxiv.org
The Skolem problem and the related Positivity problem for linear recurrence sequences are
outstanding number-theoretic problems whose decidability has been open for many …
outstanding number-theoretic problems whose decidability has been open for many …
Distribution-based objectives for Markov decision processes
We consider distribution-based objectives for Markov Decision Processes (MDP). This class
of objectives gives rise to an interesting trade-off between full and partial information. As in …
of objectives gives rise to an interesting trade-off between full and partial information. As in …
On decidability of time-bounded reachability in CTMDPs
We consider the time-bounded reachability problem for continuous-time Markov decision
processes. We show that the problem is decidable subject to Schanuel's conjecture. Our …
processes. We show that the problem is decidable subject to Schanuel's conjecture. Our …
The orbit problem for parametric linear dynamical systems
We study a parametric version of the Kannan-Lipton Orbit Problem for linear dynamical
systems. We show decidability in the case of one parameter and Skolem-hardness with two …
systems. We show decidability in the case of one parameter and Skolem-hardness with two …