{"id":"https://openalex.org/W2130664212","doi":"https://doi.org/10.1007/3-540-44585-4_47","title":"As Cheap as Possible: Effcient Cost-Optimal Reachability for Priced Timed Automata","display_name":"As Cheap as Possible: Effcient Cost-Optimal Reachability for Priced Timed Automata","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W2130664212","doi":"https://doi.org/10.1007/3-540-44585-4_47","mag":"2130664212"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-44585-4_47","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-44585-4_47","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 Larsen","raw_affiliation_strings":["Basic Research in Computer Science, Aalborg University, Aalborg","Department of Computer Systems, University of Twente, UK"],"affiliations":[{"raw_affiliation_string":"Basic Research in Computer Science, Aalborg University, Aalborg","institution_ids":["https://openalex.org/I891191580"]},{"raw_affiliation_string":"Department of Computer Systems, University of Twente, UK","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108532510","display_name":"Gerd Behrmann","orcid":null},"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":"Gerd Behrmann","raw_affiliation_strings":["Basic Research in Computer Science, Aalborg University, Aalborg"],"affiliations":[{"raw_affiliation_string":"Basic Research in Computer Science, Aalborg University, Aalborg","institution_ids":["https://openalex.org/I891191580"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070465089","display_name":"Ed Brinksma","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ed Brinksma","raw_affiliation_strings":["Department of Computer Systems, University of Twente, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Systems, University of Twente, UK","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015799790","display_name":"Ansgar Fehnker","orcid":"https://orcid.org/0000-0002-5326-3432"},"institutions":[{"id":"https://openalex.org/I145872427","display_name":"Radboud University Nijmegen","ror":"https://ror.org/016xsfp80","country_code":"NL","type":"education","lineage":["https://openalex.org/I145872427"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Ansgar Fehnker","raw_affiliation_strings":["University of Nijmegen, Computing Science Institute, Nijmegen"],"affiliations":[{"raw_affiliation_string":"University of Nijmegen, Computing Science Institute, Nijmegen","institution_ids":["https://openalex.org/I145872427"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024307101","display_name":"Thomas Hune","orcid":null},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Thomas Hune","raw_affiliation_strings":["Basic Research in Computer Science, Aarhus University, Aarhus"],"affiliations":[{"raw_affiliation_string":"Basic Research in Computer Science, Aarhus University, Aarhus","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079870005","display_name":"Paul Pettersson","orcid":"https://orcid.org/0000-0003-4040-3480"},"institutions":[{"id":"https://openalex.org/I123387679","display_name":"Uppsala University","ror":"https://ror.org/048a87296","country_code":"SE","type":"education","lineage":["https://openalex.org/I123387679"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Paul Pettersson","raw_affiliation_strings":["Department of Information Technology, Uppsala University, Uppsala"],"affiliations":[{"raw_affiliation_string":"Department of Information Technology, Uppsala University, Uppsala","institution_ids":["https://openalex.org/I123387679"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111437954","display_name":"Judi Romijn","orcid":null},"institutions":[{"id":"https://openalex.org/I145872427","display_name":"Radboud University Nijmegen","ror":"https://ror.org/016xsfp80","country_code":"NL","type":"education","lineage":["https://openalex.org/I145872427"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Judi Romijn","raw_affiliation_strings":["University of Nijmegen, Computing Science Institute, Nijmegen"],"affiliations":[{"raw_affiliation_string":"University of Nijmegen, Computing Science Institute, Nijmegen","institution_ids":["https://openalex.org/I145872427"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":7,"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":11.3225,"has_fulltext":false,"cited_by_count":140,"citation_normalized_percentile":{"value":0.98885206,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"493","last_page":"505"},"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/T10126","display_name":"Logic, programming, and type systems","score":0.9955999851226807,"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.9886000156402588,"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/reachability","display_name":"Reachability","score":0.9754132032394409},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8506993651390076},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.8179101943969727},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.7176111936569214},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.5369856357574463},{"id":"https://openalex.org/keywords/timed-automaton","display_name":"Timed automaton","score":0.4888969957828522},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.4515574872493744},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4464348554611206},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.4435013234615326},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.41508662700653076},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3060533106327057},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2040524184703827}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.9754132032394409},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8506993651390076},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.8179101943969727},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.7176111936569214},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.5369856357574463},{"id":"https://openalex.org/C30788636","wikidata":"https://www.wikidata.org/wiki/Q7805517","display_name":"Timed automaton","level":3,"score":0.4888969957828522},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.4515574872493744},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4464348554611206},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.4435013234615326},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41508662700653076},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3060533106327057},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2040524184703827}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/3-540-44585-4_47","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-44585-4_47","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.tue.nl:publications/14722ebe-7f70-43b3-867f-5ddffd578517","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/14722ebe-7f70-43b3-867f-5ddffd578517","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Larsen, K G, Behrmann, G, Brinksma, E, Fehnker, A, Hune, T, Pettersson, P & Romijn, J M T 2001, As cheap as possible : efficient cost-optimal reachability for priced timed automata. in G Berry, H Comon & A Finkel (eds), Computer aided verification : proceedings 13th international conference, CAV 2001, Paris, july 18-22, 2001. Lecture Notes in Computer Science, vol. 2102, Springer, pp. 493-505. https://doi.org/10.1007/3-540-44585-4_47","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:ris.utwente.nl:openaire_cris_publications/468bebf2-8afc-4249-b6e1-64093a37a903","is_oa":false,"landing_page_url":"https://research.utwente.nl/en/publications/468bebf2-8afc-4249-b6e1-64093a37a903","pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Larsen, K, Behrmann, G, Brinksma, E, Fehnker, A, Hune, T, Pettersson, P & Romijn, J 2001, As Cheap as Possible : Efficient Cost-Optimal Reachability for Priced Timed Automata. in G Berry, H Comon & A Finkel (eds), Computer Aided Verification : 13th International Conference, CAV 2001 Paris, France, July 18\u201322, 2001 Proceedings. vol. 2102, Lecture Notes in Computer Science, vol. 2102, Springer, Heidelberg, pp. 493-505, 13th International Conference on Computer Aided Verification, CAV 2001, Paris, France, 18/07/01. https://doi.org/10.1007/3-540-44585-4_47","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:tue:oai:pure.tue.nl:publications/14722ebe-7f70-43b3-867f-5ddffd578517","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/14722ebe-7f70-43b3-867f-5ddffd578517","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Computer aided verification : proceedings 13th international conference, CAV 2001, Paris, july 18-22, 2001, 493 - 505","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W59365162","https://openalex.org/W258022877","https://openalex.org/W1482233117","https://openalex.org/W1503973138","https://openalex.org/W1511152484","https://openalex.org/W1573865009","https://openalex.org/W1601699262","https://openalex.org/W1602938474","https://openalex.org/W1820192350","https://openalex.org/W1878516677","https://openalex.org/W1905380539","https://openalex.org/W1957639564","https://openalex.org/W1967174286","https://openalex.org/W2000947342","https://openalex.org/W2065323166","https://openalex.org/W2071306171","https://openalex.org/W2076508310","https://openalex.org/W2078637295","https://openalex.org/W2089017767","https://openalex.org/W2106614985","https://openalex.org/W2123910665","https://openalex.org/W2131983024","https://openalex.org/W2142718416","https://openalex.org/W2145000217","https://openalex.org/W2146250272","https://openalex.org/W2146446489","https://openalex.org/W2343495766","https://openalex.org/W2379209625","https://openalex.org/W2688386367","https://openalex.org/W4245606633","https://openalex.org/W6630104300"],"related_works":["https://openalex.org/W2884574904","https://openalex.org/W4253760428","https://openalex.org/W2047831585","https://openalex.org/W3208672221","https://openalex.org/W3017277461","https://openalex.org/W4287199681","https://openalex.org/W3172202899","https://openalex.org/W1565729639","https://openalex.org/W1750615905","https://openalex.org/W1606006280"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":7}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-06-24T00:00:00"}