{"id":"https://openalex.org/W2065323166","doi":"https://doi.org/10.1007/3-540-45351-2_15","title":"Minimum-Cost Reachability for Priced Time Automata","display_name":"Minimum-Cost Reachability for Priced Time Automata","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W2065323166","doi":"https://doi.org/10.1007/3-540-45351-2_15","mag":"2065323166"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-45351-2_15","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45351-2_15","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/A5108532510","display_name":"Gerd Behrmann","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Gerd Behrmann","raw_affiliation_strings":["Basic Research in Computer Science, Aalborg University, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Basic Research in Computer Science, Aalborg University, The Netherlands","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":["Computing Science Institute, University of Nijmegen, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Computing Science Institute, University of Nijmegen, The Netherlands","institution_ids":["https://openalex.org/I145872427"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024307101","display_name":"Thomas Hune","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Thomas Hune","raw_affiliation_strings":["Basic Research in Computer Science, Aarhus University, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Basic Research in Computer Science, Aarhus University, The Netherlands","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069362159","display_name":"Kim G. Larsen","orcid":"https://orcid.org/0000-0002-5953-3384"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kim Larsen","raw_affiliation_strings":["Basic Research in Computer Science, Aalborg University, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Basic Research in Computer Science, Aalborg University, The Netherlands","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079870005","display_name":"Paul Pettersson","orcid":"https://orcid.org/0000-0003-4040-3480"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Paul Pettersson","raw_affiliation_strings":["Department of Computer Systems, Information Technology Uppsala University, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Computer Systems, Information Technology Uppsala University, The Netherlands","institution_ids":[]}]},{"author_position":"middle","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":["Computing Science Institute, University of Nijmegen, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Computing Science Institute, University of Nijmegen, The Netherlands","institution_ids":["https://openalex.org/I145872427"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001955028","display_name":"Frits Vaandrager","orcid":"https://orcid.org/0000-0003-3955-1910"},"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":"Frits Vaandrager","raw_affiliation_strings":["Computing Science Institute, University of Nijmegen, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Computing Science Institute, University of Nijmegen, The Netherlands","institution_ids":["https://openalex.org/I145872427"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":7,"corresponding_author_ids":["https://openalex.org/A5108532510"],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":10.446,"has_fulltext":false,"cited_by_count":298,"citation_normalized_percentile":{"value":0.98584337,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"147","last_page":"161"},"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.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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9901999831199646,"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.9401469826698303},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.8458821773529053},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.8399510383605957},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.768856942653656},{"id":"https://openalex.org/keywords/timed-automaton","display_name":"Timed automaton","score":0.6768456101417542},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.618908166885376},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.5537741780281067},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.5372132658958435},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.4836884140968323},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.48037654161453247},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.4704928398132324},{"id":"https://openalex.org/keywords/hybrid-automaton","display_name":"Hybrid automaton","score":0.44892024993896484},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3980821371078491},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33394747972488403},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.11909112334251404}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.9401469826698303},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.8458821773529053},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.8399510383605957},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.768856942653656},{"id":"https://openalex.org/C30788636","wikidata":"https://www.wikidata.org/wiki/Q7805517","display_name":"Timed automaton","level":3,"score":0.6768456101417542},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.618908166885376},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.5537741780281067},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.5372132658958435},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.4836884140968323},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.48037654161453247},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.4704928398132324},{"id":"https://openalex.org/C2776028153","wikidata":"https://www.wikidata.org/wiki/Q5953179","display_name":"Hybrid automaton","level":3,"score":0.44892024993896484},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3980821371078491},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33394747972488403},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.11909112334251404},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/3-540-45351-2_15","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45351-2_15","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:ut:oai:ris.utwente.nl:publications/9b7f4608-fe2a-401a-9019-1541bba23ac5","is_oa":false,"landing_page_url":"https://research.utwente.nl/en/publications/minimumcost-reachability-for-priced-timed-automata(9b7f4608-fe2a-401a-9019-1541bba23ac5).html","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":"Hybrid Systems: Computation and Control: 4th International Workshop, HSCC 2001 Rome, Italy, March 28\u201330, 2001 Proceedings, 147 - 161","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1482233117","https://openalex.org/W1511152484","https://openalex.org/W1522448884","https://openalex.org/W1532591243","https://openalex.org/W1577414782","https://openalex.org/W1589082502","https://openalex.org/W1592764834","https://openalex.org/W1600541802","https://openalex.org/W1751719170","https://openalex.org/W1820192350","https://openalex.org/W1878516677","https://openalex.org/W1905380539","https://openalex.org/W1916487582","https://openalex.org/W1939356072","https://openalex.org/W1957639564","https://openalex.org/W2000947342","https://openalex.org/W2076508310","https://openalex.org/W2094567396","https://openalex.org/W2101508170","https://openalex.org/W2142718416","https://openalex.org/W2147340401","https://openalex.org/W2379209625","https://openalex.org/W2403742698","https://openalex.org/W2637232237","https://openalex.org/W2731085289","https://openalex.org/W4245606633","https://openalex.org/W4249317963","https://openalex.org/W6640488497"],"related_works":["https://openalex.org/W2060144422","https://openalex.org/W2951140680","https://openalex.org/W2912654482","https://openalex.org/W2150468037","https://openalex.org/W2133856837","https://openalex.org/W1565729639","https://openalex.org/W1750615905","https://openalex.org/W2102105946","https://openalex.org/W2103488150","https://openalex.org/W2354154573"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":10},{"year":2018,"cited_by_count":12},{"year":2017,"cited_by_count":18},{"year":2016,"cited_by_count":16},{"year":2015,"cited_by_count":24},{"year":2014,"cited_by_count":21},{"year":2013,"cited_by_count":24},{"year":2012,"cited_by_count":24}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}