Matches in SemOpenAlex for { <https://semopenalex.org/work/W2045845366> ?p ?o ?g. }
Showing items 1 to 57 of
57
with 100 items per page.
- W2045845366 endingPage "154" @default.
- W2045845366 startingPage "133" @default.
- W2045845366 abstract "Binary decision diagrams are in widespread use in verification systems for the canonical representation of finite functions. Here we consider multivalued BDDs, which represent functions of the form ?: B??L, where L is a finite set of leaves. We study a rather natural online BDD refinement problem: a partition of the leaves of several shared BDDs is gradually refined, and the equivalence of the BDDs under the current partition must be maintained in a discriminator table. We show that it can be solved in O(nlogn) time if n bounds both the size of the BDDs and the total size of update operations. Our algorithm is based on an understanding of BDDs as the fixed points of an operator that in each step splits and gathers nodes. We apply our algorithm to show that automata BDD-represented transition functions can be minimized in time O(n·logn), where n is the total number of BDD nodes representing the automaton. This result is not an instance of Hopcroft's classical minimization algorithm, which breaks down for BDD-represented automata because of the BDD path compression property." @default.
- W2045845366 created "2016-06-24" @default.
- W2045845366 creator A5083488023 @default.
- W2045845366 date "1999-08-01" @default.
- W2045845366 modified "2023-09-27" @default.
- W2045845366 title "An nlogn Algorithm for Online BDD Refinement" @default.
- W2045845366 cites W1508300074 @default.
- W2045845366 cites W1578881602 @default.
- W2045845366 cites W1599105192 @default.
- W2045845366 cites W2002279082 @default.
- W2045845366 cites W2030224590 @default.
- W2045845366 cites W2068361557 @default.
- W2045845366 cites W2071152819 @default.
- W2045845366 cites W2090233333 @default.
- W2045845366 cites W2105489972 @default.
- W2045845366 cites W2113689473 @default.
- W2045845366 cites W2122493035 @default.
- W2045845366 cites W2168881618 @default.
- W2045845366 cites W2169703983 @default.
- W2045845366 cites W2344021881 @default.
- W2045845366 cites W2733077638 @default.
- W2045845366 doi "https://doi.org/10.1006/jagm.1999.1013" @default.
- W2045845366 hasPublicationYear "1999" @default.
- W2045845366 type Work @default.
- W2045845366 sameAs 2045845366 @default.
- W2045845366 citedByCount "3" @default.
- W2045845366 crossrefType "journal-article" @default.
- W2045845366 hasAuthorship W2045845366A5083488023 @default.
- W2045845366 hasConcept C11413529 @default.
- W2045845366 hasConcept C33923547 @default.
- W2045845366 hasConcept C41008148 @default.
- W2045845366 hasConcept C80444323 @default.
- W2045845366 hasConceptScore W2045845366C11413529 @default.
- W2045845366 hasConceptScore W2045845366C33923547 @default.
- W2045845366 hasConceptScore W2045845366C41008148 @default.
- W2045845366 hasConceptScore W2045845366C80444323 @default.
- W2045845366 hasIssue "2" @default.
- W2045845366 hasLocation W20458453661 @default.
- W2045845366 hasOpenAccess W2045845366 @default.
- W2045845366 hasPrimaryLocation W20458453661 @default.
- W2045845366 hasRelatedWork W1974891317 @default.
- W2045845366 hasRelatedWork W2044189972 @default.
- W2045845366 hasRelatedWork W2333698505 @default.
- W2045845366 hasRelatedWork W2351491280 @default.
- W2045845366 hasRelatedWork W2371447506 @default.
- W2045845366 hasRelatedWork W2386767533 @default.
- W2045845366 hasRelatedWork W2392953011 @default.
- W2045845366 hasRelatedWork W2748952813 @default.
- W2045845366 hasRelatedWork W2899084033 @default.
- W2045845366 hasRelatedWork W303980170 @default.
- W2045845366 hasVolume "32" @default.
- W2045845366 isParatext "false" @default.
- W2045845366 isRetracted "false" @default.
- W2045845366 magId "2045845366" @default.
- W2045845366 workType "article" @default.