{"id":"https://openalex.org/W2065978248","doi":"https://doi.org/10.1145/1013560.1013563","title":"Symbolic semantic rules for producing compact STGLAs from value passing process descriptions","display_name":"Symbolic semantic rules for producing compact STGLAs from value passing process descriptions","publication_year":2004,"publication_date":"2004-07-01","ids":{"openalex":"https://openalex.org/W2065978248","doi":"https://doi.org/10.1145/1013560.1013563","mag":"2065978248"},"language":"en","primary_location":{"id":"doi:10.1145/1013560.1013563","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1013560.1013563","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","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/A5090241572","display_name":"Marco Bernardo","orcid":"https://orcid.org/0000-0003-0267-6170"},"institutions":[{"id":"https://openalex.org/I190397597","display_name":"University of Urbino","ror":"https://ror.org/04q4kt073","country_code":"IT","type":"education","lineage":["https://openalex.org/I190397597"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Marco Bernardo","raw_affiliation_strings":["University of Urbino---Italy","University of Urbino , Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Urbino---Italy","institution_ids":["https://openalex.org/I190397597"]},{"raw_affiliation_string":"University of Urbino , Italy","institution_ids":["https://openalex.org/I190397597"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5090241572"],"corresponding_institution_ids":["https://openalex.org/I190397597"],"apc_list":null,"apc_paid":null,"fwci":0.342,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.62000875,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"5","issue":"3","first_page":"436","last_page":"469"},"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.9941999912261963,"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/T11549","display_name":"Synthetic Organic Chemistry Methods","score":0.9746000170707703,"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/bisimulation","display_name":"Bisimulation","score":0.8204070925712585},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6220470666885376},{"id":"https://openalex.org/keywords/the-symbolic","display_name":"The Symbolic","score":0.5877989530563354},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5606759786605835},{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.4849815368652344},{"id":"https://openalex.org/keywords/semantic-equivalence","display_name":"Semantic equivalence","score":0.4727412462234497},{"id":"https://openalex.org/keywords/symbolic-data-analysis","display_name":"Symbolic data analysis","score":0.45855942368507385},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.4534584879875183},{"id":"https://openalex.org/keywords/semantic-data-model","display_name":"Semantic data model","score":0.4442744255065918},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.43501579761505127},{"id":"https://openalex.org/keywords/symbolic-execution","display_name":"Symbolic execution","score":0.43411242961883545},{"id":"https://openalex.org/keywords/symbolic-trajectory-evaluation","display_name":"Symbolic trajectory evaluation","score":0.4198172986507416},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.41715115308761597},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37212634086608887},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.3259493112564087},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.301186203956604},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2441677749156952},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2050330638885498},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.20439696311950684},{"id":"https://openalex.org/keywords/semantic-computing","display_name":"Semantic computing","score":0.19010215997695923},{"id":"https://openalex.org/keywords/semantic-web","display_name":"Semantic Web","score":0.16349056363105774}],"concepts":[{"id":"https://openalex.org/C135315306","wikidata":"https://www.wikidata.org/wiki/Q866364","display_name":"Bisimulation","level":2,"score":0.8204070925712585},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6220470666885376},{"id":"https://openalex.org/C2776095079","wikidata":"https://www.wikidata.org/wiki/Q489538","display_name":"The Symbolic","level":2,"score":0.5877989530563354},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5606759786605835},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.4849815368652344},{"id":"https://openalex.org/C37926939","wikidata":"https://www.wikidata.org/wiki/Q7449061","display_name":"Semantic equivalence","level":4,"score":0.4727412462234497},{"id":"https://openalex.org/C65620979","wikidata":"https://www.wikidata.org/wiki/Q7661176","display_name":"Symbolic data analysis","level":2,"score":0.45855942368507385},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.4534584879875183},{"id":"https://openalex.org/C90312973","wikidata":"https://www.wikidata.org/wiki/Q7449052","display_name":"Semantic data model","level":2,"score":0.4442744255065918},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.43501579761505127},{"id":"https://openalex.org/C2779639559","wikidata":"https://www.wikidata.org/wiki/Q7661178","display_name":"Symbolic execution","level":3,"score":0.43411242961883545},{"id":"https://openalex.org/C23123167","wikidata":"https://www.wikidata.org/wiki/Q7661193","display_name":"Symbolic trajectory evaluation","level":3,"score":0.4198172986507416},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.41715115308761597},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37212634086608887},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.3259493112564087},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.301186203956604},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2441677749156952},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2050330638885498},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.20439696311950684},{"id":"https://openalex.org/C511149849","wikidata":"https://www.wikidata.org/wiki/Q7449051","display_name":"Semantic computing","level":3,"score":0.19010215997695923},{"id":"https://openalex.org/C2129575","wikidata":"https://www.wikidata.org/wiki/Q54837","display_name":"Semantic Web","level":2,"score":0.16349056363105774},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C11171543","wikidata":"https://www.wikidata.org/wiki/Q41630","display_name":"Psychoanalysis","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}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1013560.1013563","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1013560.1013563","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.582.7579","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.582.7579","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.sti.uniurb.it/bernardo/documents/acmtocl5.pdf","raw_type":"text"},{"id":"pmh:oai:ora.uniurb.it:11576/1879645","is_oa":false,"landing_page_url":"http://hdl.handle.net/11576/1879645","pdf_url":null,"source":{"id":"https://openalex.org/S4377196377","display_name":"CINECA IRIS Institutional Research information system (University of Urbino)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190397597","host_organization_name":"University of Urbino","host_organization_lineage":["https://openalex.org/I190397597"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W88975855","https://openalex.org/W133701161","https://openalex.org/W1501397281","https://openalex.org/W1503973138","https://openalex.org/W1522645051","https://openalex.org/W1863244539","https://openalex.org/W1971107784","https://openalex.org/W1978358700","https://openalex.org/W2004627178","https://openalex.org/W2098041207","https://openalex.org/W2913663755","https://openalex.org/W6630104300","https://openalex.org/W6631493839"],"related_works":["https://openalex.org/W2101264565","https://openalex.org/W2514597554","https://openalex.org/W3141167149","https://openalex.org/W345638404","https://openalex.org/W2044213223","https://openalex.org/W4245197793","https://openalex.org/W2147015581","https://openalex.org/W4254035807","https://openalex.org/W3170793698","https://openalex.org/W1552900908"],"abstract_inverted_index":{"Value":[0],"passing":[1,46,115,165],"process":[2,47],"algebras":[3],"with":[4,12,39,66,77,137,177],"infinite":[5],"data":[6],"domains":[7],"need":[8],"to":[9,21,49,85,117,139,179],"be":[10,22,36],"equipped":[11],"symbolic":[13,28,51,63,74,105,132,172,188],"semantic":[14,41,106,133,144,173,192],"models":[15,29,189],"in":[16,196],"order":[17],"for":[18,159],"their":[19],"analysis":[20],"possible.":[23],"This":[24],"means":[25],"that":[26,82,108,130],"appropriate":[27],"and":[30,89,97,146,190],"the":[31,44,59,62,73,86,125,131,141,147,151,160,167,171,187,191,197],"related":[32],"verification":[33],"algorithms":[34,94],"must":[35],"developed,":[37],"together":[38],"suitable":[40],"rules":[42,107,134,145,174,193],"mapping":[43],"value":[45,114,164],"descriptions":[48],"such":[50],"models.":[52],"In":[53],"this":[54],"article,":[55],"we":[56,156],"first":[57],"introduce":[58],"model":[60],"of":[61,72,80,95,104,113,150,163],"transition":[64,75],"graphs":[65,76],"lookahead":[67],"assignment":[68,78,152],"(STGLAs),":[69],"a":[70,102,110,180],"variant":[71],"(STGAs)":[79],"Lin":[81],"can":[83],"undergo":[84],"strong,":[87],"weak":[88],"observational":[90],"bisimulation":[91],"equivalence":[92],"checking":[93],"Li":[96],"Chen.":[98],"We":[99,128],"then":[100],"define":[101],"set":[103],"map":[109],"useful":[111],"fragment":[112,162],"CCS":[116],"finite":[118],"STGLAs":[119,168],"without":[120],"making":[121],"any":[122],"assumption":[123],"about":[124],"variable":[126],"names.":[127],"demonstrate":[129],"are":[135,175],"correct":[136],"respect":[138,178],"both":[140],"usual":[142],"concrete":[143],"novel":[148],"issue":[149],"application":[153],"order.":[154],"Finally,":[155],"prove":[157],"that,":[158],"considered":[161],"CCS,":[166],"produced":[169],"by":[170],"optimal":[176],"certain":[181],"compactness":[182],"criterion,":[183],"thus":[184],"improving":[185],"on":[186],"previously":[194],"proposed":[195],"literature.":[198]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}