{"id":"https://openalex.org/W2097239366","doi":"https://doi.org/10.1109/aspdac.1999.760025","title":"Application driven variable reordering and an example implementation in reachability analysis","display_name":"Application driven variable reordering and an example implementation in reachability analysis","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W2097239366","doi":"https://doi.org/10.1109/aspdac.1999.760025","mag":"2097239366"},"language":"en","primary_location":{"id":"doi:10.1109/aspdac.1999.760025","doi":"https://doi.org/10.1109/aspdac.1999.760025","is_oa":false,"landing_page_url":"https://doi.org/10.1109/aspdac.1999.760025","pdf_url":null,"source":{"id":"https://openalex.org/S4363608791","display_name":"Asia and South Pacific Design Automation Conference (ASP-DAC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ASP-DAC '99 Asia and South Pacific Design Automation Conference 1999 (Cat. No.99EX198)","raw_type":"proceedings-article"},"parent_works":[],"lineage":["https://openalex.org/W2097239366"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5102919398","display_name":"Christoph Meinel","orcid":"https://orcid.org/0000-0002-3410-3193","observed_orcids":["https://orcid.org/0000-0002-3410-3193","https://orcid.org/0009-0009-9797-6483"]},"institutions":[{"id":"https://openalex.org/I89864525","display_name":"Universit\u00e4t Trier","ror":"https://ror.org/02778hg05","country_code":"DE","type":"education","lineage":["https://openalex.org/I89864525"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"C. Meinel","raw_affiliation_strings":["Trier Univ., Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Trier Univ., Germany","institution_ids":["https://openalex.org/I89864525"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055952963","display_name":"K. Schwettmann","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I89864525","display_name":"Universit\u00e4t Trier","ror":"https://ror.org/02778hg05","country_code":"DE","type":"education","lineage":["https://openalex.org/I89864525"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"K. Schwettmann","raw_affiliation_strings":["FB IV-Informatik, University of Trier, Trier, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"FB IV-Informatik, University of Trier, Trier, Germany","institution_ids":["https://openalex.org/I89864525"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065271127","display_name":"Anna Slobodov\u00e1","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"A. Slobodova","raw_affiliation_strings":["Trier, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Trier, Germany","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.4388,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.77250138,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"762","issue":null,"first_page":"327","last_page":"330 vol.1"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/variable-reordering","display_name":"variable reordering","score":0.9710000157356262},{"id":"https://openalex.org/keywords/ordered-binary-decision-diagrams","display_name":"ordered binary decision diagrams","score":0.9430000185966492},{"id":"https://openalex.org/keywords/reachability-analysis","display_name":"reachability analysis","score":0.9520000219345093},{"id":"https://openalex.org/keywords/finite-state-machines","display_name":"finite automata","score":0.8429999947547913},{"id":"https://openalex.org/keywords/computational-acceleration","display_name":"computational acceleration","score":0.5550000071525574}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8538467288017273},{"id":"https://openalex.org/C3309909","wikidata":"https://www.wikidata.org/wiki/Q864155","display_name":"Binary decision diagram","level":2,"score":0.8320121765136719},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8194968700408936},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.728181779384613},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7075464129447937},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.6346443891525269},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.5904833674430847},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.5648217797279358},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.5609869956970215},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.480163037776947},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.44857677817344666},{"id":"https://openalex.org/C169272836","wikidata":"https://www.wikidata.org/wiki/Q5668307","display_name":"Variable elimination","level":3,"score":0.4204847812652588},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4108269214630127},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3745020031929016},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.13769397139549255},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12178882956504822},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/aspdac.1999.760025","doi":"https://doi.org/10.1109/aspdac.1999.760025","is_oa":false,"landing_page_url":"https://doi.org/10.1109/aspdac.1999.760025","pdf_url":null,"source":{"id":"https://openalex.org/S4363608791","display_name":"Asia and South Pacific Design Automation Conference (ASP-DAC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ASP-DAC '99 Asia and South Pacific Design Automation Conference 1999 (Cat. No.99EX198)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.34.6053","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.34.6053","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.informatik.uni-trier.de/~meinel/papers/ASP-DAC99.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.55.7445","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.55.7445","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.informatik.uni-trier.de/pub/Users-Root/reports/98-24.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1505590927","https://openalex.org/W1602476740","https://openalex.org/W1608751818","https://openalex.org/W1822320350","https://openalex.org/W1886348063","https://openalex.org/W1992006255","https://openalex.org/W2004079116","https://openalex.org/W2078740228","https://openalex.org/W2080267935","https://openalex.org/W2096820312","https://openalex.org/W2118291360","https://openalex.org/W2520093650","https://openalex.org/W4239569538","https://openalex.org/W4250447890"],"related_works":["https://openalex.org/W2118291360","https://openalex.org/W4250447890","https://openalex.org/W379080128","https://openalex.org/W2157414893","https://openalex.org/W7095130906","https://openalex.org/W7100786074","https://openalex.org/W7098700388","https://openalex.org/W1992105102","https://openalex.org/W7097952738","https://openalex.org/W2148523397"],"abstract_inverted_index":{"Variable":[0],"reordering":[1,27,48,65,83,97,114],"is":[2,93,121],"the":[3,8,17,35,38,44,50,54,64,96,100,107,113,119],"main":[4,91],"approach":[5,120],"to":[6,22,24,94],"minimize":[7],"size":[9],"of":[10,37,69,72,106,112,118,128],"Ordered":[11],"Binary":[12],"Decision":[13],"Diagrams.":[14],"But":[15],"despite":[16],"huge":[18],"effort":[19],"spent,":[20],"up":[21,125],"now,":[23],"design":[25],"different":[26],"heuristics,":[28],"their":[29],"performance":[30],"often":[31],"does":[32],"not":[33],"meet":[34],"needs":[36],"applications.":[39],"In":[40,77],"many":[41],"OBDD-based":[42],"computations,":[43],"time":[45,51],"cost":[46],"for":[47,62],"dominates":[49],"spent":[52],"by":[53,66,99,123],"computation":[55,109],"itself.":[56],"There":[57],"are":[58],"some":[59],"known":[60],"approaches":[61],"accelerating":[63],"taking":[67],"advantage":[68],"structural":[70],"properties":[71],"OBDDs":[73],"and":[74],"functions":[75],"represented.":[76],"this":[78],"paper,":[79],"we":[80],"propose":[81],"a":[82],"method":[84],"that":[85],"exploits":[86],"application":[87],"specific":[88],"information.":[89],"The":[90,116],"idea":[92],"drive":[95],"process":[98],"computation.":[101],"This":[102],"effects":[103],"an":[104],"acceleration":[105],"whole":[108],"rather":[110],"than":[111],"only.":[115],"power":[117],"illustrated":[122],"speeding":[124],"forward":[126],"traversal":[127],"finite":[129],"state":[130],"machines.":[131]},"counts_by_year":[],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}