{"id":"https://openalex.org/W4415642515","doi":"https://doi.org/10.46298/lmcs-21(4:14)2025","title":"Positive Hennessy-Milner Logic for Branching Bisimulation","display_name":"Positive Hennessy-Milner Logic for Branching Bisimulation","publication_year":2025,"publication_date":"2025-10-28","ids":{"openalex":"https://openalex.org/W4415642515","doi":"https://doi.org/10.46298/lmcs-21(4:14)2025"},"language":"en","primary_location":{"id":"doi:10.46298/lmcs-21(4:14)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(4:14)2025","pdf_url":"https://lmcs.episciences.org/16811/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/16811/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5071639019","display_name":"Herman Geuvers","orcid":"https://orcid.org/0000-0003-2522-2980"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Herman Geuvers","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5120166586","display_name":"Komi Golov","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Komi Golov","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5071639019"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.17102082,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"Volume 21, Issue 4","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9390000104904175,"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"}},"topics":[{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9390000104904175,"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/T10456","display_name":"Multi-Agent Systems and Negotiation","score":0.012799999676644802,"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/T10034","display_name":"Syntax, Semantics, Linguistic Variation","score":0.006899999920278788,"subfield":{"id":"https://openalex.org/subfields/1203","display_name":"Language and Linguistics"},"field":{"id":"https://openalex.org/fields/12","display_name":"Arts and Humanities"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bisimulation","display_name":"Bisimulation","score":0.8162000179290771},{"id":"https://openalex.org/keywords/modal-logic","display_name":"Modal logic","score":0.7378000020980835},{"id":"https://openalex.org/keywords/normal-modal-logic","display_name":"Normal modal logic","score":0.6136999726295471},{"id":"https://openalex.org/keywords/accessibility-relation","display_name":"Accessibility relation","score":0.5806999802589417},{"id":"https://openalex.org/keywords/s5","display_name":"S5","score":0.535099983215332},{"id":"https://openalex.org/keywords/modal","display_name":"Modal","score":0.5149000287055969},{"id":"https://openalex.org/keywords/branching","display_name":"Branching (polymer chemistry)","score":0.5095000267028809},{"id":"https://openalex.org/keywords/modal-\u03bc-calculus","display_name":"Modal \u03bc-calculus","score":0.4925999939441681},{"id":"https://openalex.org/keywords/dynamic-logic","display_name":"Dynamic logic (digital electronics)","score":0.47429999709129333}],"concepts":[{"id":"https://openalex.org/C135315306","wikidata":"https://www.wikidata.org/wiki/Q866364","display_name":"Bisimulation","level":2,"score":0.8162000179290771},{"id":"https://openalex.org/C27508121","wikidata":"https://www.wikidata.org/wiki/Q210841","display_name":"Modal logic","level":3,"score":0.7378000020980835},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6425999999046326},{"id":"https://openalex.org/C114092440","wikidata":"https://www.wikidata.org/wiki/Q840226","display_name":"Normal modal logic","level":4,"score":0.6136999726295471},{"id":"https://openalex.org/C11191006","wikidata":"https://www.wikidata.org/wiki/Q2663311","display_name":"Accessibility relation","level":4,"score":0.5806999802589417},{"id":"https://openalex.org/C192609573","wikidata":"https://www.wikidata.org/wiki/Q7388341","display_name":"S5","level":5,"score":0.535099983215332},{"id":"https://openalex.org/C71139939","wikidata":"https://www.wikidata.org/wiki/Q910194","display_name":"Modal","level":2,"score":0.5149000287055969},{"id":"https://openalex.org/C206175624","wikidata":"https://www.wikidata.org/wiki/Q595731","display_name":"Branching (polymer chemistry)","level":2,"score":0.5095000267028809},{"id":"https://openalex.org/C173125200","wikidata":"https://www.wikidata.org/wiki/Q5275729","display_name":"Modal \u03bc-calculus","level":5,"score":0.4925999939441681},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4876999855041504},{"id":"https://openalex.org/C2777796570","wikidata":"https://www.wikidata.org/wiki/Q2351326","display_name":"Dynamic logic (digital electronics)","level":4,"score":0.47429999709129333},{"id":"https://openalex.org/C203659156","wikidata":"https://www.wikidata.org/wiki/Q6934805","display_name":"Multimodal logic","level":3,"score":0.3790000081062317},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.37049999833106995},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.33390000462532043},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.3246999979019165},{"id":"https://openalex.org/C47030870","wikidata":"https://www.wikidata.org/wiki/Q467606","display_name":"Model theory","level":2,"score":0.3127000033855438},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.3012000024318695},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.2856000065803528},{"id":"https://openalex.org/C78344899","wikidata":"https://www.wikidata.org/wiki/Q638442","display_name":"Modal operator","level":4,"score":0.2791000008583069},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26919999718666077},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.26249998807907104},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.2603999972343445},{"id":"https://openalex.org/C47884741","wikidata":"https://www.wikidata.org/wiki/Q1166618","display_name":"Mathematical logic","level":2,"score":0.26030001044273376},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.25929999351501465}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.46298/lmcs-21(4:14)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(4:14)2025","pdf_url":"https://lmcs.episciences.org/16811/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:repository.ubn.ru.nl:2066/325956","is_oa":true,"landing_page_url":"https://hdl.handle.net/2066/325956","pdf_url":"https://repository.ubn.ru.nl//bitstream/handle/2066/325956/325956.pdf","source":{"id":"https://openalex.org/S4306401067","display_name":"Radboud Repository (Radboud University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I145872427","host_organization_name":"Radboud University Nijmegen","host_organization_lineage":["https://openalex.org/I145872427"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article / Letter to editor"}],"best_oa_location":{"id":"doi:10.46298/lmcs-21(4:14)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(4:14)2025","pdf_url":"https://lmcs.episciences.org/16811/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4415642515.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Labelled":[0],"transitions":[1],"systems":[2],"can":[3],"be":[4],"studied":[5,44],"in":[6,12,96,138,152,174],"terms":[7,13,153],"of":[8,14,58,83,91,112,119,134,141,154,169,177,183,197,232,251,267],"modal":[9,37,71,104,130,208],"logic":[10,38],"and":[11,121,123,200,219,226],"bisimulation.":[15],"These":[16],"two":[17,27,62],"notions":[18,118],"are":[19,29,64],"connected":[20],"by":[21],"Hennessy-Milner":[22,60,84,185,201,221,234],"theorems,":[23],"that":[24,26,73,86,106,158,241,269],"show":[25,125,157,228,240],"states":[28,63],"bisimilar":[30,148],"precisely":[31,66,143,165],"when":[32,67,88,144,166],"they":[33],"satisfy":[34],"the":[35,59,89,97,132,139,167,175,180,184,187,195,229,233,237],"same":[36],"formulas.":[39],"Recently,":[40],"apartness":[41],"has":[42],"been":[43],"as":[45,206],"a":[46,55,70,109,207,248,257,265],"dual":[47,56],"to":[48,54,149,247,264,275],"bisimulation,":[49],"which":[50,255],"also":[51],"gives":[52,262],"rise":[53,263],"version":[57,182,231],"theorem:":[61],"apart":[65,162],"there":[68],"is":[69,94,136,146,160,171,245,256,270],"formula":[72,244],"distinguishes":[74],"them.":[75],"In":[76,191,236],"this":[77,100,128],"paper,":[78],"we":[79,101,115,156,193,227,239],"introduce":[80,102,116,211],""directed"":[81],"versions":[82],"theorems":[85],"characterize":[87],"theory":[90,133,140,168,176],"one":[92],"state":[93],"included":[95,137,173],"other.":[98],"For":[99],""positive":[103],"logics"":[105],"only":[107],"allow":[108],"limited":[110],"use":[111],"negation.":[113],"Furthermore,":[114],"directed":[117,147,161,181,216,230],"bisimulation":[120,199],"apartness,":[122,155],"then":[124],"that,":[126],"for":[127],"positive":[129],"logic,":[131],"$s$":[135,145,159,170],"$t$":[142,164],"$t$.":[150,178],"Or,":[151],"from":[163],"not":[172],"From":[179],"theorem,":[186],"original":[188],"result":[189],"follows.":[190],"particular,":[192],"study":[194],"case":[196],"branching":[198,213,217],"Logic":[202,222],"with":[203,223],"Until":[204],"(HMLU)":[205],"logic.":[209],"We":[210],""directed":[212],"bisimulation"":[214],"(and":[215],"apartness)":[218],""Positive":[220],"Until"":[224],"(PHMLU)":[225],"theorems.":[235],"process,":[238],"every":[242],"HMLU":[243,253,268],"equivalent":[246],"Boolean":[249],"combination":[250],"Positive":[252],"formulas,":[254],"very":[258],"non-trivial":[259],"result.":[260],"This":[261],"sublogic":[266],"equally":[271],"expressive":[272],"but":[273],"easier":[274],"reason":[276],"about.":[277]},"counts_by_year":[],"updated_date":"2026-03-11T06:11:40.159057","created_date":"2025-10-29T00:00:00"}