{"id":"https://openalex.org/W2344990015","doi":"https://doi.org/10.23638/lmcs-14(2:8)2018","title":"Analyzing Timed Systems Using Tree Automata","display_name":"Analyzing Timed Systems Using Tree Automata","publication_year":2018,"publication_date":"2018-05-09","ids":{"openalex":"https://openalex.org/W2344990015","doi":"https://doi.org/10.23638/lmcs-14(2:8)2018","mag":"2344990015"},"language":"en","primary_location":{"id":"doi:10.23638/lmcs-14(2:8)2018","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-14(2:8)2018","pdf_url":"https://lmcs.episciences.org/4489/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":"preprint","indexed_in":["arxiv","crossref","datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/4489/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5063753055","display_name":"S. Akshay","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"S. Akshay","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064833291","display_name":"Paul Gastin","orcid":"https://orcid.org/0000-0002-1313-7722"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Paul Gastin","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5101833503","display_name":"Shankara Narayanan Krishna","orcid":"https://orcid.org/0000-0003-0925-398X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shankara Narayanan Krishna","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5063753055"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.2824,"has_fulltext":true,"cited_by_count":7,"citation_normalized_percentile":{"value":0.81149658,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"Volume 14, Issue 2","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":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/T11567","display_name":"semigroups and automata theory","score":0.9987000226974487,"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.9980999827384949,"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.76185142993927},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.7616614103317261},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.7002007961273193},{"id":"https://openalex.org/keywords/timed-automaton","display_name":"Timed automaton","score":0.6784563660621643},{"id":"https://openalex.org/keywords/nested-word","display_name":"Nested word","score":0.6042397618293762},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5565866827964783},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.5387682914733887},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5371212959289551},{"id":"https://openalex.org/keywords/pushdown-automaton","display_name":"Pushdown automaton","score":0.452613890171051},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.43073770403862},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.41601356863975525},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34217000007629395},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.2944100797176361},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20503461360931396}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.76185142993927},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.7616614103317261},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.7002007961273193},{"id":"https://openalex.org/C30788636","wikidata":"https://www.wikidata.org/wiki/Q7805517","display_name":"Timed automaton","level":3,"score":0.6784563660621643},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.6042397618293762},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5565866827964783},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.5387682914733887},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5371212959289551},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.452613890171051},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.43073770403862},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.41601356863975525},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34217000007629395},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.2944100797176361},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20503461360931396},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.23638/lmcs-14(2:8)2018","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-14(2:8)2018","pdf_url":"https://lmcs.episciences.org/4489/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:1604.08443","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1604.08443","pdf_url":"https://arxiv.org/pdf/1604.08443","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"doi:10.48550/arxiv.1604.08443","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1604.08443","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"},{"id":"doi:10.4230/lipics.concur.2016.27","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.concur.2016.27","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"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","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"doi:10.23638/lmcs-14(2:8)2018","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-14(2:8)2018","pdf_url":"https://lmcs.episciences.org/4489/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":[{"id":"https://openalex.org/G2963670993","display_name":null,"funder_award_id":"IFA12","funder_id":"https://openalex.org/F4320320719","funder_display_name":"Department of Science and Technology, Ministry of Science and Technology, India"},{"id":"https://openalex.org/G5570752017","display_name":null,"funder_award_id":"IFA12-MA-17","funder_id":"https://openalex.org/F4320320719","funder_display_name":"Department of Science and Technology, Ministry of Science and Technology, India"}],"funders":[{"id":"https://openalex.org/F4320320719","display_name":"Department of Science and Technology, Ministry of Science and Technology, India","ror":"https://ror.org/0101xrq71"},{"id":"https://openalex.org/F4320321027","display_name":"Indo-French Centre for the Promotion of Advanced Research","ror":"https://ror.org/017aem598"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2344990015.pdf","grobid_xml":"https://content.openalex.org/works/W2344990015.grobid-xml"},"referenced_works_count":16,"referenced_works":["https://openalex.org/W56613915","https://openalex.org/W153330214","https://openalex.org/W1524026935","https://openalex.org/W1962072139","https://openalex.org/W1976426006","https://openalex.org/W2083004834","https://openalex.org/W2092618327","https://openalex.org/W2101508170","https://openalex.org/W2103587987","https://openalex.org/W2107398710","https://openalex.org/W2120105239","https://openalex.org/W2133514269","https://openalex.org/W2165546792","https://openalex.org/W2267998239","https://openalex.org/W2541461689","https://openalex.org/W3145128584"],"related_works":["https://openalex.org/W1976426006","https://openalex.org/W190730148","https://openalex.org/W2160827412","https://openalex.org/W3021321801","https://openalex.org/W2128090891","https://openalex.org/W2046505442","https://openalex.org/W4206600150","https://openalex.org/W2036539537","https://openalex.org/W1855476678","https://openalex.org/W2250083056"],"abstract_inverted_index":{"Timed":[0],"systems,":[1,124],"such":[2,35,46,92],"as":[3,36,66,114],"timed":[4,14,21,47,64,109,122,141,144],"automata,":[5],"are":[6],"usually":[7],"analyzed":[8],"using":[9,49,97],"their":[10],"operational":[11],"semantics":[12],"on":[13,121,140],"words.":[15],"The":[16,58,100],"classical":[17],"region":[18],"abstraction":[19],"for":[20],"automata":[22,29,52,142],"reduces":[23],"them":[24],"to":[25,44,62,107],"(untimed)":[26],"finite":[27,50,55],"state":[28,37],"with":[30,68],"the":[31,119],"same":[32],"time-abstract":[33],"properties,":[34],"reachability.":[38],"We":[39],"propose":[40],"a":[41,75],"new":[42],"technique":[43,101,120],"analyze":[45],"systems":[48,147],"tree":[51,98],"instead":[53],"of":[54,77,91],"word":[56],"automata.":[57,99],"main":[59],"idea":[60],"is":[61,102],"consider":[63],"behaviors":[65],"graphs":[67,78,93],"matching":[69],"edges":[70],"capturing":[71],"timing":[72],"constraints.":[73],"When":[74],"family":[76],"has":[79],"bounded":[80],"tree-width,":[81],"they":[82],"can":[83,94,137],"be":[84,95],"interpreted":[85],"in":[86],"trees":[87],"and":[88,105,143],"MSO-definable":[89],"properties":[90],"checked":[96],"quite":[103],"general":[104],"applies":[106],"many":[108],"systems.":[110],"In":[111],"this":[112],"paper,":[113],"an":[115],"example,":[116],"we":[117,132,136],"develop":[118],"pushdown":[123,146],"which":[125],"have":[126],"recently":[127],"received":[128],"considerable":[129],"attention.":[130],"Further,":[131],"also":[133],"demonstrate":[134],"how":[135],"use":[138],"it":[139],"multi-stack":[145],"(with":[148],"boundedness":[149],"restrictions).":[150]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-04-16T08:26:57.006410","created_date":"2025-10-10T00:00:00"}