Abstract
We develop a fixed-point extension of quantitative equational logic and give semantics in one-bounded complete quantitative algebras. Unlike previous related work about fixed-points in metric spaces, we are working with the notion of approximate equality rather than exact equality. The result is a novel theory of fixed points which can not only provide solutions to the traditional fixed-point equations but we can also define the rate of convergence to the fixed point. We show that such a theory is the quantitative analogue of a Conway theory and also of an iteration theory; and it reflects the metric coinduction principle. We study the Bellman equation for a Markov decision process as an illustrative example.
Original language | English |
---|---|
Title of host publication | Proceedings of the 36th Annual Symposium on Logic in Computer Science |
Publisher | Institute of Electrical and Electronics Engineers (IEEE) |
Number of pages | 13 |
ISBN (Electronic) | 978-1-6654-4895-6 |
ISBN (Print) | 978-1-6654-4896-3 |
DOIs | |
Publication status | Published - 9 Jul 2021 |
Event | 36th Annual ACM/IEEE Symposium on Logic in Computer Science - Online Duration: 29 Jun 2021 → 2 Jul 2021 http://easyconferences.eu/lics2021/ |
Symposium
Symposium | 36th Annual ACM/IEEE Symposium on Logic in Computer Science |
---|---|
Abbreviated title | LICS 2021 |
Period | 29/06/21 → 2/07/21 |
Internet address |