67 citations · 123 across the 37 of their papers we have counts for
6 papers · 1 filter
Seed Selection in the Heterogeneous Moran Process
Petros Petsinis, Andreas Pavlogiannis, Josef Tkadlec +1
The Moran process is a classic stochastic process that models the rise and takeover of novel traits in network-structured populations. In biological terms, a set of mutants, each w…
Fixation Maximization in the Positional Moran Process
Joachim Brendborg, Panagiotis Karras, Andreas Pavlogiannis +2
The Moran process is a classic stochastic process that models invasion dynamics on graphs. A single "mutant" (e.g., a new opinion, strain, social trait etc.) invades a population o…
Faster Algorithms for Quantitative Analysis of Markov Chains and Markov Decision Processes with Small Treewidth
Ali Asadi, Krishnendu Chatterjee, Amir Kafshdar Goharshady +2
Discrete-time Markov Chains (MCs) and Markov Decision Processes (MDPs) are two standard formalisms in system analysis. Their main associated quantitative objectives are hitting pro…
Optimal and Perfectly Parallel Algorithms for On-demand Data-flow Analysis
Krishnendu Chatterjee, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen +1
Interprocedural data-flow analyses form an expressive and useful paradigm of numerous static analysis applications, such as live variables analysis, alias analysis and null pointer…
Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs
Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis
We consider the core algorithmic problems related to verification of systems with respect to three classical quantitative properties, namely, the mean-payoff property, the ratio pr…
A Framework for Automated Competitive Analysis of On-line Scheduling of Firm-Deadline Tasks
Krishnendu Chatterjee, Andreas Pavlogiannis, Alexander Kößler +1
We present a flexible framework for the automated competitive analysis of on-line scheduling algorithms for firm-deadline real-time tasks based on multi-objective graphs: Given a t…