{"id":"https://openalex.org/W1489950854","doi":"https://doi.org/10.1007/3-540-47813-2_20","title":"Approximating ATL* in ATL","display_name":"Approximating ATL* in ATL","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W1489950854","doi":"https://doi.org/10.1007/3-540-47813-2_20","mag":"1489950854"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-47813-2_20","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-47813-2_20","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":"conference-paper","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":null,"display_name":"Aidan Harding","orcid":null},"institutions":[{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"education","lineage":["https://openalex.org/I79619799"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Aidan Harding","raw_affiliation_strings":["School of Computer Science, University of Birmingham, B15 2TT, Edgbaston, Birmingham, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, University of Birmingham, B15 2TT, Edgbaston, Birmingham, UK","institution_ids":["https://openalex.org/I79619799"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055690957","display_name":"Mark Ryan","orcid":"https://orcid.org/0000-0002-1632-497X"},"institutions":[{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"education","lineage":["https://openalex.org/I79619799"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Mark Ryan","raw_affiliation_strings":["School of Computer Science, University of Birmingham, B15 2TT, Edgbaston, Birmingham, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, University of Birmingham, B15 2TT, Edgbaston, Birmingham, UK","institution_ids":["https://openalex.org/I79619799"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011513275","display_name":"Pierre\u2010Yves Schobbens","orcid":"https://orcid.org/0000-0001-8677-4485"},"institutions":[{"id":"https://openalex.org/I149768937","display_name":"University of Namur","ror":"https://ror.org/03d1maw17","country_code":"BE","type":"education","lineage":["https://openalex.org/I149768937"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Pierre-Yves Schobbens","raw_affiliation_strings":["Institut d\u2019Informatique, Facult\u00e9s Universitaires de Namur, Rue Grandgagnage 21, 5000, Namur, Belgium","Institut d'Informatique, Facult\u00e9s Universitaires de Namur, Rue Grandgagnage 21, 5000, Namur, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut d\u2019Informatique, Facult\u00e9s Universitaires de Namur, Rue Grandgagnage 21, 5000, Namur, Belgium","institution_ids":["https://openalex.org/I149768937"]},{"raw_affiliation_string":"Institut d'Informatique, Facult\u00e9s Universitaires de Namur, Rue Grandgagnage 21, 5000, Namur, Belgium","institution_ids":["https://openalex.org/I149768937"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.7703,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.65343429,"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":"289","last_page":"301"},"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.9988999962806702,"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.998199999332428,"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.6749576926231384},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.5715424418449402},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.568448543548584},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.511601984500885},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4940245747566223},{"id":"https://openalex.org/keywords/composition","display_name":"Composition (language)","score":0.45071941614151},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.4292723536491394},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4278603196144104},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32300442457199097},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.14540937542915344},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.04895550012588501}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6749576926231384},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.5715424418449402},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.568448543548584},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.511601984500885},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4940245747566223},{"id":"https://openalex.org/C40231798","wikidata":"https://www.wikidata.org/wiki/Q1333743","display_name":"Composition (language)","level":2,"score":0.45071941614151},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.4292723536491394},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4278603196144104},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32300442457199097},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.14540937542915344},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.04895550012588501},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/3-540-47813-2_20","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-47813-2_20","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"},{"id":"pmh:oai:pure.unamur.be:openaire_cris_publications/51f4f08e-2b29-49ba-88f5-3444e8be3666","is_oa":false,"landing_page_url":"https://researchportal.unamur.be/en/publications/51f4f08e-2b29-49ba-88f5-3444e8be3666","pdf_url":null,"source":{"id":"https://openalex.org/S4406922457","display_name":"Repository of the University of Namur","issn_l":null,"issn":null,"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Harding, A, Ryan, M & Schobbens, P-Y 2002, Approximating ATL* in ATL. in T Cortesi (ed.), Proceedings of the Third International Workshop on Verification, Model Checking, and Abstract Interpretation, VMCAI02, Venice. vol. 2294, pp. 289-301.","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1489630028","https://openalex.org/W1507116188","https://openalex.org/W1996832037","https://openalex.org/W2030926579","https://openalex.org/W2067441543","https://openalex.org/W2124110813","https://openalex.org/W2155470936","https://openalex.org/W2571737579"],"related_works":["https://openalex.org/W1551070491","https://openalex.org/W2034301573","https://openalex.org/W1592102986","https://openalex.org/W2350953867","https://openalex.org/W2103740034","https://openalex.org/W2166027622","https://openalex.org/W2612218842","https://openalex.org/W1513903619","https://openalex.org/W2203774400","https://openalex.org/W2157373800"],"abstract_inverted_index":null,"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-10-10T00:00:00"}