Probabilistic Symbolic Simulation and Verification with ⊕-OBDDs
Identifieur interne : 002073 ( Main/Exploration ); précédent : 002072; suivant : 002074Probabilistic Symbolic Simulation and Verification with ⊕-OBDDs
Auteurs : Christoph Meinel [Allemagne] ; Harald Sack [Allemagne]Source :
- Electronic Notes in Theoretical Computer Science [ 1571-0661 ] ; 1999.
Abstract
Ordered Binary Decision Diagrams (OBDDs) have already proved useful in the verification of combinational and sequential circuits. Due to limitations of the descriptive power of OBDDs several more general models of Binary Decision Diagrams have been studied. In this paper, ⊕-OBDDs - also known as Mod2OBDDs - in respect to their ability to serve as a tool for combinational verification are considered. Besides the application of ⊕-OBDDs, the more general problem of how to exploit the inherent potential of ⊕-OBDDs more efficiently is addressed.
Url:
DOI: 10.1016/S1571-0661(05)80601-2
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001240
- to stream Istex, to step Curation: 001128
- to stream Istex, to step Checkpoint: 000D22
- to stream Main, to step Merge: 002427
- to stream Main, to step Curation: 002073
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title>Probabilistic Symbolic Simulation and Verification with ⊕-OBDDs</title><author><name sortKey="Meinel, Christoph" sort="Meinel, Christoph" uniqKey="Meinel C" first="Christoph" last="Meinel">Christoph Meinel</name><affiliation><country>Allemagne</country><placeName><settlement type="city">Trèves (Allemagne)</settlement><region type="land" nuts="1">Rhénanie-Palatinat</region></placeName><orgName type="university">Université de Trèves</orgName></affiliation></author><author><name sortKey="Sack, Harald" sort="Sack, Harald" uniqKey="Sack H" first="Harald" last="Sack">Harald Sack</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:F762C0EAE021FA53E125EB7E787DBCC707888893</idno><date when="1999" year="1999">1999</date><idno type="doi">10.1016/S1571-0661(05)80601-2</idno><idno type="url">https://api.istex.fr/document/F762C0EAE021FA53E125EB7E787DBCC707888893/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001240</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001240</idno><idno type="wicri:Area/Istex/Curation">001128</idno><idno type="wicri:Area/Istex/Checkpoint">000D22</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000D22</idno><idno type="wicri:doubleKey">1571-0661:1999:Meinel C:probabilistic:symbolic:simulation</idno><idno type="wicri:Area/Main/Merge">002427</idno><idno type="wicri:Area/Main/Curation">002073</idno><idno type="wicri:Area/Main/Exploration">002073</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a">Probabilistic Symbolic Simulation and Verification with ⊕-OBDDs</title><author><name sortKey="Meinel, Christoph" sort="Meinel, Christoph" uniqKey="Meinel C" first="Christoph" last="Meinel">Christoph Meinel</name><affiliation wicri:level="1"><country xml:lang="fr">Allemagne</country><wicri:regionArea>FB IV — Informatik, Universität Trier D-54286 Trier</wicri:regionArea><wicri:noRegion>54286 Trier</wicri:noRegion><wicri:noRegion>Universität Trier D-54286 Trier</wicri:noRegion><placeName><settlement type="city">Trèves (Allemagne)</settlement><region type="land" nuts="1">Rhénanie-Palatinat</region></placeName><orgName type="university">Université de Trèves</orgName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country><placeName><settlement type="city">Trèves (Allemagne)</settlement><region type="land" nuts="1">Rhénanie-Palatinat</region></placeName><orgName type="university">Université de Trèves</orgName></affiliation></author><author><name sortKey="Sack, Harald" sort="Sack, Harald" uniqKey="Sack H" first="Harald" last="Sack">Harald Sack</name><affiliation wicri:level="1"><country xml:lang="fr">Allemagne</country><wicri:regionArea>FB IV — Informatik, Universität Trier D-54286 Trier</wicri:regionArea><wicri:noRegion>54286 Trier</wicri:noRegion><wicri:noRegion>Universität Trier D-54286 Trier</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author></analytic><monogr></monogr><series><title level="j">Electronic Notes in Theoretical Computer Science</title><title level="j" type="abbrev">ENTCS</title><idno type="ISSN">1571-0661</idno><imprint><publisher>ELSEVIER</publisher><date type="published" when="1999">1999</date><biblScope unit="volume">22</biblScope><biblScope unit="supplement">C</biblScope><biblScope unit="page" from="156">156</biblScope><biblScope unit="page" to="170">170</biblScope></imprint><idno type="ISSN">1571-0661</idno></series><idno type="istex">F762C0EAE021FA53E125EB7E787DBCC707888893</idno><idno type="DOI">10.1016/S1571-0661(05)80601-2</idno><idno type="PII">S1571-0661(05)80601-2</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">1571-0661</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Ordered Binary Decision Diagrams (OBDDs) have already proved useful in the verification of combinational and sequential circuits. Due to limitations of the descriptive power of OBDDs several more general models of Binary Decision Diagrams have been studied. In this paper, ⊕-OBDDs - also known as Mod2OBDDs - in respect to their ability to serve as a tool for combinational verification are considered. Besides the application of ⊕-OBDDs, the more general problem of how to exploit the inherent potential of ⊕-OBDDs more efficiently is addressed.</div></front></TEI><affiliations><list><country><li>Allemagne</li></country><region><li>Rhénanie-Palatinat</li></region><settlement><li>Trèves (Allemagne)</li></settlement><orgName><li>Université de Trèves</li></orgName></list><tree><country name="Allemagne"><region name="Rhénanie-Palatinat"><name sortKey="Meinel, Christoph" sort="Meinel, Christoph" uniqKey="Meinel C" first="Christoph" last="Meinel">Christoph Meinel</name></region><name sortKey="Meinel, Christoph" sort="Meinel, Christoph" uniqKey="Meinel C" first="Christoph" last="Meinel">Christoph Meinel</name><name sortKey="Sack, Harald" sort="Sack, Harald" uniqKey="Sack H" first="Harald" last="Sack">Harald Sack</name><name sortKey="Sack, Harald" sort="Sack, Harald" uniqKey="Sack H" first="Harald" last="Sack">Harald Sack</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002073 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 002073 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:F762C0EAE021FA53E125EB7E787DBCC707888893
|texte= Probabilistic Symbolic Simulation and Verification with ⊕-OBDDs
}}
| This area was generated with Dilib version V0.6.31. |  |