{"id":"https://openalex.org/W3005962139","doi":"https://doi.org/10.3233/fi-2020-1890","title":"Verification Techniques for a Network Algebra","display_name":"Verification Techniques for a Network Algebra","publication_year":2020,"publication_date":"2020-02-08","ids":{"openalex":"https://openalex.org/W3005962139","doi":"https://doi.org/10.3233/fi-2020-1890","mag":"3005962139"},"language":"en","primary_location":{"id":"doi:10.3233/fi-2020-1890","is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-2020-1890","pdf_url":null,"source":{"id":"https://openalex.org/S39012697","display_name":"Fundamenta Informaticae","issn_l":"0169-2968","issn":["0169-2968","1875-8681"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fundamenta Informaticae","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/A5060034388","display_name":"Linda Brodo","orcid":"https://orcid.org/0000-0002-4455-2419"},"institutions":[{"id":"https://openalex.org/I159650629","display_name":"University of Sassari","ror":"https://ror.org/01bnjbv91","country_code":"IT","type":"education","lineage":["https://openalex.org/I159650629"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Linda Brodo","raw_affiliation_strings":["Universit\u00e0 degli Studi di Sassari, Italy"],"affiliations":[{"raw_affiliation_string":"Universit\u00e0 degli Studi di Sassari, Italy","institution_ids":["https://openalex.org/I159650629"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047180960","display_name":"Carlos Olarte","orcid":"https://orcid.org/0000-0002-7264-7773"},"institutions":[{"id":"https://openalex.org/I35046152","display_name":"Universidade Federal do Rio Grande do Norte","ror":"https://ror.org/04wn09761","country_code":"BR","type":"education","lineage":["https://openalex.org/I35046152"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Carlos Olarte","raw_affiliation_strings":["ECT, Universidade Federal do Rio Grande do Norte, Brazil"],"affiliations":[{"raw_affiliation_string":"ECT, Universidade Federal do Rio Grande do Norte, Brazil","institution_ids":["https://openalex.org/I35046152"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5060034388"],"corresponding_institution_ids":["https://openalex.org/I159650629"],"apc_list":null,"apc_paid":null,"fwci":0.2887,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.60512512,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"172","issue":"1","first_page":"1","last_page":"38"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9940999746322632,"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.9940999746322632,"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/T12162","display_name":"Cellular Automata and Applications","score":0.9828000068664551,"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.9821000099182129,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bisimulation","display_name":"Bisimulation","score":0.6907334923744202},{"id":"https://openalex.org/keywords/executable","display_name":"Executable","score":0.6904110908508301},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6727427244186401},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.5875856280326843},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5784330368041992},{"id":"https://openalex.org/keywords/rewriting","display_name":"Rewriting","score":0.5726868510246277},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.4911358058452606},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.4906517565250397},{"id":"https://openalex.org/keywords/symbolic-execution","display_name":"Symbolic execution","score":0.47714993357658386},{"id":"https://openalex.org/keywords/symbolic-trajectory-evaluation","display_name":"Symbolic trajectory evaluation","score":0.4766053557395935},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.46989962458610535},{"id":"https://openalex.org/keywords/symbolic-data-analysis","display_name":"Symbolic data analysis","score":0.46587109565734863},{"id":"https://openalex.org/keywords/process-calculus","display_name":"Process calculus","score":0.4600211977958679},{"id":"https://openalex.org/keywords/transition-system","display_name":"Transition system","score":0.44987502694129944},{"id":"https://openalex.org/keywords/operational-semantics","display_name":"Operational semantics","score":0.4329732656478882},{"id":"https://openalex.org/keywords/modal-logic","display_name":"Modal logic","score":0.4313458204269409},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.3653950095176697},{"id":"https://openalex.org/keywords/modal","display_name":"Modal","score":0.3425120413303375},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21959218382835388}],"concepts":[{"id":"https://openalex.org/C135315306","wikidata":"https://www.wikidata.org/wiki/Q866364","display_name":"Bisimulation","level":2,"score":0.6907334923744202},{"id":"https://openalex.org/C160145156","wikidata":"https://www.wikidata.org/wiki/Q778586","display_name":"Executable","level":2,"score":0.6904110908508301},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6727427244186401},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.5875856280326843},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5784330368041992},{"id":"https://openalex.org/C154690210","wikidata":"https://www.wikidata.org/wiki/Q1668499","display_name":"Rewriting","level":2,"score":0.5726868510246277},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4911358058452606},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.4906517565250397},{"id":"https://openalex.org/C2779639559","wikidata":"https://www.wikidata.org/wiki/Q7661178","display_name":"Symbolic execution","level":3,"score":0.47714993357658386},{"id":"https://openalex.org/C23123167","wikidata":"https://www.wikidata.org/wiki/Q7661193","display_name":"Symbolic trajectory evaluation","level":3,"score":0.4766053557395935},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.46989962458610535},{"id":"https://openalex.org/C65620979","wikidata":"https://www.wikidata.org/wiki/Q7661176","display_name":"Symbolic data analysis","level":2,"score":0.46587109565734863},{"id":"https://openalex.org/C161771561","wikidata":"https://www.wikidata.org/wiki/Q1970286","display_name":"Process calculus","level":2,"score":0.4600211977958679},{"id":"https://openalex.org/C2779167558","wikidata":"https://www.wikidata.org/wiki/Q176468","display_name":"Transition system","level":2,"score":0.44987502694129944},{"id":"https://openalex.org/C156325763","wikidata":"https://www.wikidata.org/wiki/Q1930895","display_name":"Operational semantics","level":3,"score":0.4329732656478882},{"id":"https://openalex.org/C27508121","wikidata":"https://www.wikidata.org/wiki/Q210841","display_name":"Modal logic","level":3,"score":0.4313458204269409},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.3653950095176697},{"id":"https://openalex.org/C71139939","wikidata":"https://www.wikidata.org/wiki/Q910194","display_name":"Modal","level":2,"score":0.3425120413303375},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21959218382835388},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.0},{"id":"https://openalex.org/C188027245","wikidata":"https://www.wikidata.org/wiki/Q750446","display_name":"Polymer chemistry","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.3233/fi-2020-1890","is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-2020-1890","pdf_url":null,"source":{"id":"https://openalex.org/S39012697","display_name":"Fundamenta Informaticae","issn_l":"0169-2968","issn":["0169-2968","1875-8681"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fundamenta Informaticae","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-03568005v1","is_oa":false,"landing_page_url":"https://hal.science/hal-03568005","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Fundamenta Informaticae, 2020, 172 (1), pp.1-38. ⟨10.3233/FI-2020-1890⟩","raw_type":"Journal articles"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2101264565","https://openalex.org/W2514597554","https://openalex.org/W3141167149","https://openalex.org/W345638404","https://openalex.org/W1820380186","https://openalex.org/W2044213223","https://openalex.org/W2147015581","https://openalex.org/W4254035807","https://openalex.org/W3170793698","https://openalex.org/W1552900908"],"abstract_inverted_index":{"The":[0,41],"Core":[1],"Network":[2],"Algebra":[3],"(CNA)":[4],"is":[5,95,138],"a":[6,38,70,74,102,130],"model":[7],"for":[8,65,77,83],"concurrency":[9],"that":[10],"extends":[11],"the":[12,33,47,87,92,117,125,134,142,152,156],"point-to-point":[13],"communication":[14],"discipline":[15],"of":[16,49,90,106,119,133,145],"Milner\u2019s":[17],"CCS":[18],"with":[19],"multiparty":[20,39],"interactions.":[21],"Links":[22],"are":[23,80],"used":[24],"to":[25,61,114,140,170],"build":[26],"chains":[27],"describing":[28],"how":[29,55],"information":[30],"flows":[31],"among":[32],"different":[34],"agents":[35],"participating":[36],"in":[37,44,51],"interaction.":[40],"inherent":[42],"non-determinism":[43],"deciding":[45],"both":[46,151],"number":[48,105],"participants":[50],"an":[52,160],"interaction,":[53],"and":[54,73,98,111,155],"they":[56],"synchronize,":[57],"makes":[58],"it":[59,99],"difficult":[60],"devise":[62],"verification":[63,168],"techniques":[64],"this":[66],"language.":[67],"We":[68,108,122,164],"propose":[69,124],"symbolic":[71,75,93,120,153],"semantics":[72,89,94,154],"bisimulation":[76],"CNA":[78,146,172],"which":[79,137],"more":[81],"amenable":[82],"automating":[84],"reasoning.":[85],"Unlike":[86],"operational":[88],"CNA,":[91],"finitely":[96],"branching":[97],"represents,":[100],"compactly,":[101],"possibly":[103],"infinite":[104],"transitions.":[107],"give":[109],"necessary":[110],"sufficient":[112],"conditions":[113],"efficiently":[115],"check":[116],"validity":[118],"configurations.":[121],"also":[123],"Symbolic":[126],"Link":[127],"Modal":[128],"Logic,":[129],"seamless":[131],"extension":[132],"Hennessy-Milner":[135],"logic":[136,158],"able":[139],"characterize":[141],"(symbolic)":[143],"transitions":[144],"processes.":[147,173],"Finally,":[148],"we":[149],"specify":[150],"modal":[157],"as":[159],"executable":[161],"rewriting":[162],"theory.":[163],"thus":[165],"obtain":[166],"several":[167],"procedures":[169],"analyze":[171]},"counts_by_year":[{"year":2020,"cited_by_count":2}],"updated_date":"2026-03-10T16:38:18.471706","created_date":"2025-10-10T00:00:00"}