{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:33:15Z","timestamp":1725492795762},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441441"},{"type":"electronic","value":"9783540457190"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45719-4_17","type":"book-chapter","created":{"date-parts":[[2007,10,9]],"date-time":"2007-10-09T10:55:00Z","timestamp":1191927300000},"page":"239-254","source":"Crossref","is-referenced-by-count":6,"title":["Equational Axioms for Probabilistic Bisimilarity"],"prefix":"10.1007","author":[{"given":"Luca","family":"Aceto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zolt\u00e1n","family":"\u00c9sik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anna","family":"Ing\u00f3lfsd\u00f3ttir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,9,2]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"L. Aceto, Z. \u00c9sik, and A. Ing\u00f3lfsd\u00f3ttir, Equational axioms for probabilistic bisimilarity (preliminary report), Report RS-02-6, BRICS (Basic Research in Computer Science, Centre of the Danish National Research Foundation), February 2002. Available at the URL http:\/\/www.brics.dk\/RS\/02\/6\/index.html .","DOI":"10.7146\/brics.v9i6.21724"},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1006\/inco.1995.1135","volume":"121","author":"J. C. M. Baeten","year":"1995","unstructured":"J. C. M. Baeten, J. A. Bergstra, and S. A. Smolka, Axiomatizing probabilistic processes: ACP with generative probabilities, Inform. and Comput., 121 (1995), pp. 234\u2013255.","journal-title":"Inform. and Comput."},{"key":"17_CR3","unstructured":"J. W. de Bakker and D. Scott, A theory of programs, Technical Report, IBM Laboratory, Vienna, 1969."},{"key":"17_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1007\/3-540-48224-5_31","volume-title":"Axiomatizations for probabilistic bisimulation","author":"E. Bandini","year":"2001","unstructured":"E. Bandini and R. Segala, Axiomatizations for probabilistic bisimulation, in Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP) 2001, vol. 2076 of Lecture Notes in Computer Science, Springer-Verlag, July 2001, pp. 370\u2013381."},{"key":"17_CR5","unstructured":"H. Bekic, Definable operations in general algebras, and the theory of automata and flowcharts, Technical Report, IBM Laboratory, Vienna, 1969."},{"key":"17_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-78034-9","volume-title":"Iteration theories","author":"S. L. Bloom","year":"1993","unstructured":"S. L. Bloom and Z. \u00c9sik, Iteration theories, Springer-Verlag, Berlin, 1993."},{"key":"17_CR7","unstructured":"-, The equational logic of fixed points, Theoret. Comput. Sci., 179 (1997), pp. 1\u201360."},{"key":"17_CR8","volume-title":"Regular Algebra and Finite Machines","author":"J. H. Conway","year":"1971","unstructured":"J. H. Conway, Regular Algebra and Finite Machines, Mathematics Series (R. Brown and J. De Wet eds.), Chapman and Hall, London, United Kingdom, 1971."},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1016\/0022-0000(78)90024-7","volume":"16","author":"C. C. Elgot","year":"1978","unstructured":"C. C. Elgot, S. L. Bloom, and R. Tindell, On the algebraic structure of rooted trees, J. Comput. System Sci., 16 (1978), pp. 362\u2013399.","journal-title":"J. Comput. System Sci."},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/0022-0000(88)90020-7","volume":"36","author":"Z. \u00c9sik","year":"1988","unstructured":"Z. \u00c9sik, Independence of the equational axioms for iteration theories, J. Comput. System Sci., 36 (1988), pp. 66\u201376.","journal-title":"J. Comput. System Sci."},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/S0304-3975(96)00240-X","volume":"177","author":"Z. \u00c9sik","year":"1997","unstructured":"-, Completeness of Park induction, Theoret. Comput. Sci., 177 (1997), pp. 217\u2013283. Mathematical foundations of programming semantics (Manhattan, KS, 1994).","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1006\/inco.1998.2746","volume":"148","author":"Z. \u00c9sik","year":"1999","unstructured":"-, Group axioms for iteration, Inform. and Comput., 148 (1999), pp. 131\u2013180.","journal-title":"Inform. and Comput."},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"W. J. Fokkink, Introduction to Process Algebra, Texts in Theoretical Computer Science, An EATCS Series, Springer-Verlag, 2000.","DOI":"10.1007\/978-3-662-04293-9"},{"key":"17_CR14","unstructured":"H. Hansson, Time and Probability in Formal Design of Distributed Systems, vol. 1 of Real-Time Safety Critical Systems, Elsevier, 1994."},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"B. Jonsson, W. Yi, and K. G. Larsen, Probabilistic extensions of process algebras, in Handbook of Process Algebra, North-Holland, Amsterdam, 2001, pp. 685\u2013710.","DOI":"10.1016\/B978-044482830-9\/50029-1"},{"key":"17_CR16","unstructured":"C.-C. Jou, Aspects of Probabilistic Process Algebra, PhD thesis, SUNY at Stony rook, Stony Brook, New York, 1991."},{"key":"17_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/BFb0039071","volume-title":"Equivalences, congruences, and complete axiomatizations for probabilistic processes","author":"C.-C. Jou","year":"1990","unstructured":"C.-C. Jou and S. A. Smolka, Equivalences, congruences, and complete axiomatizations for probabilistic processes, in Proceedings CONCUR 90, Amsterdam, J. Baeten and J. Klop, eds., vol. 458 of Lecture Notes in Computer Science, Springer-Verlag, 1990, pp. 367\u2013383."},{"key":"17_CR18","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1006\/inco.1994.1037","volume":"110","author":"D. Kozen","year":"1994","unstructured":"D. Kozen, A completeness theorem for Kleene algebras and the algebra of regular events, Inform. and Comput., 110 (1994), pp. 366\u2013390.","journal-title":"Inform. and Comput."},{"key":"17_CR19","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0304-3975(91)90395-I","volume":"89","author":"D. Krob","year":"1991","unstructured":"D. Krob, Complete systems of B-rational identities, Theoretical Comput. Sci., 89 (1991), pp. 207\u2013343.","journal-title":"Theoretical Comput. Sci."},{"key":"17_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(91)90030-6","volume":"94","author":"K. G. Larsen","year":"1991","unstructured":"K. G. Larsen and A. Skou, Bisimulation through probabilistic testing, Information and Computation, 94 (1991), pp. 1\u201328.","journal-title":"Information and Computation"},{"key":"17_CR21","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1007\/BFb0084809","volume-title":"Compositional verification of probabilistic processes","author":"K. G. Larsen","year":"1992","unstructured":"-, Compositional verification of probabilistic processes, in Proceedings CONCUR 92, Stony Brook, NY, USA, W. R. Cleaveland, ed., vol. 630 of Lecture Notes in Computer Science, Springer-Verlag, 1992, pp. 456\u2013471."},{"key":"17_CR22","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/0022-0000(84)90023-0","volume":"28","author":"R. Milner","year":"1984","unstructured":"R. Milner, A complete inference system for a class of regular behaviours, J. Comput. System Sci., 28 (1984), pp. 439\u2013466.","journal-title":"J. Comput. System Sci."},{"key":"17_CR23","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1145\/321312.321326","volume":"13","author":"A. Salomaa","year":"1966","unstructured":"A. Salomaa, Two complete axiom systems for the algebra of regular events, J. Assoc. Comput. Mach., 13 (1966), pp. 158\u2013169.","journal-title":"J. Assoc. Comput. Mach."},{"key":"17_CR24","first-page":"571","volume-title":"Proof, Language, and Interaction: Essays in Honour of Robin Milner","author":"E. W. Stark","year":"2000","unstructured":"E. W. Stark and S. A. Smolka, A complete axiom system for finite-state probabilistic processes, in Proof, Language, and Interaction: Essays in Honour of Robin Milner, MIT Press, Cambridge, MA, 2000, pp. 571\u2013595."}],"container-title":["Lecture Notes in Computer Science","Algebraic Methodology and Software Technology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45719-4_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T13:09:28Z","timestamp":1556888968000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45719-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441441","9783540457190"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-45719-4_17","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}