{"id":"https://openalex.org/W1590344134","doi":"https://doi.org/10.1007/978-3-642-04368-0_17","title":"Stochastic Games for Verification of Probabilistic Timed Automata","display_name":"Stochastic Games for Verification of Probabilistic Timed Automata","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W1590344134","doi":"https://doi.org/10.1007/978-3-642-04368-0_17","mag":"1590344134"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-04368-0_17","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-04368-0_17","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":true,"oa_status":"green","oa_url":"https://inria.hal.science/inria-00457923","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5081710233","display_name":"Marta Kwiatkowska","orcid":"https://orcid.org/0000-0001-9022-7599"},"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"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Marta Kwiatkowska","raw_affiliation_strings":["Computing Laboratory, Oxford University, Parks Road, Oxford, OX1 3QD"],"affiliations":[{"raw_affiliation_string":"Computing Laboratory, Oxford University, Parks Road, Oxford, OX1 3QD","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067544120","display_name":"Gethin Norman","orcid":"https://orcid.org/0000-0001-9326-4344"},"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"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Gethin Norman","raw_affiliation_strings":["Computing Laboratory, Oxford University, Parks Road, Oxford, OX1 3QD"],"affiliations":[{"raw_affiliation_string":"Computing Laboratory, Oxford University, Parks Road, Oxford, OX1 3QD","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5036097359","display_name":"David Parker","orcid":"https://orcid.org/0000-0003-4137-8862"},"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"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"David Parker","raw_affiliation_strings":["Computing Laboratory, Oxford University, Parks Road, Oxford, OX1 3QD"],"affiliations":[{"raw_affiliation_string":"Computing Laboratory, Oxford University, Parks Road, Oxford, OX1 3QD","institution_ids":["https://openalex.org/I40120149"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5081710233"],"corresponding_institution_ids":["https://openalex.org/I40120149"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":8.7974,"has_fulltext":false,"cited_by_count":63,"citation_normalized_percentile":{"value":0.98783003,"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":"212","last_page":"227"},"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/T12423","display_name":"Software Reliability and Analysis Research","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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9988999962806702,"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.9134176969528198},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7459888458251953},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.742759108543396},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.7024455070495605},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6523681879043579},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6255772709846497},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5525361895561218},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.49931764602661133},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.48821476101875305},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.48679491877555847},{"id":"https://openalex.org/keywords/probabilistic-automaton","display_name":"Probabilistic automaton","score":0.4847540557384491},{"id":"https://openalex.org/keywords/timed-automaton","display_name":"Timed automaton","score":0.4423459470272064},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.43393510580062866},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43108242750167847},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2502608895301819},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10614150762557983},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1036442220211029}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.9134176969528198},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7459888458251953},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.742759108543396},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.7024455070495605},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6523681879043579},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6255772709846497},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5525361895561218},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.49931764602661133},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.48821476101875305},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.48679491877555847},{"id":"https://openalex.org/C174784677","wikidata":"https://www.wikidata.org/wiki/Q176567","display_name":"Probabilistic automaton","level":3,"score":0.4847540557384491},{"id":"https://openalex.org/C30788636","wikidata":"https://www.wikidata.org/wiki/Q7805517","display_name":"Timed automaton","level":3,"score":0.4423459470272064},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.43393510580062866},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43108242750167847},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2502608895301819},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10614150762557983},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1036442220211029},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","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},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1007/978-3-642-04368-0_17","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-04368-0_17","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:CiteSeerX.psu:10.1.1.170.141","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.170.141","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.prismmodelchecker.org/papers/formats09.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.182.3194","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.182.3194","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://qav.comlab.ox.ac.uk/papers/RR-09-05.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.550.1858","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.550.1858","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.ox.ac.uk/files/2301/RR-09-05.pdf","raw_type":"text"},{"id":"pmh:oai:HAL:inria-00457923v1","is_oa":true,"landing_page_url":"https://inria.hal.science/inria-00457923","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"7th International Conference on Formal Modeling and Analysis of Timed Systems : FORMATS 2009, Sep 2009, Budapest, Hungary. pp.212-217, ⟨10.1007/978-3-642-04368-0_17⟩","raw_type":"Conference papers"},{"id":"pmh:oai:eprints.gla.ac.uk:39645","is_oa":false,"landing_page_url":"http://eprints.gla.ac.uk/39645/","pdf_url":null,"source":{"id":"https://openalex.org/S4210235606","display_name":"ENLIGHTEN (Jurnal Bimbingan dan Konseling Islam)","issn_l":"2622-8912","issn":["2622-8912","2622-8920"],"is_oa":false,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Book Sections"}],"best_oa_location":{"id":"pmh:oai:HAL:inria-00457923v1","is_oa":true,"landing_page_url":"https://inria.hal.science/inria-00457923","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"7th International Conference on Formal Modeling and Analysis of Timed Systems : FORMATS 2009, Sep 2009, Budapest, Hungary. pp.212-217, ⟨10.1007/978-3-642-04368-0_17⟩","raw_type":"Conference papers"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2574985670","display_name":null,"funder_award_id":"EP/D07956X/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G3293463209","display_name":null,"funder_award_id":"EP/D076625/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G5152650391","display_name":null,"funder_award_id":"EP/D076625/2","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G6585145625","display_name":null,"funder_award_id":"EP/D07956X/2","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W1480600454","https://openalex.org/W1498004481","https://openalex.org/W1514172519","https://openalex.org/W1544206522","https://openalex.org/W1590344134","https://openalex.org/W1774309420","https://openalex.org/W1803230550","https://openalex.org/W1874725288","https://openalex.org/W1966347268","https://openalex.org/W1981808971","https://openalex.org/W2000947342","https://openalex.org/W2009280542","https://openalex.org/W2009363597","https://openalex.org/W2028827800","https://openalex.org/W2052092737","https://openalex.org/W2095602520","https://openalex.org/W2119567691","https://openalex.org/W2121889906","https://openalex.org/W2130773092","https://openalex.org/W2132266737","https://openalex.org/W2132976180","https://openalex.org/W2133057837","https://openalex.org/W2159841389","https://openalex.org/W2169677553","https://openalex.org/W2243410218","https://openalex.org/W2334782222","https://openalex.org/W2486801597","https://openalex.org/W2489001267","https://openalex.org/W2575731723","https://openalex.org/W2992293693"],"related_works":["https://openalex.org/W2047831585","https://openalex.org/W4253760428","https://openalex.org/W2099490078","https://openalex.org/W3208672221","https://openalex.org/W2951439219","https://openalex.org/W1565729639","https://openalex.org/W1750615905","https://openalex.org/W1606006280","https://openalex.org/W2612724135","https://openalex.org/W1556444648"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":10}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}