{"id":"https://openalex.org/W2624809536","doi":"https://doi.org/10.2168/lmcs-9(1:6)2013","title":"Coarse abstractions make Zeno behaviours difficult to detect","display_name":"Coarse abstractions make Zeno behaviours difficult to detect","publication_year":2013,"publication_date":"2013-02-27","ids":{"openalex":"https://openalex.org/W2624809536","doi":"https://doi.org/10.2168/lmcs-9(1:6)2013","mag":"2624809536"},"language":"en","primary_location":{"id":"doi:10.2168/lmcs-9(1:6)2013","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-9(1:6)2013","pdf_url":"https://lmcs.episciences.org/882/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/882/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5011012804","display_name":"Fr\u00e9d\u00e9ric Herbreteau","orcid":"https://orcid.org/0000-0002-1029-2356"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I15057530","display_name":"Universit\u00e9 de Bordeaux","ror":"https://ror.org/057qpr032","country_code":"FR","type":"education","lineage":["https://openalex.org/I15057530"]},{"id":"https://openalex.org/I4210142254","display_name":"Laboratoire Bordelais de Recherche en Informatique","ror":"https://ror.org/03adqg323","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I15057530","https://openalex.org/I4210142254","https://openalex.org/I4210159245","https://openalex.org/I4210160189"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Fr\u00e9d\u00e9ric Herbreteau","raw_affiliation_strings":["Univ. Bordeaux, CNRS, LaBRI, UMR 5800, F-33400 Talence, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Univ. Bordeaux, CNRS, LaBRI, UMR 5800, F-33400 Talence, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I15057530","https://openalex.org/I4210142254"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047476786","display_name":"B. Srivathsan","orcid":"https://orcid.org/0000-0003-2666-0691"},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"B Srivathsan","raw_affiliation_strings":["Software Modeling and Verification group, RWTH Aachen University, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Software Modeling and Verification group, RWTH Aachen University, Germany","institution_ids":["https://openalex.org/I887968799"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.28509077,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"Volume 9, Issue 1","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":1.0,"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":1.0,"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.9979000091552734,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9973999857902527,"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/extrapolation","display_name":"Extrapolation","score":0.8888165950775146},{"id":"https://openalex.org/keywords/zenos-paradoxes","display_name":"Zeno's paradoxes","score":0.8444690704345703},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.7991666793823242},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7149577736854553},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6771690845489502},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.5275033712387085},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4693242907524109},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44884854555130005},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.4423360824584961},{"id":"https://openalex.org/keywords/timed-automaton","display_name":"Timed automaton","score":0.43581146001815796},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.41234204173088074},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30340278148651123}],"concepts":[{"id":"https://openalex.org/C132459708","wikidata":"https://www.wikidata.org/wiki/Q744069","display_name":"Extrapolation","level":2,"score":0.8888165950775146},{"id":"https://openalex.org/C7707877","wikidata":"https://www.wikidata.org/wiki/Q33378","display_name":"Zeno's paradoxes","level":2,"score":0.8444690704345703},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.7991666793823242},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7149577736854553},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6771690845489502},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.5275033712387085},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4693242907524109},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44884854555130005},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.4423360824584961},{"id":"https://openalex.org/C30788636","wikidata":"https://www.wikidata.org/wiki/Q7805517","display_name":"Timed automaton","level":3,"score":0.43581146001815796},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41234204173088074},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30340278148651123},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.2168/lmcs-9(1:6)2013","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-9(1:6)2013","pdf_url":"https://lmcs.episciences.org/882/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1106.1850","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1106.1850","pdf_url":"https://arxiv.org/pdf/1106.1850","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:doaj.org/article:996c3ac0062d45289a9f6298a2b2dfb5","is_oa":true,"landing_page_url":"https://doaj.org/article/996c3ac0062d45289a9f6298a2b2dfb5","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","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":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 9, Issue 1 (2013)","raw_type":"article"},{"id":"doi:10.18154/rwth-conv-074381","is_oa":true,"landing_page_url":"https://doi.org/10.18154/rwth-conv-074381","pdf_url":null,"source":{"id":"https://openalex.org/S4306401033","display_name":"RWTH Publications (RWTH Aachen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887968799","host_organization_name":"RWTH Aachen University","host_organization_lineage":["https://openalex.org/I887968799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"doi:10.2168/lmcs-9(1:6)2013","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-9(1:6)2013","pdf_url":"https://lmcs.episciences.org/882/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"},{"id":"https://openalex.org/F4320322771","display_name":"Secret\u00e1rio de Ci\u00eancia, Tecnologia e Ensino Superior, Governo do Estado de Parana","ror":"https://ror.org/05nyhnc56"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2624809536.pdf","grobid_xml":"https://content.openalex.org/works/W2624809536.grobid-xml"},"referenced_works_count":18,"referenced_works":["https://openalex.org/W85611312","https://openalex.org/W1482233117","https://openalex.org/W1482486776","https://openalex.org/W1603296878","https://openalex.org/W1977308797","https://openalex.org/W2002089154","https://openalex.org/W2007490191","https://openalex.org/W2079649539","https://openalex.org/W2091971051","https://openalex.org/W2101508170","https://openalex.org/W2112744184","https://openalex.org/W2132976180","https://openalex.org/W2142718416","https://openalex.org/W2169586608","https://openalex.org/W3125449943","https://openalex.org/W4233777324","https://openalex.org/W4300592141","https://openalex.org/W4302339081"],"related_works":["https://openalex.org/W2884574904","https://openalex.org/W2283019860","https://openalex.org/W1977622287","https://openalex.org/W2079649539","https://openalex.org/W1565729639","https://openalex.org/W1485850862","https://openalex.org/W1750615905","https://openalex.org/W2103488150","https://openalex.org/W1554767603","https://openalex.org/W4285057385"],"abstract_inverted_index":{"An":[0],"infinite":[1],"run":[2],"of":[3,16,57,76,84,102,110],"a":[4,13,98,107],"timed":[5,51],"automaton":[6],"is":[7,26],"Zeno":[8,65],"if":[9],"it":[10,25],"spans":[11],"only":[12],"finite":[14],"amount":[15],"time.":[17],"Such":[18],"runs":[19,34,66],"are":[20,36],"considered":[21],"unfeasible":[22],"and":[23,89],"hence":[24],"important":[27,41],"to":[28],"detect":[29],"them,":[30],"or":[31],"dually,":[32],"find":[33],"that":[35,55,96,113],"non-Zeno.":[37],"Over":[38],"the":[39,74,82,111],"years":[40],"improvements":[42],"have":[43],"been":[44],"obtained":[45],"in":[46,87],"checking":[47],"reachability":[48],"properties":[49],"for":[50,64,73],"automata.":[52],"We":[53,80,105],"show":[54,71],"some":[56],"these":[58,115],"very":[59],"efficient":[60],"optimizations":[61],"make":[62],"testing":[63],"costly.":[67],"In":[68],"particular":[69],"we":[70],"NP-completeness":[72],"LU-extrapolation":[75,112],"Behrmann":[77],"et":[78],"al.":[79],"analyze":[81],"source":[83],"this":[85],"complexity":[86,101],"detail":[88],"give":[90],"general":[91],"conditions":[92],"on":[93],"extrapolation":[94],"operators":[95],"guarantee":[97],"(low)":[99],"polynomial":[100],"Zenoness":[103],"checking.":[104],"propose":[106],"slight":[108],"weakening":[109],"satisfies":[114],"conditions.":[116]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-08-05T07:39:15.569665","created_date":"2019-06-27T00:00:00"}