{"id":"https://openalex.org/W2013011361","doi":"https://doi.org/10.1109/cdc.2011.6160992","title":"Reachability probabilities in Markovian Timed Automata","display_name":"Reachability probabilities in Markovian Timed Automata","publication_year":2011,"publication_date":"2011-12-01","ids":{"openalex":"https://openalex.org/W2013011361","doi":"https://doi.org/10.1109/cdc.2011.6160992","mag":"2013011361"},"language":"en","primary_location":{"id":"doi:10.1109/cdc.2011.6160992","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2011.6160992","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Conference on Decision and Control and European Control Conference","raw_type":"proceedings-article"},"type":"article","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/A5030747944","display_name":"Taolue Chen","orcid":"https://orcid.org/0000-0002-5993-1665"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]},{"id":"https://openalex.org/I4210146410","display_name":"Science Oxford","ror":"https://ror.org/04j8yhy50","country_code":"GB","type":"nonprofit","lineage":["https://openalex.org/I4210146410"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Taolue Chen","raw_affiliation_strings":["Department of Computer Science, Oxford University, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Oxford University, UK","institution_ids":["https://openalex.org/I40120149","https://openalex.org/I4210146410"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025707429","display_name":"Tingting Han","orcid":"https://orcid.org/0000-0002-2131-9200"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]},{"id":"https://openalex.org/I4210146410","display_name":"Science Oxford","ror":"https://ror.org/04j8yhy50","country_code":"GB","type":"nonprofit","lineage":["https://openalex.org/I4210146410"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Tingting Han","raw_affiliation_strings":["Department of Computer Science, Oxford University, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Oxford University, UK","institution_ids":["https://openalex.org/I40120149","https://openalex.org/I4210146410"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090819329","display_name":"Joost-Pieter Katoen","orcid":"https://orcid.org/0000-0002-6143-1926"},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Joost-Pieter Katoen","raw_affiliation_strings":["Software Modelling and Verification Group, RWTH Aachen University, Germany"],"affiliations":[{"raw_affiliation_string":"Software Modelling and Verification Group, RWTH Aachen University, Germany","institution_ids":["https://openalex.org/I887968799"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041563113","display_name":"Alexandru Mereacre","orcid":"https://orcid.org/0000-0002-5376-2194"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]},{"id":"https://openalex.org/I4210146410","display_name":"Science Oxford","ror":"https://ror.org/04j8yhy50","country_code":"GB","type":"nonprofit","lineage":["https://openalex.org/I4210146410"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Alexandru Mereacre","raw_affiliation_strings":["Department of Computer Science, Oxford University, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Oxford University, UK","institution_ids":["https://openalex.org/I40120149","https://openalex.org/I4210146410"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5030747944"],"corresponding_institution_ids":["https://openalex.org/I40120149","https://openalex.org/I4210146410"],"apc_list":null,"apc_paid":null,"fwci":1.6068,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.8272435,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"7075","last_page":"7080"},"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/T11125","display_name":"Petri Nets in System Modeling","score":0.9909999966621399,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9907000064849854,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.8892760276794434},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6265497803688049},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6007084250450134},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6000022888183594},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.5753834247589111},{"id":"https://openalex.org/keywords/timed-automaton","display_name":"Timed automaton","score":0.5509485602378845},{"id":"https://openalex.org/keywords/bellman-equation","display_name":"Bellman equation","score":0.5312901139259338},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.5239408612251282},{"id":"https://openalex.org/keywords/discretization","display_name":"Discretization","score":0.5229895114898682},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5155251026153564},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.4729611277580261},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4576933979988098},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.37643104791641235},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33883601427078247},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22183072566986084},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.20480123162269592}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8892760276794434},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6265497803688049},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6007084250450134},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6000022888183594},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.5753834247589111},{"id":"https://openalex.org/C30788636","wikidata":"https://www.wikidata.org/wiki/Q7805517","display_name":"Timed automaton","level":3,"score":0.5509485602378845},{"id":"https://openalex.org/C14646407","wikidata":"https://www.wikidata.org/wiki/Q1430750","display_name":"Bellman equation","level":2,"score":0.5312901139259338},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.5239408612251282},{"id":"https://openalex.org/C73000952","wikidata":"https://www.wikidata.org/wiki/Q17007827","display_name":"Discretization","level":2,"score":0.5229895114898682},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5155251026153564},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.4729611277580261},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4576933979988098},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.37643104791641235},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33883601427078247},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22183072566986084},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.20480123162269592},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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.1109/cdc.2011.6160992","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2011.6160992","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Conference on Decision and Control and European Control Conference","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.728.1301","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.728.1301","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.eis.mdx.ac.uk/staffpages/taoluechen/pub-papers/chkm12_cdc.pdf","raw_type":"text"},{"id":"pmh:oai:publications.rwth-aachen.de:124969","is_oa":false,"landing_page_url":"https://publications.rwth-aachen.de/record/124969","pdf_url":null,"source":{"id":"https://openalex.org/S4306401362","display_name":"RWTH Publications (RWTH Aachen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887968799","host_organization_name":"RWTH Aachen University","host_organization_lineage":["https://openalex.org/I887968799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2011 50th IEEE Conference on Decision and Control and European Control Conference : (CDC-ECC 2011) ; Orlando, Florida, USA, 12 - 15 December 2011 / [IEEE Control Systems Society (CSS); European Union Control Association (EUCA)]<br/>50. IEEE Conference on Decision and Control and European Control Conference, CDC-ECC 2011, Orlando, FL, USA, 2011-12-12 - 2011-12-15","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.41999998688697815,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W9281975","https://openalex.org/W1499790443","https://openalex.org/W1508405709","https://openalex.org/W2009280542","https://openalex.org/W2013011361","https://openalex.org/W2063746348","https://openalex.org/W2071128049","https://openalex.org/W2075222142","https://openalex.org/W2098432798","https://openalex.org/W2101508170","https://openalex.org/W2103836778","https://openalex.org/W2143706916","https://openalex.org/W2152342144","https://openalex.org/W2154602821","https://openalex.org/W2158776910","https://openalex.org/W2160106881","https://openalex.org/W2168234479","https://openalex.org/W2244458880","https://openalex.org/W2334782222","https://openalex.org/W3103183526","https://openalex.org/W4247619688","https://openalex.org/W6629744607"],"related_works":["https://openalex.org/W1554767603","https://openalex.org/W1565729639","https://openalex.org/W2077321406","https://openalex.org/W1750615905","https://openalex.org/W4293248739","https://openalex.org/W2153269726","https://openalex.org/W2065323166","https://openalex.org/W1606006280","https://openalex.org/W2145444024","https://openalex.org/W4245606633"],"abstract_inverted_index":{"We":[0,13,40],"propose":[1,41],"a":[2,31,37,58,61],"novel":[3],"stochastic":[4],"extension":[5],"of":[6,17,33],"timed":[7],"automata,":[8],"i.e.":[9],"Markovian":[10],"Timed":[11],"Automata.":[12],"study":[14],"the":[15,26,46,54],"problem":[16],"optimizing":[18],"time-bounded":[19],"reachability":[20],"probabilities":[21],"in":[22],"this":[23],"model,":[24],"i.e.,":[25],"maximum":[27],"likelihood":[28],"to":[29,44,52,63],"hit":[30],"set":[32],"goal":[34],"locations":[35],"within":[36],"given":[38],"deadline.":[39],"Bellman":[42,55],"equations":[43],"characterize":[45],"probability,":[47],"and":[48,60],"provide":[49],"two":[50],"approaches":[51],"solve":[53],"equations,":[56],"namely,":[57],"discretization":[59],"reduction":[62],"Hamilton-Jacobi-Bellman":[64],"equations.":[65]},"counts_by_year":[{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"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"}