{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T22:10:48Z","timestamp":1765231848744},"publisher-location":"Berlin, Heidelberg","reference-count":69,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540222651"},{"type":"electronic","value":"9783540246114"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24611-4_3","type":"book-chapter","created":{"date-parts":[[2010,2,25]],"date-time":"2010-02-25T14:01:10Z","timestamp":1267106470000},"page":"89-123","source":"Crossref","is-referenced-by-count":20,"title":["An Overview of Probabilistic Process Algebras and Their Equivalences"],"prefix":"10.1007","author":[{"given":"Natalia","family":"L\u00f3pez","sequence":"first","affiliation":[]},{"given":"Manuel","family":"N\u00fa\u00f1ez","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/3-540-45319-9_15","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S. Andova","year":"2001","unstructured":"Andova, S., Baeten, J.C.M.: Abstraction in probabilistic process algebra. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol.\u00a02031, pp. 204\u2013219. Springer, Heidelberg (2001)"},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/3-540-44804-7_11","volume-title":"Process Algebra and Probabilistic Methods. Performance Modelling and Verification","author":"M. Bravetti","year":"2001","unstructured":"Bravetti, M., Aldini, A.: Expressing processes with different action durations through probabilities. In: de Luca, L., Gilmore, S. (eds.) PROBMIV 2001, PAPM-PROBMIV 2001, and PAPM 2001. LNCS, vol.\u00a02165, pp. 168\u2013183. Springer, Heidelberg (2001)"},{"issue":"1","key":"3_CR3","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/S0304-3975(01)00344-9","volume":"290","author":"M. Bravetti","year":"2003","unstructured":"Bravetti, M., Aldini, A.: Discrete time generative-reactive probabilistic processes with different advancing speeds. Theoretical Computer Science\u00a0290(1), 355\u2013406 (2003)","journal-title":"Theoretical Computer Science"},{"key":"3_CR4","series-title":"Electronics Notes in Theoretical Computer Science","volume-title":"MTCS 2000","author":"M. Bravetti","year":"2000","unstructured":"Bravetti, M., Bernardo, M.: Compositional asymmetric cooperations for process algebras with probabilities, priorities, and time. In: MTCS 2000. Electronics Notes in Theoretical Computer Science, vol.\u00a039(3). Elsevier, Amsterdam (2000)"},{"issue":"2","key":"3_CR5","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":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/3-540-63166-6_14","volume-title":"Computer Aided Verification","author":"C. Baier","year":"1997","unstructured":"Baier, C., Hermanns, H.: Weak bisimulation for fully probabilistic processes. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol.\u00a01254, pp. 119\u2013130. Springer, Heidelberg (1997)"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/3-540-51237-3_4","volume-title":"Logic at Botik 1989","author":"B. Bloom","year":"1989","unstructured":"Bloom, B., Meyer, A.R.: A remark on bisimulation between probabilistic processes. In: Meyer, A.R., Taitslin, M.A. (eds.) Logic at Botik 1989. LNCS, vol.\u00a0363, pp. 26\u201340. Springer, Heidelberg (1989)"},{"volume-title":"Handbook of Process Algebra","year":"2001","key":"3_CR8","unstructured":"Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.): Handbook of Process Algebra. North-Holland, Amsterdam (2001)"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/3-540-60218-6_23","volume-title":"CONCUR \u201995 Concurrency Theory","author":"E. Brinksma","year":"1995","unstructured":"Brinksma, E., Rensink, A., Vogler, W.: Fair testing. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol.\u00a0962, pp. 313\u2013327. Springer, Heidelberg (1995)"},{"key":"3_CR10","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":"3_CR11","doi-asserted-by":"crossref","unstructured":"J.C.M. Baeten and W.P. Weijland. Process Algebra. Cambridge Tracts in Computer Science 18. Cambridge University Press, 1990.","DOI":"10.1017\/CBO9780511624193"},{"issue":"1\u20132","key":"3_CR12","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S1567-8326(02)00040-1","volume":"55","author":"D. Cazorla","year":"2003","unstructured":"Cazorla, D., Cuartero, F., Valero, V., Pelayo, F.L., Pardo, J.J.: Algebraic theory of probabilistic and non-deterministic processes. Journal of Logic and Algebraic Programming\u00a055(1\u20132), 57\u2013103 (2003)","journal-title":"Journal of Logic and Algebraic Programming"},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/S0020-0190(01)00213-7","volume":"80","author":"D. Cazorla","year":"2001","unstructured":"Cazorla, D., Cuartero, F., Valero, V., Pelayo, F.L.: A process algebra for probabilistic and nondeterministic processes. Information Processing Letters\u00a080, 15\u201323 (2001)","journal-title":"Information Processing Letters"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","first-page":"340","volume-title":"4th International AMAST Workshop on Real-Time Systems, Concurrent and Distributed Software","author":"F. Cuartero","year":"1997","unstructured":"Cuartero, F., de Frutos, D., Valero, V.: A sound and complete proof system for probabilistic processes. In: AMAST-ARTS 1997, ARTS 1997, and AMAST-WS 1997. LNCS, vol.\u00a01231, pp. 340\u2013352. Springer, Heidelberg (1997)"},{"issue":"2","key":"3_CR15","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1006\/inco.1999.2808","volume":"154","author":"R. Cleaveland","year":"1999","unstructured":"Cleaveland, R., Dayar, Z., Smolka, S.A., Yuen, S.: Testing preorders for probabilistic processes. Information and Computation\u00a0154(2), 93\u2013148 (1999)","journal-title":"Information and Computation"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1007\/BFb0039056","volume-title":"CONCUR 1990","author":"I. Christoff","year":"1990","unstructured":"Christoff, I.: Testing equivalences and fully abstract models for probabilistic processes. In: CONCUR 1990. LNCS, vol.\u00a0458, pp. 126\u2013140. Springer, Heidelberg (1990)"},{"key":"3_CR17","volume-title":"Handbook of process algebra, ch. 12","author":"R. Cleaveland","year":"2001","unstructured":"Cleaveland, R., L\u2019\u0301uttgen, G., Natarajan, V.: Priority in process algebra. In: Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.) Handbook of process algebra, ch. 12. North-Holland, Amsterdam (2001)"},{"key":"3_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"708","DOI":"10.1007\/3-540-55719-9_116","volume-title":"Automata, Languages and Programming","author":"R. Cleaveland","year":"1992","unstructured":"Cleaveland, R., Smolka, S.A., Zwarico, A.E.: Testing preorders for probabilistic processes. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol.\u00a0623, pp. 708\u2013719. Springer, Heidelberg (1992)"},{"key":"3_CR19","first-page":"338","volume-title":"29th IEEE Symposium on Foundations of Computer Science","author":"C. Courcoubetis","year":"1988","unstructured":"Courcoubetis, C., Yannakakis, M.: Verifying temporal properties of finite-state probabilistic programs. In: 29th IEEE Symposium on Foundations of Computer Science, pp. 338\u2013345. IEEE Computer Society Press, Los Alamitos (1988)"},{"key":"3_CR20","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/978-0-387-35271-8_18","volume-title":"Formal Description Techniques for Distributed Systems and Communication Protocols (X), and Protocol Specification, Testing, and Verification (XVII)","author":"D. Frutos-Escrig de","year":"1997","unstructured":"de Frutos-Escrig, D., Llana-D\u00edaz, L.F., N\u00fa\u00f1ez, M.: Friendly testing as a conformance relation. In: Formal Description Techniques for Distributed Systems and Communication Protocols (X), and Protocol Specification, Testing, and Verification (XVII), pp. 283\u2013298. Chapman & Hall, Boca Raton (1997)"},{"key":"3_CR21","first-page":"401","volume-title":"Formal Description Techniques for Distributed Systems and Communication Protocols (XII), and Protocol Specification, Testing, and Verification (XIX)","author":"D. Frutos-Escrig de","year":"1999","unstructured":"de Frutos-Escrig, D., L\u00f3pez, N., N\u00fa\u00f1ez, M.: Global timed bisimulation: An introduction. In: Formal Description Techniques for Distributed Systems and Communication Protocols (XII), and Protocol Specification, Testing, and Verification (XIX), pp. 401\u2013416. Kluwer Academic Publishers, Dordrecht (1999)"},{"key":"3_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/3-540-45694-5_24","volume-title":"CONCUR 2002 - Concurrency Theory","author":"J. Desharnais","year":"2002","unstructured":"Desharnais, J., Gupta, V., Jagadeesan, R., Panangaden, P.: Weak bisimulation is sound and complete for PCTL*. In: Brim, L., Jan\u010dar, P., K\u0159et\u00ednsk\u00fd, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol.\u00a02421, pp. 355\u2013370. Springer, Heidelberg (2002)"},{"key":"3_CR23","series-title":"Electronics Notes in Theoretical Computer Science","volume-title":"PROBMIV 1998","author":"P.R. D\u2019Argenio","year":"1999","unstructured":"D\u2019Argenio, P.R., Hermanns, H., Katoen, J.-P.: On generative parallel composition. In: PROBMIV 1998. Electronics Notes in Theoretical Computer Science, vol.\u00a022. Elsevier, Amsterdam (1999)"},{"key":"3_CR24","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"34","author":"R. Nicola de","year":"1984","unstructured":"de Nicola, R., Hennessy, M.C.B.: Testing equivalences for processes. Theoretical Computer Science\u00a034, 83\u2013133 (1984)","journal-title":"Theoretical Computer Science"},{"key":"3_CR25","first-page":"181","volume-title":"14th ACM Symposium on Theory of Computing","author":"Y.A. Feldman","year":"1982","unstructured":"Feldman, Y.A., Harel, D.: A probabilistic dinamic logic. In: 14th ACM Symposium on Theory of Computing, pp. 181\u2013195. ACM Press, New York (1982)"},{"key":"3_CR26","series-title":"IFIP TC 2","volume-title":"Proceedings of Working Conference on Programming Concepts and Methods","author":"A. Giacalone","year":"1990","unstructured":"Giacalone, A., Jou, C.-C., Smolka, S.A.: Algebraic reasoning for probabilistic concurrent systems. In: Proceedings of Working Conference on Programming Concepts and Methods. IFIP TC 2. North Holland, Amsterdam (1990)"},{"key":"3_CR27","series-title":"Electronic Notes in Theoretical Computer Science","volume-title":"PROBMIV 1998","author":"C. Gregorio","year":"1999","unstructured":"Gregorio, C., N\u00fa\u00f1ez, M.: Denotational semantics for probabilistic refusal testing. In: PROBMIV 1998. Electronic Notes in Theoretical Computer Science, vol.\u00a022. Elsevier, Amsterdam (1999)"},{"issue":"1","key":"3_CR28","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.A., Steffen, B.: Reactive, generative and stratified models of probabilistic processes. Information and Computation\u00a0121(1), 59\u201380 (1995)","journal-title":"Information and Computation"},{"key":"3_CR29","first-page":"130","volume-title":"5th IEEE Symposium on Logic In Computer Science","author":"R. Glabbeek van","year":"1990","unstructured":"van Glabbeek, R., Smolka, S.A., Steffen, B., Tofts, C.M.N.: Reactive, generative, and stratified models of probabilistic processes. In: 5th IEEE Symposium on Logic In Computer Science, pp. 130\u2013141. IEEE Computer Society Press, Los Alamitos (1990)"},{"issue":"3","key":"3_CR30","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/233551.233556","volume":"43","author":"R. Glabbeek van","year":"1996","unstructured":"van Glabbeek, R., Weijland, W.P.: Branching time and abstraction in bisimulation semantics. Journal of the ACM\u00a043(3), 555\u2013600 (1996)","journal-title":"Journal of the ACM"},{"key":"3_CR31","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0304-3975(87)90004-1","volume":"49","author":"M. Hennessy","year":"1987","unstructured":"Hennessy, M.: An algebraic theory of fair asynchronous communicating processes. Theoretical Computer Science\u00a049, 121\u2013143 (1987)","journal-title":"Theoretical Computer Science"},{"key":"3_CR32","volume-title":"Algebraic Theory of Processes","author":"M. Hennessy","year":"1988","unstructured":"Hennessy, M.: Algebraic Theory of Processes. MIT Press, Cambridge (1988)"},{"key":"3_CR33","volume-title":"10th IEEE Real-Time Systems Symposium","author":"H. Hansson","year":"1989","unstructured":"Hansson, H., Jonsson, B.: A framework for reasoning about time and realibility. In: 10th IEEE Real-Time Systems Symposium. IEEE Computer Society Press, Los Alamitos (1989)"},{"key":"3_CR34","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1109\/REAL.1990.128759","volume-title":"11th IEEE Real-Time Systems Symposium","author":"H. Hansson","year":"1990","unstructured":"Hansson, H., Jonsson, B.: A calculus for communicating systems with time and probabilities. In: 11th IEEE Real-Time Systems Symposium, pp. 278\u2013287. IEEE Computer Society Press, Los Alamitos (1990)"},{"key":"3_CR35","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)"},{"key":"3_CR36","first-page":"1","volume-title":"16th ACM Symposium on Theory of Computing","author":"S. Hart","year":"1984","unstructured":"Hart, S., Sharir, M.: Probabilistic temporal logics for finite and bounded models. In: 16th ACM Symposium on Theory of Computing, pp. 1\u201313. ACM Press, New York (1984)"},{"key":"3_CR37","first-page":"186","volume-title":"4th IEEE Symposium on Logic In Computer Science","author":"C. Jones","year":"1989","unstructured":"Jones, C., Plotkin, G.D.: A probabilistic powerdomain of evaluations. In: 4th IEEE Symposium on Logic In Computer Science, pp. 186\u2013195. IEEE Computer Society Press, Los Alamitos (1989)"},{"key":"3_CR38","series-title":"Electronic Notes in Theoretical Computer Science","volume-title":"EXPRESS 1998","author":"M. Kwiatkowska","year":"1998","unstructured":"Kwiatkowska, M., Norman, G.J.: A testing equivalence for reactive probabilistic processes. In: EXPRESS 1998. Electronic Notes in Theoretical Computer Science, vol.\u00a016. Elsevier, Amsterdam (1998)"},{"key":"3_CR39","first-page":"291","volume-title":"15th ACM Symposium on Theory of Computing","author":"D. Kozen","year":"1983","unstructured":"Kozen, D.: A probabilistic PDL. In: 15th ACM Symposium on Theory of Computing, pp. 291\u2013297. ACM Press, New York (1983)"},{"key":"3_CR40","volume-title":"Finite Markov Chains","author":"J.G. Kemeny","year":"1976","unstructured":"Kemeny, J.G., Snell, J.L.: Finite Markov Chains. Springer, Heidelberg (1976)"},{"key":"3_CR41","unstructured":"LOTOS. A formal description technique based on the temporal ordering of observational behaviour. IS 8807, TC97\/SC21 (1988)"},{"key":"3_CR42","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/0304-3975(94)00171-E","volume":"138","author":"G. Lowe","year":"1995","unstructured":"Lowe, G.: Probabilistic and prioritized models of timed CSP. Theoretical Computer Science\u00a0138, 315\u2013352 (1995)","journal-title":"Theoretical Computer Science"},{"key":"3_CR43","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1145\/75277.75307","volume-title":"16th ACM Simposium on Principles of Programming Languages","author":"K. Larsen","year":"1989","unstructured":"Larsen, K., Skou, A.: Bisimulation through probabilistic testing. In: 16th ACM Simposium on Principles of Programming Languages, pp. 344\u2013352. ACM Press, New York (1989)"},{"issue":"1","key":"3_CR44","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. Information and Computation\u00a094(1), 1\u201328 (1991)","journal-title":"Information and Computation"},{"key":"3_CR45","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/41840.41852","volume-title":"6th ACM Symp. on Principles of Distributed Computing","author":"N.A. Lynch","year":"1987","unstructured":"Lynch, N.A., Tuttle, M.R.: Hierarchical correctness proofs for distributed algorithms. In: 6th ACM Symp. on Principles of Distributed Computing, pp. 137\u2013151. ACM Press, New York (1987)"},{"key":"3_CR46","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0304-3975(83)90114-7","volume":"253","author":"R. Milner","year":"1983","unstructured":"Milner, R.: Calculi for synchrony and asynchrony. Theoretical Computer Science\u00a0253, 267\u2013310 (1983)","journal-title":"Theoretical Computer Science"},{"key":"3_CR47","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice Hall, Englewood Cliffs (1989)"},{"key":"3_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1007\/3-540-55719-9_114","volume-title":"19th ICALP","author":"R. Milner","year":"1992","unstructured":"Milner, R., Sangiorgi, D.: Barbed bisimulation. In: 19th ICALP. LNCS, vol.\u00a0623, pp. 685\u2013695. Springer, Heidelberg (1992)"},{"key":"3_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"648","DOI":"10.1007\/3-540-60084-1_112","volume-title":"22nd ICALP","author":"V. Natarajan","year":"1995","unstructured":"Natarajan, V., Cleaveland, R.: Divergence and fair testing. In: 22nd ICALP. LNCS, vol.\u00a0944, pp. 648\u2013659. Springer, Heidelberg (1995)"},{"key":"3_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-540-49382-2_19","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"K. Narayan Kumar","year":"1998","unstructured":"Narayan Kumar, K., Cleaveland, R., Smolka, S.A.: Infinite probabilistic and nonprobabilistic testing. In: Arvind, V., Sarukkai, S. (eds.) FST TCS 1998. LNCS, vol.\u00a01530, pp. 209\u2013220. Springer, Heidelberg (1998)"},{"key":"3_CR51","first-page":"365","volume-title":"Formal Description Techniques VIII","author":"M. N\u00fa\u00f1ez","year":"1995","unstructured":"N\u00fa\u00f1ez, M., de Frutos, D.: Testing semantics for probabilistic LOTOS. In: Formal Description Techniques VIII, pp. 365\u2013380. Chapman & Hall, Boca Raton (1995)"},{"key":"3_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/3-540-60218-6_18","volume-title":"CONCUR 1995","author":"M. N\u00fa\u00f1ez","year":"1995","unstructured":"N\u00fa\u00f1ez, M., de Frutos, D., Llana, L.: Acceptance trees for probabilistic processes. In: CONCUR 1995. LNCS, vol.\u00a0962, pp. 249\u2013263. Springer, Heidelberg (1995)"},{"key":"3_CR53","first-page":"135","volume-title":"Formal Description Techniques for Distributed Systems and Communication Protocols (XII), and Protocol Specification, Testing, and Verification (XIX)","author":"M. N\u00fa\u00f1ez","year":"1999","unstructured":"N\u00fa\u00f1ez, M., Rup\u00e9rez, D.: Fair testing through probabilistic testing. In: Formal Description Techniques for Distributed Systems and Communication Protocols (XII), and Protocol Specification, Testing, and Verification (XIX), pp. 135\u2013150. Kluwer Academic Publishers, Dordrecht (1999)"},{"issue":"1\u20132","key":"3_CR54","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/S1567-8326(02)00069-3","volume":"56","author":"M. N\u00fa\u00f1ez","year":"2003","unstructured":"N\u00fa\u00f1ez, M.: Algebraic theory of probabilistic processes. Journal of Logic and Algebraic Programming\u00a056(1\u20132), 117\u2013177 (2003)","journal-title":"Journal of Logic and Algebraic Programming"},{"issue":"3","key":"3_CR55","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/0304-3975(87)90117-4","volume":"50","author":"I. Phillips","year":"1987","unstructured":"Phillips, I.: Refusal testing. Theoretical Computer Science\u00a050(3), 241\u2013284 (1987)","journal-title":"Theoretical Computer Science"},{"key":"3_CR56","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/3-540-44618-4_25","volume-title":"CONCUR 2000 - Concurrency Theory","author":"A. Philippou","year":"2000","unstructured":"Philippou, A., Lee, I., Sokolsky, O.: Weak bisimulation for probabilistic systems. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol.\u00a01877, pp. 334\u2013349. Springer, Heidelberg (2000)"},{"key":"3_CR57","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/S0019-9958(63)90290-0","volume":"6","author":"M.O. Rabin","year":"1963","unstructured":"Rabin, M.O.: Probabilistic automata. Information and Control\u00a06, 230\u2013245 (1963)","journal-title":"Information and Control"},{"key":"3_CR58","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-540-45187-7_13","volume-title":"CONCUR 2003 - Concurrency Theory","author":"E.W. Stark","year":"2003","unstructured":"Stark, E.W., Cleaveland, R., Smolka, S.A.: A process-algebraic language for probabilistic I\/O automata. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol.\u00a02761, pp. 193\u2013207. Springer, Heidelberg (2003)"},{"key":"3_CR59","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":"3_CR60","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0304-3975(94)00286-0","volume":"152","author":"K. Seidel","year":"1995","unstructured":"Seidel, K.: Probabilistic communicating processes. Theoretical Computer Science\u00a0152, 219\u2013249 (1995)","journal-title":"Theoretical Computer Science"},{"key":"3_CR61","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1007\/978-3-540-48654-1_35","volume-title":"CONCUR 1994","author":"R. Segala","year":"1994","unstructured":"Segala, R., Lynch, N.: Probabilistic simulations for probabilistic processes. In: CONCUR 1994. LNCS, vol.\u00a0836, pp. 481\u2013496. Springer, Heidelberg (1994)"},{"issue":"2","key":"3_CR62","first-page":"250","volume":"2","author":"R. Segala","year":"1995","unstructured":"Segala, R., Lynch, N.: Probabilistic simulations for probabilistic processes. Nordic Journal of Computing\u00a02(2), 250\u2013273 (1995)","journal-title":"Nordic Journal of Computing"},{"key":"3_CR63","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. MIT Press, Cambridge (2000)"},{"key":"3_CR64","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.W.: 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":"3_CR65","first-page":"327","volume-title":"26th IEEE Symposium on Foundations of Computer Science","author":"M.Y. Vardi","year":"1985","unstructured":"Vardi, M.Y.: Automatic verification of probabilistic concurrent finite-state programs. In: 26th IEEE Symposium on Foundations of Computer Science, pp. 327\u2013338. IEEE Computer Society Press, Los Alamitos (1985)"},{"key":"3_CR66","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1007\/978-3-540-48654-1_37","volume-title":"CONCUR 1994","author":"S.-H. Wu","year":"1994","unstructured":"Wu, S.-H., Smolka, S.A., Stark, E.W.: Composition and behaviors of probabilistic I\/O automata. In: CONCUR 1994. LNCS, vol.\u00a0836, pp. 513\u2013528. Springer, Heidelberg (1994)"},{"issue":"1-2","key":"3_CR67","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00056-X","volume":"176","author":"S.-H. Wu","year":"1997","unstructured":"Wu, S.-H., Smolka, S.A., Stark, E.W.: Composition and behaviors of probabilistic I\/O automata. Theoretical Computer Science\u00a0176(1-2), 1\u201337 (1997)","journal-title":"Theoretical Computer Science"},{"key":"3_CR68","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1007\/978-3-540-48654-1_36","volume-title":"CONCUR 1994","author":"S. Yuen","year":"1994","unstructured":"Yuen, S., Cleaveland, R., Dayar, Z., Smolka, S.A.: Fully abstract characterizations of testing preorders for probabilistic processes. In: CONCUR 1994. LNCS, vol.\u00a0836, pp. 497\u2013512. Springer, Heidelberg (1994)"},{"key":"3_CR69","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/B978-0-444-89874-6.50010-6","volume-title":"Protocol Specification, Testing and Verification XII","author":"W. Yi","year":"1992","unstructured":"Yi, W., Larsen, K.G.: Testing probabilistic and nondeterministic processes. In: Protocol Specification, Testing and Verification XII, pp. 47\u201361. North Holland, Amsterdam (1992)"}],"container-title":["Lecture Notes in Computer Science","Validation of Stochastic Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24611-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T07:46:04Z","timestamp":1558856764000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24611-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540222651","9783540246114"],"references-count":69,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24611-4_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}