Archivio Istituzionale della RicercaTransforming Boolean relations and functions is an important horizontal technique that finds several applications in logic synthesis and formal verification. This paper develops a framework for analyzing input/output transformations of Boolean relations and functions. It also contributes efficient composition techniques based on partitioning the transformation. Experimental results on equivalence-preserving FSM state-space re-encoding demonstrate the feasibility of the approach.
Transforming boolean relations by symbolic encoding / Cabodi, Gianpiero; Camurati, Paolo Enrico; Quer, Stefano. - 987:(1995), pp. 161-170. (Intervento presentato al convegno IFIP WG 10.5 Advanced Research Working Conference, CHARME '95 tenutosi a Frankfurt/Main (DEU) nel October 2–4, 1995) [10.1007/3-540-60385-9_10].
Transforming boolean relations by symbolic encoding
CABODI, Gianpiero;CAMURATI, Paolo Enrico;QUER, Stefano
1995
Abstract
Transforming Boolean relations and functions is an important horizontal technique that finds several applications in logic synthesis and formal verification. This paper develops a framework for analyzing input/output transformations of Boolean relations and functions. It also contributes efficient composition techniques based on partitioning the transformation. Experimental results on equivalence-preserving FSM state-space re-encoding demonstrate the feasibility of the approach.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11583/1848204
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo