{"id":"https://openalex.org/W2945441728","doi":"https://doi.org/10.1109/rivf.2019.8713701","title":"The Logic of Temporal Domination","display_name":"The Logic of Temporal Domination","publication_year":2019,"publication_date":"2019-03-01","ids":{"openalex":"https://openalex.org/W2945441728","doi":"https://doi.org/10.1109/rivf.2019.8713701","mag":"2945441728"},"language":"en","primary_location":{"id":"doi:10.1109/rivf.2019.8713701","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rivf.2019.8713701","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE-RIVF International Conference on Computing and Communication Technologies (RIVF)","raw_type":"proceedings-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/A5086903137","display_name":"Thomas Studer","orcid":"https://orcid.org/0000-0002-0949-3302"},"institutions":[{"id":"https://openalex.org/I118564535","display_name":"University of Bern","ror":"https://ror.org/02k7v4d05","country_code":"CH","type":"education","lineage":["https://openalex.org/I118564535"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Thomas Studer","raw_affiliation_strings":["Institut f\u00fcr Informatik, Universit\u00e4t Bern, Bern, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t Bern, Bern, Switzerland","institution_ids":["https://openalex.org/I118564535"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5086903137"],"corresponding_institution_ids":["https://openalex.org/I118564535"],"apc_list":null,"apc_paid":null,"fwci":0.1926,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.51707201,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"4"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9995999932289124,"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.9995999932289124,"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/T11567","display_name":"semigroups and automata theory","score":0.9988999962806702,"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.9987999796867371,"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/computer-science","display_name":"Computer science","score":0.5837255120277405}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5837255120277405}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/rivf.2019.8713701","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rivf.2019.8713701","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE-RIVF International Conference on Computing and Communication Technologies (RIVF)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.587.8519","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.587.8519","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.iam.unibe.ch/~tstuder/papers/PSI2014.pdf","raw_type":"text"},{"id":"pmh:oai:boris.unibe.ch:133988","is_oa":false,"landing_page_url":"https://boris.unibe.ch/133988/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401086","display_name":"Bern Open Repository and Information System (University of Bern)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I118564535","host_organization_name":"University of Bern","host_organization_lineage":["https://openalex.org/I118564535"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Studer, Thomas (March 2019). The Logic of Temporal Domination. In: RIVF 2019. Proceedings (pp. 1-4). IEEE 10.1109/RIVF.2019.8713701 <http://dx.doi.org/10.1109/RIVF.2019.8713701>","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4699999988079071,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1560050980","https://openalex.org/W1612453857","https://openalex.org/W1987027130","https://openalex.org/W2002089154","https://openalex.org/W2023808162","https://openalex.org/W2049848227","https://openalex.org/W2061970672","https://openalex.org/W2081320746","https://openalex.org/W2138856440","https://openalex.org/W2396555304","https://openalex.org/W2798623107","https://openalex.org/W4302339081"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W4396696052","https://openalex.org/W4402327032","https://openalex.org/W2382290278"],"abstract_inverted_index":{"In":[0,68],"this":[1,72],"short":[2],"note,":[3],"we":[4,74],"are":[5],"concerned":[6],"with":[7],"the":[8,25,34,41,77],"fairness":[9],"condition":[10,43],"\u201cA":[11],"and":[12,23,30,50,55],"B":[13],"hold":[14],"almost":[15],"equally":[16],"often\u201d,":[17],"which":[18,40],"is":[19,59],"important":[20],"for":[21,80],"specifying":[22],"verifying":[24],"correctness":[26],"of":[27,36,52,63],"nonterminating":[28],"processes":[29],"protocols.":[31],"We":[32,47],"introduce":[33],"logic":[35,54],"temporal":[37,66],"domination,":[38],"in":[39],"above":[42],"can":[44],"be":[45],"expressed.":[46],"present":[48],"syntax":[49],"semantics":[51],"our":[53],"show":[56],"that":[57],"it":[58],"a":[60],"proper":[61],"extension":[62],"linear":[64],"time":[65],"logic.":[67],"order":[69],"to":[70],"obtain":[71],"result,":[73],"rely":[75],"on":[76],"corresponding":[78],"result":[79],"k-counting":[81],"automata.":[82]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2026-07-02T09:51:11.867554","created_date":"2025-10-10T00:00:00"}