{"id":"https://openalex.org/W4415312050","doi":"https://doi.org/10.4230/lipics.csl.2026.23","title":"A Logic For Fresh Labelled Transition Systems","display_name":"A Logic For Fresh Labelled Transition Systems","publication_year":2025,"publication_date":"2025-06-17","ids":{"openalex":"https://openalex.org/W4415312050","doi":"https://doi.org/10.4230/lipics.csl.2026.23"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2506.14538","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2506.14538","pdf_url":"https://arxiv.org/pdf/2506.14538","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"type":"article","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2506.14538","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5064109122","display_name":"Mohamed H Bandukara","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Bandukara, Mohamed H.","raw_affiliation_strings":["Queen Mary University of London, UK"],"raw_orcid":"https://orcid.org/0009-0004-0181-5241","affiliations":[{"raw_affiliation_string":"Queen Mary University of London, UK","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041266426","display_name":"Nikos Tzevelekos","orcid":"https://orcid.org/0000-0001-8509-8059"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tzevelekos, Nikos","raw_affiliation_strings":["Queen Mary University of London, UK"],"raw_orcid":"https://orcid.org/0000-0001-8509-8059","affiliations":[{"raw_affiliation_string":"Queen Mary University of London, UK","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5064109122"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.41875965,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T13964","display_name":"Educational Technology and Optimization","score":0.09350000321865082,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T13964","display_name":"Educational Technology and Optimization","score":0.09350000321865082,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/recursion","display_name":"Recursion (computer science)","score":0.6331999897956848},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6223999857902527},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4805000126361847},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.45579999685287476},{"id":"https://openalex.org/keywords/transition-system","display_name":"Transition system","score":0.4465000033378601},{"id":"https://openalex.org/keywords/b\u00fcchi-automaton","display_name":"B\u00fcchi automaton","score":0.4415999948978424},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.421099990606308},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4154999852180481},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.41370001435279846}],"concepts":[{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.6331999897956848},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6323000192642212},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6223999857902527},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4805000126361847},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47780001163482666},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.45579999685287476},{"id":"https://openalex.org/C2779167558","wikidata":"https://www.wikidata.org/wiki/Q176468","display_name":"Transition system","level":2,"score":0.4465000033378601},{"id":"https://openalex.org/C165753454","wikidata":"https://www.wikidata.org/wiki/Q1020380","display_name":"B\u00fcchi automaton","level":4,"score":0.4415999948978424},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.421099990606308},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4154999852180481},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.41370001435279846},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.3953999876976013},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.39169999957084656},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39089998602867126},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.3652999997138977},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.3515999913215637},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34470000863075256},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.34290000796318054},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.33329999446868896},{"id":"https://openalex.org/C2778220771","wikidata":"https://www.wikidata.org/wiki/Q1522579","display_name":"Substitution (logic)","level":2,"score":0.31630000472068787},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.30219998955726624},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.2842999994754791},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2797999978065491},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.2727000117301941},{"id":"https://openalex.org/C16671368","wikidata":"https://www.wikidata.org/wiki/Q230885","display_name":"State diagram","level":3,"score":0.2705000042915344},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.266400009393692},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.2542000114917755},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.2506999969482422}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:arXiv.org:2506.14538","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2506.14538","pdf_url":"https://arxiv.org/pdf/2506.14538","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:drops-oai.dagstuhl.de:25447","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2026.23","pdf_url":null,"source":{"id":"https://openalex.org/S4306402524","display_name":"Leibniz-Zentrum f\u00fcr Informatik (Schloss Dagstuhl)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},{"id":"doi:10.48550/arxiv.2506.14538","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2506.14538","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"},{"id":"doi:10.4230/lipics.csl.2026.23","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.csl.2026.23","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2506.14538","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2506.14538","pdf_url":"https://arxiv.org/pdf/2506.14538","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4799976526","display_name":null,"funder_award_id":"DTP EP/R513106/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G7258775301","display_name":"DTP 2018-19 Queen Mary University of London","funder_award_id":"EP/R513106/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4415312050.pdf","grobid_xml":"https://content.openalex.org/works/W4415312050.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,134],"introduce":[1,68],"a":[2,54,70,97,125,143],"Hennessy-Milner":[3],"logic":[4,66],"with":[5,74],"recursion":[6,86],"for":[7,158],"Fresh":[8],"Labelled":[9],"Transition":[10],"Systems":[11],"(FLTSs).":[12],"These":[13],"are":[14,119],"nominal":[15,150],"labelled":[16],"transition":[17],"systems":[18],"which":[19,47],"keep":[20],"track":[21],"of":[22,26,44,57,91,99,105,109,115,124],"the":[23,42,103,113,122,136],"history,":[24],"i.e.":[25],"data":[27,36,81,92,111],"values":[28,82,118],"seen":[29,52],"so":[30],"far,":[31],"and":[32,79,139],"can":[33,50,95],"model":[34],"fresh":[35,80],"generation.":[37],"In":[38],"particular,":[39],"FLTSs":[40],"generalise":[41],"computations":[43],"Fresh-Register":[45],"Automata,":[46],"in":[48],"turn":[49],"be":[51],"as":[53,102],"\"regular\"":[55],"class":[56],"history-tracking":[58],"automata":[59],"operating":[60],"on":[61,89],"infinite":[62,75,107],"input":[63],"alphabets.":[64],"The":[65],"we":[67],"is":[69,87,132],"modal":[71],"mu-calculus":[72],"equipped":[73],"disjunctions":[76],"over":[77],"arbitrary":[78],"respectively,":[83],"while":[84],"its":[85,140],"parameterised":[88],"vectors":[90],"values.":[93],"It":[94],"express":[96],"variety":[98],"properties,":[100],"such":[101],"existence":[104,123],"an":[106,154],"path":[108,127],"distinct":[110],"values,":[112],"absence":[114],"paths":[116],"where":[117,128],"repeated,":[120],"or":[121],"finite":[126],"some":[129],"taint":[130],"property":[131],"violated.":[133],"study":[135],"model-checking":[137],"problem":[138],"complexity":[141],"via":[142],"reduction":[144],"to":[145],"parity":[146],"games":[147],"and,":[148],"using":[149],"sets":[151],"techniques,":[152],"provide":[153],"exponential":[155],"upper":[156],"bound":[157],"it.":[159]},"counts_by_year":[],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2025-10-18T00:00:00"}