{"id":"https://openalex.org/W2886025101","doi":"https://doi.org/10.1007/978-3-319-99154-2_15","title":"Bounded Verification of Reachability of Probabilistic Hybrid Systems","display_name":"Bounded Verification of Reachability of Probabilistic Hybrid Systems","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2886025101","doi":"https://doi.org/10.1007/978-3-319-99154-2_15","mag":"2886025101"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-99154-2_15","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-99154-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/A5083539632","display_name":"Ratan Lal","orcid":"https://orcid.org/0000-0003-1547-6741"},"institutions":[{"id":"https://openalex.org/I189590672","display_name":"Kansas State University","ror":"https://ror.org/05p1j8758","country_code":"US","type":"education","lineage":["https://openalex.org/I189590672"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ratan Lal","raw_affiliation_strings":["Kansas State University, Manhattan, USA"],"affiliations":[{"raw_affiliation_string":"Kansas State University, Manhattan, USA","institution_ids":["https://openalex.org/I189590672"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068080537","display_name":"Pavithra Prabhakar","orcid":"https://orcid.org/0000-0002-5368-3234"},"institutions":[{"id":"https://openalex.org/I189590672","display_name":"Kansas State University","ror":"https://ror.org/05p1j8758","country_code":"US","type":"education","lineage":["https://openalex.org/I189590672"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Pavithra Prabhakar","raw_affiliation_strings":["Kansas State University, Manhattan, USA"],"affiliations":[{"raw_affiliation_string":"Kansas State University, Manhattan, USA","institution_ids":["https://openalex.org/I189590672"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5083539632"],"corresponding_institution_ids":["https://openalex.org/I189590672"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.2534,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.77846154,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"240","last_page":"256"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12423","display_name":"Software Reliability and Analysis Research","score":0.9987999796867371,"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"}},"topics":[{"id":"https://openalex.org/T12423","display_name":"Software Reliability and Analysis Research","score":0.9987999796867371,"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/T10142","display_name":"Formal Methods in Verification","score":0.9916999936103821,"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/T10780","display_name":"Reliability and Maintenance Optimization","score":0.9648000001907349,"subfield":{"id":"https://openalex.org/subfields/2213","display_name":"Safety, Risk, Reliability and Quality"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.8594859838485718},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.7600580453872681},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.6970187425613403},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6701394319534302},{"id":"https://openalex.org/keywords/hybrid-system","display_name":"Hybrid system","score":0.5899611711502075},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5441539883613586},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.5410595536231995},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5182583332061768},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.4398946762084961},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.42550963163375854},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.4241783618927002},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.42022523283958435},{"id":"https://openalex.org/keywords/probabilistic-analysis-of-algorithms","display_name":"Probabilistic analysis of algorithms","score":0.4177650213241577},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.3955853581428528},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3519548773765564},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23786506056785583},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.08296766877174377},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.0816686749458313}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8594859838485718},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.7600580453872681},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.6970187425613403},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6701394319534302},{"id":"https://openalex.org/C50897621","wikidata":"https://www.wikidata.org/wiki/Q2665508","display_name":"Hybrid system","level":2,"score":0.5899611711502075},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5441539883613586},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.5410595536231995},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5182583332061768},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.4398946762084961},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.42550963163375854},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.4241783618927002},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.42022523283958435},{"id":"https://openalex.org/C24404364","wikidata":"https://www.wikidata.org/wiki/Q7246846","display_name":"Probabilistic analysis of algorithms","level":3,"score":0.4177650213241577},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.3955853581428528},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3519548773765564},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23786506056785583},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08296766877174377},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0816686749458313},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","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":1,"locations":[{"id":"doi:10.1007/978-3-319-99154-2_15","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-99154-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"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.699999988079071}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W602497127","https://openalex.org/W1266757872","https://openalex.org/W1487949979","https://openalex.org/W1491203899","https://openalex.org/W1516852392","https://openalex.org/W1522694098","https://openalex.org/W1525967073","https://openalex.org/W1583191255","https://openalex.org/W1602707050","https://openalex.org/W1626822335","https://openalex.org/W1824914642","https://openalex.org/W1955710548","https://openalex.org/W2006574672","https://openalex.org/W2017676950","https://openalex.org/W2058117005","https://openalex.org/W2075222142","https://openalex.org/W2077287580","https://openalex.org/W2080813827","https://openalex.org/W2084772009","https://openalex.org/W2094530979","https://openalex.org/W2101561362","https://openalex.org/W2119289222","https://openalex.org/W2122087968","https://openalex.org/W2124060754","https://openalex.org/W2126053898","https://openalex.org/W2141803002","https://openalex.org/W2147340401","https://openalex.org/W2157056800","https://openalex.org/W2223995125","https://openalex.org/W2607115544"],"related_works":["https://openalex.org/W2357387646","https://openalex.org/W856973001","https://openalex.org/W2047831585","https://openalex.org/W4253760428","https://openalex.org/W2952920810","https://openalex.org/W4293477811","https://openalex.org/W2017676950","https://openalex.org/W2102105946","https://openalex.org/W78063724","https://openalex.org/W197679583"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}