_id,title
8193,Multiple-environment Markov decision processes: Efficient analysis and applications
6918,An efficient algorithm for computing network reliability in small treewidth
7212,Limits on amplifiers of natural selection under death-Birth updating
7343,Social immunity modulates competition between coinfecting pathogens
7346,The evolutionary price of anarchy: Locally bounded agents in a dynamic virus game
7196,A role of graphs in evolutionary processes
7810,Optimal and perfectly parallel algorithms for on-demand data-flow analysis
8089,Polynomial invariant generation for non-deterministic recursive programs
7955,Approximating values of generalized-reachability stochastic games
6380,Efficient parameterized algorithms for data packing
6780,Modular verification for almost-sure termination of probabilistic programs
7950,Token swapping on trees
5948,Termination of nondeterministic probabilistic programs
6056,Probabilistic smart contracts: Secure randomness on the blockchain
6175,Cost analysis of nondeterministic probabilistic programs
6378,"Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving"
6462,Run-time optimization for learned controllers through quantitative games
6490,The treewidth of smart contracts
6836,Social dilemmas among unequals
6884,Bidding mechanisms in graph games
6885,Long-run average behavior of vector addition systems with states
6887,Near-linear time algorithms for Streett objectives in graphs and MDPs
6889,Combinations of Qualitative Winning for Stochastic Parity Games
6942,Strategy representation by decision trees with linear classifiers
7014,Non-polynomial worst-case analysis of recursive programs
7158,Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth
7183,Deciding fast termination for probabilistic VASS with nondeterminism
7210,Population structure determines the tradeoff between fixation probability and fixation time
7402,Graph planning with expected finite horizon
325,Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs
157,Evolution of cooperation in stochastic games
2,"Indirect reciprocity with private, noisy, and incomplete information"
293,The signal-burying game can explain why we obscure positive traits and good deeds
310,"Lower bounds for symbolic computation on graphs: Strongly connected components, liveness, safety and diameter"
311,Quantitative analysis of smart contracts
143,Efficient algorithms for asymptotic bounds on termination time in VASS
141,Symbolic algorithms for graphs and Markov decision processes with fairness objectives
198,Language acquisition with communication between learners
25,Goal-HSVI: Heuristic search value iteration for goal-POMDPs
24,Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives
297,Strategy representation by decision trees in reactive synthesis
34,Sensor synthesis for POMDPs with reachability objectives
35,Algorithms and conditional lower bounds for planning problems
419,Partners and rivals in direct reciprocity
454,Crosstalk in concurrent repeated games impedes direct reciprocity and requires stronger levels of forgiveness
5679,New approaches for almost-sure termination of probabilistic programs
5751,Construction of arbitrarily strong amplifiers of natural selection using evolutionary graph theory
59,Graph games and reactive synthesis
5967,The Big Match with a clock and a bit of memory
5977,Computational approaches for stochastic shortest path on succinct MDPs
5993,Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs
6009,Algorithms for algebraic path properties in concurrent systems of constant treewidth components
6340,Secure Credit Reporting on the Blockchain
66,Ergodic mean-payoff games for the analysis of attacks in crypto-currencies.
738,Automated competitive analysis of real time scheduling with graph games
79,Parameter-independent strategies for pMDPs via POMDPs
86,Computing average response time
5455,Optimal Dyck reachability for data-dependence and alias analysis
5456,Data-centric dynamic partial order reduction
1194,Stochastic invariants for probabilistic termination
821,Algorithmic advances in program analysis and their applications
1407,Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games
1009,Optimizing expectation with guarantees in POMDPs
1011,Faster algorithms for weighted recursive state machines
1066,Quantitative fair simulation games
1065,Pushdown reachability with constant treewidth
1080,Reconstructing metastatic seeding patterns of human cancers
1294,Trading performance for stability in Markov decision processes
464,Improved algorithms for parity and Streett objectives
466,Unifying two views on multiple mean-payoff objectives in Markov decision processes
465,Edit distance for pushdown automata
467,Nested weighted automata
512,Amplification on undirected population structures: Comets beat stars
551,Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs
552,Faster algorithms for mean payoff parity games
553,Strategy complexity of concurrent safety games
5559,Strong amplifiers of natural selection
625,The cost of exactness in quantitative reachability
628,Automated recurrence analysis for almost linear expected runtime bounds
645,Value iteration for long run average reward in markov decision processes
6519,Improved set-based symbolic algorithms for parity games
653,Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer
671,Memory-n strategies of direct reciprocity
684,Obligation blackwell games and p-automata
681,Doomsday equilibria for omega-regular games
699,The red queen and king in finite populations
639,Non-polynomial worst case analysis of recursive programs
711,Bidirectional nested weighted automata
716,The complexity of mean-payoff pushdown games
719,Special issue: Synthesis and SYNT 2014
717,Hyperplane separation technique for multidimensional mean-payoff games
744,Optional interactions and suspicious behaviour facilitates trustful cooperation in prisoners dilemma
950,Infinite-duration bidding games
949,JTDec: A tool for tree decompositions in soot
5451,Strong amplifiers of natural selection
5452,Arbitrarily strong amplifiers of natural selection
5453,Arbitrarily strong amplifiers of natural selection
1166,A symbolic SAT based algorithm for almost sure reachability with small strategies in pomdps
1397,Algorithms for partially observable markov decision processes
1200,"Only the combination of mathematics and agent based simulations can leverage the full potential of evolutionary modeling: Comment on “Evolutionary game theory using agent-based methods” by C. Adami, J. Schossau and A. Hintze"
1333,Humans choose representatives who enforce cooperation in social dilemmas through extortion
1335,Quantitative monitor automata
1322,Asymmetric power boosts extortion in an economic experiment
1324,Indefinite-horizon reachability in Goal-DEC-POMDPs
1325,Stability in graphs and games
1326,Optimizing the expected mean payoff in Energy Markov Decision Processes
1327,Stochastic shortest path with energy constraints in POMDPs
1340,The big match in small space
5445,Quantitative interprocedural analysis
1477,"What is decidable about partially observable Markov decision processes with ω-regular objectives"
1068,Conditionally optimal algorithms for generalized Büchi Games
1069,On the skolem problem for continuous linear dynamical systems
1070,Computation tree logic for synchronization properties
1071,Optimal reachability and a space time tradeoff for distance queries in constant treewidth graphs
1090,Nested weighted limit-average automata of bounded width
1093,Linear distances between Markov chains
1138,Quantitative automata under probabilistic semantics
1140,Model and objective separation with conditional lower bounds disjunction is harder than conjunction
1182,Robust draws in balanced knockout tournaments
1245,Game-theoretic models identify useful principles for peer collaboration in online learning platforms
1386,Termination analysis of probabilistic programs through Positivstellensatz's
1389,On recurrent reachability for continuous linear dynamical systems
1380,On the complexity of the orbit problem
1423,Comparing reactive and memory-one strategies of direct reciprocity
1426,Coevolutionary interactions between farmers and mafia induce host acceptance of avian brood parasites
1518,Efficient strategies for calculating blockwise likelihoods under the coalescent
478,The complexity of deciding legality of a single step of magic: The gathering
480,Perfect-information stochastic games with generalized mean-payoff objectives
5449,Amplification on undirected population structures: Comets beat stars
1529,Optimal cost almost-sure reachability in POMDPs
1438,Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs
1437,Algorithms for algebraic path properties in concurrent systems of constant treewidth components
1839,Multigain: A controller synthesis tool for MDPs with multiple mean-payoff objectives
5431,The patience of concurrent stochastic games with safety and reachability objectives
5432,The complexity of evolutionary games on graphs
5440,The complexity of evolutionary games on graphs
5443,A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs
5444,Reconstructing robust phylogenies of metastatic cancers
1481,Automatic generation of alternative starting positions for simple traditional board games
1499,Polynomial time decidability of weighted synchronization under partial observability
1594,Controller synthesis for MDPs and frequency LTL\GU
1601,The Hanoi omega-automata format
1603,Counterexample explanation by learning small strategies in Markov decision processes
5549,Experimental part of CAV 2015 publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes
1602,Faster algorithms for algebraic path properties in recursive state machines with constant treewidth
1607,Faster algorithms for quantitative verification in constant treewidth graphs
1609,The complexity of synthesis from probabilistic components
1604,Quantitative interprocedural analysis
5437,Faster algorithms for quantitative verification in constant treewidth graphs
5430,Faster algorithms for quantitative verification in constant treewidth graphs
1624,Cellular cooperation with shift updating and repulsion
1689,Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games
1691,Temporal logic motion planning using POMDPs with parity objectives: Case study paper
1694,Quantitative temporal simulation and refinement distances for timed systems
1698,The complexity of multi-mean-payoff and multi-energy games
1681,Evolution of decisions in population games with sequentially searching individuals
1709,Biological auctions with multiple rewards
1714,A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks
1846,Refinement checking on parametric modal transition systems
1851,Evolutionarily stable mating decisions for sequentially searching females and the stability of reproductive isolation by assortative mating
1838,Assume-guarantee synthesis for concurrent reactive programs with partial information
2034,Probabilistic opacity for Markov decision processes
1598,Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives
1502,Complete composition operators for IOCO-testing theory
1501,CEGAR for compositional analysis of qualitative properties in Markov decision processes
1559,Computational complexity of ecological and evolutionary spatial dynamics
1660,Long-run average behaviour of probabilistic vector addition systems
1667,Optimizing performance of continuous-time stochastic systems using timeout synthesis
1673,Amplifiers of selection
1665,Mutations driving CLL and their evolution in progression and relapse
1732,Qualitative analysis of POMDPs with temporal logic specifications for robotics applications
1820,Optimal cost almost-sure reachability in POMDPs
1873,POMDPs under probabilistic semantics
1882,Compositionality for quantitative specifications
1400,The subclonal evolution of cancer
1731,Randomness for free
1856,Measuring and synthesizing systems in probabilistic environments
1661,Improved algorithms for one-pair and k-pair Streett objectives
1657,Unifying two views on multiple mean-payoff objectives in Markov decision processes
1610,Edit distance for pushdown automata
5435,Unifying two views on multiple mean-payoff objectives in Markov decision processes
5429,Unifying two views on multiple mean-payoff objectives in Markov decision processes
5438,Edit distance for pushdown automata
1656,Nested weighted automata
5436,Nested weighted automata
524,Qualitative analysis of concurrent mean payoff games
523,Looking at mean-payoff and total-payoff through windows
5441,Algorithms for algebraic path properties in concurrent systems of constant treewidth components
1853,Game theoretic secure localization in wireless sensor networks
1884,Novel putative driver gene mutations in chronic lymphocytic leukemia (CLL): results from a combined analysis of whole exome sequencing of 262 primary CLL aamples
2027,Verification of markov decision processes using learning algorithms
2052,Parameterized model checking of rendezvous systems
2053,Probabilistic bisimulation: Naturally on distributions
2063,CEGAR for qualitative analysis of probabilistic systems
2162,The complexity of ergodic mean payoff games
2163,Games with a weak adversary
2190,From LTL to deterministic automata: A safraless compositional approach
2216,Edit distance for timed automata
5412,CEGAR for qualitative analysis of probabilistic systems
5413,CEGAR for qualitative analysis of probabilistic systems
5414,CEGAR for qualitative analysis of probabilistic systems
5418,Games with a weak adversary
5419,Improved algorithms for reachability and shortest path on low tree-width graphs
5420,The value 1 problem for concurrent mean-payoff games
5421,The complexity of evolution on graphs
5427,Optimal tree-decomposition balancing and reachability on low treewidth graphs
1375,Approximating the minimum cycle mean
5423,A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks
2039,The time scale of evolutionary innovation
2141,Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition
2187,Synthesizing robust systems
1903,Partial-observation stochastic reachability and parity games
2212,Perfect-information stochastic mean-payoff parity games
2716,Strategy synthesis for multi-dimensional quantitative objectives
1733,Interface simulation distances
5428,Quantitative fair simulation games
5426,Qualitative analysis of POMDPs with temporal logic specifications for robotics applications
5424,Qualitative analysis of POMDPs with temporal logic specifications for robotics applications
2234,Markov decision processes with multiple long-run average objectives
2213,The complexity of partial-observation stochastic parity games with finite-memory strategies
2246,Alternating traps in Muller and parity games
2211,Partial-observation stochastic games: How to win when belief fails
2038,Temporal specifications with accumulative values
2054,Qualitative concurrent parity games: Bounded rationality
475,First cycle games
5415,Nested weighted automata
535,Polynomial time algorithms for energy games with special weight structures
5404,The complexity of ergodic games
5406,Distributed synthesis for LTL Fragments
5409,Edit distance for timed automata
1376,Distributed synthesis for LTL fragments
1374,Infinite-state games with finitary conditions
5410,Automatic generation of alternative starting positions for traditional board games
2000,TTP: Tool for tumor progression
5399,TTP: Tool for Tumor Progression
5405,Perfect-information stochastic mean-payoff parity games
5408,The complexity of partial-observation stochastic parity games with finite-memory strategies
2292,Mathematical Foundations of Computer Science 2013
2295,What is decidable about partially observable Markov decision processes with omega-regular objectives
2299,Synthesis of AMBA AHB from formal specification: A case study
5400,"What is decidable about partially observable Markov decision processes with ω-regular objectives"
2854,Strategy improvement for concurrent reachability and turn based stochastic safety games
2886,Controllable-choice message sequence graphs
2858,The effect of one additional driver mutation on tumor progression
3116,Code aware resource management
2238,Multi-objective discounted reward verification in graphs and MDPs
2247,Forgiver triumphs in alternating prisoner's dilemma
2446,Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis
2444,Faster algorithms for Markov decision processes with low treewidth
2305,Trading performance for stability in Markov decision processes
2824,"Synthesis of memory-efficient, clock-memory free, and non-Zeno safety controllers for timed systems"
2831,Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives
2836,Assume-guarantee synthesis for digital contract signing
2816,Evolutionary dynamics of cancer in response to targeted combination therapy
2817,Density games
2819,Quantitative timed simulation functions and refinement metrics for real-time systems
2814,The complexity of coverage
5403,Qualitative analysis of concurrent mean-payoff games
2279,Looking at mean-payoff and total-payoff through windows
2329,Hyperplane separation technique for multidimensional mean-payoff games
2820,Automated analysis of real-time scheduling using graph games
3165,An O(n2) time algorithm for alternating Büchi games
2715,Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives
2848,Evolutionary game dynamics in populations with different learners
2936,Finite automata with time delay blocks
2916,Interface Simulation Distances
3128,A survey of partial-observation stochastic parity games
3135,Efficient controller synthesis for consumption games with multiple resource types
2947,Equivalence of games with probabilistic uncertainty and partial observation games
2955,Partial-observation stochastic games: How to win when belief fails
2957,Decidable problems for probabilistic automata on infinite words
5377,Mean-payoff pushdown games
2956,Mean payoff pushdown games
3157,The molecular evolution of acquired resistance to targeted EGFR blockade in colorectal cancers
3260,Evolutionary dynamics of biological auctions
3314,Discounting and averaging in games across time scales
3252,Synthesizing protocols for digital contract signing
3254,The complexity of stochastic Müller games
3255,Games and Markov decision processes with mean payoff parity and energy parity objectives
3341,Robustness of structurally equivalent concurrent parity games
3846,"A survey of stochastic ω regular games"
2972,Energy parity games
495,A Myhill Nerode theorem for automata with advice
496,Interpretations in trees with countably many branches
497,Faster algorithms for alternating refinement relations
5378,Faster algorithms for alternating refinement relations
5379,An O(n2) time algorithm for alternating Büchi games
5380,Bounded rationality in concurrent parity games
3338,Bounded rationality in concurrent parity games
3339,Magnifying lens abstraction for stochastic games with discounted and long-run average objectives
3344,Graph games with reachability objectives
3363,The decidability frontier for probabilistic automata on infinite words
3366,Quantitative synthesis for concurrent programs
3342,Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives
5381,Partial-observation stochastic games: How to win when belief fails
5384,Decidable problems for probabilistic automata on infinite words
3315,Timed parity games: Complexity and robustness
3316,Specification-centered robustness
5382,Robustness of structurally equivalent concurrent parity games
3345,Energy and mean-payoff parity Markov Decision Processes
3346,Two views on multiple mean payoff objectives in Markov Decision Processes
3347,Finitary languages
3348,Synthesis of memory efficient real time controllers for safety objectives
3349,A reduction from parity games to simple stochastic games
3350,Minimum attention controller synthesis for omega regular objectives
3351,On memoryless quantitative objectives
3356,Temporal specifications with accumulative values
3357,The complexity of request-response games
3361,The complexity of quantitative information flow problems
3354,Qualitative concurrent parity games
5385,Temporal specifications with accumulative values
3343,Faster and dynamic algorithms for maximal end component decomposition and related graph problems in probabilistic verification
5387,Energy and mean-payoff parity Markov decision processes
3365,QUASY: quantitative synthesis tool
5390,"Topological, automata-theoretic and logical characterization of finitary languages"
3859,Formal modeling and analysis of timed systems
5388,Quantitative synthesis for concurrent programs
3851,Energy parity games
3852,Discounting in games across time scales
3853,Mean-payoff automaton expressions
3854,Obliging games
3855,Qualitative analysis of partially-observable Markov Decision Processes
3864,Measuring and synthesizing systems in probabilistic environments
3865,Analyzing the impact of change in multi-threaded programs
3866,Robustness in the presence of liveness
3857,Probabilistic Automata on infinite words: decidability and undecidability results
3858,The complexity of partial-observation parity games
3860,Generalized mean-payoff and energy games
3863,Strategy construction for parity games with imperfect information
3856,Randomness for free
3861,Strategy logic
3868,Algorithms for game metrics
3867,Expressiveness and closure properties for quantitative languages
4388,GIST: A solver for probabilistic games
489,How do we remember the past in randomised strategies?
4569,Better quality in synthesis through quantitative objectives
5394,Improved lower bounds for request-response and finitary Streett games
5395,Qualitative analysis of partially-observable Markov decision processes
5392,Probabilistic automata on infinite words: Decidability and undecidability results
3870,Finitary winning in omega-regular games
3871,Probabilistic weighted automata
5393,Gist: A solver for probabilistic games
4542,Alternating weighted automata
4543,Stochastic games with finitary objectives
4545,A survey of stochastic games with limsup and liminf objectives