Bisimulation serves as the identity criterion; in the finite case it is decidable via Paige–Tarjan partition refinement.
Sources 第十五章 旋机吸引子系统的形式化
External anchor Paige & Tarjan, Three partition refinement algorithms (1987)
Bisimulation serves as the identity criterion; in the finite case it is decidable via Paige–Tarjan partition refinement.
No published premises or dependents.
〔定理级〕以互模拟为身份判据;有限情形可经 Paige–Tarjan 分划细化判定。——李旭彤《生之科学》(第十五章 旋机吸引子系统的形式化),问道研究所,2026。
李旭彤:〈SGC-0012〉以互模拟为身份判据;有限情形可经 Paige–Tarjan 分划细化判定〔定理级〕,载《生之科学》第十五章 旋机吸引子系统的形式化,问道研究所,2026。https://reresearch.org/claim/sgc-0012/
Li, Xutong (2026). SGC-0012 [Theorem]: Bisimulation serves as the identity criterion; in the finite case it is decidable via Paige–Tarjan partition refinement. In: Science of Generation, 第十五章 旋机吸引子系统的形式化. Reasoning Research Institute. https://reresearch.org/en/claim/sgc-0012/
@misc{SGC-0012,
author = {Li, Xutong},
title = {{SGC-0012}: Bisimulation serves as the identity criterion; in the finite case it is decidable via Paige–Tarjan partition refinement.},
howpublished = {Science of Generation Portal},
organization = {Reasoning Research Institute},
year = {2026},
url = {https://reresearch.org/en/claim/sgc-0012/},
note = {Epistemic tier: Theorem. Source: 第十五章 旋机吸引子系统的形式化}
}