{"id":"https://openalex.org/W45450336","doi":"https://doi.org/10.1007/978-3-319-10512-3_6","title":"On MITL and Alternating Timed Automata over Infinite Words","display_name":"On MITL and Alternating Timed Automata over Infinite Words","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W45450336","doi":"https://doi.org/10.1007/978-3-319-10512-3_6","mag":"45450336"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-10512-3_6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-10512-3_6","pdf_url":null,"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":null,"license_id":null,"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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5070197309","display_name":"Thomas Brihaye","orcid":"https://orcid.org/0000-0001-5763-3130"},"institutions":[{"id":"https://openalex.org/I130929987","display_name":"University of Mons","ror":"https://ror.org/02qnnz951","country_code":"BE","type":"education","lineage":["https://openalex.org/I130929987"]}],"countries":["BE"],"is_corresponding":true,"raw_author_name":"Thomas Brihaye","raw_affiliation_strings":["Universit\u00e9 de Mons, Belgium"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 de Mons, Belgium","institution_ids":["https://openalex.org/I130929987"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058564780","display_name":"Morgane Esti\u00e9venart","orcid":null},"institutions":[{"id":"https://openalex.org/I130929987","display_name":"University of Mons","ror":"https://ror.org/02qnnz951","country_code":"BE","type":"education","lineage":["https://openalex.org/I130929987"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Morgane Esti\u00e9venart","raw_affiliation_strings":["Universit\u00e9 de Mons, Belgium"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 de Mons, Belgium","institution_ids":["https://openalex.org/I130929987"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108492834","display_name":"Gilles Geeraerts","orcid":null},"institutions":[{"id":"https://openalex.org/I132053463","display_name":"Universit\u00e9 Libre de Bruxelles","ror":"https://ror.org/01r9htc13","country_code":"BE","type":"education","lineage":["https://openalex.org/I132053463"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Gilles Geeraerts","raw_affiliation_strings":["Universit\u00e9 libre de Bruxelles, Belgium"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 libre de Bruxelles, Belgium","institution_ids":["https://openalex.org/I132053463"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5070197309"],"corresponding_institution_ids":["https://openalex.org/I130929987"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.0021,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.85163622,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"69","last_page":"84"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998999834060669,"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.9998999834060669,"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9965999722480774,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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.9944000244140625,"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.7942793369293213},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.7693697214126587},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.7456216812133789},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.7234025597572327},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.6840538382530212},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.5271320343017578},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.518846869468689},{"id":"https://openalex.org/keywords/timed-automaton","display_name":"Timed automaton","score":0.46380993723869324},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4604862630367279},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.44724929332733154},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.42734652757644653},{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.426797479391098},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3882415294647217},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1606992483139038},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.09630441665649414}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7942793369293213},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.7693697214126587},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.7456216812133789},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.7234025597572327},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.6840538382530212},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.5271320343017578},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.518846869468689},{"id":"https://openalex.org/C30788636","wikidata":"https://www.wikidata.org/wiki/Q7805517","display_name":"Timed automaton","level":3,"score":0.46380993723869324},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4604862630367279},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.44724929332733154},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.42734652757644653},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.426797479391098},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3882415294647217},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1606992483139038},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.09630441665649414}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-319-10512-3_6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-10512-3_6","pdf_url":null,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.44999998807907104,"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W203832094","https://openalex.org/W1587385873","https://openalex.org/W1775249002","https://openalex.org/W1944332274","https://openalex.org/W1983559036","https://openalex.org/W2022782983","https://openalex.org/W2026629052","https://openalex.org/W2049696538","https://openalex.org/W2050073538","https://openalex.org/W2059045337","https://openalex.org/W2089003125","https://openalex.org/W2101508170","https://openalex.org/W2102380292","https://openalex.org/W2127101272","https://openalex.org/W2153485994","https://openalex.org/W2340735175","https://openalex.org/W2396245196","https://openalex.org/W2952315117","https://openalex.org/W3023191323","https://openalex.org/W3098270706","https://openalex.org/W3104737963"],"related_works":["https://openalex.org/W3176904788","https://openalex.org/W21597398","https://openalex.org/W3200370358","https://openalex.org/W2091617677","https://openalex.org/W4298153058","https://openalex.org/W4296306758","https://openalex.org/W2408080066","https://openalex.org/W1913543287","https://openalex.org/W2268872489","https://openalex.org/W4281812495"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}