2 citations · 4 across the 10 of their papers we have counts for
Showing 2026Show all
3 papers · 1 filter
cs.LO2026
Coalgebraic Non-Wellfounded Proofs: Recursiveness and GTC
Mayuko Kori
Non-wellfounded proof systems impose a global condition called the global trace condition (GTC) on a derivation tree to ensure soundness. Providing a categorical characterisation o…
cs.LO2026
From Coalgebraic Determinization to Belief Construction for Partial Observability
Mayuko Kori, Kazuki Watanabe
The belief construction is a fundamental technique for transforming partially observable systems to fully observable ones while preserving the relevant semantics. It plays a centra…
cs.LO2026
A Framework for Coalgebraic Reward-Sensitive Bisimulation (Extended Version)
Pedro H. Azevedo de Amorim, Mayuko Kori, Koko Muroya
In this paper we present a framework for modelling \emph{reward-sensitive bisimulations}, that is, bisimulations that account for quantitative differences such as accumulated rewar…