Implicit and incremental computation of primes and essential primes of Boolean functions

Recently introduced implicit set manipulation techniques have made it possible to formally verify finite state machines with state graphs too large to be built. The authors show that these techniques can also be used with success to compute and manipulate implicitly large sets of prime and of essent...

Full description

Saved in:
Bibliographic Details
Published in[1992] Proceedings 29th ACM/IEEE Design Automation Conference pp. 36 - 39
Main Authors Coudert, O., Madre, J.C.
Format Conference Proceeding
LanguageEnglish
Published IEEE Comput. Soc. Press 1992
Subjects
Automata
Binary decision diagrams
Boolean functions
Computational efficiency
Costs
Data structures
Equations
Online AccessGet full text
ISBN9780818628221
0818628227
ISSN0738-100X
DOI10.1109/DAC.1992.227866

Cover

Abstract Recently introduced implicit set manipulation techniques have made it possible to formally verify finite state machines with state graphs too large to be built. The authors show that these techniques can also be used with success to compute and manipulate implicitly large sets of prime and of essential prime implicants of incompletely specified Boolean functions. These sets are denoted by meta-products that are represented with binary decision diagrams (BDDs). Two procedures are described. The first is based on the standard BDD operators, and the second, more efficient, takes advantage of the structural properties of BDDs and of meta-products to handle a larger class of functions than the first procedure.< >
AbstractList Recently introduced implicit set manipulation techniques have made it possible to formally verify finite state machines with state graphs too large to be built. The authors show that these techniques can also be used with success to compute and manipulate implicitly large sets of prime and of essential prime implicants of incompletely specified Boolean functions. These sets are denoted by meta-products that are represented with binary decision diagrams (BDDs). Two procedures are described. The first is based on the standard BDD operators, and the second, more efficient, takes advantage of the structural properties of BDDs and of meta-products to handle a larger class of functions than the first procedure.< >
Author Madre, J.C.
Coudert, O.
Author_xml – sequence: 1
  givenname: O.
  surname: Coudert
  fullname: Coudert, O.
  organization: Bull Corporate Res. Center, Les Clayes-sous-bois, France
– sequence: 2
  givenname: J.C.
  surname: Madre
  fullname: Madre, J.C.
  organization: Bull Corporate Res. Center, Les Clayes-sous-bois, France
BookMark eNotkE9rwzAMxQ3rYF2X82Anf4FkshzHzrHL_hUKu2zQW3EyBTwSu8TpYd9-7lrxQCD99Hjoli188MTYvYBCCKgfn9dNIeoaC0RtquqKZbU2YISp0CCKBVuCliYXALsblsX4A6mUMghyyXab8TC4zs3c-m_ufDfRSH62A-_CeDjOdnbB89Dzw-RGiv8UxZgQl5jLMK2fQhjIet4ffXc6iXfsurdDpOzSV-zr9eWzec-3H2-bZr3NndA451VKWgFJ0xJZBVpJabWyZd9hEilTtqKVJYHWWJMWslWiLJUgib0CJLliD2dfR0T7UyA7_e7Pr5B_j_VT6Q
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/DAC.1992.227866
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EndPage 39
ExternalDocumentID 227866
GroupedDBID 123
29O
6IE
6IF
6IH
6IK
6IL
6IM
6IN
AAJGR
AAWTH
ACGFS
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
APO
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IEGSK
IJVOP
IPLJI
M43
OCL
RIE
RIL
RNS
ID FETCH-LOGICAL-i172t-680860e38beea507533a75a4fc2fc2e584b1b34e07729e713b514451e32f502e3
IEDL.DBID RIE
ISBN 9780818628221
0818628227
ISSN 0738-100X
IngestDate Tue Aug 26 16:39:36 EDT 2025
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i172t-680860e38beea507533a75a4fc2fc2e584b1b34e07729e713b514451e32f502e3
PageCount 4
ParticipantIDs ieee_primary_227866
PublicationCentury 1900
PublicationDate 19920000
PublicationDateYYYYMMDD 1992-01-01
PublicationDate_xml – year: 1992
  text: 19920000
PublicationDecade 1990
PublicationTitle [1992] Proceedings 29th ACM/IEEE Design Automation Conference
PublicationTitleAbbrev DAC
PublicationYear 1992
Publisher IEEE Comput. Soc. Press
Publisher_xml – name: IEEE Comput. Soc. Press
SSID ssj0000558203
ssj0004161
Score 1.4926567
Snippet Recently introduced implicit set manipulation techniques have made it possible to formally verify finite state machines with state graphs too large to be...
SourceID ieee
SourceType Publisher
StartPage 36
SubjectTerms Automata
Binary decision diagrams
Boolean functions
Computational efficiency
Costs
Data structures
Equations
Title Implicit and incremental computation of primes and essential primes of Boolean functions
URI https://ieeexplore.ieee.org/document/227866
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV09T8MwELVoJ1iAUsS3PLAmjRM7bUYoVAUJxEClbJXjXKSKKqlosvDrubPT8iEGpAyOE8mKc8k9n--9Y-wav6-8QEfvqUTHHkmge-gUpGdCAwWgjxU5EYWfnuPpTD6mKm11ti0XBgBs8hn41LR7-XllGgqVDYi2Gccd1kErc1StbTglUGpkNxQ3lEhhpVLRgEm9NEit9KNA-I4OcdgK72zORSv5I4JkcHczJgJf6LuxftRcsS5nsu-43GurVEiZJm9-U2e--fil4_jPpzlg_S9uH3_Zeq1DtgNlj-19kyU8YumDTTNf1FyXOV-UxsUQ9ZIbWwPCvkxeFXxFtQHW9i6SIC_xb7HcdOLl26pagi45-U5r3n02m9y_jqdeW4HBWyCwqT2qyxEHEI0yAI3IEbGhHiotCxPiAQheMpFFEgLC6IDr3Qzxl1QCorBQQQjRMeuWVQknjCvQoSryJAFRSIhjjS2V4wBaRpEywSnr0RTNV05kY-5m5-zP3nO267JmKRJywbr1ewOXiA3q7MpaxScKO7It
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1NT4NAEN1oPagXtWr8dg9eoSzs0nLUatNq23hok96aZRmSxgYaSy_-emcWWj_iwYTDspAQloX3mJ33hrE7fL-SFIHeUZEOHbJAdxAUpGN8AykgxoqEhMKDYdgdy-eJmlQ-21YLAwA2-Qxcatq1_CQ3KwqVNUi2GYbbbAdhX6pSrLUJqHhKteyS4loUKaxZKk5h8i_1Jtb8USCBR0hsVtY7631Rmf4IL2o83rdJwue75dV-VF2xoNM5KNXcS-tVSLkmb-6qiF3z8cvJ8Z_3c8hOvtR9_HWDW0dsC7I62_9mTHjMJj2baD4ruM4SPstMGUXUc25sFQj7OHme8gVVB1jas8iEPMPvxXzdiYcf8nwOOuOEnnaCn7Bx52nU7jpVDQZnhtSmcKgyR-hB0IoBNHJHZIe6qbRMjY8bIH2JRRxI8IilA_7xxsjApBIQ-KnyfAhOWS3LMzhjXIH2VZpEEYhUQhhqbKkEL6BlECjjnbM6DdF0UdpsTMvRufiz95btdkeD_rTfG75csr0yh5biIlesVryv4BqZQhHf2BnyCZODtXo
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=%5B1992%5D+Proceedings+29th+ACM%2FIEEE+Design+Automation+Conference&rft.atitle=Implicit+and+incremental+computation+of+primes+and+essential+primes+of+Boolean+functions&rft.au=Coudert%2C+O.&rft.au=Madre%2C+J.C.&rft.date=1992-01-01&rft.pub=IEEE+Comput.+Soc.+Press&rft.isbn=9780818628221&rft.issn=0738-100X&rft.spage=36&rft.epage=39&rft_id=info:doi/10.1109%2FDAC.1992.227866&rft.externalDocID=227866
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0738-100X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0738-100X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0738-100X&client=summon