Fixpoint Theory -- Upside Down

DOI10.46298/lmcs-19(2:15)2023arXiv2101.08184OpenAlexW4379800149MaRDI QIDQ6135764

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

Publication date: 26 August 2023

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

MV-algebrasstochastic gamesbisimilarityfixpointsKnaster-Tarski theoremnon-expansive functions

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computational Optimal Transport: With Applications to Data Science
• 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
• The quantitative linear-time-branching-time spectrum
• 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
• Bisimulation, modal logic and model checking games
• Making abstract interpretations complete
• On Nonterminating Stochastic Games
• Optimal Transport
• Value iteration for simple stochastic games: stopping criterion and learning algorithm

This page was built for publication: Fixpoint Theory -- Upside Down