{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:23:57Z","timestamp":1775053437284,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540425564","type":"print"},{"value":"9783540448044","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44804-7_9","type":"book-chapter","created":{"date-parts":[[2007,7,20]],"date-time":"2007-07-20T14:22:41Z","timestamp":1184941361000},"page":"136-151","source":"Crossref","is-referenced-by-count":4,"title":["Reward Based Congruences: Can We Aggregate More?"],"prefix":"10.1007","author":[{"given":"Marco","family":"Bernardo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mario","family":"Bravetti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,8,30]]},"reference":[{"key":"9_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/3-540-48320-9_12","volume-title":"Proc. of CONCUR\u2019 99","author":"C. Baier","year":"1999","unstructured":"C. Baier, J.-P. Katoen, H. Hermanns, \u201cApproximate Symbolic Model Checking of Continuous Time Markov Chains\u201d, in Proc. of CONCUR\u2019 99, LNCS 1664:146\u2013162"},{"key":"9_CR2","unstructured":"M. Bernardo, \u201cTheory and Application of Extended Markovian Process Algebra\u201d, Ph.D. Thesis, University of Bologna (Italy), 1999 ( http:\/\/www.di.unito.it\/~bernardo\/ )"},{"key":"9_CR3","unstructured":"M. Bernardo, M. Bravetti, \u201cPerformance Measure Sensitive Congruences for Markovian Process Algebras\u201d, to appear in Theoretical Computer Science, 2001"},{"key":"9_CR4","unstructured":"M. Bernardo, M. Bravetti, \u201cFormal Specification of Performance Measures for Process Algebra Models of Concurrent Systems\u201d, Tech. Rep. UBLCS-1998-08, University of Bologna (Italy), 1998 (revised 2001)"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"M. Bravetti, M. Bernardo, \u201cCompositional Asymmetric Cooperations for Process Algebras with Probabilities, Priorities, and Time\u201d, Tech. Rep. UBLCS-2000-01, University of Bologna (Italy), 2000 (extended abstract in MTCS\u2019 00, Electronic Notes in Theoretical Computer Science 39(3))","DOI":"10.1016\/S1571-0661(05)01220-X"},{"key":"9_CR6","unstructured":"G. Clark, \u201cFormalising the Specification of Rewards with PEPA\u201d, in Proc. Of PAPM\u2019 96, CLUT, pp. 139\u2013160"},{"key":"9_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/3-540-48778-6_13","volume-title":"Proc. of ARTS\u2019 99","author":"G. Clark","year":"1999","unstructured":"G. Clark, S. Gilmore, J. Hillston, \u201cSpecifying Performance Measures for PEPA\u201d, in Proc. of ARTS\u2019 99, LNCS 1601:211\u2013227"},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1006\/inco.1995.1123","volume":"121","author":"R.J. Glabbeek van","year":"1995","unstructured":"R.J. van Glabbeek, S.A. Smolka, B. Steffen, \u201cReactive, Generative and Stratified Models of Probabilistic Processes\u201d, in Information and Computation 121:59\u201380, 1995","journal-title":"Information and Computation"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/BF01439850","volume":"3","author":"B.R. Haverkort","year":"1993","unstructured":"B.R. Haverkort, K.S. Trivedi, \u201cSpecification Techniques for Markov Reward Models\u201d, in Discrete Event Dynamic Systems: Theory and Applications 3:219\u2013247, 1993","journal-title":"Discrete Event Dynamic Systems: Theory and Applications"},{"key":"9_CR10","unstructured":"R.A. Howard, \u201cDynamic Probabilistic Systems\u201d, John Wiley & Sons, 1971"},{"key":"9_CR11","series-title":"Tech. Rep.","volume-title":"Lumping in Markov Reward Processes","author":"V.F. Nicola","year":"1990","unstructured":"V.F. Nicola, \u201cLumping in Markov Reward Processes\u201d, Tech. Rep. RC-14719, IBM T.J. Watson Research Center, Yorktown Heights (NY), 1990"},{"key":"9_CR12","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/978-3-7091-9123-1_10","volume":"4","author":"W.H. Sanders","year":"1991","unstructured":"W.H. Sanders, J.F. Meyer, \u201cA Unified Approach for Specifying Measures of Performance, Dependability, and Performability\u201d, in Dependable Computing and Fault Tolerant Systems 4:215\u2013237, 1991","journal-title":"Dependable Computing and Fault Tolerant Systems"},{"key":"9_CR13","unstructured":"J.E. Voeten, \u201cTemporal Rewards for Performance Evaluation\u201d, in Proc. of PAPM\u2019 00, Carleton Scientific, pp. 511\u2013522"}],"container-title":["Lecture Notes in Computer Science","Process Algebra and Probabilistic Methods. Performance Modelling and Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44804-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T06:59:25Z","timestamp":1556693965000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44804-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540425564","9783540448044"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-44804-7_9","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}