{"id":"https://openalex.org/W2102306637","doi":"https://doi.org/10.1016/s1571-0661(05)80595-x","title":"Computing Probability Bounds for Linear Time Formulas over Concurrent Probabilistic Systems","display_name":"Computing Probability Bounds for Linear Time Formulas over Concurrent Probabilistic Systems","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W2102306637","doi":"https://doi.org/10.1016/s1571-0661(05)80595-x","mag":"2102306637"},"language":"en","primary_location":{"id":"doi:10.1016/s1571-0661(05)80595-x","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(05)80595-x","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1016/s1571-0661(05)80595-x","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5097063833","display_name":"Christel Baier Marta","orcid":null},"institutions":[{"id":"https://openalex.org/I177802217","display_name":"University of Mannheim","ror":"https://ror.org/031bsb921","country_code":"DE","type":"education","lineage":["https://openalex.org/I177802217"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Christel Baier Marta, Kwiatkowska Gethin, Norman","raw_affiliation_strings":["University of Mannheim"],"affiliations":[{"raw_affiliation_string":"University of Mannheim","institution_ids":["https://openalex.org/I177802217"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5097063833"],"corresponding_institution_ids":["https://openalex.org/I177802217"],"apc_list":null,"apc_paid":null,"fwci":0.9768,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.77430556,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"22","issue":null,"first_page":"29","last_page":"29"},"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.9965999722480774,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9958999752998352,"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/probabilistic-logic","display_name":"Probabilistic logic","score":0.6880800724029541},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.629131555557251},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6245920658111572},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.5804189443588257},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.5518147945404053},{"id":"https://openalex.org/keywords/state-space","display_name":"State space","score":0.5416006445884705},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5343126058578491},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.5167804956436157},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5029956698417664},{"id":"https://openalex.org/keywords/probability-measure","display_name":"Probability measure","score":0.46723276376724243},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.3492717444896698},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.26633939146995544},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.22879010438919067},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.11064377427101135}],"concepts":[{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6880800724029541},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.629131555557251},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6245920658111572},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.5804189443588257},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.5518147945404053},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.5416006445884705},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5343126058578491},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.5167804956436157},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5029956698417664},{"id":"https://openalex.org/C21031990","wikidata":"https://www.wikidata.org/wiki/Q355020","display_name":"Probability measure","level":2,"score":0.46723276376724243},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3492717444896698},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.26633939146995544},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.22879010438919067},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.11064377427101135},{"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/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/s1571-0661(05)80595-x","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(05)80595-x","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.104.1818","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.104.1818","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/probmiv99.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1016/s1571-0661(05)80595-x","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(05)80595-x","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W122791382","https://openalex.org/W138290785","https://openalex.org/W1497670448","https://openalex.org/W1596186423","https://openalex.org/W1806449990","https://openalex.org/W1963547452","https://openalex.org/W1972203711","https://openalex.org/W2019881090","https://openalex.org/W2047650874","https://openalex.org/W2071659383","https://openalex.org/W2090942994","https://openalex.org/W2091188761","https://openalex.org/W2125500714","https://openalex.org/W2153358971","https://openalex.org/W2165161585","https://openalex.org/W2167435507","https://openalex.org/W4242441073"],"related_works":["https://openalex.org/W2536336862","https://openalex.org/W1992339587","https://openalex.org/W2587928437","https://openalex.org/W303716511","https://openalex.org/W2188447863","https://openalex.org/W2996712820","https://openalex.org/W2035809827","https://openalex.org/W2154602669","https://openalex.org/W2477091536","https://openalex.org/W1936786184"],"abstract_inverted_index":{"Probabilistic":[0],"verification":[1],"of":[2,17,28,36,67,70,75,88],"concurrent":[3],"probabilistic":[4],"systems":[5],"against":[6],"linear":[7,54],"time":[8,18,21,55],"specifications":[9],"is":[10,22,43,100,106,112],"known":[11],"to":[12,50],"be":[13,117],"expensive":[14],"in":[15,25,33,90,123],"terms":[16],"and":[19,31,40,60,102,109,114],"space:":[20],"double":[23],"exponential":[24,45,108],"the":[26,29,34,37,64,68,77,94,98],"size":[27,35],"formula":[30,56],"polynomial":[32],"state":[38],"space,":[39],"space":[41,110],"complexity":[42,111],"single":[44,107],"[24,7].":[46],"This":[47,80],"paper":[48],"proposes":[49],"compute":[51],"for":[52],"a":[53,58,82,124],"only":[57],"lower":[59],"upper":[61],"bound":[62],"on":[63],"probability":[65],"measure":[66],"set":[69],"paths":[71],"satisfying":[72],"it,":[73],"instead":[74],"calculating":[76],"exact":[78],"probability.":[79],"yields":[81],"coarser":[83],"estimate,":[84],"namely":[85],"an":[86,120],"interval":[87],"values":[89],"[0,1]":[91],"which":[92],"contains":[93],"actual":[95],"probability,":[96],"but":[97],"calculation":[99],"simpler":[101],"more":[103],"efficient":[104],"(time":[105],"linear),":[113],"could":[115],"thus":[116],"useful":[118],"as":[119],"initial":[121],"check":[122],"model":[125],"checking":[126],"tool.":[127],"1":[128]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2016-06-24T00:00:00"}