{"id":"https://openalex.org/W7111312972","doi":"https://doi.org/10.4230/lipics.fsttcs.2025.14","title":"Regulating Synchronous Data Exchange to Meet Control Flow and Data Specifications","display_name":"Regulating Synchronous Data Exchange to Meet Control Flow and Data Specifications","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W7111312972","doi":"https://doi.org/10.4230/lipics.fsttcs.2025.14"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25096","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2025.14","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol360-fsttcs2025/LIPIcs.FSTTCS.2025.14/LIPIcs.FSTTCS.2025.14.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","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"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol360-fsttcs2025/LIPIcs.FSTTCS.2025.14/LIPIcs.FSTTCS.2025.14.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Bhaskar, Ashwin","orcid":"https://orcid.org/0000-0002-7989-9279"},"institutions":[{"id":"https://openalex.org/I19149307","display_name":"Chennai Mathematical Institute","ror":"https://ror.org/04zp24820","country_code":"IN","type":"education","lineage":["https://openalex.org/I19149307"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Bhaskar, Ashwin","raw_affiliation_strings":["Chennai Mathematical Institute, India"],"affiliations":[{"raw_affiliation_string":"Chennai Mathematical Institute, India","institution_ids":["https://openalex.org/I19149307"]}]},{"author_position":"last","author":{"id":null,"display_name":"Praveen, M.","orcid":"https://orcid.org/0000-0002-5734-7115"},"institutions":[{"id":"https://openalex.org/I19149307","display_name":"Chennai Mathematical Institute","ror":"https://ror.org/04zp24820","country_code":"IN","type":"education","lineage":["https://openalex.org/I19149307"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Praveen, M.","raw_affiliation_strings":["Chennai Mathematical Institute, India","CNRS IRL ReLaX, Chennai, India"],"affiliations":[{"raw_affiliation_string":"Chennai Mathematical Institute, India","institution_ids":["https://openalex.org/I19149307"]},{"raw_affiliation_string":"CNRS IRL ReLaX, Chennai, India","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I19149307"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.68872625,"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/T10142","display_name":"Formal Methods in Verification","score":0.7918000221252441,"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.7918000221252441,"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.08399999886751175,"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/T11424","display_name":"Security and Verification in Computing","score":0.05290000140666962,"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/decidability","display_name":"Decidability","score":0.7924000024795532},{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.7475000023841858},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5843999981880188},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5809000134468079},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5404999852180481},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.4952999949455261},{"id":"https://openalex.org/keywords/interface","display_name":"Interface (matter)","score":0.4693000018596649},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.41130000352859497},{"id":"https://openalex.org/keywords/base","display_name":"Base (topology)","score":0.36390000581741333}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.7924000024795532},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.7475000023841858},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6291000247001648},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5843999981880188},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5809000134468079},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5404999852180481},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.4952999949455261},{"id":"https://openalex.org/C113843644","wikidata":"https://www.wikidata.org/wiki/Q901882","display_name":"Interface (matter)","level":4,"score":0.4693000018596649},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.46140000224113464},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.41130000352859497},{"id":"https://openalex.org/C42058472","wikidata":"https://www.wikidata.org/wiki/Q810214","display_name":"Base (topology)","level":2,"score":0.36390000581741333},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.3515999913215637},{"id":"https://openalex.org/C160191386","wikidata":"https://www.wikidata.org/wiki/Q868299","display_name":"Control flow","level":2,"score":0.32190001010894775},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3034999966621399},{"id":"https://openalex.org/C20136886","wikidata":"https://www.wikidata.org/wiki/Q749647","display_name":"Interoperability","level":2,"score":0.3012000024318695},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.2989000082015991},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.2888000011444092},{"id":"https://openalex.org/C165753454","wikidata":"https://www.wikidata.org/wiki/Q1020380","display_name":"B\u00fcchi automaton","level":4,"score":0.28130000829696655},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28029999136924744},{"id":"https://openalex.org/C204495577","wikidata":"https://www.wikidata.org/wiki/Q1205349","display_name":"Callback","level":2,"score":0.27799999713897705},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.2696000039577484},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.26739999651908875},{"id":"https://openalex.org/C159023740","wikidata":"https://www.wikidata.org/wiki/Q623276","display_name":"Deadlock","level":2,"score":0.260699987411499},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.260699987411499},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2590000033378601},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.25760000944137573}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:25096","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2025.14","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol360-fsttcs2025/LIPIcs.FSTTCS.2025.14/LIPIcs.FSTTCS.2025.14.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","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.4230/lipics.fsttcs.2025.14","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.fsttcs.2025.14","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:drops-oai.dagstuhl.de:25096","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2025.14","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol360-fsttcs2025/LIPIcs.FSTTCS.2025.14/LIPIcs.FSTTCS.2025.14.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","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"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.4156314432621002,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320322753","display_name":"Infosys Foundation","ror":"https://ror.org/03bs18y54"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7111312972.pdf","grobid_xml":"https://content.openalex.org/works/W7111312972.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"When":[0],"multiple":[1],"software":[2],"components":[3],"interact":[4],"via":[5,289],"method":[6,51,146],"calls,":[7],"we":[8],"may":[9],"want":[10],"to":[11,24,44,70,152,169,175,234,251,266,277,312],"ensure":[12],"that":[13,54,135,183,193,256,271,302],"the":[14,20,36,62,93,103,113,127,131,143,149,164,188,194,213,226,262,278,306,316],"order":[15,110,237],"of":[16,38,133,142,145,157],"invoked":[17,124],"methods":[18,118],"and":[19,81,89,148],"arguments":[21,150],"provided":[22],"adhere":[23],"some":[25],"specification.":[26,190],"The":[27],"classic":[28],"problem":[29,196,242],"associated":[30],"with":[31,108],"interface":[32,66],"automata":[33,104],"checks":[34],"for":[35,305,315],"existence":[37],"a":[39,47,86,98,181,244,282,290,296],"mediator":[40],"whose":[41],"intention":[42],"is":[43,168,173,197,275],"act":[45],"as":[46,243],"buffer":[48],"in":[49,102,179,199,212,295],"between":[50,246],"invocations":[52,55,134],"so":[53],"do":[56],"not":[57,122],"go":[58],"unanswered.":[59],"We":[60,138,162,191,209,239,285,299],"extend":[61],"base":[63],"model":[64,240],"underlying":[65],"automata,":[67],"enabling":[68],"them":[69,153],"exchange":[71],"integer":[72,79,177,253],"values":[73,129,178,254],"-":[74],"one":[75,249],"automaton":[76,91],"generates":[77],"an":[78,155],"value":[80,94,228],"outputs":[82],"it":[83,172],"by":[84,95],"firing":[85,97],"generating":[87,218],"transition":[88],"another":[90],"receives":[92],"synchronously":[96],"receiving":[99,230],"transition.":[100],"Transitions":[101],"can":[105,119,121,220,232,309],"have":[106,222,235],"guards":[107,216],"linear":[109,236],"constraints":[111,224],"on":[112,217,225],"exchanged":[114,227],"values,":[115],"influencing":[116],"which":[117,167,293],"or":[120],"be":[123,310],"later.":[125],"So":[126],"generated":[128],"influence":[130],"sequences":[132,186,258,270],"are":[136,204,259,272],"enabled.":[137,273],"specify":[139],"desirable":[140],"properties":[141],"sequence":[144],"calls":[147],"passed":[151],"using":[154],"extension":[156],"Linear":[158],"Temporal":[159],"Logic":[160],"(LTL).":[161],"consider":[163],"interoperability":[165,195],"problem,":[166],"check":[170],"if":[171],"possible":[174],"generate":[176,252],"such":[180,255],"way":[182],"all":[184],"enabled":[185],"satisfy":[187],"given":[189],"show":[192,210,301],"undecidable":[198],"general,":[200],"even":[201],"when":[202],"there":[203],"only":[205,221],"two":[206,247],"participating":[207],"automata.":[208],"decidability":[211],"case":[214],"where":[215],"transitions":[219,231],"equality":[223],"(but":[229],"continue":[233],"constraints).":[238],"this":[241,287],"game":[245,288,308,318],"players,":[248],"trying":[250],"violating":[257,269],"disabled":[260],"while":[261],"other":[263],"player":[264,280],"tries":[265],"dig":[267],"out":[268],"Interoperability":[274],"equivalent":[276],"first":[279],"having":[281],"winning":[283,303,313],"strategy.":[284],"solve":[286],"finite":[291],"abstraction,":[292],"results":[294],"symbolic":[297,307],"game.":[298],"then":[300],"strategies":[304,314],"translated":[311],"original":[317],"over":[319],"integers.":[320]},"counts_by_year":[],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-12-10T00:00:00"}