5 citations · 8 across the 11 of their papers we have counts for
4 papers · 1 filter
Data Structures for Finite Downsets of Natural Vectors: Theory and Practice
Michaël Cadilhac, Vanessa Flügel, Guillermo A. Pérez +1
Manipulating downward-closed sets of vectors forms the basis of so-called antichain-based algorithms in verification. In that context, the dimension of the vectors is intimately ti…
Algorithms for Markov Binomial Chains
Alejandro Alarcón Gonzalez, Niel Hens, Tim Leys +1
We study algorithms to analyze a particular class of Markov population processes that is often used in epidemiology. More specifically, Markov binomial chains are the model that ar…
Graph-Based Reductions for Parametric and Weighted MDPs
Kasper Engelen, Guillermo A. Pérez, Shrisha Rao
We study the complexity of reductions for weighted reachability in parametric Markov decision processes. That is, we say a state p is never worse than q if for all valuations of th…
Acacia-Bonsai: A Modern Implementation of Downset-Based LTL Realizability
Michaël Cadilhac, Guillermo A. Pérez
We describe our implementation of downset-manipulating algorithms used to solve the realizability problem for linear temporal logic (LTL). These algorithms were introduced by Filio…