On the composition problem for OBDDs with multiple variable orders
Identifieur interne :
001714 ( PascalFrancis/Curation );
précédent :
001713;
suivant :
001715
On the composition problem for OBDDs with multiple variable orders
Auteurs : A. Slobodova [
Allemagne]
Source :
-
Lecture notes in computer science [ 0302-9743 ] ; 1998.
RBID : Pascal:98-0427282
Descripteurs français
English descriptors
Abstract
Ordered Binary Decision Diagram (OBDD) is a favorite data structure used for representation Boolean functions in computer-aided synthesis and verification of digital systems. The secret of its success is the efficiency of the algorithms for Boolean operations, satisfiability and equivalence check. However, the algorithms work well under condition only that the variable order of considered OBDDs is the same. In this paper, we discuss the problem of Boolean operations on OBDDs with multiple variable orders, which naturally appears, e.g., in the connection with minimization techniques based on dynamic variable reordering. Our goal is to place the problem with respect to its complexity and to point out the difficulties in finding an acceptable solution.
| pA |
| A01 | 01 | 1 | | @0 0302-9743 |
|---|
| A05 | | | | @2 1450 |
|---|
| A08 | 01 | 1 | ENG | @1 On the composition problem for OBDDs with multiple variable orders |
|---|
| A09 | 01 | 1 | ENG | @1 MFCS'98 : mathematical foundations of computer science 1998 : Brno, 24-28 August 1998 |
|---|
| A11 | 01 | 1 | | @1 SLOBODOVA (A.) |
|---|
| A12 | 01 | 1 | | @1 BRIM (Lubos) @9 ed. |
|---|
| A12 | 02 | 1 | | @1 GRUSKA (Josef) @9 ed. |
|---|
| A12 | 03 | 1 | | @1 ZLATUSKA (Jirí) @9 ed. |
|---|
| A14 | 01 | | | @1 Institute of Telematics @2 Trier @3 DEU @Z 1 aut. |
|---|
| A20 | | | | @1 645-655 |
|---|
| A21 | | | | @1 1998 |
|---|
| A23 | 01 | | | @0 ENG |
|---|
| A26 | 01 | | | @0 3-540-64827-5 |
|---|
| A43 | 01 | | | @1 INIST @2 16343 @5 354000070098310620 |
|---|
| A44 | | | | @0 0000 @1 © 1998 INIST-CNRS. All rights reserved. |
|---|
| A45 | | | | @0 11 ref. |
|---|
| A47 | 01 | 1 | | @0 98-0427282 |
|---|
| A60 | | | | @1 P @2 C |
|---|
| A61 | | | | @0 A |
|---|
| A64 | | 1 | | @0 Lecture notes in computer science |
|---|
| A66 | 01 | | | @0 DEU |
|---|
| A66 | 02 | | | @0 USA |
|---|
| C01 | 01 | | ENG | @0 Ordered Binary Decision Diagram (OBDD) is a favorite data structure used for representation Boolean functions in computer-aided synthesis and verification of digital systems. The secret of its success is the efficiency of the algorithms for Boolean operations, satisfiability and equivalence check. However, the algorithms work well under condition only that the variable order of considered OBDDs is the same. In this paper, we discuss the problem of Boolean operations on OBDDs with multiple variable orders, which naturally appears, e.g., in the connection with minimization techniques based on dynamic variable reordering. Our goal is to place the problem with respect to its complexity and to point out the difficulties in finding an acceptable solution. |
|---|
| C02 | 01 | X | | @0 001D02A06 |
|---|
| C03 | 01 | X | FRE | @0 Informatique théorique @5 01 |
|---|
| C03 | 01 | X | ENG | @0 Computer theory @5 01 |
|---|
| C03 | 01 | X | SPA | @0 Informática teórica @5 01 |
|---|
| C03 | 02 | X | FRE | @0 Problème combinatoire @5 02 |
|---|
| C03 | 02 | X | ENG | @0 Combinatorial problem @5 02 |
|---|
| C03 | 02 | X | SPA | @0 Problema combinatorio @5 02 |
|---|
| C03 | 03 | X | FRE | @0 Problème NP difficile @5 03 |
|---|
| C03 | 03 | X | ENG | @0 NP hard problem @5 03 |
|---|
| C03 | 03 | X | SPA | @0 Problema NP duro @5 03 |
|---|
| C03 | 04 | X | FRE | @0 Diagramme binaire décision @5 04 |
|---|
| C03 | 04 | X | ENG | @0 Binary decision diagram @5 04 |
|---|
| C03 | 04 | X | SPA | @0 Diagrama binaria decisión @5 04 |
|---|
| C03 | 05 | X | FRE | @0 Fonction booléenne @5 05 |
|---|
| C03 | 05 | X | ENG | @0 Boolean function @5 05 |
|---|
| C03 | 05 | X | SPA | @0 Función booliana @5 05 |
|---|
| C03 | 06 | X | FRE | @0 Complexité algorithme @5 06 |
|---|
| C03 | 06 | X | ENG | @0 Algorithm complexity @5 06 |
|---|
| C03 | 06 | X | SPA | @0 Complejidad algoritmo @5 06 |
|---|
| N21 | | | | @1 285 |
|---|
|
|---|
| pR |
| A30 | 01 | 1 | ENG | @1 Mathematical foundations of computer science. International symposium @2 23 @3 Brno CZE @4 1998-08-24 |
|---|
|
|---|
Links toward previous steps (curation, corpus...)
- to stream PascalFrancis, to step Corpus: Pour aller vers cette notice dans l'étape Curation :001111
Links to Exploration step
Pascal:98-0427282
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">On the composition problem for OBDDs with multiple variable orders</title>
<author><name sortKey="Slobodova, A" sort="Slobodova, A" uniqKey="Slobodova A" first="A." last="Slobodova">A. Slobodova</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Institute of Telematics</s1>
<s2>Trier</s2>
<s3>DEU</s3>
<sZ>1 aut.</sZ>
</inist:fA14><country>Allemagne</country>
</affiliation><publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">98-0427282</idno>
<date when="1998">1998</date>
<idno type="stanalyst">PASCAL 98-0427282 INIST</idno>
<idno type="RBID">Pascal:98-0427282</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">001111</idno>
<idno type="wicri:Area/PascalFrancis/Curation">001714</idno>
</publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">On the composition problem for OBDDs with multiple variable orders</title>
<author><name sortKey="Slobodova, A" sort="Slobodova, A" uniqKey="Slobodova A" first="A." last="Slobodova">A. Slobodova</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Institute of Telematics</s1>
<s2>Trier</s2>
<s3>DEU</s3>
<sZ>1 aut.</sZ>
</inist:fA14><country>Allemagne</country>
</affiliation><series><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
<imprint><date when="1998">1998</date>
</imprint><seriesStmt><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
</seriesStmt><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Algorithm complexity</term>
<term>Binary decision diagram</term>
<term>Boolean function</term>
<term>Combinatorial problem</term>
<term>Computer theory</term>
<term>NP hard problem</term>
</keywords><keywords scheme="Pascal" xml:lang="fr"><term>Informatique théorique</term>
<term>Problème combinatoire</term>
<term>Problème NP difficile</term>
<term>Diagramme binaire décision</term>
<term>Fonction booléenne</term>
<term>Complexité algorithme</term>
</keywords><front><div type="abstract" xml:lang="en">Ordered Binary Decision Diagram (OBDD) is a favorite data structure used for representation Boolean functions in computer-aided synthesis and verification of digital systems. The secret of its success is the efficiency of the algorithms for Boolean operations, satisfiability and equivalence check. However, the algorithms work well under condition only that the variable order of considered OBDDs is the same. In this paper, we discuss the problem of Boolean operations on OBDDs with multiple variable orders, which naturally appears, e.g., in the connection with minimization techniques based on dynamic variable reordering. Our goal is to place the problem with respect to its complexity and to point out the difficulties in finding an acceptable solution.</div>
</front><inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01><fA05><s2>1450</s2>
</fA05><fA08 i1="01" i2="1" l="ENG"><s1>On the composition problem for OBDDs with multiple variable orders</s1>
</fA08><fA09 i1="01" i2="1" l="ENG"><s1>MFCS'98 : mathematical foundations of computer science 1998 : Brno, 24-28 August 1998</s1>
</fA09><fA11 i1="01" i2="1"><s1>SLOBODOVA (A.)</s1>
</fA11><fA12 i1="01" i2="1"><s1>BRIM (Lubos)</s1>
<s9>ed.</s9>
</fA12><fA12 i1="02" i2="1"><s1>GRUSKA (Josef)</s1>
<s9>ed.</s9>
</fA12><fA12 i1="03" i2="1"><s1>ZLATUSKA (Jirí)</s1>
<s9>ed.</s9>
</fA12><fA14 i1="01"><s1>Institute of Telematics</s1>
<s2>Trier</s2>
<s3>DEU</s3>
<sZ>1 aut.</sZ>
</fA14><fA20><s1>645-655</s1>
</fA20><fA21><s1>1998</s1>
</fA21><fA23 i1="01"><s0>ENG</s0>
</fA23><fA26 i1="01"><s0>3-540-64827-5</s0>
</fA26><fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000070098310620</s5>
</fA43><fA44><s0>0000</s0>
<s1>© 1998 INIST-CNRS. All rights reserved.</s1>
</fA44><fA45><s0>11 ref.</s0>
</fA45><fA47 i1="01" i2="1"><s0>98-0427282</s0>
</fA47><fA60><s1>P</s1>
<s2>C</s2>
</fA60><fA64 i2="1"><s0>Lecture notes in computer science</s0>
</fA64><fA66 i1="01"><s0>DEU</s0>
</fA66><fA66 i1="02"><s0>USA</s0>
</fA66><fC01 i1="01" l="ENG"><s0>Ordered Binary Decision Diagram (OBDD) is a favorite data structure used for representation Boolean functions in computer-aided synthesis and verification of digital systems. The secret of its success is the efficiency of the algorithms for Boolean operations, satisfiability and equivalence check. However, the algorithms work well under condition only that the variable order of considered OBDDs is the same. In this paper, we discuss the problem of Boolean operations on OBDDs with multiple variable orders, which naturally appears, e.g., in the connection with minimization techniques based on dynamic variable reordering. Our goal is to place the problem with respect to its complexity and to point out the difficulties in finding an acceptable solution.</s0>
</fC01><fC02 i1="01" i2="X"><s0>001D02A06</s0>
</fC02><fC03 i1="01" i2="X" l="FRE"><s0>Informatique théorique</s0>
<s5>01</s5>
</fC03><fC03 i1="01" i2="X" l="ENG"><s0>Computer theory</s0>
<s5>01</s5>
</fC03><fC03 i1="01" i2="X" l="SPA"><s0>Informática teórica</s0>
<s5>01</s5>
</fC03><fC03 i1="02" i2="X" l="FRE"><s0>Problème combinatoire</s0>
<s5>02</s5>
</fC03><fC03 i1="02" i2="X" l="ENG"><s0>Combinatorial problem</s0>
<s5>02</s5>
</fC03><fC03 i1="02" i2="X" l="SPA"><s0>Problema combinatorio</s0>
<s5>02</s5>
</fC03><fC03 i1="03" i2="X" l="FRE"><s0>Problème NP difficile</s0>
<s5>03</s5>
</fC03><fC03 i1="03" i2="X" l="ENG"><s0>NP hard problem</s0>
<s5>03</s5>
</fC03><fC03 i1="03" i2="X" l="SPA"><s0>Problema NP duro</s0>
<s5>03</s5>
</fC03><fC03 i1="04" i2="X" l="FRE"><s0>Diagramme binaire décision</s0>
<s5>04</s5>
</fC03><fC03 i1="04" i2="X" l="ENG"><s0>Binary decision diagram</s0>
<s5>04</s5>
</fC03><fC03 i1="04" i2="X" l="SPA"><s0>Diagrama binaria decisión</s0>
<s5>04</s5>
</fC03><fC03 i1="05" i2="X" l="FRE"><s0>Fonction booléenne</s0>
<s5>05</s5>
</fC03><fC03 i1="05" i2="X" l="ENG"><s0>Boolean function</s0>
<s5>05</s5>
</fC03><fC03 i1="05" i2="X" l="SPA"><s0>Función booliana</s0>
<s5>05</s5>
</fC03><fC03 i1="06" i2="X" l="FRE"><s0>Complexité algorithme</s0>
<s5>06</s5>
</fC03><fC03 i1="06" i2="X" l="ENG"><s0>Algorithm complexity</s0>
<s5>06</s5>
</fC03><fC03 i1="06" i2="X" l="SPA"><s0>Complejidad algoritmo</s0>
<s5>06</s5>
</fC03><fN21><s1>285</s1>
</fN21><pR><fA30 i1="01" i2="1" l="ENG"><s1>Mathematical foundations of computer science. International symposium</s1>
<s2>23</s2>
<s3>Brno CZE</s3>
<s4>1998-08-24</s4>
</fA30>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/PascalFrancis/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001714 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Curation/biblio.hfd -nk 001714 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= PascalFrancis
|étape= Curation
|type= RBID
|clé= Pascal:98-0427282
|texte= On the composition problem for OBDDs with multiple variable orders
}}
| This area was generated with Dilib version V0.6.31.
Data generation: Sat Jul 22 16:29:01 2017. Site generation: Wed Feb 28 14:55:37 2024 |  |
