{"id":"https://openalex.org/W1647694692","doi":"https://doi.org/10.1007/978-3-642-15349-5_2","title":"Symbolic and Compositional Reachability for Timed Automata","display_name":"Symbolic and Compositional Reachability for Timed Automata","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W1647694692","doi":"https://doi.org/10.1007/978-3-642-15349-5_2","mag":"1647694692"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-15349-5_2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-15349-5_2","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/A5069362159","display_name":"Kim G. Larsen","orcid":"https://orcid.org/0000-0002-5953-3384"},"institutions":[{"id":"https://openalex.org/I891191580","display_name":"Aalborg University","ror":"https://ror.org/04m5j1k67","country_code":"DK","type":"education","lineage":["https://openalex.org/I891191580"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Kim Guldstrand Larsen","raw_affiliation_strings":["Department of Computer Science, Aalborg University, Denmark","Department of Computer Science, Aalborg University, Denmark,"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Aalborg University, Denmark","institution_ids":["https://openalex.org/I891191580"]},{"raw_affiliation_string":"Department of Computer Science, Aalborg University, Denmark,","institution_ids":["https://openalex.org/I891191580"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5069362159"],"corresponding_institution_ids":["https://openalex.org/I891191580"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.3632,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.62172203,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"24","last_page":"28"},"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.9970999956130981,"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/T11125","display_name":"Petri Nets in System Modeling","score":0.9957000017166138,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8525549173355103},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.8478308916091919},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.7814561128616333},{"id":"https://openalex.org/keywords/synchronizing","display_name":"Synchronizing","score":0.7064452171325684},{"id":"https://openalex.org/keywords/timed-automaton","display_name":"Timed automaton","score":0.7045614719390869},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.5625287890434265},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.541254460811615},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5240100622177124},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.4510478675365448},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.4453429579734802},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35789865255355835},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09124988317489624}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8525549173355103},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8478308916091919},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.7814561128616333},{"id":"https://openalex.org/C162932704","wikidata":"https://www.wikidata.org/wiki/Q1058791","display_name":"Synchronizing","level":3,"score":0.7064452171325684},{"id":"https://openalex.org/C30788636","wikidata":"https://www.wikidata.org/wiki/Q7805517","display_name":"Timed automaton","level":3,"score":0.7045614719390869},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.5625287890434265},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.541254460811615},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5240100622177124},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.4510478675365448},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4453429579734802},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35789865255355835},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09124988317489624},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"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/C761482","wikidata":"https://www.wikidata.org/wiki/Q118093","display_name":"Transmission (telecommunications)","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-642-15349-5_2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-15349-5_2","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.atira.dk:publications/43b1e717-a48f-4329-83c1-3c17f549880e","is_oa":false,"landing_page_url":"http://www.csc.liv.ac.uk/~rp2010/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401731","display_name":"VBN Forskningsportal (Aalborg Universitet)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I891191580","host_organization_name":"Aalborg University","host_organization_lineage":["https://openalex.org/I891191580"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Larsen , K G 2010 , ' Symbolic and Compositional Reachability for Timed Automata ' , Lecture Notes in Computer Science , bind 6227 , s. 24-28 . https://doi.org/10.1007/978-3-642-15349-5","raw_type":"contributionToPeriodical"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/13","score":0.6800000071525574,"display_name":"Climate action"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W41277334","https://openalex.org/W59365162","https://openalex.org/W143291542","https://openalex.org/W1224547023","https://openalex.org/W1482233117","https://openalex.org/W1522448884","https://openalex.org/W1544709292","https://openalex.org/W1554260731","https://openalex.org/W1556566737","https://openalex.org/W1569203277","https://openalex.org/W1573865009","https://openalex.org/W1577437452","https://openalex.org/W1589421353","https://openalex.org/W1625256512","https://openalex.org/W1772179977","https://openalex.org/W1819818805","https://openalex.org/W1874996599","https://openalex.org/W2000947342","https://openalex.org/W2007490191","https://openalex.org/W2039784168","https://openalex.org/W2047516333","https://openalex.org/W2065323166","https://openalex.org/W2096978064","https://openalex.org/W2097267767","https://openalex.org/W2134659903","https://openalex.org/W2141635201","https://openalex.org/W2142441581","https://openalex.org/W2145000217","https://openalex.org/W2150377894","https://openalex.org/W2155817791","https://openalex.org/W2160170063","https://openalex.org/W2398303742","https://openalex.org/W2500657807","https://openalex.org/W2503674810","https://openalex.org/W4242096891","https://openalex.org/W6604697549"],"related_works":["https://openalex.org/W3049732643","https://openalex.org/W2884574904","https://openalex.org/W4290017224","https://openalex.org/W2050522087","https://openalex.org/W2729254191","https://openalex.org/W4317533142","https://openalex.org/W1565729639","https://openalex.org/W1485850862","https://openalex.org/W1750615905","https://openalex.org/W2103488150"],"abstract_inverted_index":null,"counts_by_year":[{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}