{"id":"https://openalex.org/W1990239819","doi":"https://doi.org/10.1016/s1571-0661(05)80429-3","title":"Abstraction of parameterized networks","display_name":"Abstraction of parameterized networks","publication_year":1997,"publication_date":"1997-01-01","ids":{"openalex":"https://openalex.org/W1990239819","doi":"https://doi.org/10.1016/s1571-0661(05)80429-3","mag":"1990239819"},"language":"en","primary_location":{"id":"doi:10.1016/s1571-0661(05)80429-3","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(05)80429-3","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1016/s1571-0661(05)80429-3","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5079441396","display_name":"David Lesens","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"David Lesens","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5089858094","display_name":"Hassen Sa\u0131\u0308di","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hassen Sa\u00efdi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.1097,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.91009707,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"9","issue":null,"first_page":"42","last_page":"42"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9976999759674072,"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.9976999759674072,"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/T10661","display_name":"biodegradable polymer synthesis and properties","score":0.9887999892234802,"subfield":{"id":"https://openalex.org/subfields/2502","display_name":"Biomaterials"},"field":{"id":"https://openalex.org/fields/25","display_name":"Materials Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10092","display_name":"Organometallic Complex Synthesis and Catalysis","score":0.9613999724388123,"subfield":{"id":"https://openalex.org/subfields/1605","display_name":"Organic Chemistry"},"field":{"id":"https://openalex.org/fields/16","display_name":"Chemistry"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.8330243825912476},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7802382707595825},{"id":"https://openalex.org/keywords/interleaving","display_name":"Interleaving","score":0.6487776041030884},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.6421147584915161},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.6189894080162048},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.550574779510498},{"id":"https://openalex.org/keywords/automated-theorem-proving","display_name":"Automated theorem proving","score":0.5388197302818298},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.5069770812988281},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.49056190252304077},{"id":"https://openalex.org/keywords/synchronization","display_name":"Synchronization (alternating current)","score":0.4883682131767273},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46986517310142517},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.41752010583877563}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8330243825912476},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7802382707595825},{"id":"https://openalex.org/C28034677","wikidata":"https://www.wikidata.org/wiki/Q17092530","display_name":"Interleaving","level":2,"score":0.6487776041030884},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.6421147584915161},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.6189894080162048},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.550574779510498},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.5388197302818298},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.5069770812988281},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.49056190252304077},{"id":"https://openalex.org/C2778562939","wikidata":"https://www.wikidata.org/wiki/Q1298791","display_name":"Synchronization (alternating current)","level":3,"score":0.4883682131767273},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46986517310142517},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.41752010583877563},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"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":1,"locations":[{"id":"doi:10.1016/s1571-0661(05)80429-3","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(05)80429-3","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/s1571-0661(05)80429-3","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(05)80429-3","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1655266410","https://openalex.org/W2051058708","https://openalex.org/W2389051085","https://openalex.org/W2330343234","https://openalex.org/W1901012776","https://openalex.org/W154868527","https://openalex.org/W2463883322","https://openalex.org/W1494268238","https://openalex.org/W2814468324","https://openalex.org/W2229382548"],"abstract_inverted_index":{"In":[0],"this":[1,69],"paper":[2],"we":[3,34],"are":[4],"interested":[5],"in":[6],"the":[7,55,58,75,78,81,87,97,106,112,144,173],"verification":[8,72,133,161],"of":[9,12,23,29,57,80,130,159,172],"safety":[10],"properties":[11],"parameterized":[13,170],"networks.":[14],"A":[15],"network":[16,60,83],"is":[17,61,65,84,90,140,163],"defined":[18],"as":[19],"a":[20,48,92,128,169],"parallel":[21,36],"composition":[22,37],"an":[24,51],"arbitrary":[25,154],"but":[26],"finite":[27],"number":[28],"identical":[30],"sequential":[31],"processes,":[32],"where":[33],"consider":[35,151],"by":[38,42],"interleaving":[39],"and":[40],"synchronization":[41],"shared":[43],"variables.":[44],"Using":[45],"abstraction":[46,118],"techniques,":[47],"process,":[49],"called":[50],"abstract":[52,82,113],"network,":[53,114],"encoding":[54],"behaviour":[56],"entire":[59],"constructed.":[62],"The":[63,123,136,157],"property":[64,98,107],"then":[66],"checked":[67],"on":[68,95,111,165],"process.":[70],"Our":[71],"method":[73,162],"has":[74,119],"following":[76],"advantages:":[77],"construction":[79,124],"fully":[85],"automatic;":[86],"obtained":[88],"process":[89,94],"generally":[91],"simple":[93],"which":[96],"can":[99],"be":[100,109,121],"easily":[101],"verified.":[102],"Of":[103],"course,":[104],"if":[105],"cannot":[108],"verified":[110],"another":[115],"more":[116],"precise":[117],"to":[120,126,142,150],"computed.":[122],"requires":[125],"discharge":[127,143],"set":[129],"first":[131],"order":[132],"conditions":[134],"(VCs).":[135],"PVS":[137],"theorem":[138],"prover":[139],"used":[141],"generated":[145],"VCs.":[146],"This":[147],"allows":[148],"us":[149],"processes":[152],"with":[153],"data":[155],"types.":[156],"effectiveness":[158],"our":[160],"illustrated":[164],"two":[166],"examples":[167],"including":[168],"version":[171],"Fischer's":[174],"protocol.":[175]},"counts_by_year":[{"year":2020,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}