{"id":"https://openalex.org/W2074625252","doi":"https://doi.org/10.3103/s0146411610070035","title":"On application of weaker simulations to parameterized model checking by network invariants technique","display_name":"On application of weaker simulations to parameterized model checking by network invariants technique","publication_year":2010,"publication_date":"2010-12-01","ids":{"openalex":"https://openalex.org/W2074625252","doi":"https://doi.org/10.3103/s0146411610070035","mag":"2074625252"},"language":"en","primary_location":{"id":"doi:10.3103/s0146411610070035","is_oa":false,"landing_page_url":"https://doi.org/10.3103/s0146411610070035","pdf_url":null,"source":{"id":"https://openalex.org/S17203304","display_name":"Automatic Control and Computer Sciences","issn_l":"0146-4116","issn":["0146-4116","1558-108X"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320267","host_organization_name":"Pleiades Publishing","host_organization_lineage":["https://openalex.org/P4310320267","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Pleiades Publishing","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Automatic Control and Computer Sciences","raw_type":"journal-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/A5040967690","display_name":"Igor Konnov","orcid":"https://orcid.org/0000-0001-6629-3377"},"institutions":[{"id":"https://openalex.org/I19880235","display_name":"Lomonosov Moscow State University","ror":"https://ror.org/010pmpe69","country_code":"RU","type":"education","lineage":["https://openalex.org/I19880235"]},{"id":"https://openalex.org/I4210150146","display_name":"Moscow State University","ror":"https://ror.org/050a13t43","country_code":"TJ","type":"education","lineage":["https://openalex.org/I4210150146"]}],"countries":["RU","TJ"],"is_corresponding":true,"raw_author_name":"I. V. Konnov","raw_affiliation_strings":["Lomonosov Moscow State University, Moscow, Russia","Lomonosov Moscow State Univ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Lomonosov Moscow State University, Moscow, Russia","institution_ids":["https://openalex.org/I19880235"]},{"raw_affiliation_string":"Lomonosov Moscow State Univ","institution_ids":["https://openalex.org/I4210150146"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5040967690"],"corresponding_institution_ids":["https://openalex.org/I19880235","https://openalex.org/I4210150146"],"apc_list":null,"apc_paid":null,"fwci":0.319,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.62593458,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"44","issue":"7","first_page":"378","last_page":"386"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998000264167786,"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.9998000264167786,"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/T11195","display_name":"Simulation Techniques and Applications","score":0.9955000281333923,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12810","display_name":"Real-time simulation and control systems","score":0.9951000213623047,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7843906879425049},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.7733213901519775},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.6873452067375183},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.5956568121910095},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5766010880470276},{"id":"https://openalex.org/keywords/bisimulation","display_name":"Bisimulation","score":0.5397374033927917},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.5238043069839478},{"id":"https://openalex.org/keywords/trace","display_name":"TRACE (psycholinguistics)","score":0.5095279812812805},{"id":"https://openalex.org/keywords/invariant","display_name":"Invariant (physics)","score":0.5013875961303711},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.49342861771583557},{"id":"https://openalex.org/keywords/equivalence-relation","display_name":"Equivalence relation","score":0.4280746281147003},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4073145389556885},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1887665092945099},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.1371344029903412}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7843906879425049},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7733213901519775},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.6873452067375183},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.5956568121910095},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5766010880470276},{"id":"https://openalex.org/C135315306","wikidata":"https://www.wikidata.org/wiki/Q866364","display_name":"Bisimulation","level":2,"score":0.5397374033927917},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.5238043069839478},{"id":"https://openalex.org/C75291252","wikidata":"https://www.wikidata.org/wiki/Q1315756","display_name":"TRACE (psycholinguistics)","level":2,"score":0.5095279812812805},{"id":"https://openalex.org/C190470478","wikidata":"https://www.wikidata.org/wiki/Q2370229","display_name":"Invariant (physics)","level":2,"score":0.5013875961303711},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.49342861771583557},{"id":"https://openalex.org/C156103551","wikidata":"https://www.wikidata.org/wiki/Q130998","display_name":"Equivalence relation","level":2,"score":0.4280746281147003},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4073145389556885},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1887665092945099},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.1371344029903412},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","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},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3103/s0146411610070035","is_oa":false,"landing_page_url":"https://doi.org/10.3103/s0146411610070035","pdf_url":null,"source":{"id":"https://openalex.org/S17203304","display_name":"Automatic Control and Computer Sciences","issn_l":"0146-4116","issn":["0146-4116","1558-108X"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320267","host_organization_name":"Pleiades Publishing","host_organization_lineage":["https://openalex.org/P4310320267","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Pleiades Publishing","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Automatic Control and Computer Sciences","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W335576746","https://openalex.org/W1488858096","https://openalex.org/W1505204863","https://openalex.org/W1509819701","https://openalex.org/W1762311305","https://openalex.org/W1772581832","https://openalex.org/W1861590051","https://openalex.org/W1943502734","https://openalex.org/W1975425602","https://openalex.org/W1985161650","https://openalex.org/W2000210358","https://openalex.org/W2006553351","https://openalex.org/W2027755003","https://openalex.org/W2044309072","https://openalex.org/W2051054731","https://openalex.org/W2056234391","https://openalex.org/W2062081943","https://openalex.org/W2102236203","https://openalex.org/W2133010105","https://openalex.org/W2141957585","https://openalex.org/W2143812611","https://openalex.org/W2147269402","https://openalex.org/W2163016025","https://openalex.org/W2296256089","https://openalex.org/W2340735175","https://openalex.org/W2913459036","https://openalex.org/W4285719527","https://openalex.org/W4366833775","https://openalex.org/W6603281867"],"related_works":["https://openalex.org/W2051058708","https://openalex.org/W1495872178","https://openalex.org/W154868527","https://openalex.org/W1494268238","https://openalex.org/W2141421005","https://openalex.org/W1586382855","https://openalex.org/W1569743961","https://openalex.org/W4388918135","https://openalex.org/W2499765358","https://openalex.org/W2349728712"],"abstract_inverted_index":{"In":[0,40,60,166],"this":[1,167],"paper":[2,168],"we":[3,154],"consider":[4],"parameterized":[5,161],"model":[6,162],"checking":[7],"problem":[8],"of":[9,16,21,43,89,143,163,171,177],"asynchronous":[10,44],"communicating":[11],"processes":[12],"in":[13],"the":[14,41,81,87,139,156,175],"framework":[15,20,157],"network":[17,22,90],"invariants.":[18,91],"The":[19,141],"invariants":[23],"relies":[24],"on":[25,138],"relations":[26,66],"over":[27,113,125],"labelled":[28],"transition":[29],"systems":[30],"such":[31,148],"as":[32],"simulation,":[33,71],"bisimulation,":[34],"trace":[35,38],"equivalence":[36],"and":[37,48,55,74,118],"inclusion.":[39],"case":[42],"parallel":[45],"composition":[46],"simulation":[47,65,73,78,93,112,124,137],"bisimulation":[49],"appear":[50],"to":[51,83,86,105,133,146,158],"be":[52,84],"rather":[53],"strong":[54],"thus":[56],"require":[57],"additional":[58],"abstractions.":[59],"our":[61],"work":[62],"three":[63],"weaker":[64],"are":[67,179],"proposed":[68],"namely":[69],"quasi-block":[70,100],"block":[72,123],"semi-block":[75,111,136],"simulation.":[76,101],"Quasi-block":[77],"has":[79],"all":[80],"properties":[82],"applied":[85],"technique":[88],"Block":[92],"is":[94,103,131,151],"a":[95,99,135,149,160,169],"stronger":[96],"relation":[97],"than":[98],"It":[102],"used":[104,155],"find":[106],"an":[107,121,144],"invariant.":[108],"An":[109],"initial":[110,122],"two":[114],"models":[115,127],"exists":[116],"if":[117,120],"only":[119],"that":[126,173],"exists.":[128],"Thus,":[129],"it":[130],"sufficient":[132],"compute":[134],"models.":[140],"sketch":[142],"algorithm":[145],"perform":[147],"computation":[150,178],"presented.":[152],"Previously,":[153],"check":[159],"RSVP":[164],"protocol.":[165],"series":[170],"optimizations":[172],"decrease":[174],"time":[176],"shown.":[180]},"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-30T17:31:21.811387","created_date":"2025-10-10T00:00:00"}