{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,26]],"date-time":"2025-07-26T09:11:21Z","timestamp":1753521081367},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540425564"},{"type":"electronic","value":"9783540448044"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44804-7_12","type":"book-chapter","created":{"date-parts":[[2007,7,20]],"date-time":"2007-07-20T14:22:41Z","timestamp":1184941361000},"page":"184-199","source":"Crossref","is-referenced-by-count":11,"title":["Quantifying the Dynamic Behavior of Process Algebras"],"prefix":"10.1007","author":[{"given":"Peter","family":"Buchholz","sequence":"first","affiliation":[]},{"given":"Peter","family":"Kemper","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,30]]},"reference":[{"key":"12_CR1","unstructured":"R. Agrawal, F. Baccelli, and R. Rajan. An algebra for queueing networks with time varying service. Research Report 3435, INRIA, 1998."},{"key":"12_CR2","unstructured":"F. Baccelli, G. Cohen, G. Olsder, and J. Quadrat. Synchronization and Linearity. John Wiley and Sons, 1992."},{"key":"12_CR3","unstructured":"F. Baccelli, B. Gaujal, and D. Simon. Analysis of preemptive periodic real time systems using the (max,plus) algebra. Research Report 3778, INRIA, 1999."},{"key":"12_CR4","unstructured":"F. Baccelli and D. Hong. TCP is (max\/+) linear. In Proc. SIGCOM 2000. ACM, 2000."},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00127-8","volume":"202","author":"M. Bernado","year":"1998","unstructured":"M. Bernado and R. Gorrieri. A tuturial of EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time. Theoretical Computer Science, 202:1\u201354, 1998.","journal-title":"Theoretical Computer Science"},{"key":"12_CR6","unstructured":"D. P. Bertsekas and J. N. Tsitsiklis. Parallel and distributed computation. Prentice Hall, 1989."},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"P. Buchholz. Die strukturierte Analyse Markovscher Modelle (in German). IFB 282. Springer, 1991.","DOI":"10.1007\/978-3-642-76923-8"},{"key":"12_CR8","volume-title":"Proc. 2nd Work. Process Algebras and Performance Modelling Arbeitsberichte IMMD","author":"P. Buchholz","year":"1994","unstructured":"P. Buchholz. Markovian process algebra: composition and equivalence. In [17]."},{"key":"12_CR9","unstructured":"P. Buchholz. Bisimulation for automata with transition costs. submitted, 2000."},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"C. S. Chang. Performance guarantess in communication networks. Springer, 1999.","DOI":"10.1007\/978-1-4471-0459-9"},{"issue":"1","key":"12_CR11","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1145\/151646.151648","volume":"15","author":"R. Cleaveland","year":"1993","unstructured":"R. Cleaveland, J. Parrow, and B. Steffen. The concurrency workbench: a semantics based tool for the verification of concurrent systems. ACM Transactions on Programming Languages and Systems, 15(1):36\u201372, 1993.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"P. R. D\u2019Argenio, H. Hermanns, and J. P. Katoen. On generative parallel composition. In Proc. ProbMiv 98, Electronic Notes on Theor. Computer Sc., 21, 1999.","DOI":"10.1016\/S1571-0661(05)80596-1"},{"issue":"2","key":"12_CR13","doi-asserted-by":"publisher","first-page":"926","DOI":"10.1287\/opre.32.2.343","volume":"32","author":"D. Gross","year":"1984","unstructured":"D. Gross and D. Miller. The randomization technique as a modeling tool and solution procedure for transient Markov processes. Operations Research, 32(2):926\u2013944, 1984.","journal-title":"Operations Research"},{"key":"12_CR14","unstructured":"H. Hansson. Time and probability for the formal design of distributed systems. Phd thesis, University of Uppsala, 1991."},{"issue":"9\/10","key":"12_CR15","doi-asserted-by":"publisher","first-page":"901","DOI":"10.1016\/S0169-7552(97)00133-5","volume":"30","author":"H. Hermanns","year":"1998","unstructured":"H. Hermanns, U. Herzog, and V. Mertsiotakis. Stochastic process algebras \u2014 between LOTOS and Markov chains. Computer Networks and ISDN Systems, 30(9\/10):901\u2013924, 1998.","journal-title":"Computer Networks and ISDN Systems"},{"key":"12_CR16","volume-title":"Proc. 2nd Work. Process Algebras and Performance Modelling Arbeitsberichte IMMD","author":"H. Hermanns","year":"1994","unstructured":"H. Hermanns and M. Rettelbach. Syntax, semantics, equivalences, and axioms for MTIPP. In [17]"},{"key":"12_CR17","volume-title":"Proc. 2nd Work. Process Algebras and Performance Modelling Arbeitsberichte IMMD","author":"U. Herzog","year":"1994","unstructured":"U. Herzog and M. Rettelbach, eds. Proc. 2nd Work. Process Algebras and Performance Modelling Arbeitsberichte IMMD, Univ. Erlangen, Germany, No. 27, 1994."},{"key":"12_CR18","volume-title":"Proc. 2nd Work. Process Algebras and Performance Modelling Arbeitsberichte IMMD","author":"J. Hillston","year":"1994","unstructured":"J. Hillston. The nature of synchronisation. In [17]."},{"key":"12_CR19","unstructured":"J. Hillston. A compositional approach for performance modelling. Phd thesis, University of Edinburgh, Dep. of Comp. Sc., 1994."},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"J. Hillston. Compositional Markovian modelling using a process algebra. In W. J. Stewart, editor, Computations with Markov Chains, pages 177\u2013196. Kluwer, 1995.","DOI":"10.1007\/978-1-4615-2241-6_12"},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"C. Hoare. Communicating sequential processes. Prentice Hall, 1985.","DOI":"10.1007\/978-3-642-82921-5_4"},{"key":"12_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(91)90030-6","volume":"94","author":"K. Larsen","year":"1991","unstructured":"K. Larsen and A. Skou. Bisimulation through probabilistic testing. Information and Computation, 94: 1\u201328, 1991.","journal-title":"Information and Computation"},{"key":"12_CR23","unstructured":"R. Milner. Communication and concurrency. Prentice Hall, 1989."},{"key":"12_CR24","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BFb0017309","volume-title":"Proc. 5th GI Conference on Theoretical Computer Science","author":"D. Park","year":"1981","unstructured":"D. Park. Concurrency and automata on infinite sequences. In Proc. 5th GI Conference on Theoretical Computer Science, pages 167\u2013183. Springer LNCS 104, 1981."},{"key":"12_CR25","doi-asserted-by":"crossref","unstructured":"R. van Glabbek, S. Smolka, B. Steffen, and C. Tofts. Reactive, generative and stratified models for probabilistic processes. In Proc. LICS\u201990, 1990.","DOI":"10.1109\/LICS.1990.113740"}],"container-title":["Lecture Notes in Computer Science","Process Algebra and Probabilistic Methods. Performance Modelling and Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44804-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,13]],"date-time":"2023-05-13T09:48:55Z","timestamp":1683971335000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44804-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540425564","9783540448044"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-44804-7_12","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}