{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:54:38Z","timestamp":1725551678917},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540309116"},{"type":"electronic","value":"9783540324256"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11601548_17","type":"book-chapter","created":{"date-parts":[[2005,12,10]],"date-time":"2005-12-10T00:39:45Z","timestamp":1134175185000},"page":"309-337","source":"Crossref","is-referenced-by-count":12,"title":["Compositional Reasoning for Probabilistic Finite-State Behaviors"],"prefix":"10.1007","author":[{"given":"Yuxin","family":"Deng","sequence":"first","affiliation":[]},{"given":"Catuscia","family":"Palamidessi","sequence":"additional","affiliation":[]},{"given":"Jun","family":"Pang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Aceto, L., \u00c9sik, Z., Ing\u00f3lfsd\u00f3ttir, A.: Equational axioms for probabilistic bisimilarity (preliminary report). Technical Report RS-02-6, BRICS (2002)","DOI":"10.7146\/brics.v9i6.21724"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Aceto, L., Fokkink, W.J.: The quest for equational axiomatizations of parallel composition: Status and open problems. In: Proceedings of the Workshop on Algebraic Process Calculi: The First Twenty Five Years and Beyond. BRICS Notes Series (2005) (to appear)","DOI":"10.1016\/j.entcs.2005.12.076"},{"key":"17_CR3","unstructured":"Andova, S.: Probabilistic Process Algebra. PhD thesis, Eindhoven University of Technology (2002)"},{"issue":"2","key":"17_CR4","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1006\/inco.1995.1135","volume":"121","author":"J.C.M. Baeten","year":"1995","unstructured":"Baeten, J.C.M., Bergstra, J.A., Smolka, S.A.: Axiomatizing probabilistic processes: ACP with generative probabilities. Information and Computation\u00a0121(2), 234\u2013255 (1995)","journal-title":"Information and Computation"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/11539452_21","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"J.C.M. Baeten","year":"2005","unstructured":"Baeten, J.C.M., Bravetti, M.: A ground-complete axiomatization of finite state processes in process algebra. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol.\u00a03653, pp. 248\u2013262. Springer, Heidelberg (2005)"},{"key":"17_CR6","series-title":"Cambridge Tracts in Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511608841","volume-title":"Process Algebra","author":"J.C.M. Baeten","year":"1990","unstructured":"Baeten, J.C.M., Weijland, W.P.: Process Algebra. Cambridge Tracts in Theoretical Computer Science, vol.\u00a018. Cambridge University Press, Cambridge (1990)"},{"key":"17_CR7","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)"},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0019-9958(84)80025-X","volume":"60","author":"J.A. Bergstra","year":"1984","unstructured":"Bergstra, J.A., Klop, J.W.: Process algebra for synchronous communications. Information and Control\u00a060, 109\u2013137 (1984)","journal-title":"Information and Control"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/3-540-16444-8_1","volume-title":"Mathematical Methods of Specification and Synthesis of Software Systems \u201985","author":"J.A. Bergstra","year":"1986","unstructured":"Bergstra, J.A., Klop, J.W.: Verification of an alternating bit protocol by means of process algebra. In: Bibel, W., Jantke, K.P. (eds.) Mathematical Methods of Specification and Synthesis of Software Systems 1985. LNCS, vol.\u00a0215, pp. 9\u201323. Springer, Heidelberg (1986)"},{"key":"17_CR10","first-page":"21","volume-title":"Proceedings of Logic Colloquium 1986","author":"J.A. Bergstra","year":"1988","unstructured":"Bergstra, J.A., Klop, J.W.: A complete inference system for regular processes with silent moves. In: Proceedings of Logic Colloquium 1986, pp. 21\u201381. North Holland, Amsterdam (1988)"},{"issue":"4","key":"17_CR11","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1145\/566385.566386","volume":"3","author":"M. Bravetti","year":"2002","unstructured":"Bravetti, M., Gorrieri, R.: Deciding and axiomatizing weak ST bisimulation for a process algebra with recursion and action refinement. ACM Transactions on Computational Logic\u00a03(4), 465\u2013520 (2002)","journal-title":"ACM Transactions on Computational Logic"},{"key":"17_CR12","unstructured":"Christensen, S.: Decidability and Decomposition in Process Algebras. PhD thesis, University of Edinburgh (1993)"},{"issue":"4","key":"17_CR13","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1093\/comjnl\/37.4.233","volume":"37","author":"S. Christensen","year":"1994","unstructured":"Christensen, S., Hirshfeld, Y., Moller, F.: Decidable subsets of ccs. Computer Journal\u00a037(4), 233\u2013242 (1994)","journal-title":"Computer Journal"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"D\u2019Argenio, P.R., Hermanns, H., Katoen, J.-P.: On generative parallel composition. Electronic Notes in Theoretical Computer Science\u00a022 (1999)","DOI":"10.1016\/S1571-0661(05)80596-1"},{"key":"17_CR15","unstructured":"Deng, Y.: Axiomatisations and types for probabilistic and mobile processes. PhD thesis, Ecole des Mines de Paris (2005)"},{"key":"17_CR16","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":"17_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-540-27815-3_15","volume-title":"Algebraic Methodology and Software Technology","author":"W.J. Fokkink","year":"2004","unstructured":"Fokkink, W.J., Groote, J.F., Pang, J., Badban, B., van de Pol, J.C.: Verifying a sliding window protocol in \u03bcCRL. In: Rattray, C., Maharaj, S., Shankland, C. (eds.) AMAST 2004. LNCS, vol.\u00a03116, pp. 148\u2013163. Springer, Heidelberg (2004)"},{"key":"17_CR18","unstructured":"Giacalone, A., Jou, C.-C., Smolka, S.A.: Algebraic reasoning for probabilistic concurrent systems. In: Proceedings of IFIP WG 2.2\/2.3 Working Conference on Programming Concepts and Methods, pp. 453\u2013459 (1990)"},{"issue":"1-2","key":"17_CR19","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S1567-8326(01)00005-4","volume":"48","author":"J.F. Groote","year":"2001","unstructured":"Groote, J.F., Ponse, A., Usenko, Y.S.: Linearization in parallel pCRL. Journal of Logic and Algebraic Programming\u00a048(1-2), 39\u201372 (2001)","journal-title":"Journal of Logic and Algebraic Programming"},{"key":"17_CR20","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/2455.2460","volume":"32","author":"M. Hennessy","year":"1985","unstructured":"Hennessy, M., Milner, R.: Algebraic laws for nondeterminism and concurrency. Journal of ACM\u00a032, 137\u2013161 (1985)","journal-title":"Journal of ACM"},{"key":"17_CR21","volume-title":"Communicating Sequential Processes","author":"C.A.R. Hoare","year":"1985","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs (1985)"},{"issue":"1","key":"17_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(91)90030-6","volume":"94","author":"K.G. Larsen","year":"1991","unstructured":"Larsen, K.G., Skou, A.: Bisimulation through probabilistic testing. Information and Computation\u00a094(1), 1\u201328 (1991)","journal-title":"Information and Computation"},{"key":"17_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/BFb0084809","volume-title":"CONCUR \u201992","author":"K.G. Larsen","year":"1992","unstructured":"Larsen, K.G., Skou, A.: Compositional verification of probabilistic processes. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol.\u00a0630, pp. 456\u2013471. Springer, Heidelberg (1992)"},{"key":"17_CR24","doi-asserted-by":"crossref","unstructured":"Lynch, N.A., Saias, I., Segala, R.: Proving time bounds for randomized distributed algorithms. In: Proceedings of the 13th Annual ACM Symposium on the Principles of Distributed Computing, pp. 314\u2013323 (1994)","DOI":"10.1145\/197917.198117"},{"key":"17_CR25","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0304-3975(83)90114-7","volume":"25","author":"R. Milner","year":"1983","unstructured":"Milner, R.: Calculi for synchrony and asynchrony. Theoretical Computer Science\u00a025, 267\u2013310 (1983)","journal-title":"Theoretical Computer Science"},{"key":"17_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. Journal of Computer and System Science\u00a028, 439\u2013466 (1984)","journal-title":"Journal of Computer and System Science"},{"key":"17_CR27","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)"},{"key":"17_CR28","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0890-5401(89)90070-9","volume":"81","author":"R. Milner","year":"1989","unstructured":"Milner, R.: A complete axiomatisation for observational congruence of finite-state behaviours. Information and Computation\u00a081, 227\u2013247 (1989)","journal-title":"Information and Computation"},{"issue":"3","key":"17_CR29","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/PL00008917","volume":"13","author":"A. Pogosyants","year":"2000","unstructured":"Pogosyants, A., Segala, R., Lynch, N.A.: Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study. Distributed Computing\u00a013(3), 155\u2013186 (2000)","journal-title":"Distributed Computing"},{"key":"17_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/BFb0015027","volume-title":"CONCUR \u201994: Concurrency Theory","author":"R. Segala","year":"1994","unstructured":"Segala, R., Lynch, N.A.: Probabilistic simulations for probabilistic processes. In: Jonsson, B., Parrow, J. (eds.) CONCUR 1994. LNCS, vol.\u00a0836, pp. 481\u2013496. Springer, Heidelberg (1994)"},{"key":"17_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24611-4_1","volume-title":"Validation of Stochastic Systems","author":"A. Sokolova","year":"2004","unstructured":"Sokolova, A., de Vink, E.P.: Probabilistic automata: system types, parallel composition and comparison. In: Baier, C., Haverkort, B.R., Hermanns, H., Katoen, J.-P., Siegle, M. (eds.) Validation of Stochastic Systems. LNCS, vol.\u00a02925, pp. 1\u201343. Springer, Heidelberg (2004)"},{"key":"17_CR32","first-page":"571","volume-title":"Proof, language, and interaction: essays in honour of Robin Milner","author":"E.W. Stark","year":"2000","unstructured":"Stark, E.W., Smolka, S.A.: A complete axiom system for finite-state probabilistic processes. In: Proof, language, and interaction: essays in honour of Robin Milner, pp. 571\u2013595. MIT Press, Cambridge (2000)"},{"key":"17_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/3-540-48778-6_4","volume-title":"Formal Methods for Real-Time and Probabilistic Systems","author":"M. Stoelinga","year":"1999","unstructured":"Stoelinga, M., Vaandrager, F.: Root contention in IEEE 1394. In: Katoen, J.-P. (ed.) AMAST-ARTS 1999, ARTS 1999, and AMAST-WS 1999. LNCS, vol.\u00a01601, pp. 53\u201374. Springer, Heidelberg (1999)"},{"key":"17_CR34","unstructured":"Usenko, Y.S.: Linearization in \u03bcCRL. PhD thesis, Edindhoven University of Technology (2002)"},{"key":"17_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1007\/3-540-57182-5_39","volume-title":"Mathematical Foundations of Computer Science 1993","author":"R.J. Glabbeek van","year":"1993","unstructured":"van Glabbeek, R.J.: A complete axiomatization for branching bisimulation congruence of finite-state behaviours. In: Borzyszkowski, A.M., Sokolowski, S. (eds.) MFCS 1993. LNCS, vol.\u00a0711, pp. 473\u2013484. Springer, Heidelberg (1993)"}],"container-title":["Lecture Notes in Computer Science","Processes, Terms and Cycles: Steps on the Road to Infinity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11601548_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T17:12:53Z","timestamp":1683306773000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11601548_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540309116","9783540324256"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/11601548_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}