Ackermann Encoding, Bisimulations, and OBDDs
<|reference_start|>Ackermann Encoding, Bisimulations, and OBDDs: We propose an alternative way to represent graphs via OBDDs based on the observation that a partition of the graph nodes allows sharing among the employed OBDDs. In the second part of the paper we present a method to compute at the same time the quotient w.r.t. the maximum bisimulation and the OBDD representation of a given graph. The proposed computation is based on an OBDD-rewriting of the notion of Ackermann encoding of hereditarily finite sets into natural numbers.<|reference_end|>
@article{piazza2003ackermann,
    title={Ackermann Encoding, Bisimulations, and OBDDs},
    author={Carla Piazza (1) and Alberto Policriti (2) ((1) Universita' Ca'
  Foscari di Venezia (2) Universita' degli Studi di Udine)},
    journal={arXiv preprint arXiv:cs/0311018},
    year={2003},
    archivePrefix={arXiv},
    eprint={cs/0311018},
    primaryClass={cs.LO cs.DS}
}