{"id":"https://openalex.org/W1848324794","doi":"https://doi.org/10.1007/bfb0054177","title":"Model checking via reachability testing for timed automata","display_name":"Model checking via reachability testing for timed automata","publication_year":1998,"publication_date":"1998-01-01","ids":{"openalex":"https://openalex.org/W1848324794","doi":"https://doi.org/10.1007/bfb0054177","mag":"1848324794"},"language":"en","primary_location":{"id":"doi:10.1007/bfb0054177","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bfb0054177","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/A5041913577","display_name":"Luca Aceto","orcid":"https://orcid.org/0000-0002-2197-3018"},"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":"Luca Aceto","raw_affiliation_strings":["BRICS Basic Research in Computer Science., Department of Computer Science, Aalborg University, Predrik Bajers Vej 7-E, DK-9220, Aalborg \u00d8, Denmark","BRICS Basic Research in Computer Science., Department of Computer Science, Aalborg University, Aalborg \u00d8, Denmark"],"affiliations":[{"raw_affiliation_string":"BRICS Basic Research in Computer Science., Department of Computer Science, Aalborg University, Predrik Bajers Vej 7-E, DK-9220, Aalborg \u00d8, Denmark","institution_ids":["https://openalex.org/I891191580"]},{"raw_affiliation_string":"BRICS Basic Research in Computer Science., Department of Computer Science, Aalborg University, Aalborg \u00d8, Denmark","institution_ids":["https://openalex.org/I891191580"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103376123","display_name":"Augusto Burgue\u00f1o","orcid":null},"institutions":[{"id":"https://openalex.org/I4210161954","display_name":"D\u00e9partement d'Informatique","ror":"https://ror.org/05y6rqs46","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I2746051580","https://openalex.org/I29607241","https://openalex.org/I4210159245","https://openalex.org/I4210161954"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Augusto Burgue\u00f1o","raw_affiliation_strings":["D\u00e9partement d'Informatique, ONERA-CERT, 2 av. E. Belin, BP4025, 31055, Toulouse, Cedex 4, France","D\u00e9partement d'Informatique, ONERA-CERT, Toulouse, France"],"affiliations":[{"raw_affiliation_string":"D\u00e9partement d'Informatique, ONERA-CERT, 2 av. E. Belin, BP4025, 31055, Toulouse, Cedex 4, France","institution_ids":["https://openalex.org/I4210161954"]},{"raw_affiliation_string":"D\u00e9partement d'Informatique, ONERA-CERT, Toulouse, France","institution_ids":["https://openalex.org/I4210161954"]}]},{"author_position":"last","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":false,"raw_author_name":"Kim G. Larsen","raw_affiliation_strings":["BRICS Basic Research in Computer Science., Department of Computer Science, Aalborg University, Predrik Bajers Vej 7-E, DK-9220, Aalborg \u00d8, Denmark","BRICS Basic Research in Computer Science., Department of Computer Science, Aalborg University, Aalborg \u00d8, Denmark"],"affiliations":[{"raw_affiliation_string":"BRICS Basic Research in Computer Science., Department of Computer Science, Aalborg University, Predrik Bajers Vej 7-E, DK-9220, Aalborg \u00d8, Denmark","institution_ids":["https://openalex.org/I891191580"]},{"raw_affiliation_string":"BRICS Basic Research in Computer Science., Department of Computer Science, Aalborg University, Aalborg \u00d8, Denmark","institution_ids":["https://openalex.org/I891191580"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5041913577"],"corresponding_institution_ids":["https://openalex.org/I891191580"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":9.0958,"has_fulltext":false,"cited_by_count":103,"citation_normalized_percentile":{"value":0.98532179,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"263","last_page":"280"},"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9991000294685364,"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/T12423","display_name":"Software Reliability and Analysis Research","score":0.9962000250816345,"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/liveness","display_name":"Liveness","score":0.9483143091201782},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.9381722211837769},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8054629564285278},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.779465913772583},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.7330954074859619},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.6395586729049683},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5946277976036072},{"id":"https://openalex.org/keywords/timed-automaton","display_name":"Timed automaton","score":0.5847503542900085},{"id":"https://openalex.org/keywords/formalism","display_name":"Formalism (music)","score":0.5826721787452698},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5372284650802612},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.4783420264720917},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.4205816984176636},{"id":"https://openalex.org/keywords/b\u00fcchi-automaton","display_name":"B\u00fcchi automaton","score":0.41875797510147095},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3664972186088562},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.20093700289726257},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1550273895263672}],"concepts":[{"id":"https://openalex.org/C15569618","wikidata":"https://www.wikidata.org/wiki/Q3561421","display_name":"Liveness","level":2,"score":0.9483143091201782},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.9381722211837769},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8054629564285278},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.779465913772583},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.7330954074859619},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.6395586729049683},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5946277976036072},{"id":"https://openalex.org/C30788636","wikidata":"https://www.wikidata.org/wiki/Q7805517","display_name":"Timed automaton","level":3,"score":0.5847503542900085},{"id":"https://openalex.org/C73301696","wikidata":"https://www.wikidata.org/wiki/Q5469984","display_name":"Formalism (music)","level":3,"score":0.5826721787452698},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5372284650802612},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4783420264720917},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.4205816984176636},{"id":"https://openalex.org/C165753454","wikidata":"https://www.wikidata.org/wiki/Q1020380","display_name":"B\u00fcchi automaton","level":4,"score":0.41875797510147095},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3664972186088562},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.20093700289726257},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1550273895263672},{"id":"https://openalex.org/C558565934","wikidata":"https://www.wikidata.org/wiki/Q2743","display_name":"Musical","level":2,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C153349607","wikidata":"https://www.wikidata.org/wiki/Q36649","display_name":"Visual arts","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}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/bfb0054177","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bfb0054177","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/1f57ad30-0034-11da-b4d5-000ea68e967b","is_oa":false,"landing_page_url":"https://vbn.aau.dk/da/publications/1f57ad30-0034-11da-b4d5-000ea68e967b","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":"Aceto, L, Burgue\u00f1o, A & Larsen, K G 1997, Model Checking via Reachability Testing for Timed Automata. BRICS Report Series, no. RS-97-29, Department of Computer Science, Aarhus University, \u00c5rhus : Daimi.","raw_type":"book"},{"id":"pmh:oai:pure.atira.dk:publications/21a48260-003f-11da-b4d5-000ea68e967b","is_oa":false,"landing_page_url":"https://vbn.aau.dk/da/publications/21a48260-003f-11da-b4d5-000ea68e967b","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":"Aceto, L, Burgue\u00f1o, A & Larsen, K G 1998, Model Checking via Reachability Testing for Timed Automata. in Steffen, B. (ed.) (ed.), Tools and Algorithms for the Construction and Analysis of Systems : Proc. of the 4th International Conference, TACAS'98 held as part of the Joint European Conference on Theory and Practice of Software, ETAPS'98, Lisbon, Portugal, March 28-April 4, 1998 : Lecture Notes in Computer Science. 1384 edn, IEEE Computer Society Press, pp. 263-280, Model Checking via Reachability Testing for Timed Automata, 19/05/2010.","raw_type":"contributionToPeriodical"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":42,"referenced_works":["https://openalex.org/W3820865","https://openalex.org/W192861780","https://openalex.org/W1488948284","https://openalex.org/W1490128362","https://openalex.org/W1503973138","https://openalex.org/W1512053738","https://openalex.org/W1512310098","https://openalex.org/W1543690662","https://openalex.org/W1550474961","https://openalex.org/W1592405134","https://openalex.org/W1965338471","https://openalex.org/W1966112122","https://openalex.org/W1976268573","https://openalex.org/W1978469611","https://openalex.org/W1990609140","https://openalex.org/W2019881090","https://openalex.org/W2023808162","https://openalex.org/W2025280888","https://openalex.org/W2030263557","https://openalex.org/W2101269152","https://openalex.org/W2101508170","https://openalex.org/W2117087357","https://openalex.org/W2130773092","https://openalex.org/W2153273838","https://openalex.org/W2153439859","https://openalex.org/W2157144873","https://openalex.org/W2160883697","https://openalex.org/W2163590987","https://openalex.org/W2244694539","https://openalex.org/W2262332340","https://openalex.org/W2290372454","https://openalex.org/W2292852945","https://openalex.org/W2338077133","https://openalex.org/W2398303742","https://openalex.org/W2561675875","https://openalex.org/W2731301312","https://openalex.org/W2737433617","https://openalex.org/W2952567904","https://openalex.org/W4285719527","https://openalex.org/W6600162280","https://openalex.org/W6629787081","https://openalex.org/W6638154442"],"related_works":["https://openalex.org/W4312626387","https://openalex.org/W1989082972","https://openalex.org/W2103504376","https://openalex.org/W2153337086","https://openalex.org/W2135051863","https://openalex.org/W1651168384","https://openalex.org/W1565729639","https://openalex.org/W1750615905","https://openalex.org/W1606006280","https://openalex.org/W2905821389"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}