{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T05:42:48Z","timestamp":1648964568289},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,11,23]],"date-time":"2012-11-23T00:00:00Z","timestamp":1353628800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math.Comput.Sci."],"published-print":{"date-parts":[[2012,12]]},"DOI":"10.1007\/s11786-012-0137-2","type":"journal-article","created":{"date-parts":[[2012,11,22]],"date-time":"2012-11-22T17:26:28Z","timestamp":1353605188000},"page":"475-497","source":"Crossref","is-referenced-by-count":1,"title":["A Calculus for Generic, QoS-Aware Component Composition"],"prefix":"10.1007","volume":"6","author":[{"given":"L. S.","family":"Barbosa","sequence":"first","affiliation":[]},{"given":"Sun","family":"Meng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,11,23]]},"reference":[{"issue":"8","key":"137_CR1","first-page":"157","volume":"14","author":"J. Adamek","year":"2005","unstructured":"Adamek J.: An introduction to coalgebra. Theory Appl. Categ. 14(8), 157\u2013199 (2005)","journal-title":"Theory Appl. Categ."},{"issue":"8","key":"137_CR2","first-page":"891","volume":"9","author":"L.S. Barbosa","year":"2003","unstructured":"Barbosa L.S.: Towards a calculus of state-based software components. J. Univ. Comput. Sci. 9(8), 891\u2013909 (2003)","journal-title":"J. Univ. Comput. Sci."},{"key":"137_CR3","doi-asserted-by":"crossref","unstructured":"Barbosa, L.S., Meng, S.: QoS-aware Component Composition. Proceeding of the CISIS 2010, IEEE Computer Society, pp. 1008\u20131013 (2010)","DOI":"10.1109\/CISIS.2010.141"},{"issue":"1","key":"137_CR4","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S1571-0661(04)80631-5","volume":"82","author":"L.S. Barbosa","year":"2003","unstructured":"Barbosa L.S., Oliveira J.N.: State-based components made generic. Electr. Notes Theor. Comput. Sci. 82(1), 39\u201356 (2003)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"issue":"1\u20132","key":"137_CR5","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/j.tcs.2006.07.030","volume":"365","author":"L.S. Barbosa","year":"2006","unstructured":"Barbosa L.S., Oliveira J.N.: Transposing partial components: an exercise on coalgebraic refinement. Theor. Comput. Sci. 365(1\u20132), 2\u201322 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"137_CR6","volume-title":"Algebra of Programming","author":"R. Bird","year":"1997","unstructured":"Bird R., de Moor O.: Algebra of Programming. Prentice Hall, Englewood Cliffs (1997)"},{"key":"137_CR7","doi-asserted-by":"crossref","DOI":"10.1002\/0471791571","volume-title":"Queueing Networks and Markov Chains: Modeling and Performance Evaluation with Computer Science Applications","author":"G. Bolch","year":"2006","unstructured":"Bolch G., Greiner S., de Meer H., Trivedi K.S.: Queueing Networks and Markov Chains: Modeling and Performance Evaluation with Computer Science Applications. Wiley, Hoboken (2006)"},{"issue":"2","key":"137_CR8","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/j.entcs.2007.03.009","volume":"175","author":"T. Chothia","year":"2007","unstructured":"Chothia T., Kleijn J.: Q-Automata: modelling the resource usage of concurrent components. Electr. Notes Theor. Comput. Sci. 175(2), 153\u2013167 (2007)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"137_CR9","doi-asserted-by":"crossref","unstructured":"Hasuo, I., Heunen, C., Jacobs, B., Sokolova, A.: Coalgebraic components in a many-sorted microcosm. Proceeding of CALCO 2009, Lecture Notes in Computer Science 5728, Springer, pp. 64\u201380 (2009)","DOI":"10.1007\/978-3-642-03741-2_6"},{"issue":"1\u20132","key":"137_CR10","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/j.tcs.2004.07.022","volume":"327","author":"J. Hughes","year":"2004","unstructured":"Hughes J., Jacobs B.: Simulations in coalgebra. Theor. Comput. Sci. 327(1\u20132), 71\u2013108 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"137_CR11","doi-asserted-by":"crossref","unstructured":"Hasuo, I.: Generic Forward and Backward Simulations II: Probabilistic Simulation. Proceedings of CONCUR 2010, Lecture Notes in Computer Science 6269, Springer, pp. 447\u2013461 (2009)","DOI":"10.1007\/978-3-642-15375-4_31"},{"key":"137_CR12","unstructured":"Hoogendijk, P.F.: A generic theory of datatypes. PhD thesis, Department of Computing Science, Eindhoven University of Technology (1996)"},{"key":"137_CR13","doi-asserted-by":"crossref","unstructured":"Jacobs, B.: Exercises in coalgebraic specification. Algebraic and Coalgebraic Methods in the Mathematics of Program Construction, volume 2297 of LNCS, Springer, pp. 237\u2013280 (2002)","DOI":"10.1007\/3-540-47797-7_7"},{"key":"137_CR14","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF01304852","volume":"23","author":"A. Kock","year":"1972","unstructured":"Kock A.: Strong functors and monoidal monads. Arch. Math. 23, 113\u2013120 (1972)","journal-title":"Arch. Math."},{"key":"137_CR15","doi-asserted-by":"crossref","unstructured":"Martins, A., Barbosa, L.S., Rodrigues, N.F.: Shacc: A Functional Prototyper for a Component Calculus. Proceedings CALCO-Tools\u201911, Lecture Notes in Computer Science 6859, Springer, pp. 413\u2013419 (2011)","DOI":"10.1007\/978-3-642-22944-2_32"},{"issue":"2","key":"137_CR16","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1145\/190.191","volume":"2","author":"M.A. Marsan","year":"1984","unstructured":"Marsan M.A., Conte G., Balbo G.: A class of generalized stochastic petri nets for the performance evaluation of multiprocessor systems. ACM Trans. Comput. Syst. 2(2), 93\u2013122 (1984)","journal-title":"ACM Trans. Comput. Syst."},{"issue":"6","key":"137_CR17","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1109\/MIC.2004.71","volume":"8","author":"D.A. Menasc\u00e9","year":"2004","unstructured":"Menasc\u00e9 D.A.: Composing web services: a QoS view. IEEE Internet Comput. 8(6), 8\u201390 (2004)","journal-title":"IEEE Internet Comput."},{"key":"137_CR18","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner R.: Communication and Concurrency. Prentice Hall, Englewood Cliffs (1989)"},{"key":"137_CR19","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0304-3975(00)00056-6","volume":"249","author":"J. Rutten","year":"2000","unstructured":"Rutten J.: Universal coalgebra: a theory of systems. Theor. Comput. Sci. 249, 3\u201380 (2000)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"137_CR20","doi-asserted-by":"crossref","first-page":"103","DOI":"10.3233\/FI-2009-144","volume":"95","author":"S. Meng","year":"2009","unstructured":"Meng S., Arbab F.: QoS-driven service selection and composition using quantitative constraint automata. Fundam. Inf. 95(1), 103\u2013128 (2009)","journal-title":"Fundam. Inf."},{"issue":"2","key":"137_CR21","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1016\/j.tcs.2005.09.072","volume":"351","author":"S. Meng","year":"2006","unstructured":"Meng S., Barbosa L.S.: Components as coalgebras: the refinement dimension. Theor. Comput. Sci. 351(2), 276\u2013294 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"137_CR22","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/j.entcs.2008.03.094","volume":"207","author":"S. Meng","year":"2008","unstructured":"Meng S.: Pre-galois connection on coalgebras for generic component refinement. Electr. Notes Theor. Comput. Sci. 207, 203\u2013217 (2008)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"137_CR23","volume-title":"Component Software\u2014Beyond Object-Oriented Programming. 2nd edn","author":"C. Szyperski","year":"2003","unstructured":"Szyperski C., Gruntz D., Mure S.: Component Software\u2014Beyond Object-Oriented Programming. 2nd edn. Publishing House of Electronics Industry, Beijing (2003)"},{"issue":"1","key":"137_CR24","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0164-1212(94)90112-0","volume":"27","author":"P.D. Stotts","year":"1994","unstructured":"Stotts P.D., Pugh W.: Parallel finite automata for modeling concurrent software systems. J. Syst. Softw. 27(1), 27\u201343 (1994)","journal-title":"J. Syst. Softw."},{"issue":"5","key":"137_CR25","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1109\/TSE.2004.11","volume":"30","author":"L. Zeng","year":"2004","unstructured":"Zeng L., Benatallah B., Ngu A.H.H., Dumas M., Kalagnanam J., Chang H.: QoS-aware middleware for web services composition. IEEE Trans. Softw. Eng. 30(5), 311\u2013327 (2004)","journal-title":"IEEE Trans. Softw. Eng."}],"container-title":["Mathematics in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-012-0137-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11786-012-0137-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-012-0137-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,16]],"date-time":"2020-07-16T15:28:15Z","timestamp":1594913295000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11786-012-0137-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11,23]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,12]]}},"alternative-id":["137"],"URL":"https:\/\/doi.org\/10.1007\/s11786-012-0137-2","relation":{},"ISSN":["1661-8270","1661-8289"],"issn-type":[{"value":"1661-8270","type":"print"},{"value":"1661-8289","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,11,23]]}}}