{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:51:41Z","timestamp":1725537101414},"publisher-location":"Berlin, Heidelberg","reference-count":39,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642040801"},{"type":"electronic","value":"9783642040818"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04081-8_11","type":"book-chapter","created":{"date-parts":[[2009,8,31]],"date-time":"2009-08-31T16:27:08Z","timestamp":1251736028000},"page":"146-162","source":"Crossref","is-referenced-by-count":8,"title":["Deriving Syntax and Axioms for Quantitative Regular Behaviours"],"prefix":"10.1007","author":[{"given":"Filippo","family":"Bonchi","sequence":"first","affiliation":[]},{"given":"Marcello","family":"Bonsangue","sequence":"additional","affiliation":[]},{"given":"Jan","family":"Rutten","sequence":"additional","affiliation":[]},{"given":"Alexandra","family":"Silva","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/3-540-45719-4_17","volume-title":"Algebraic Methodology and Software Technology","author":"L. Aceto","year":"2002","unstructured":"Aceto, L., \u00c9sik, Z., Ing\u00f3lfsd\u00f3ttir, A.: Equational axioms for probabilistic bisimilarity. In: Kirchner, H., Ringeissen, C. (eds.) AMAST 2002. LNCS, vol.\u00a02422, pp. 239\u2013253. Springer, Heidelberg (2002)"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Baeten, J., Bergstra, J., Smolka, S.: Axiomization probabilistic processes: Acp with generative probabililties (extended abstract). In: Cleaveland [11], pp. 472\u2013485","DOI":"10.1007\/BFb0084810"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","volume-title":"CONCUR \u201990","year":"1990","unstructured":"Baeten, J., Klop, J. (eds.): CONCUR 1990. LNCS, vol.\u00a0458. Springer, Heidelberg (1990)"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/3-540-48224-5_31","volume-title":"Automata, Languages and Programming","author":"E. Bandini","year":"2001","unstructured":"Bandini, E., Segala, R.: Axiomatizations for probabilistic bisimulation. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 370\u2013381. Springer, Heidelberg (2001)"},{"issue":"1-2","key":"11_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2004.07.019","volume":"327","author":"F. Bartels","year":"2004","unstructured":"Bartels, F., Sokolova, A., de Vink, E.: A hierarchy of probabilistic system types. TCS\u00a0327(1-2), 3\u201322 (2004)","journal-title":"TCS"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Bonchi, F., Bonsangue, M., Rutten, J., Silva, A.: Deriving syntax and axioms for quantitative regular behaviours. CWI technical report (2009)","DOI":"10.1007\/978-3-642-04081-8_11"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Bonsangue, M., Rutten, J., Silva, A.: An algebra for Kripke polynomial coalgebras. In: LICS (to appear, 2009)","DOI":"10.1109\/LICS.2009.18"},{"issue":"4","key":"11_CR8","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1145\/321239.321249","volume":"11","author":"J. Brzozowski","year":"1964","unstructured":"Brzozowski, J.: Derivatives of regular expressions. Journal of the ACM\u00a011(4), 481\u2013494 (1964)","journal-title":"Journal of the ACM"},{"issue":"1-3","key":"11_CR9","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.tcs.2007.11.018","volume":"393","author":"P. Buchholz","year":"2008","unstructured":"Buchholz, P.: Bisimulation relations for weighted automata. TCS\u00a0393(1-3), 109\u2013123 (2008)","journal-title":"TCS"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/3-540-44804-7_12","volume-title":"Process Algebra and Probabilistic Methods. Performance Modelling and Verification","author":"P. Buchholz","year":"2001","unstructured":"Buchholz, P., Kemper, P.: Quantifying the dynamic behavior of process algebras. In: de Luca, L., Gilmore, S. (eds.) PROBMIV 2001, PAPM-PROBMIV 2001, and PAPM 2001. LNCS, vol.\u00a02165, pp. 184\u2013199. Springer, Heidelberg (2001)"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","volume-title":"CONCUR \u201992","year":"1992","unstructured":"Cleaveland, R. (ed.): CONCUR 1992. LNCS, vol.\u00a0630. Springer, Heidelberg (1992)"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"D\u2019Argenio, P., Hermanns, H., Katoen, J.-P.: On generative parallel composition. ENTCS\u00a022 (1999)","DOI":"10.1016\/S1571-0661(05)80596-1"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-540-31982-5_7","volume-title":"Foundations of Software Science and Computational Structures","author":"Y. Deng","year":"2005","unstructured":"Deng, Y., Palamidessi, C.: Axiomatizations for Probabilistic Finite-State Behaviors. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol.\u00a03441, pp. 110\u2013124. Springer, Heidelberg (2005)"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/11601548_17","volume-title":"Processes, Terms and Cycles: Steps on the Road to Infinity","author":"Y. Deng","year":"2005","unstructured":"Deng, Y., Palamidessi, C., Pang, J.: Compositional reasoning for probabilistic finite-state behaviors. In: Middeldorp, A., van Oostrom, V., van Raamsdonk, F., de Vrijer, R. (eds.) Processes, Terms and Cycles: Steps on the Road to Infinity. LNCS, vol.\u00a03838, pp. 309\u2013337. Springer, Heidelberg (2005)"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/11523468_42","volume-title":"Automata, Languages and Programming","author":"M. Droste","year":"2005","unstructured":"Droste, M., Gastin, P.: Weighted Automata and Weighted Logics. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 513\u2013525. Springer, Heidelberg (2005)"},{"key":"11_CR16","unstructured":"Giacalone, A., Jou, C., Smolka, S.: Algebraic reasoning for probabilistic concurrent systems. In: Broy, Jones (eds.) Proc. of IFIP TC 2 (1990)"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Gumm, H., Schr\u00f6der, T.: Monoid-labeled transition systems. ENTCS\u00a044(1) (2001)","DOI":"10.1016\/S1571-0661(04)80908-3"},{"issue":"5","key":"11_CR18","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1007\/BF01211866","volume":"6","author":"H. Hansson","year":"1994","unstructured":"Hansson, H., Jonsson, B.: A logic for reasoning about time and reliability. Form. Asp. Comp.\u00a06(5), 512\u2013535 (1994)","journal-title":"Form. Asp. Comp."},{"issue":"1","key":"11_CR19","first-page":"31","volume":"35","author":"B. Jacobs","year":"2001","unstructured":"Jacobs, B.: Many-sorted coalgebraic modal logic: a model-theoretic study. ITA\u00a035(1), 31\u201359 (2001)","journal-title":"ITA"},{"key":"11_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/11780274_20","volume-title":"Algebra, Meaning, and Computation","author":"B. Jacobs","year":"2006","unstructured":"Jacobs, B.: A Bialgebraic Review of Deterministic Automata, Regular Expressions and Languages. In: Futatsugi, K., Jouannaud, J.-P., Meseguer, J. (eds.) Algebra, Meaning, and Computation. LNCS, vol.\u00a04060, pp. 375\u2013404. Springer, Heidelberg (2006)"},{"key":"11_CR21","doi-asserted-by":"crossref","unstructured":"Jou, C., Smolka, S.: Equivalences, congruences, and complete axiomatizations for probabilistic processes. In: Baeten, Klop [3], pp. 367\u2013383","DOI":"10.1007\/BFb0039071"},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Kleene, S.: Representation of events in nerve nets and finite automata. Automata Studies, 3\u201342 (1956)","DOI":"10.1515\/9781400882618-002"},{"key":"11_CR23","doi-asserted-by":"crossref","unstructured":"Kozen, D.: A completeness theorem for Kleene algebras and the algebra of regular events. In: Logic in Computer Science, pp. 214\u2013225 (1991)","DOI":"10.1109\/LICS.1991.151646"},{"issue":"1","key":"11_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(91)90030-6","volume":"94","author":"K. Larsen","year":"1991","unstructured":"Larsen, K., Skou, A.: Bisimulation through probabilistic testing. Inf. Comp.\u00a094(1), 1\u201328 (1991)","journal-title":"Inf. Comp."},{"key":"11_CR25","doi-asserted-by":"crossref","unstructured":"Larsen, K., Skou, A.: Compositional verification of probabilistic processes. In: Cleaveland [11], pp. 456\u2013471","DOI":"10.1007\/BFb0084809"},{"issue":"3","key":"11_CR26","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/0022-0000(84)90023-0","volume":"28","author":"R. Milner","year":"1984","unstructured":"Milner, R.: A complete inference system for a class of regular behaviours. J. Comp. Syst. Sci.\u00a028(3), 439\u2013466 (1984)","journal-title":"J. Comp. Syst. Sci."},{"key":"11_CR27","first-page":"7","volume":"96","author":"M. Mislove","year":"2004","unstructured":"Mislove, M., Ouaknine, J., Worrell, J.: Axioms for probability and nondeterminism. ENTCS\u00a096, 7\u201328 (2004)","journal-title":"ENTCS"},{"key":"11_CR28","first-page":"322","volume-title":"LICS","author":"A. Pnueli","year":"1986","unstructured":"Pnueli, A., Zuck, L.: Probabilistic verification by tableaux. In: LICS, pp. 322\u2013331. IEEE, Los Alamitos (1986)"},{"issue":"3","key":"11_CR29","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/S0019-9958(63)90290-0","volume":"6","author":"M. Rabin","year":"1963","unstructured":"Rabin, M.: Probabilistic automata. Information and Control\u00a06(3), 230\u2013245 (1963)","journal-title":"Information and Control"},{"key":"11_CR30","doi-asserted-by":"crossref","unstructured":"R\u00f6\u00dfiger, M.: Coalgebras and modal logic. ENTCS\u00a033 (2000)","DOI":"10.1016\/S1571-0661(05)80353-6"},{"issue":"1","key":"11_CR31","doi-asserted-by":"publisher","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. TCS\u00a0249(1), 3\u201380 (2000)","journal-title":"TCS"},{"issue":"1","key":"11_CR32","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1145\/321312.321326","volume":"13","author":"A. Salomaa","year":"1966","unstructured":"Salomaa, A.: Two complete axiom systems for the algebra of regular events. J. ACM\u00a013(1), 158\u2013169 (1966)","journal-title":"J. ACM"},{"issue":"2-3","key":"11_CR33","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0019-9958(61)80020-X","volume":"4","author":"M. Sch\u00fctzenberger","year":"1961","unstructured":"Sch\u00fctzenberger, M.: On the definition of a family of automata. Information and Control\u00a04(2-3), 245\u2013270 (1961)","journal-title":"Information and Control"},{"key":"11_CR34","unstructured":"Segala, R.: Modeling and verification of randomized distributed real-time systems. PhD thesis, MIT (1995)"},{"key":"11_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/978-3-540-48654-1_35","volume-title":"CONCUR \u201994: Concurrency Theory","author":"R. Segala","year":"1994","unstructured":"Segala, R., Lynch, N.: Probabilistic simulations for probabilistic processes. In: Jonsson, B., Parrow, J. (eds.) CONCUR 1994. LNCS, vol.\u00a0836, pp. 481\u2013496. Springer, Heidelberg (1994)"},{"key":"11_CR36","doi-asserted-by":"crossref","unstructured":"Smolka, S., Steffen, B.: Priority as extremal probability. In: Baeten, Klop [3], pp. 456\u2013466","DOI":"10.1007\/BFb0039077"},{"key":"11_CR37","doi-asserted-by":"crossref","first-page":"571","DOI":"10.7551\/mitpress\/5641.003.0027","volume-title":"Proof, Language, and Interaction","author":"E. Stark","year":"2000","unstructured":"Stark, E., Smolka, S.: A complete axiom system for finite-state probabilistic processes. In: Plotkin, et al. (eds.) Proof, Language, and Interaction, pp. 571\u2013596. MIT Press, Cambridge (2000)"},{"issue":"1","key":"11_CR38","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1006\/inco.1995.1123","volume":"121","author":"R. Glabbeek van","year":"1995","unstructured":"van Glabbeek, R., Smolka, S., Steffen, B.: Reactive, generative and stratified models of probabilistic processes. Inf. Comput.\u00a0121(1), 59\u201380 (1995)","journal-title":"Inf. Comput."},{"key":"11_CR39","first-page":"327","volume-title":"FOCS","author":"M. Vardi","year":"1985","unstructured":"Vardi, M.: Automatic verification of probabilistic concurrent finite-state programs. In: FOCS, pp. 327\u2013338. IEEE, Los Alamitos (1985)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2009 - Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04081-8_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,16]],"date-time":"2024-03-16T05:45:16Z","timestamp":1710567916000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04081-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642040801","9783642040818"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04081-8_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}