{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T16:43:53Z","timestamp":1743698633503,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540407539"},{"type":"electronic","value":"9783540451877"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45187-7_13","type":"book-chapter","created":{"date-parts":[[2010,6,25]],"date-time":"2010-06-25T22:38:49Z","timestamp":1277505529000},"page":"193-207","source":"Crossref","is-referenced-by-count":12,"title":["A Process-Algebraic Language for Probabilistic I\/O Automata"],"prefix":"10.1007","author":[{"given":"Eugene W.","family":"Stark","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rance","family":"Cleaveland","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Scott A.","family":"Smolka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"13_CR1","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1006\/inco.1998.2706","volume":"144","author":"M. Bernardo","year":"1998","unstructured":"Bernardo, M., Donatiello, L., Gorrieri, R.: A formal approach to the integration of performance aspects in the modeling and analysis of concurrent systems. Information and Computation\u00a0144(2), 83\u2013154 (1998)","journal-title":"Information and Computation"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/3-540-44667-2_5","volume-title":"Lectures on Formal Methods and Performance Analysis","author":"E. Brinksma","year":"2001","unstructured":"Brinksma, E., Hermanns, H.: Process algebra and Markov chains. In: Brinksma, E., Hermanns, H., Katoen, J.-P. (eds.) EEF School 2000 and FMPA 2000. LNCS, vol.\u00a02090, pp. 183\u2013231. Springer, Heidelberg (2001)"},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/S0304-3975(98)00169-8","volume":"215","author":"P. Buchholz","year":"1999","unstructured":"Buchholz, P.: Exact performance equivalence: An equivalence relation for stochastic automata. Theoretical Computer Science\u00a0215, 263\u2013287 (1999)","journal-title":"Theoretical Computer Science"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Cleaveland, R., Parrow, J., Steffen, B.U.: The Concurrency Workbench: A semantics-based tool for the verification of concurrent systems. ACM TOPLAS\u00a015(1) (1993)","DOI":"10.1145\/151646.151648"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"De Nicola, R., Segala, R.: A process algebraic view of Input\/Output Automata. Theoretical Computer Science\u00a0138(2) (1995)","DOI":"10.1016\/0304-3975(95)92307-J"},{"key":"13_CR6","first-page":"285","volume-title":"Foundations of Component-Based Systems","author":"S.J. Garland","year":"2000","unstructured":"Garland, S.J., Lynch, N.A.: Using I\/O automata for developing distributed systems. In: Leavens, G.T., Sitaraman, M. (eds.) Foundations of Component-Based Systems, pp. 285\u2013312. Cambridge University Press, Cambridge (2000)"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0304-3975(00)00305-4","volume":"274","author":"J.-P. Katoen","year":"2002","unstructured":"Katoen, J.-P., Hermanns, H., Herzog, U.: Process algebra for performance evaluation. Theoretical Computer Science\u00a0274, 43\u201397 (2002)","journal-title":"Theoretical Computer Science"},{"key":"13_CR8","unstructured":"Hillston, J.: The nature of synchronization. In: Herzog, U., Rettelbach, M. (eds.) Proceedings of the 2nd Workshop on Process Algebra and Performance Modeling, July 1994, pp. 51\u201370. University of Erlangen (1994)"},{"key":"13_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511569951","volume-title":"A Compositional Approach to Performance Modelling","author":"J. Hillston","year":"1996","unstructured":"Hillston, J.: A Compositional Approach to Performance Modelling. Cambridge University Press, Cambridge (1996)"},{"key":"13_CR10","volume-title":"Handbook of Process Algebra","author":"B. Jonsson","year":"2001","unstructured":"Jonsson, B., Larsen, K.G., Yi, W.: Probabilistic extensions of process algebras. In: Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.) Handbook of Process Algebra. Elsevier, Amsterdam (2001)"},{"issue":"1","key":"13_CR11","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":"13_CR12","doi-asserted-by":"crossref","unstructured":"Lynch, N.A., Tuttle, M.: Hierarchical correctness proofs for distributed algorithms. In: Proceedings of the 6th Annual ACM Symposium on Principles of Distributed Computing, pp. 137\u2013151 (1987)","DOI":"10.1145\/41840.41852"},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"1093","DOI":"10.1109\/32.99196","volume":"17","author":"B. Plateau","year":"1991","unstructured":"Plateau, B., Atif, K.: Stochastic automata networks for modeling parallel systems. IEEE Transactions on Software Engineering\u00a017, 1093\u20131108 (1991)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"13_CR14","first-page":"466","volume-title":"Proc. 13th Annual Symposium on Logic in Computer Science","author":"E.W. Stark","year":"1998","unstructured":"Stark, E.W., Smolka, S.: Compositional analysis of expected delays in networks of probabilistic I\/O automata. In: Proc. 13th Annual Symposium on Logic in Computer Science, Indianapolis, IN, June 1998, pp. 466\u2013477. IEEE Computer Society Press, Los Alamitos (1998)"},{"key":"13_CR15","unstructured":"Stark, E.: On behavior equivalence for probabilistic I\/O automata and its relationship to probabilistic bisimulation. Journal of Automata, Languages, and Combinatorics\u00a08(2) (2003) (to appear)"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Vaandrager, F.W.: On the relationship between process algebra and input\/output automata. In: Sixth Annual Symposium on Logic in Computer Science (LICS 1991), Amsterdam, July 1991, pp. 387\u2013398. Computer Society Press (1991)","DOI":"10.1109\/LICS.1991.151662"},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0015029","volume-title":"CONCUR \u201994: Concurrency Theory","author":"S.-H. Wu","year":"1994","unstructured":"Wu, S.-H., Smolka, S.A., Stark, E.W.: Compositionality and full abstraction for probabilistic I\/O automata. In: Jonsson, B., Parrow, J. (eds.) CONCUR 1994. LNCS, vol.\u00a0836. Springer, Heidelberg (1994)"},{"issue":"1-2","key":"13_CR18","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\u201338 (1997)","journal-title":"Theoretical Computer Science"},{"key":"13_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/3-540-36577-X_31","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"D. Zhang","year":"2003","unstructured":"Zhang, D., Cleaveland, R., Stark, E.W.: The integrated CWBNC\/ PIOATool for functional and performance analysis of concurrent systems. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol.\u00a02619, pp. 431\u2013436. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2003 - Concurrency Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45187-7_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T07:57:34Z","timestamp":1740211054000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45187-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540407539","9783540451877"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45187-7_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}