{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:15:00Z","timestamp":1725488100723},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540675303"},{"type":"electronic","value":"9783540454991"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-45499-3_24","type":"book-chapter","created":{"date-parts":[[2007,7,31]],"date-time":"2007-07-31T21:55:04Z","timestamp":1185918904000},"page":"323-338","source":"Crossref","is-referenced-by-count":4,"title":["Time and Probability in Process Algebra"],"prefix":"10.1007","author":[{"given":"Suzana","family":"Andova","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,5,19]]},"reference":[{"key":"24_CR1","unstructured":"S. Andova, Process algebra with interleaving probabilistic parallel composition, CSR 99-04, Eindhoven University of Technology, 1999."},{"key":"24_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/3-540-48778-6_7","volume-title":"Proc. ARTS\u201999","author":"S. Andova","year":"1999","unstructured":"S. Andova, Process algebra with probabilistic choice (extended abstract), Proc. ARTS\u201999, Bamberg, Germany, J.-P. Katoen, ed., LNCS 1601, Springer-Verlag, pp. 111\u2013129, 1999. Full version report CSR 99-12, Eindhoven University of Technology, 1999."},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"S. Andova, Discrete relative time in probabilistic process algebra, Eindhoven University of Technology, CSR 00-**, 2000.","DOI":"10.1007\/3-540-45499-3_24"},{"issue":"2","key":"24_CR4","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/BF01898401","volume":"3","author":"J.C.M. Baeten","year":"1991","unstructured":"J.C.M. Baeten, J.A. Bergstra, Real time process algebra, Formal Aspects of Computing, 3(2):142\u2013188, 1991.","journal-title":"Formal Aspects of Computing"},{"key":"24_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1007\/978-3-540-48654-1_34","volume-title":"Proc. CONCUR\u201994","author":"J.C.M. Baeten","year":"1994","unstructured":"J.C.M. Baeten, J.A. Bergstra, Process algebra with partial choice, Proc. CONCUR\u201994, Uppsala, B. Jonsson & J. Parrow, eds., LNCS 836, Springer Verlag, 465\u2013480, 1994."},{"issue":"2","key":"24_CR6","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/BF01214556","volume":"8","author":"J.C.M. Baeten","year":"1996","unstructured":"J.C.M. Baeten, J.A. Bergstra, Discrete time process algebra, Formal Aspects of Computing, 8(2):188\u2013208, 1996.","journal-title":"Formal Aspects of Computing"},{"issue":"12","key":"24_CR7","doi-asserted-by":"crossref","first-page":"51","DOI":"10.3233\/FI-1997-291203","volume":"29","author":"J.C.M. Baeten","year":"1997","unstructured":"J.C.M. Baeten, J. A. Bergstra, Discrete time process algebra: Absolute time, relative time and parametric time, Fundamenta Informatic\u00e6, 29(1,2):51\u201376, 1997.","journal-title":"Fundamenta Informatic\u00e6"},{"key":"24_CR8","unstructured":"J.C.M. Baeten, C. A. Middelburg, Process algebra with timing: Real time and discrete time, Eindhoven University of Technology, CSR 99-11, 1999. To appear in J.A. Bergstra, A. Ponse and S.A. Smolka, ed., Handbook of Process Algebra, Elsevier, 2000."},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"J.C.M. Baeten, W.P. Weijland, Process algebra, Cambridge University Press, 1990.","DOI":"10.1017\/CBO9780511624193"},{"key":"24_CR10","unstructured":"J.C.M. Baeten, C. Verhoef, Concrete process algebra, Handbook of Logic in Computer Science, volume 4: \u201cSemantic Modelling\u201d, Oxford University Press, 1995."},{"issue":"2","key":"24_CR11","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, S.A. Smolka, Axiomatizing probabilistic processes: ACP with generative probabilities, Information and Computation 121(2): 234\u2013255, September 1995.","journal-title":"Information and Computation"},{"key":"24_CR12","unstructured":"D. Bo\u0161na\u010dki, Discrete time specification of the PAR protocol, (unpublished paper)."},{"key":"24_CR13","unstructured":"P.R. D\u2019Argenio, H. Hermanns, J.-P. Katoen On generative parallel composition, Preliminary Proc. of PROBMIV\u201998, Indianapolis, USA, C. Baier & M. Huth & M Kwiatkowska & M. Ryan ed., 105\u2013121, 1998."},{"key":"24_CR14","unstructured":"A. Giacalone, C.-C. Jou, S. A. Smolka, Algebraic reasoning for probabilistic concurrent systems, Proc. Working Conference on Programming Concepts and Methods, IFIP TC 2, Sea of Galilee, Israel, M. Broy & C.B. Jones ed., 443\u2013458, 1990."},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"R. J. van Glabbeek, S. A. Smolka, B. Steffen, C. M. N. Tofts, Reactive, generative and stratified models of probabilistic processes, Proc. of 5th Annual IEEE Symp. on Logic in Computer Science, Philadelphia, PA, 130\u2013141, 1990.","DOI":"10.1109\/LICS.1990.113740"},{"key":"24_CR16","unstructured":"H. Hansson, Time and probability in formal design of distributed systems, Ph.D. thesis, DoCS 91\/27, University of Uppsala, 1991."},{"issue":"2","key":"24_CR17","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1006\/inco.1995.1041","volume":"117","author":"H. Hennessy","year":"1995","unstructured":"H. Hennessy, T. Regan, A process algebra for timed systems, Information and Computation, 117(2):221\u2013239,1995.","journal-title":"Information and Computation"},{"key":"24_CR18","unstructured":"A. Jeffrey, Discrete Timed CSP, Tech. Report PMG Memo 78, Chalmers University of Technology, Dep. of Computer Sciences, 1991."},{"key":"24_CR19","doi-asserted-by":"crossref","unstructured":"B. Jonsson, K.G. Larsen, Specification and refinement of probabilistic processes, Proc. of 6th Annual IEEE Symp. on Logic in Computer Science, Amsterdam, 1991.","DOI":"10.1109\/LICS.1991.151651"},{"key":"24_CR20","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/BFb0039071","volume-title":"Proc. CONCUR\u2019 90","author":"C.-C. Jou","year":"1990","unstructured":"C.-C. Jou, S. A. Smolka Equivalences, congruences and complete axiomatizations for probabilistic processes, Proc. CONCUR\u2019 90, LNCS 458, Springer Verlag, Berlin, 367\u2013383, 1990."},{"key":"24_CR21","doi-asserted-by":"crossref","unstructured":"K.G. Larsen, A. Skou, Bisimulation through probabilistic testing, Proc. of 16th ACM Symp. on Principles of Programming Languages, Austin, TX, 1989.","DOI":"10.1145\/75277.75307"},{"key":"24_CR22","doi-asserted-by":"crossref","unstructured":"F.W. Vaandrager, Two simple protocols, In: Applications of Process Algebra, Cambridge University Press, J.C.M. Baeten ed., pp.23\u201344, 1990.","DOI":"10.1017\/CBO9780511608841.003"},{"key":"24_CR23","unstructured":"J. J. Vereijken, Discrete-time process algebra, Ph.D. thesis, IPA 97\/06, Eindhoven University of Technology, Computing Science Department, 1997."}],"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-45499-3_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,25]],"date-time":"2020-04-25T09:52:05Z","timestamp":1587808325000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45499-3_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540675303","9783540454991"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-45499-3_24","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}