The Bisimulation Problem for equational graphs of finite out-degree
Logic in Computer Science
2007-05-23 v1 Discrete Mathematics
Abstract
The "bisimulation problem" for equational graphs of finite out-degree is shown to be decidable. We reduce this problem to the bisimulation problem for deterministic rational (vectors of) boolean series on the alphabet of a dpda M. We then exhibit a complete formal system for deducing equivalent pairs of such vectors.
Keywords
Cite
@article{arxiv.cs/0008018,
title = {The Bisimulation Problem for equational graphs of finite out-degree},
author = {G. Senizergues},
journal= {arXiv preprint arXiv:cs/0008018},
year = {2007}
}
Comments
98 pages, 4 figures, submitted to JACM