{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:24:57Z","timestamp":1761596697602},"reference-count":32,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1998,4,1]],"date-time":"1998-04-01T00:00:00Z","timestamp":891388800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1998,4]]},"DOI":"10.1016\/s0020-0190(98)00038-6","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T13:32:24Z","timestamp":1049722344000},"page":"71-79","source":"Crossref","is-referenced-by-count":26,"title":["On the verification of qualitative properties of probabilistic processes under fairness constraints"],"prefix":"10.1016","volume":"66","author":[{"given":"Christel","family":"Baier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marta","family":"Kwiatkowsk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(98)00038-6_BIB1","series-title":"Proc. ICALP'91","first-page":"115","article-title":"Model-checking for probabilistic real-time systems","volume":"510","author":"Alur","year":"1991"},{"key":"10.1016\/S0020-0190(98)00038-6_BIB2","article-title":"Formal verification of performance and reliability of real-time systems","author":"de Alfaro","year":"1996"},{"key":"10.1016\/S0020-0190(98)00038-6_BIB3","doi-asserted-by":"crossref","unstructured":"C. Baier, M.Z. Kwiatkowska, Model checking for a probabilistic branching time logic with fairness, Distrib. Comput., to appear.","DOI":"10.1007\/s004460050046"},{"key":"10.1016\/S0020-0190(98)00038-6_BIB4","series-title":"Proc. EXPRESS'97","article-title":"Domain equations for probabilistic processes","volume":"7","author":"Baier","year":"1997"},{"key":"10.1016\/S0020-0190(98)00038-6_BIB5","series-title":"Proc. Foundations of Software Technology and Theoretical Computer Science","first-page":"499","article-title":"Model checking of probabilistic and nondeterministic systems","volume":"1026","author":"Bianco","year":"1995"},{"key":"10.1016\/S0020-0190(98)00038-6_BIB6","series-title":"Proc. Foundations of Software Technology and Theoretical Computer Science","first-page":"342","article-title":"Reasoning about safety and liveness properties for probabilistic processes","volume":"652","author":"Christoff","year":"1992"},{"key":"10.1016\/S0020-0190(98)00038-6_BIB7","series-title":"Proc. FOCS'88","first-page":"338","article-title":"Verifying temporal properties of finite-state probabilistic programs","author":"Courcoubetis","year":"1988"},{"key":"10.1016\/S0020-0190(98)00038-6_BIB8","series-title":"Fairness","author":"Francez","year":"1988"},{"key":"10.1016\/S0020-0190(98)00038-6_BIB9","series-title":"Proc. IFIP TC2 Working Conference on Programming Concepts and Methods","article-title":"Algebraic reasoning for probabilistic concurrent systems","author":"Giacalone","year":"1990"},{"issue":"1","key":"10.1016\/S0020-0190(98)00038-6_BIB10","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1006\/inco.1995.1123","article-title":"Reactive, generative, and stratified models for probabilistic processes","volume":"121","author":"van Glabbeek","year":"1995","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0020-0190(98)00038-6_BIB11","series-title":"Proc. LICS'90","first-page":"130","article-title":"Reactive, generative, and stratified models for probabilistic processes","author":"van Glabbeek","year":"1990"},{"key":"10.1016\/S0020-0190(98)00038-6_BIB12","series-title":"Time and Probability in Formal Design of Distributed Systems, Real-Time Safety Critical Systems","author":"Hansson","year":"1994"},{"key":"10.1016\/S0020-0190(98)00038-6_BIB13","series-title":"Proc. 11th IEEE Symposium on Real Time Systems","article-title":"A calculus for communicating systems with time and probabilities","author":"Hansson","year":"1990"},{"key":"10.1016\/S0020-0190(98)00038-6_BIB14","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1007\/BF01211866","article-title":"A logic for reasoning about time and probability","volume":"6","author":"Hansson","year":"1994","journal-title":"Formal Aspects of Computing"},{"key":"10.1016\/S0020-0190(98)00038-6_BIB15","series-title":"Proc. 16th ACM Symposium on Theory of Computing","first-page":"1","article-title":"Probabilistic temporal logic for finite and bounded models","author":"Hart","year":"1984"},{"key":"10.1016\/S0020-0190(98)00038-6_BIB16","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1145\/2166.357214","article-title":"Termination of probabilistic concurrent programs","volume":"5","author":"Hart","year":"1983","journal-title":"ACM Trans. Programming Languages"},{"key":"10.1016\/S0020-0190(98)00038-6_BIB17","series-title":"Proc. LICS'95","first-page":"431","article-title":"Compositional testing preorders for probabilistic processes","author":"Jonsson","year":"1995"},{"issue":"7","key":"10.1016\/S0020-0190(98)00038-6_BIB18","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/0950-5849(89)90159-6","article-title":"Survey of fairness notions","volume":"31","author":"Kwiatkowska","year":"1989","journal-title":"Inform. and Software Technol."},{"key":"10.1016\/S0020-0190(98)00038-6_BIB19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(91)90030-6","article-title":"Bisimulation through probabilistic testing","volume":"94","author":"Larsen","year":"1991","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0020-0190(98)00038-6_BIB20","series-title":"Proc. CONCUR'92","first-page":"456","article-title":"Compositional verification of probabilistic processes","volume":"630","author":"Larsen","year":"1992"},{"key":"10.1016\/S0020-0190(98)00038-6_BIB21","series-title":"Proc. ICALP'81","article-title":"Impartiality, justice and fairness: the ethics of concurrent termination","volume":"115","author":"Lehmann","year":"1981"},{"key":"10.1016\/S0020-0190(98)00038-6_BIB22","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/S0019-9958(82)91022-1","article-title":"Reasoning with time and chance","volume":"53","author":"Lehmann","year":"1982","journal-title":"Inform. and Control"},{"key":"10.1016\/S0020-0190(98)00038-6_BIB23","series-title":"Proc. 12th ACM Symp. on Principles of Programming Languages","first-page":"97","article-title":"Checking that finite state concurrent programs satisfy their linear specification","author":"Lichtenstein","year":"1985"},{"key":"10.1016\/S0020-0190(98)00038-6_BIB24","series-title":"Temporal Verification of Reactive Systems: Safety","author":"Manna","year":"1995"},{"key":"10.1016\/S0020-0190(98)00038-6_BIB25","series-title":"Proc. 15th ACM Symposium on Theory of Computing","article-title":"On the extremely fair treatment of probabilistic algorithms","author":"Pnueli","year":"1983"},{"issue":"1","key":"10.1016\/S0020-0190(98)00038-6_BIB26","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/BF01843570","article-title":"Verification of multiprocess probabilistic protocols","volume":"1","author":"Pnueli","year":"1986","journal-title":"Distrib. Comput."},{"key":"10.1016\/S0020-0190(98)00038-6_BIB27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.1993.1012","article-title":"Probabilistic verification","volume":"103","author":"Pnueli","year":"1993","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0020-0190(98)00038-6_BIB28","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BF00265555","article-title":"Fairness and related properties in transition systems\u2014a temporal logic to deal with fairness","volume":"19","author":"Queille","year":"1983","journal-title":"Acta Inform."},{"key":"10.1016\/S0020-0190(98)00038-6_BIB29","article-title":"Modeling and verification of randomized distributed real-time systems","author":"Segala","year":"1995"},{"issue":"5","key":"10.1016\/S0020-0190(98)00038-6_BIB30","doi-asserted-by":"crossref","DOI":"10.1007\/BF01211867","article-title":"Processes with probabilities","volume":"6","author":"Tofts","year":"1994","journal-title":"Formal Aspects of Comput."},{"key":"10.1016\/S0020-0190(98)00038-6_BIB31","series-title":"Proc. FOCS'85","first-page":"327","article-title":"Automatic verification of probabilistic concurrent finite-state programs","author":"Vardi","year":"1985"},{"key":"10.1016\/S0020-0190(98)00038-6_BIB32","series-title":"Proc. Protocol Specification, Testing and Verification XII","first-page":"47","article-title":"Testing probabilistic and nondeterministic processes","author":"Yi","year":"1992"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098000386?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098000386?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T18:27:41Z","timestamp":1556044061000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019098000386"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,4]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1998,4]]}},"alternative-id":["S0020019098000386"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(98)00038-6","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1998,4]]}}}