Ackermann Encoding, Bisimulations, and OBDDs
Logic in Computer Science
2009-09-29 v1 Data Structures and Algorithms
Abstract
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.
Keywords
Cite
@article{arxiv.cs/0311018,
title = {Ackermann Encoding, Bisimulations, and OBDDs},
author = {Carla Piazza and Alberto Policriti},
journal= {arXiv preprint arXiv:cs/0311018},
year = {2009}
}
Comments
To appear on 'Theory and Practice of Logic Programming'