{"id":"https://openalex.org/W4415886783","doi":"https://doi.org/10.1007/978-3-032-09524-4_13","title":"DTMC Model Checking by\u00a0Path Abstraction Revisited","display_name":"DTMC Model Checking by\u00a0Path Abstraction Revisited","publication_year":2025,"publication_date":"2025-11-04","ids":{"openalex":"https://openalex.org/W4415886783","doi":"https://doi.org/10.1007/978-3-032-09524-4_13"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-032-09524-4_13","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-032-09524-4_13","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":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.utwente.nl/en/publications/327d1716-f6fc-47af-9699-ee1ab257a8ec","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5007673197","display_name":"Arnd Hartmanns","orcid":"https://orcid.org/0000-0003-3268-8674"},"institutions":[{"id":"https://openalex.org/I94624287","display_name":"University of Twente","ror":"https://ror.org/006hf6230","country_code":"NL","type":"education","lineage":["https://openalex.org/I94624287"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Arnd Hartmanns","raw_affiliation_strings":["University of Twente, Enschede, The Netherlands"],"raw_orcid":"https://orcid.org/0000-0003-3268-8674","affiliations":[{"raw_affiliation_string":"University of Twente, Enschede, The Netherlands","institution_ids":["https://openalex.org/I94624287"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5120253313","display_name":"Robert Modderman","orcid":"https://orcid.org/0009-0002-9198-3809"},"institutions":[{"id":"https://openalex.org/I94624287","display_name":"University of Twente","ror":"https://ror.org/006hf6230","country_code":"NL","type":"education","lineage":["https://openalex.org/I94624287"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Robert Modderman","raw_affiliation_strings":["University of Twente, Enschede, The Netherlands"],"raw_orcid":"https://orcid.org/0009-0002-9198-3809","affiliations":[{"raw_affiliation_string":"University of Twente, Enschede, The Netherlands","institution_ids":["https://openalex.org/I94624287"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5120253313"],"corresponding_institution_ids":["https://openalex.org/I94624287"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.5254,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.89723926,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"186","last_page":"201"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9728000164031982,"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.9728000164031982,"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.011599999852478504,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.0015999999595806003,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.7386999726295471},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6504999995231628},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5478000044822693},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.5286999940872192},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.5116999745368958},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.49570000171661377},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.48539999127388},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4796999990940094},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4593000113964081}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7842000126838684},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.7386999726295471},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6504999995231628},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5478000044822693},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5317000150680542},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.5286999940872192},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.5116999745368958},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.49570000171661377},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.48539999127388},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4796999990940094},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4593000113964081},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4489000141620636},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4309999942779541},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.4302999973297119},{"id":"https://openalex.org/C52063229","wikidata":"https://www.wikidata.org/wiki/Q7246845","display_name":"Probabilistic CTL","level":4,"score":0.3930000066757202},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.3391999900341034},{"id":"https://openalex.org/C206901836","wikidata":"https://www.wikidata.org/wiki/Q208237","display_name":"Monoid","level":2,"score":0.3321000039577484},{"id":"https://openalex.org/C2777168461","wikidata":"https://www.wikidata.org/wiki/Q42196253","display_name":"Set operations","level":3,"score":0.3107999861240387},{"id":"https://openalex.org/C147080032","wikidata":"https://www.wikidata.org/wiki/Q176720","display_name":"Continuous-time Markov chain","level":5,"score":0.29679998755455017},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.296099990606308},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.28690001368522644},{"id":"https://openalex.org/C16671368","wikidata":"https://www.wikidata.org/wiki/Q230885","display_name":"State diagram","level":3,"score":0.2865999937057495},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.28290000557899475},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.27309998869895935},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.26980000734329224},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2694999873638153},{"id":"https://openalex.org/C162838799","wikidata":"https://www.wikidata.org/wiki/Q596077","display_name":"Counterexample","level":2,"score":0.2508000135421753}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-032-09524-4_13","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-032-09524-4_13","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:ris.utwente.nl:openaire/327d1716-f6fc-47af-9699-ee1ab257a8ec","is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/327d1716-f6fc-47af-9699-ee1ab257a8ec","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Hartmanns, A & Modderman, R 2026, DTMC Model Checking by\u00a0Path Abstraction Revisited. in P Ganty & A Mansutti (eds), Reachability Problems : 19th International Conference, RP 2025, Proceedings. 1 edn, Lecture Notes in Computer Science, vol. 16230 LNCS, Springer, Cham, pp. 186-201, 19th International Conference on Reachability Problems, RP 2025, Madrid, Spain, 1/10/25. https://doi.org/10.1007/978-3-032-09524-4_13","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":{"id":"pmh:oai:ris.utwente.nl:openaire/327d1716-f6fc-47af-9699-ee1ab257a8ec","is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/327d1716-f6fc-47af-9699-ee1ab257a8ec","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Hartmanns, A & Modderman, R 2026, DTMC Model Checking by\u00a0Path Abstraction Revisited. in P Ganty & A Mansutti (eds), Reachability Problems : 19th International Conference, RP 2025, Proceedings. 1 edn, Lecture Notes in Computer Science, vol. 16230 LNCS, Springer, Cham, pp. 186-201, 19th International Conference on Reachability Problems, RP 2025, Madrid, Spain, 1/10/25. https://doi.org/10.1007/978-3-032-09524-4_13","raw_type":"info:eu-repo/semantics/conferenceObject"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W77329694","https://openalex.org/W190605804","https://openalex.org/W275084143","https://openalex.org/W357046174","https://openalex.org/W1586417893","https://openalex.org/W1600556058","https://openalex.org/W1686216641","https://openalex.org/W1809182522","https://openalex.org/W1880436303","https://openalex.org/W1999354872","https://openalex.org/W2075813176","https://openalex.org/W2104851058","https://openalex.org/W2135366134","https://openalex.org/W2160612550","https://openalex.org/W2206900256","https://openalex.org/W2250607661","https://openalex.org/W3179132544","https://openalex.org/W4387850859","https://openalex.org/W4402425486","https://openalex.org/W4412515023","https://openalex.org/W7079724300"],"related_works":[],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-11-04T00:00:00"}