Fixpoint theory -- upside down

DOI10.1007/978-3-030-71995-1_4OpenAlexW3140577997MaRDI QIDQ2233395

Tommaso Padoan, Paolo Baldan, Richard Eggert, Barbara König

Publication date: 18 October 2021

Full work available at URL: https://arxiv.org/abs/2101.08184

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Related Items

Latticed \(k\)-induction with an application to probabilistic programs

Cites Work

• Computational Optimal Transport: With Applications to Data Science
• Faster algorithms for mean-payoff games
• Advanced Łukasiewicz calculus and MV-algebras
• On strategy improvement algorithms for simple stochastic games
• Gromov-Wasserstein distances and the metric approach to object matching
• Combinatorial structure and randomized subexponential algorithms for infinite games
• The complexity of stochastic games
• A lattice-theoretical fixpoint theorem and its applications
• Introduction to Bisimulation and Coinduction
• Computing Game Metrics on Markov Decision Processes
• Complete Lattices and Up-To Techniques
• Algebraic laws for nondeterminism and concurrency
• Temporal abstract interpretation
• A Geometric Approach to MV-Algebras
• Automata, Languages and Programming
• On Nonterminating Stochastic Games
• Optimal Transport
• Value iteration for simple stochastic games: stopping criterion and learning algorithm
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item