{"id":"https://openalex.org/W2141881497","doi":"https://doi.org/10.1109/tse.2003.1205180","title":"Model-checking algorithms for continuous-time markov chains","display_name":"Model-checking algorithms for continuous-time markov chains","publication_year":2003,"publication_date":"2003-06-01","ids":{"openalex":"https://openalex.org/W2141881497","doi":"https://doi.org/10.1109/tse.2003.1205180","mag":"2141881497"},"language":"en","primary_location":{"id":"doi:10.1109/tse.2003.1205180","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tse.2003.1205180","pdf_url":null,"source":{"id":"https://openalex.org/S8351582","display_name":"IEEE Transactions on Software Engineering","issn_l":"0098-5589","issn":["0098-5589","1939-3520","2326-3881"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Software Engineering","raw_type":"journal-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/A5091344667","display_name":"Christel Baier","orcid":"https://orcid.org/0000-0002-5321-9343"},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"C. Baier","raw_affiliation_strings":["Institut f\u00fcr Informatik I, University of Bonn, Bonn, Germany"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik I, University of Bonn, Bonn, Germany","institution_ids":["https://openalex.org/I135140700"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036034957","display_name":"Boudewijn R. Haverkort","orcid":"https://orcid.org/0000-0002-0654-0740"},"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":"B. Haverkort","raw_affiliation_strings":["Department of Computer Science, University of Twente, Enschede, Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Twente, Enschede, Netherlands","institution_ids":["https://openalex.org/I94624287"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028747794","display_name":"Holger Hermanns","orcid":"https://orcid.org/0000-0002-2766-9615"},"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":"H. Hermanns","raw_affiliation_strings":["Department of Computer Science, University of Twente, Enschede, Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Twente, Enschede, Netherlands","institution_ids":["https://openalex.org/I94624287"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5090819329","display_name":"Joost-Pieter Katoen","orcid":"https://orcid.org/0000-0002-6143-1926"},"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":"J.-P. Katoen","raw_affiliation_strings":["Department of Computer Science, University of Twente, Enschede, Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Twente, Enschede, Netherlands","institution_ids":["https://openalex.org/I94624287"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5091344667"],"corresponding_institution_ids":["https://openalex.org/I135140700"],"apc_list":null,"apc_paid":null,"fwci":25.4576,"has_fulltext":false,"cited_by_count":769,"citation_normalized_percentile":{"value":0.9980254,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"29","issue":"6","first_page":"524","last_page":"541"},"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/T13295","display_name":"Safety Systems Engineering in Autonomy","score":0.9941999912261963,"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"}},{"id":"https://openalex.org/T12423","display_name":"Software Reliability and Analysis Research","score":0.9940000176429749,"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/model-checking","display_name":"Model checking","score":0.7359170913696289},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6786502003669739},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.6614797115325928},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.6464425325393677},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.6249757409095764},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6013416051864624},{"id":"https://openalex.org/keywords/bisimulation","display_name":"Bisimulation","score":0.5892764925956726},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5746451616287231},{"id":"https://openalex.org/keywords/probabilistic-ctl","display_name":"Probabilistic CTL","score":0.5515003800392151},{"id":"https://openalex.org/keywords/computation-tree-logic","display_name":"Computation tree logic","score":0.5238175988197327},{"id":"https://openalex.org/keywords/linear-temporal-logic","display_name":"Linear temporal logic","score":0.5064560174942017},{"id":"https://openalex.org/keywords/uniformization","display_name":"Uniformization (probability theory)","score":0.5015418529510498},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.43627113103866577},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.42513155937194824},{"id":"https://openalex.org/keywords/markov-model","display_name":"Markov model","score":0.32422998547554016},{"id":"https://openalex.org/keywords/probabilistic-analysis-of-algorithms","display_name":"Probabilistic analysis of algorithms","score":0.2880169153213501},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27647700905799866},{"id":"https://openalex.org/keywords/markov-property","display_name":"Markov property","score":0.2333192527294159}],"concepts":[{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.7359170913696289},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6786502003669739},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.6614797115325928},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6464425325393677},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.6249757409095764},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6013416051864624},{"id":"https://openalex.org/C135315306","wikidata":"https://www.wikidata.org/wiki/Q866364","display_name":"Bisimulation","level":2,"score":0.5892764925956726},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5746451616287231},{"id":"https://openalex.org/C52063229","wikidata":"https://www.wikidata.org/wiki/Q7246845","display_name":"Probabilistic CTL","level":4,"score":0.5515003800392151},{"id":"https://openalex.org/C198008173","wikidata":"https://www.wikidata.org/wiki/Q1040040","display_name":"Computation tree logic","level":3,"score":0.5238175988197327},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.5064560174942017},{"id":"https://openalex.org/C149260544","wikidata":"https://www.wikidata.org/wiki/Q7885142","display_name":"Uniformization (probability theory)","level":5,"score":0.5015418529510498},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.43627113103866577},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.42513155937194824},{"id":"https://openalex.org/C163836022","wikidata":"https://www.wikidata.org/wiki/Q6771326","display_name":"Markov model","level":3,"score":0.32422998547554016},{"id":"https://openalex.org/C24404364","wikidata":"https://www.wikidata.org/wiki/Q7246846","display_name":"Probabilistic analysis of algorithms","level":3,"score":0.2880169153213501},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27647700905799866},{"id":"https://openalex.org/C189973286","wikidata":"https://www.wikidata.org/wiki/Q176695","display_name":"Markov property","level":4,"score":0.2333192527294159},{"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/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C86339819","wikidata":"https://www.wikidata.org/wiki/Q407384","display_name":"Transcription factor","level":3,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C158448853","wikidata":"https://www.wikidata.org/wiki/Q425218","display_name":"Repressor","level":4,"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":2,"locations":[{"id":"doi:10.1109/tse.2003.1205180","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tse.2003.1205180","pdf_url":null,"source":{"id":"https://openalex.org/S8351582","display_name":"IEEE Transactions on Software Engineering","issn_l":"0098-5589","issn":["0098-5589","1939-3520","2326-3881"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Software Engineering","raw_type":"journal-article"},{"id":"pmh:oai:ris.utwente.nl:publications/ae23b1a7-12e8-42b1-84f7-c6013de5a528","is_oa":false,"landing_page_url":"https://research.utwente.nl/en/publications/ae23b1a7-12e8-42b1-84f7-c6013de5a528","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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Baier, C, Haverkort, B, Hermanns, H & Katoen, J-P 2003, 'Model-checking algorithms for continuous-time Markov chains', IEEE transactions on software engineering, vol. 29, no. 6, pp. 524-541. https://doi.org/10.1109/TSE.2003.1205180","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":83,"referenced_works":["https://openalex.org/W106209860","https://openalex.org/W192924609","https://openalex.org/W1489725951","https://openalex.org/W1503526472","https://openalex.org/W1511105469","https://openalex.org/W1514324734","https://openalex.org/W1548312885","https://openalex.org/W1548777301","https://openalex.org/W1593428110","https://openalex.org/W1596186423","https://openalex.org/W1596739056","https://openalex.org/W1601373402","https://openalex.org/W1606764134","https://openalex.org/W1655990431","https://openalex.org/W1969553191","https://openalex.org/W1972203711","https://openalex.org/W1975657455","https://openalex.org/W1976268573","https://openalex.org/W1984121732","https://openalex.org/W1990183105","https://openalex.org/W2001289891","https://openalex.org/W2001919784","https://openalex.org/W2005308357","https://openalex.org/W2005998857","https://openalex.org/W2009280542","https://openalex.org/W2020293036","https://openalex.org/W2036426733","https://openalex.org/W2041226400","https://openalex.org/W2044811734","https://openalex.org/W2046577860","https://openalex.org/W2047386147","https://openalex.org/W2048355938","https://openalex.org/W2049229863","https://openalex.org/W2051580064","https://openalex.org/W2064817422","https://openalex.org/W2067136705","https://openalex.org/W2067463757","https://openalex.org/W2069596643","https://openalex.org/W2075379212","https://openalex.org/W2090188531","https://openalex.org/W2090311494","https://openalex.org/W2096899005","https://openalex.org/W2101508170","https://openalex.org/W2107224406","https://openalex.org/W2109828309","https://openalex.org/W2114710208","https://openalex.org/W2115309705","https://openalex.org/W2115716046","https://openalex.org/W2117189826","https://openalex.org/W2118382442","https://openalex.org/W2118744069","https://openalex.org/W2119239145","https://openalex.org/W2119567691","https://openalex.org/W2121431238","https://openalex.org/W2122510266","https://openalex.org/W2124446794","https://openalex.org/W2130415189","https://openalex.org/W2133820906","https://openalex.org/W2159109239","https://openalex.org/W2160136100","https://openalex.org/W2165161585","https://openalex.org/W2168605507","https://openalex.org/W2323009482","https://openalex.org/W2337623929","https://openalex.org/W2653646069","https://openalex.org/W2695253840","https://openalex.org/W2751862591","https://openalex.org/W2796837256","https://openalex.org/W2913459036","https://openalex.org/W3166263510","https://openalex.org/W4206542816","https://openalex.org/W4210485182","https://openalex.org/W4210492057","https://openalex.org/W4213251304","https://openalex.org/W4242441073","https://openalex.org/W4242741415","https://openalex.org/W4285719527","https://openalex.org/W4298023569","https://openalex.org/W4299326032","https://openalex.org/W4301441647","https://openalex.org/W6607766122","https://openalex.org/W6632948212","https://openalex.org/W6796158857"],"related_works":["https://openalex.org/W2015927812","https://openalex.org/W2798742893","https://openalex.org/W858755136","https://openalex.org/W2578014083","https://openalex.org/W31328628","https://openalex.org/W3005864166","https://openalex.org/W1981889059","https://openalex.org/W4213436577","https://openalex.org/W1816240867","https://openalex.org/W1568272487"],"abstract_inverted_index":{"Continuous-time":[0],"Markov":[1],"chains":[2],"(CTMCs)":[3],"have":[4],"been":[5],"widely":[6],"used":[7],"to":[8,71,83,98,134],"determine":[9],"system":[10,100,116],"performance":[11],"and":[12,24,41,107,111],"dependability":[13],"characteristics.":[14],"Their":[15],"analysis":[16,157],"most":[17],"often":[18],"concerns":[19],"the":[20,55,90,108,124,135,146,180,186],"computation":[21],"of":[22,54,60,101,126,137,148,169,182],"steady-state":[23,85,109],"transient-state":[25],"probabilities.":[26,86],"This":[27,144],"paper":[28],"introduces":[29],"a":[30,67,99,112,167,173],"branching":[31],"temporal":[32],"logic":[33,58,96],"for":[34,47,94,142,155,158,176],"expressing":[35],"real-time":[36],"probabilistic":[37,73,149],"properties":[38,75,130,151],"on":[39],"CTMCs":[40,159],"presents":[42],"approximate":[43],"model":[44,91],"checking":[45,92],"algorithms":[46],"this":[48,95],"logic.":[49,187],"The":[50],"logic,":[51],"an":[52,81],"extension":[53],"continuous":[56],"stochastic":[57],"CSL":[59],"Aziz":[61],"et":[62],"al.":[63],"(1995,":[64],"2000),":[65],"contains":[66],"time-bounded":[68,118,128],"until":[69,106,129],"operator":[70,82],"express":[72,84],"timing":[74,150],"over":[76],"paths":[77],"as":[78,80,161],"well":[79],"We":[87,120],"show":[88,122,165],"that":[89,123,166],"problem":[93,125,136],"reduces":[97],"linear":[102],"equations":[103],"(for":[104,117],"unbounded":[105],"operator)":[110],"Volterra":[113],"integral":[114],"equation":[115],"until).":[119],"then":[121],"model-checking":[127],"can":[131],"be":[132],"reduced":[133],"computing":[138],"transient":[139,156],"state":[140],"probabilities":[141],"CTMCs.":[143],"allows":[145],"verification":[147],"by":[152],"efficient":[153],"techniques":[154],"such":[160],"uniformization.":[162],"Finally,":[163],"we":[164],"variant":[168],"lumping":[170],"equivalence":[171],"(bisimulation),":[172],"well-known":[174],"notion":[175],"aggregating":[177],"CTMCs,":[178],"preserves":[179],"validity":[181],"all":[183],"formulas":[184],"in":[185]},"counts_by_year":[{"year":2025,"cited_by_count":14},{"year":2024,"cited_by_count":18},{"year":2023,"cited_by_count":15},{"year":2022,"cited_by_count":15},{"year":2021,"cited_by_count":19},{"year":2020,"cited_by_count":30},{"year":2019,"cited_by_count":16},{"year":2018,"cited_by_count":29},{"year":2017,"cited_by_count":37},{"year":2016,"cited_by_count":43},{"year":2015,"cited_by_count":50},{"year":2014,"cited_by_count":54},{"year":2013,"cited_by_count":53},{"year":2012,"cited_by_count":54}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}