{"id":"https://openalex.org/W4384471300","doi":"https://doi.org/10.1007/978-3-031-37706-8_5","title":"Process Equivalence Problems as\u00a0Energy Games","display_name":"Process Equivalence Problems as\u00a0Energy Games","publication_year":2023,"publication_date":"2023-01-01","ids":{"openalex":"https://openalex.org/W4384471300","doi":"https://doi.org/10.1007/978-3-031-37706-8_5"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-031-37706-8_5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-031-37706-8_5","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-031-37706-8_5.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/978-3-031-37706-8_5.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5021370761","display_name":"Benjamin Bisping","orcid":"https://orcid.org/0000-0002-0637-0171"},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Benjamin Bisping","raw_affiliation_strings":["Technische Universit\u00e4t Berlin, Berlin, Germany"],"raw_orcid":"https://orcid.org/0000-0002-0637-0171","affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5021370761"],"corresponding_institution_ids":["https://openalex.org/I4577782"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":{"value":5000,"currency":"EUR","value_usd":5392},"fwci":0.9436,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.75679674,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"85","last_page":"106"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9973000288009644,"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.9973000288009644,"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/T11424","display_name":"Security and Verification in Computing","score":0.9943000078201294,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9912999868392944,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/reachability","display_name":"Reachability","score":0.8706892728805542},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.7479966878890991},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6697862148284912},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.5802918672561646},{"id":"https://openalex.org/keywords/trace","display_name":"TRACE (psycholinguistics)","score":0.530865490436554},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5282679796218872},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4573923349380493},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3371596336364746},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.32067692279815674},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2654492259025574}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8706892728805542},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.7479966878890991},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6697862148284912},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.5802918672561646},{"id":"https://openalex.org/C75291252","wikidata":"https://www.wikidata.org/wiki/Q1315756","display_name":"TRACE (psycholinguistics)","level":2,"score":0.530865490436554},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5282679796218872},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4573923349380493},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3371596336364746},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32067692279815674},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2654492259025574},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-031-37706-8_5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-031-37706-8_5","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-031-37706-8_5.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":{"id":"doi:10.1007/978-3-031-37706-8_5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-031-37706-8_5","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-031-37706-8_5.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","score":0.8600000143051147,"display_name":"Affordable and clean energy"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320324094","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40"}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4384471300.pdf"},"referenced_works_count":32,"referenced_works":["https://openalex.org/W1547620028","https://openalex.org/W1589421353","https://openalex.org/W1596041124","https://openalex.org/W1601841732","https://openalex.org/W1823282488","https://openalex.org/W1866572553","https://openalex.org/W1971499713","https://openalex.org/W1981015644","https://openalex.org/W2036267700","https://openalex.org/W2098675564","https://openalex.org/W2098981343","https://openalex.org/W2098996654","https://openalex.org/W2110396150","https://openalex.org/W2110917011","https://openalex.org/W2129934517","https://openalex.org/W2167354623","https://openalex.org/W2205337852","https://openalex.org/W2434522533","https://openalex.org/W2931193726","https://openalex.org/W2963524373","https://openalex.org/W3138691203","https://openalex.org/W3187357174","https://openalex.org/W3204417759","https://openalex.org/W3214935373","https://openalex.org/W4239721096","https://openalex.org/W4296970324","https://openalex.org/W4327810253","https://openalex.org/W4378767260","https://openalex.org/W6906637214","https://openalex.org/W6947943006","https://openalex.org/W6950359494","https://openalex.org/W6966858226"],"related_works":["https://openalex.org/W2136512912","https://openalex.org/W2127267268","https://openalex.org/W2156446763","https://openalex.org/W2067910792","https://openalex.org/W2150194458","https://openalex.org/W2143461633","https://openalex.org/W2889071233","https://openalex.org/W2772294324","https://openalex.org/W2047831585","https://openalex.org/W4253760428"],"abstract_inverted_index":{"Abstract":[0],"We":[1],"characterize":[2],"all":[3],"common":[4],"notions":[5],"of":[6,18,68,73,81],"behavioral":[7],"equivalence":[8,54],"by":[9],"one":[10],"6-dimensional":[11],"energy":[12],"game,":[13],"where":[14,70],"energies":[15],"bound":[16],"capabilities":[17],"an":[19],"attacker":[20],"trying":[21],"to":[22,52],"tell":[23],"processes":[24],"apart.":[25],"The":[26,43],"defender-winning":[27],"initial":[28],"credits":[29],"exhaustively":[30],"determine":[31],"which":[32,48],"preorders":[33],"and":[34],"equivalences":[35,69],"from":[36],"the":[37,89,92,98],"(strong)":[38],"linear-time\u2013branching-time":[39],"spectrum":[40],"relate":[41],"processes.":[42],"time":[44],"complexity":[45,58],"is":[46,49],"exponential,":[47],"optimal":[50],"due":[51],"trace":[53],"being":[55],"covered.":[56],"This":[57],"improves":[59],"drastically":[60],"on":[61,79,95],"our":[62],"previous":[63],"approach":[64],"for":[65],"deciding":[66],"groups":[67],"exponential":[71],"sets":[72],"distinguishing":[74],"HML":[75],"formulas":[76],"are":[77],"constructed":[78],"top":[80],"a":[82],"super-exponential":[83],"reachability":[84],"game.":[85],"In":[86],"experiments":[87],"using":[88],"VLTS":[90],"benchmarks,":[91],"algorithm":[93],"performs":[94],"par":[96],"with":[97],"best":[99],"similarity":[100],"algorithm.":[101]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-06-13T06:13:01.061226","created_date":"2025-10-10T00:00:00"}