Ackermann encoding, bisimulations and OBDDs

DOI10.1017/S1471068404002091zbMATH Open1088.68130OpenAlexW2037095133MaRDI QIDQ4669654FDOQ4669654

Authors: Carla Piazza, Alberto Policriti 

Publication date: 15 April 2005

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s1471068404002091

Recommendations

• On the OBDD representation of some graph classes
• Representation of graphs by OBDDs
• Algorithms and Computation
• scientific article; zbMATH DE number 1335887
• scientific article; zbMATH DE number 1361498

zbMATH Keywords

ordered binary decision diagrams.

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (2)

• Local encoding transformations for optimizing OBDD-representations of finite state machines
• Well-quasi-ordering hereditarily finite sets

This page was built for publication: Ackermann encoding, bisimulations and OBDDs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4669654)