{"id":"https://openalex.org/W2135205066","doi":"https://doi.org/10.1109/time.2003.1214889","title":"Towards symbolic strategy synthesis for >>A<<-LTL","display_name":"Towards symbolic strategy synthesis for >>A<<-LTL","publication_year":2004,"publication_date":"2004-01-24","ids":{"openalex":"https://openalex.org/W2135205066","doi":"https://doi.org/10.1109/time.2003.1214889","mag":"2135205066"},"language":"en","primary_location":{"id":"doi:10.1109/time.2003.1214889","is_oa":false,"landing_page_url":"https://doi.org/10.1109/time.2003.1214889","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"10th International Symposium on Temporal Representation and Reasoning, 2003 and Fourth International Conference on Temporal Logic. Proceedings.","raw_type":"proceedings-article"},"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":"https://openalex.org/A5076774632","display_name":"Aidan Harding","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"A. Harding","raw_affiliation_strings":["School of Computer Science, University of Binningham, Birmingham, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, University of Binningham, Birmingham, UK","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055690957","display_name":"Mark Ryan","orcid":"https://orcid.org/0000-0002-1632-497X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"M. Ryan","raw_affiliation_strings":["School of Computer Science, University of Binningham, Birmingham, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, University of Binningham, Birmingham, UK","institution_ids":[]}]},{"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":"P.-Y. Schobbens","raw_affiliation_strings":["Institut d'Informatique, Universitaires de Namur, Namur, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut d'Informatique, Universitaires de Namur, Namur, Belgium","institution_ids":["https://openalex.org/I149768937"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.15758798,"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":"137","last_page":"146"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998000264167786,"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.9998000264167786,"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.9991999864578247,"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9958000183105469,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/game-semantics","display_name":"Game semantics","score":0.7472526431083679},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.6476417779922485},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6387008428573608},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5830811858177185},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4404889941215515},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.42120489478111267},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.38048285245895386},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3483303189277649},{"id":"https://openalex.org/keywords/operational-semantics","display_name":"Operational semantics","score":0.2758631706237793},{"id":"https://openalex.org/keywords/denotational-semantics","display_name":"Denotational semantics","score":0.08198931813240051}],"concepts":[{"id":"https://openalex.org/C9672783","wikidata":"https://www.wikidata.org/wiki/Q65122115","display_name":"Game semantics","level":5,"score":0.7472526431083679},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.6476417779922485},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6387008428573608},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5830811858177185},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4404889941215515},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.42120489478111267},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.38048285245895386},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3483303189277649},{"id":"https://openalex.org/C156325763","wikidata":"https://www.wikidata.org/wiki/Q1930895","display_name":"Operational semantics","level":3,"score":0.2758631706237793},{"id":"https://openalex.org/C207648694","wikidata":"https://www.wikidata.org/wiki/Q1189746","display_name":"Denotational semantics","level":4,"score":0.08198931813240051}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/time.2003.1214889","is_oa":false,"landing_page_url":"https://doi.org/10.1109/time.2003.1214889","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"10th International Symposium on Temporal Representation and Reasoning, 2003 and Fourth International Conference on Temporal Logic. Proceedings.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1503170978","https://openalex.org/W1540180960","https://openalex.org/W1573354578","https://openalex.org/W2019881090","https://openalex.org/W2061438988","https://openalex.org/W2072887965","https://openalex.org/W2111715088","https://openalex.org/W2124110813","https://openalex.org/W4300021588","https://openalex.org/W6655221434","https://openalex.org/W6665773200"],"related_works":["https://openalex.org/W4231937131","https://openalex.org/W323219885","https://openalex.org/W2063928587","https://openalex.org/W1487966966","https://openalex.org/W2107831658","https://openalex.org/W2097622502","https://openalex.org/W1516969118","https://openalex.org/W4403305777","https://openalex.org/W2012369158","https://openalex.org/W2982674701"],"abstract_inverted_index":{"We":[0],"provide":[1,70],"a":[2,45,64,81,113],"symbolic":[3],"algorithm":[4,41,107],"for":[5,22,52,83],"synthesizing":[6],"winning":[7],"strategies":[8],"in":[9,115],"Alternating":[10],"Time":[11],"Temporal":[12],"Logic.":[13],"ATL":[14],"has":[15],"game":[16],"semantics,":[17],"which":[18,53,69],"makes":[19],"it":[20],"suitable":[21],"modeling":[23],"open":[24],"systems":[25],"where":[26],"coalitions":[27],"of":[28,39,49,66,112],"agents":[29],"work":[30,114],"together":[31],"to":[32,56,85,101],"achieve":[33],"their":[34],"goals.":[35],"A":[36,84,91],"typical":[37],"use":[38],"the":[40,96,103],"would":[42],"begin":[43],"with":[44,63],"highly":[46],"non-deterministic":[47],"set":[48,65],"agents,":[50,68],"A,":[51],"we":[54],"wish":[55],"synthesize":[57],"behavior.":[58],"These":[59],"may":[60],"be":[61,99,120],"composed":[62],"opponent":[67],"an":[71],"environment.":[72],"The":[73,106],"desired":[74,104],"behavior":[75],"is":[76,88,110],"then":[77,95],"written":[78],"in>-LTL,":[79],"and":[80,117],"strategy":[82],"implement":[86],"this":[87,93],"synthesized.":[89],"If":[90],"implements":[92],"strategy,":[94],"system":[97],"will":[98],"guaranteed":[100],"satisfy":[102],"property.":[105],"presented":[108],"here":[109],"part":[111],"progress":[116],"updates":[118],"can":[119],"found":[121],"at":[122],"http://www.cs.bham.ac.uk/":[123],"/spl":[124],"sim/":[125],"ath/atl/spl":[126],"I.bar/synthesis.":[127]},"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-10-10T00:00:00"}