{"id":"https://openalex.org/W2020618022","doi":"https://doi.org/10.1145/1081180.1081191","title":"On-the-fly state space reductions for weak equivalences","display_name":"On-the-fly state space reductions for weak equivalences","publication_year":2005,"publication_date":"2005-09-05","ids":{"openalex":"https://openalex.org/W2020618022","doi":"https://doi.org/10.1145/1081180.1081191","mag":"2020618022"},"language":"en","primary_location":{"id":"doi:10.1145/1081180.1081191","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1081180.1081191","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 10th international workshop on Formal methods for industrial critical systems","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/A5109230703","display_name":"Radu Mateescu","orcid":null},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]},{"id":"https://openalex.org/I4210101348","display_name":"Centre Inria de l'Universit\u00e9 Grenoble Alpes","ror":"https://ror.org/00n8d6z93","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1326498283","https://openalex.org/I4210101348"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Radu Mateescu","raw_affiliation_strings":["INRIA Rh\u00f4ne-Alpes / VASY, Montbonnot St Martin, France"],"affiliations":[{"raw_affiliation_string":"INRIA Rh\u00f4ne-Alpes / VASY, Montbonnot St Martin, France","institution_ids":["https://openalex.org/I4210101348","https://openalex.org/I1326498283"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5109230703"],"corresponding_institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I4210101348"],"apc_list":null,"apc_paid":null,"fwci":3.1507441,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.90643681,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"80","last_page":"89"},"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/T10126","display_name":"Logic, programming, and type systems","score":0.9950000047683716,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9883999824523926,"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/transitive-closure","display_name":"Transitive closure","score":0.776057779788971},{"id":"https://openalex.org/keywords/partial-order-reduction","display_name":"Partial order reduction","score":0.6832023859024048},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6139051914215088},{"id":"https://openalex.org/keywords/toolbox","display_name":"Toolbox","score":0.5966415405273438},{"id":"https://openalex.org/keywords/on-the-fly","display_name":"On the fly","score":0.5606125593185425},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5294883847236633},{"id":"https://openalex.org/keywords/successor-cardinal","display_name":"Successor cardinal","score":0.509966254234314},{"id":"https://openalex.org/keywords/state-space","display_name":"State space","score":0.49953556060791016},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.4891112446784973},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4788070321083069},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.4521024227142334},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4485376179218292},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4245072901248932},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2936190664768219},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.232689768075943},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.15081092715263367},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.07744202017784119}],"concepts":[{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.776057779788971},{"id":"https://openalex.org/C94633896","wikidata":"https://www.wikidata.org/wiki/Q7140378","display_name":"Partial order reduction","level":3,"score":0.6832023859024048},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6139051914215088},{"id":"https://openalex.org/C2777655017","wikidata":"https://www.wikidata.org/wiki/Q1501161","display_name":"Toolbox","level":2,"score":0.5966415405273438},{"id":"https://openalex.org/C2781020372","wikidata":"https://www.wikidata.org/wiki/Q533093","display_name":"On the fly","level":2,"score":0.5606125593185425},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5294883847236633},{"id":"https://openalex.org/C75306776","wikidata":"https://www.wikidata.org/wiki/Q7632662","display_name":"Successor cardinal","level":2,"score":0.509966254234314},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.49953556060791016},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.4891112446784973},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4788070321083069},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.4521024227142334},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4485376179218292},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4245072901248932},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2936190664768219},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.232689768075943},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.15081092715263367},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07744202017784119},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1081180.1081191","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1081180.1081191","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 10th international workshop on Formal methods for industrial critical systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.5400000214576721}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1483422122","https://openalex.org/W1499481996","https://openalex.org/W1503429725","https://openalex.org/W1503973138","https://openalex.org/W1506375872","https://openalex.org/W1513924733","https://openalex.org/W1530087756","https://openalex.org/W1568729458","https://openalex.org/W1568920249","https://openalex.org/W1573078772","https://openalex.org/W1573853539","https://openalex.org/W1602925513","https://openalex.org/W1830954042","https://openalex.org/W1985161650","https://openalex.org/W2026591657","https://openalex.org/W2060910670","https://openalex.org/W2063176706","https://openalex.org/W2069709605","https://openalex.org/W2099624270","https://openalex.org/W2104925315","https://openalex.org/W2118382442","https://openalex.org/W2163135875","https://openalex.org/W2166150286","https://openalex.org/W2475382359","https://openalex.org/W2580244263","https://openalex.org/W6630104300","https://openalex.org/W6634297077"],"related_works":["https://openalex.org/W1973954352","https://openalex.org/W1573151257","https://openalex.org/W1545972740","https://openalex.org/W1546995467","https://openalex.org/W1965309410","https://openalex.org/W1868864221","https://openalex.org/W1791159949","https://openalex.org/W2906490148","https://openalex.org/W3147623613","https://openalex.org/W1523442991"],"abstract_inverted_index":{"On-the-fly":[0],"verification":[1,49,142],"of":[2,61,73,78,90,108,116,164],"concurrent":[3],"finite-state":[4],"systems":[5],"consists":[6],"in":[7,15,27,43],"constructing":[8],"and":[9,86,111,147,170],"analysing":[10],"their":[11],"underlying":[12,151],"state":[13,40],"spaces":[14,41],"a":[16,44,99],"demand-driven":[17],"way.":[18],"This":[19],"technique":[20],"is":[21,96],"able":[22],"to":[23,145],"detect":[24],"errors":[25],"effectively":[26],"large":[28],"systems;":[29],"however,":[30],"its":[31],"performance":[32,163],"can":[33,159],"still":[34],"be":[35],"increased":[36],"by":[37],"reducing":[38],"the":[39,48,105,113,117,126,130,150,162],"incrementally":[42],"way":[45],"compatible":[46,148],"with":[47,149],"problem.":[50],"In":[51],"this":[52],"paper,":[53],"we":[54],"propose":[55],"algorithms":[56],"for":[57,139],"three":[58,121],"on-the-fly":[59,141,165],"reductions":[60],"Labeled":[62],"Transition":[63],"Systems":[64],"(LTSs),":[65],"which":[66,134],"preserve":[67],"weak":[68],"equivalence":[69,171],"relations:":[70],"\u03a4-compression":[71],"(collapsing":[72],"strongly":[74],"connected":[75,144],"components":[76],"made":[77],"\u03a4-transitions),":[79,85],"\u03a4-closure":[80],"(transitive":[81],"reflexive":[82],"closure":[83],"over":[84],"\u03a4-confluence":[87],"(a":[88],"form":[89],"partial":[91],"order":[92],"reduction).":[93],"Each":[94],"algorithm":[95],"described":[97],"as":[98,103],"reductor":[100],"module":[101],"taking":[102],"input":[104],"successor":[106,114],"function":[107,115],"an":[109],"LTS":[110,166],"returning":[112],"reduced":[118],"LTS.":[119],"The":[120],"reductors":[122,158],"were":[123],"implemented":[124],"within":[125],"CADP":[127],"toolbox":[128],"using":[129],"generic":[131],"OPEN/C\u00c6SAR":[132,146],"environment,":[133],"makes":[135],"them":[136],"directly":[137],"available":[138],"any":[140],"tool":[143],"reduction.":[152],"Our":[153],"experiments":[154],"show":[155],"that":[156],"these":[157],"improve":[160],"significantly":[161],"generation,":[167],"model":[168],"checking,":[169],"checking.":[172]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}