{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T11:20:37Z","timestamp":1778498437478,"version":"3.51.4"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2023,6,7]],"date-time":"2023-06-07T00:00:00Z","timestamp":1686096000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>Knaster-Tarski's theorem, characterising the greatest fixpoint of a monotone\nfunction over a complete lattice as the largest post-fixpoint, naturally leads\nto the so-called coinduction proof principle for showing that some element is\nbelow the greatest fixpoint (e.g., for providing bisimilarity witnesses). The\ndual principle, used for showing that an element is above the least fixpoint,\nis related to inductive invariants. In this paper we provide proof rules which\nare similar in spirit but for showing that an element is above the greatest\nfixpoint or, dually, below the least fixpoint. The theory is developed for\nnon-expansive monotone functions on suitable lattices of the form\n$\\mathbb{M}^Y$, where $Y$ is a finite set and $\\mathbb{M}$ an MV-algebra, and\nit is based on the construction of (finitary) approximations of the original\nfunctions. We show that our theory applies to a wide range of examples,\nincluding termination probabilities, metric transition systems, behavioural\ndistances for probabilistic automata and bisimilarity. Moreover it allows us to\ndetermine original algorithms for solving simple stochastic games.<\/jats:p>","DOI":"10.46298\/lmcs-19(2:15)2023","type":"journal-article","created":{"date-parts":[[2023,6,7]],"date-time":"2023-06-07T14:55:30Z","timestamp":1686149730000},"source":"Crossref","is-referenced-by-count":2,"title":["Fixpoint Theory -- Upside Down"],"prefix":"10.46298","volume":"Volume 19, Issue 2","author":[{"given":"Paolo","family":"Baldan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard","family":"Eggert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barbara","family":"K\u00f6nig","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tommaso","family":"Padoan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"25203","published-online":{"date-parts":[[2023,6,7]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/11443\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/11443\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T20:20:17Z","timestamp":1687292417000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/8382"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,7]]},"references-count":0,"URL":"https:\/\/doi.org\/10.46298\/lmcs-19(2:15)2023","relation":{"has-preprint":[{"id-type":"arxiv","id":"2101.08184v6","asserted-by":"subject"},{"id-type":"arxiv","id":"2101.08184v4","asserted-by":"subject"},{"id-type":"arxiv","id":"2101.08184v3","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"2101.08184","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.2101.08184","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"value":"1860-5974","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,6,7]]},"article-number":"8382"}}