{"id":"https://openalex.org/W2020293036","doi":null,"title":"Formal verification of probabilistic systems","display_name":"Formal verification of probabilistic systems","publication_year":1997,"publication_date":"1997-01-01","ids":{"openalex":"https://openalex.org/W2020293036","mag":"2020293036"},"language":"en","primary_location":{"id":"mag:2020293036","doi":null,"is_oa":false,"landing_page_url":"http://dl.acm.org/citation.cfm?id=892621","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"volume":null,"type":"book","indexed_in":[],"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/A5034436241","display_name":"Zohar Manna","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zohar Manna","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5050777140","display_name":"Luca de Alfaro","orcid":"https://orcid.org/0000-0003-3856-4576","observed_orcids":["https://orcid.org/0000-0003-3856-4576"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Luca de Alfaro","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0003-3856-4576","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.1299,"has_fulltext":false,"cited_by_count":370,"citation_normalized_percentile":{"value":0.85357143,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":null,"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.9990000128746033,"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.9990000128746033,"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/T10126","display_name":"Logic, programming, and type systems","score":0.00039999998989515007,"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/T11125","display_name":"Petri Nets in System Modeling","score":0.0003000000142492354,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/formal-verification","display_name":"formal verification","score":0.8960000276565552},{"id":"https://openalex.org/keywords/probabilistic-systems","display_name":"probabilistic systems","score":1.0},{"id":"https://openalex.org/keywords/branching-time-temporal-logic","display_name":"branching-time temporal logic","score":0.9350000023841858},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.949999988079071},{"id":"https://openalex.org/keywords/performance-evaluation","display_name":"performance evaluation","score":0.597000002861023},{"id":"https://openalex.org/keywords/stochastic-shortest-path-problem","display_name":"stochastic shortest path problem","score":0.8330000042915344},{"id":"https://openalex.org/keywords/reachability-probability","display_name":"reachability probability","score":0.9739999771118164},{"id":"https://openalex.org/keywords/semi-markov-decision-process","display_name":"semi-Markov decision process","score":0.9340000152587891},{"id":"https://openalex.org/keywords/average-reward","display_name":"average reward","score":0.8529999852180481},{"id":"https://openalex.org/keywords/throughput","display_name":"throughput","score":0.5669999718666077},{"id":"https://openalex.org/keywords/response-time","display_name":"response time","score":0.9129999876022339},{"id":"https://openalex.org/keywords/nondeterminism","display_name":"non-determinism","score":0.7860000133514404},{"id":"https://openalex.org/keywords/fairness","display_name":"fairness","score":0.6909999847412109}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.7160604000091553},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.699151873588562},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6951582431793213},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5922762751579285},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.5615158677101135},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.48192715644836426},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.46346110105514526},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.4339805245399475},{"id":"https://openalex.org/C75606506","wikidata":"https://www.wikidata.org/wiki/Q1049183","display_name":"Formal methods","level":2,"score":0.43310391902923584},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.42976823449134827},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.3534430265426636},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2321566343307495},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.20771777629852295},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16183078289031982},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.1297827661037445},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2020293036","doi":null,"is_oa":false,"landing_page_url":"http://dl.acm.org/citation.cfm?id=892621","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2481947210","https://openalex.org/W2740930950","https://openalex.org/W37462798","https://openalex.org/W4376600436","https://openalex.org/W2121431238","https://openalex.org/W1532183266","https://openalex.org/W4299560460","https://openalex.org/W7030316389","https://openalex.org/W7047580375","https://openalex.org/W7033432616"],"abstract_inverted_index":{"This":[0,64,138],"dissertation":[1],"presents":[2],"methods":[3],"for":[4,15,165,179],"the":[5,16,26,55,78,83,108,119,130,153,157,166,175],"formal":[6,40,73],"modeling":[7],"and":[8,13,37,53,59,92,101,125,132,171],"specification":[9,41,102],"of":[10,19,28,33,49,57,67,77,85,98,110,121,135,156,168],"probabilistic":[11,133],"systems,":[12],"algorithms":[14,116],"automated":[17],"verification":[18,113],"these":[20,136],"systems.":[21],"Our":[22,96],"system":[23,30,62,90,99],"models":[24,100],"describe":[25],"behavior":[27],"a":[29,127],"in":[31,82],"terms":[32],"probability,":[34],"nondeterminism,":[35],"fairness":[36],"time.":[38,95],"The":[39,115],"languages":[42,103],"we":[43],"consider":[44],"are":[45],"based":[46],"on":[47,118,174],"extensions":[48],"branching-time":[50],"temporal":[51],"logics,":[52],"enable":[54],"expression":[56],"single-event":[58],"long-run":[60],"average":[61,93,176],"properties.":[63],"latter":[65],"class":[66],"properties,":[68],"not":[69],"expressible":[70],"with":[71],"previous":[72],"languages,":[74],"includes":[75],"most":[76],"performance":[79,86],"properties":[80,134],"studied":[81],"field":[84],"evaluation,":[87],"such":[88,148],"as":[89,149],"throughput":[91],"response":[94],"choice":[97],"has":[104],"been":[105],"guided":[106],"by":[107],"goal":[109],"providing":[111],"efficient":[112],"algorithms.":[114],"rely":[117],"theory":[120],"Markov":[122],"decision":[123,181],"processes,":[124],"exploit":[126],"connection":[128,139],"between":[129],"graph-theoretical":[131],"processes.":[137,182],"also":[140],"leads":[141],"to":[142,152],"new":[143,172],"results":[144,173],"about":[145],"classical":[146],"problems,":[147],"an":[150,162],"extension":[151],"solvable":[154],"cases":[155],"stochastic":[158],"shortest":[159],"path":[160],"problem,":[161],"improved":[163],"algorithm":[164],"computation":[167],"reachability":[169],"probabilities,":[170],"reward":[177],"problem":[178],"semi-Markov":[180]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":10},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":11},{"year":2020,"cited_by_count":13},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":9},{"year":2017,"cited_by_count":14},{"year":2016,"cited_by_count":10},{"year":2015,"cited_by_count":20},{"year":2014,"cited_by_count":31},{"year":2013,"cited_by_count":16},{"year":2012,"cited_by_count":20}],"updated_date":"2026-10-28T10:33:24.094632","created_date":"2016-06-24T00:00:00"}