{"id":"https://openalex.org/W2135836819","doi":"https://doi.org/10.1109/aiccsa.2005.1387020","title":"Efficient partition of state space for parallel reachability analysis","display_name":"Efficient partition of state space for parallel reachability analysis","publication_year":2005,"publication_date":"2005-04-01","ids":{"openalex":"https://openalex.org/W2135836819","doi":"https://doi.org/10.1109/aiccsa.2005.1387020","mag":"2135836819"},"language":"en","primary_location":{"id":"doi:10.1109/aiccsa.2005.1387020","is_oa":false,"landing_page_url":"https://doi.org/10.1109/aiccsa.2005.1387020","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 3rd ACS/IEEE International Conference onComputer Systems and Applications, 2005.","raw_type":"proceedings-article"},"type":"article","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/A5064625587","display_name":"Mustapha Bourahla","orcid":null},"institutions":[{"id":"https://openalex.org/I206961696","display_name":"University of Biskra","ror":"https://ror.org/05fr5y859","country_code":"DZ","type":"education","lineage":["https://openalex.org/I206961696"]}],"countries":["DZ"],"is_corresponding":true,"raw_author_name":"M. Bourahla","raw_affiliation_strings":["Computer Science Department, University of Biskra, Biskra, Algeria","Comput. Sci. Dept., Biskra Univ., Algeria"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, University of Biskra, Biskra, Algeria","institution_ids":["https://openalex.org/I206961696"]},{"raw_affiliation_string":"Comput. Sci. Dept., Biskra Univ., Algeria","institution_ids":["https://openalex.org/I206961696"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5059482401","display_name":"Mohamed Benmohamed","orcid":null},"institutions":[{"id":"https://openalex.org/I4391767747","display_name":"University of Constantine 3","ror":"https://ror.org/04wk25q62","country_code":null,"type":"education","lineage":["https://openalex.org/I4391767747"]},{"id":"https://openalex.org/I125485651","display_name":"Constantine 1 University","ror":"https://ror.org/017wv6808","country_code":"DZ","type":"education","lineage":["https://openalex.org/I125485651"]}],"countries":["DZ"],"is_corresponding":false,"raw_author_name":"M. Benmohamed","raw_affiliation_strings":["Computer Science Department, University of Constantine, Constantine, Algeria","Lab. d'Informatique pour la Mecanique, Sci. de lngenieur, France#TAB#"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, University of Constantine, Constantine, Algeria","institution_ids":["https://openalex.org/I125485651","https://openalex.org/I4391767747"]},{"raw_affiliation_string":"Lab. d'Informatique pour la Mecanique, Sci. de lngenieur, France#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5064625587"],"corresponding_institution_ids":["https://openalex.org/I206961696"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.18978322,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"sand93 1301","issue":null,"first_page":"72","last_page":"75"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998999834060669,"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.9998999834060669,"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/reachability","display_name":"Reachability","score":0.9841856956481934},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.8385617733001709},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8061864972114563},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.6111508011817932},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.5580729842185974},{"id":"https://openalex.org/keywords/state-space","display_name":"State space","score":0.5238835215568542},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.48635560274124146},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4812614619731903},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4483475089073181},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.407120943069458},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34504449367523193},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14823845028877258},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.11554673314094543}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.9841856956481934},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.8385617733001709},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8061864972114563},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.6111508011817932},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.5580729842185974},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.5238835215568542},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.48635560274124146},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4812614619731903},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4483475089073181},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.407120943069458},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34504449367523193},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14823845028877258},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.11554673314094543},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/aiccsa.2005.1387020","is_oa":false,"landing_page_url":"https://doi.org/10.1109/aiccsa.2005.1387020","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 3rd ACS/IEEE International Conference onComputer Systems and Applications, 2005.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6600000262260437,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1519532587","https://openalex.org/W1523688497","https://openalex.org/W1974155069","https://openalex.org/W1990986484","https://openalex.org/W1996242413","https://openalex.org/W2049178540","https://openalex.org/W2057084070","https://openalex.org/W2070232376","https://openalex.org/W2080593426","https://openalex.org/W2094726151","https://openalex.org/W2118837621","https://openalex.org/W2118953734","https://openalex.org/W2161455936","https://openalex.org/W3149523047","https://openalex.org/W4213162049","https://openalex.org/W6630932160","https://openalex.org/W6677275879"],"related_works":["https://openalex.org/W2884574904","https://openalex.org/W2135836819","https://openalex.org/W278680301","https://openalex.org/W2144996318","https://openalex.org/W2130642229","https://openalex.org/W1572578464","https://openalex.org/W149700981","https://openalex.org/W2513478072","https://openalex.org/W2804745155","https://openalex.org/W2736259393"],"abstract_inverted_index":{"Summary":[0],"form":[1],"only":[2],"given.":[3],"As":[4],"the":[5,17,31,43,58,76,97,108,125,129,143,147,152,156],"model-checking":[6],"(which":[7],"is":[8,20,91,119],"based":[9],"on":[10,85,93,96,111,134],"reachability":[11,46,89,109,117,157],"analysis)":[12],"becomes":[13],"increasingly":[14],"used":[15],"in":[16],"industry,":[18],"there":[19],"a":[21,38,53,81,104,122],"big":[22],"need":[23],"for":[24,41,56,115],"efficient":[25],"new":[26,54],"methods":[27],"to":[28],"deal":[29],"with":[30,65],"large":[32,59,135],"real-size":[33],"designs.":[34],"This":[35,73],"paper":[36],"presents":[37],"novel":[39],"method":[40,55,74,141],"improving":[42],"performance":[44,154],"of":[45,67,69,83,145,155],"analysis":[47,90,110,118],"using":[48],"parallelization":[49],"techniques.":[50],"We":[51],"propose":[52],"partitioning":[57],"state":[60,77],"space":[61,78],"modeling":[62],"industrial":[63],"designs":[64,137],"hundreds":[66],"millions":[68],"states":[70],"and":[71,106,150],"transitions.":[72],"partitions":[75],"by":[79,121],"performing":[80],"combination":[82],"abstraction-partition-refinement":[84],"its":[86],"structure.":[87],"The":[88,113,131],"distributed":[92],"processes":[94],"located":[95],"different":[98],"network":[99],"machines.":[100],"Each":[101],"one":[102],"owns":[103],"partition":[105],"executes":[107],"it.":[112],"algorithm":[114],"parallel":[116],"designed":[120],"way":[123],"reducing":[124],"communication":[126,148],"overhead":[127,149],"between":[128],"processes.":[130],"experimental":[132],"results":[133],"real":[136],"show":[138],"that":[139],"this":[140],"improves":[142],"quality":[144],"partitions,":[146],"then":[151],"overall":[153],"analysis.":[158]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}