{"id":"https://openalex.org/W2402431382","doi":"https://doi.org/10.2168/lmcs-11(1:15)2015","title":"High-level Counterexamples for Probabilistic Automata","display_name":"High-level Counterexamples for Probabilistic Automata","publication_year":2015,"publication_date":"2015-03-31","ids":{"openalex":"https://openalex.org/W2402431382","doi":"https://doi.org/10.2168/lmcs-11(1:15)2015","mag":"2402431382"},"language":"en","primary_location":{"id":"doi:10.2168/lmcs-11(1:15)2015","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-11(1:15)2015","pdf_url":"https://lmcs.episciences.org/945/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/945/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Ralf Wimmer","orcid":"https://orcid.org/0000-0003-4973-7479"},"institutions":[{"id":"https://openalex.org/I161046081","display_name":"University of Freiburg","ror":"https://ror.org/0245cg223","country_code":"DE","type":"education","lineage":["https://openalex.org/I161046081"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Ralf Wimmer","raw_affiliation_strings":["Albert-Ludwigs-Universitt Freiburg, Germany"],"affiliations":[{"raw_affiliation_string":"Albert-Ludwigs-Universitt Freiburg, Germany","institution_ids":["https://openalex.org/I161046081"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Nils Jansen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nils Jansen","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Erika \u00c3?brah\u00c3?m","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Erika \u00c3?brah\u00c3?m","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":null,"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":["RWTH Aachen University, Germany"],"affiliations":[{"raw_affiliation_string":"RWTH Aachen University, Germany","institution_ids":["https://openalex.org/I887968799"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I161046081"],"apc_list":null,"apc_paid":null,"fwci":0.7277,"has_fulltext":true,"cited_by_count":13,"citation_normalized_percentile":{"value":0.76814231,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"Volume 11, Issue 1","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9624000191688538,"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.9624000191688538,"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/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.005799999926239252,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.00559999980032444,"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/counterexample","display_name":"Counterexample","score":0.9071000218391418},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.776199996471405},{"id":"https://openalex.org/keywords/probabilistic-automaton","display_name":"Probabilistic automaton","score":0.6037999987602234},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5728999972343445},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5296000242233276},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.5022000074386597}],"concepts":[{"id":"https://openalex.org/C162838799","wikidata":"https://www.wikidata.org/wiki/Q596077","display_name":"Counterexample","level":2,"score":0.9071000218391418},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.776199996471405},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7020000219345093},{"id":"https://openalex.org/C174784677","wikidata":"https://www.wikidata.org/wiki/Q176567","display_name":"Probabilistic automaton","level":3,"score":0.6037999987602234},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.597000002861023},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5728999972343445},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5296000242233276},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5022000074386597},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.41499999165534973},{"id":"https://openalex.org/C165753454","wikidata":"https://www.wikidata.org/wiki/Q1020380","display_name":"B\u00fcchi automaton","level":4,"score":0.3970000147819519},{"id":"https://openalex.org/C52063229","wikidata":"https://www.wikidata.org/wiki/Q7246845","display_name":"Probabilistic CTL","level":4,"score":0.39430001378059387},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36329999566078186},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.32280001044273376},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.29739999771118164},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.2822999954223633},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2759000062942505},{"id":"https://openalex.org/C30888246","wikidata":"https://www.wikidata.org/wiki/Q4669969","display_name":"Abstraction model checking","level":3,"score":0.26080000400543213}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.2168/lmcs-11(1:15)2015","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-11(1:15)2015","pdf_url":"https://lmcs.episciences.org/945/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1305.5055","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1305.5055","pdf_url":"https://arxiv.org/pdf/1305.5055","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:doaj.org/article:e8991b26b3d64c1683df1129207a13a9","is_oa":true,"landing_page_url":"https://doaj.org/article/e8991b26b3d64c1683df1129207a13a9","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 11, Issue 1 (2015)","raw_type":"article"},{"id":"pmh:oai:freidok.uni-freiburg.de:132100","is_oa":false,"landing_page_url":"https://freidok.uni-freiburg.de/data/132100","pdf_url":null,"source":{"id":"https://openalex.org/S4306401057","display_name":"FreiDok plus (Universit\u00e4tsbibliothek Freiburg)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I161046081","host_organization_name":"University of Freiburg","host_organization_lineage":["https://openalex.org/I161046081"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical methods in computer science. - 11, 1 (2015) , 1-23, ISSN: 1860-5974","raw_type":"article"}],"best_oa_location":{"id":"doi:10.2168/lmcs-11(1:15)2015","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-11(1:15)2015","pdf_url":"https://lmcs.episciences.org/945/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3582310573","display_name":null,"funder_award_id":"AVACS","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G4064624828","display_name":null,"funder_award_id":"SFB/TR","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G5949215475","display_name":null,"funder_award_id":"SFB/TR 14","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G6052429835","display_name":null,"funder_award_id":"(DFG)","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G6726257700","display_name":null,"funder_award_id":"AB 461/1-1","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2402431382.pdf","grobid_xml":"https://content.openalex.org/works/W2402431382.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Providing":[0],"compact":[1],"and":[2],"understandable":[3],"counterexamples":[4,19],"for":[5,20],"violated":[6],"system":[7,31,90],"properties":[8],"is":[9],"an":[10],"essential":[11],"task":[12],"in":[13,47,55],"model":[14,67],"checking.":[15],"Existing":[16],"works":[17],"on":[18],"probabilistic":[21,51],"systems":[22,52],"so":[23],"far":[24],"computed":[25],"either":[26],"a":[27,34,56,76,105],"large":[28],"set":[29],"of":[30,36,41,44,80],"runs":[32],"or":[33],"subset":[35,79],"the":[37,61,65,81,89,96],"system's":[38],"states,":[39],"both":[40],"which":[42,86],"are":[43,53],"limited":[45],"use":[46],"manual":[48],"debugging.":[49],"Many":[50],"described":[54],"guarded":[57],"command":[58],"language":[59],"like":[60],"one":[62],"used":[63],"by":[64],"popular":[66],"checker":[68],"PRISM.":[69],"In":[70],"this":[71],"paper":[72],"we":[73],"describe":[74],"how":[75,95],"smallest":[77],"possible":[78],"commands":[82,98],"can":[83,99],"be":[84,100],"identified":[85],"together":[87],"make":[88],"erroneous.":[91],"We":[92],"additionally":[93],"show":[94],"selected":[97],"further":[101],"simplified":[102],"to":[103],"obtain":[104],"well-understandable":[106],"counterexample.":[107]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2016-06-24T00:00:00"}