Hostname: page-component-77c89778f8-n9wrp Total loading time: 0 Render date: 2024-07-24T17:38:22.290Z Has data issue: false hasContentIssue false
  • English
  • Français

Ackermann encoding, bisimulations and OBDDs

Published online by Cambridge University Press:  12 August 2004

CARLA PIAZZA  and
ALBERTO POLICRITI
CARLA PIAZZA
Affiliation:
Dipartimento di Informatica, Università Ca' Foscari di Venezia, Via Torino, 155 – 30172 Mestre (VE), Italy (e-mail: piazza@dsi.unive.it)
ALBERTO POLICRITI
Affiliation:
Dipartimento di Matematica e Informatica, Università di Udine, Via Le Scienze, 206 – 33100 Udine, Italy (e-mail: policriti@dimi.uniud.it)
Get access Rights & Permissions [Opens in a new window]

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

bisimulationset theoryAckermann encodingordered binary decision diagrams
Type
Regular Papers
Information
Theory and Practice of Logic Programming , Volume 4 , Issue 5-6 , September 2004 , pp. 695 - 718
Copyright
© 2004 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)