Introduces coalgebraic shortest path problem as unifying framework and a coalgebraic Dijkstra algorithm that solves it correctly under a necessary and sufficient condition with classical complexity.
Generic weakest precondition semantics from monads enriched with order
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
representative citing papers
Presents codensity bisimilarity games as a general categorical characterization of bisimilarity-like notions via fibrations, coalgebras, and predicate transformers, covering bisimulation metrics and new notions such as bisimulation topology.
citing papers explorer
-
A Coalgebraic Dijkstra Algorithm
Introduces coalgebraic shortest path problem as unifying framework and a coalgebraic Dijkstra algorithm that solves it correctly under a necessary and sufficient condition with classical complexity.
-
Codensity Games for Bisimilarity
Presents codensity bisimilarity games as a general categorical characterization of bisimilarity-like notions via fibrations, coalgebras, and predicate transformers, covering bisimulation metrics and new notions such as bisimulation topology.