{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T09:56:15Z","timestamp":1725530175866},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642005954"},{"type":"electronic","value":"9783642005961"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00596-1_27","type":"book-chapter","created":{"date-parts":[[2009,3,27]],"date-time":"2009-03-27T01:13:03Z","timestamp":1238116383000},"page":"380-394","source":"Crossref","is-referenced-by-count":3,"title":["Concurrency, \u03c3-Algebras, and Probabilistic Fairness"],"prefix":"10.1007","author":[{"given":"Samy","family":"Abbes","sequence":"first","affiliation":[]},{"given":"Albert","family":"Benveniste","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/11494744_6","volume-title":"Applications and Theory of Petri Nets 2005","author":"S. Abbes","year":"2005","unstructured":"Abbes, S.: A (true) concurrent Markov property and some applications to Markov nets. In: Ciardo, G., Darondeau, P. (eds.) ICATPN 2005. LNCS, vol.\u00a03536, pp. 70\u201389. Springer, Heidelberg (2005)"},{"key":"27_CR2","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1017\/S096012950700607X","volume":"17","author":"S. Abbes","year":"2007","unstructured":"Abbes, S.: A projective formalism applied to topological and probabilistic event structures. Mathematical Structures in Computer Science\u00a017, 819\u2013837 (2007)","journal-title":"Mathematical Structures in Computer Science"},{"key":"27_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-540-31982-5_6","volume-title":"Foundations of Software Science and Computational Structures","author":"S. Abbes","year":"2005","unstructured":"Abbes, S., Benveniste, A.: Branching cells as local states for event structures and nets: Probabilistic applications. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol.\u00a03441, pp. 95\u2013109. Springer, Heidelberg (2005); Extended version available as Research Report INRIA RR-5347"},{"issue":"2","key":"27_CR4","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/j.ic.2005.10.001","volume":"204","author":"S. Abbes","year":"2006","unstructured":"Abbes, S., Benveniste, A.: Probabilistic models for true-concurrency: branching cells and distributed probabilities for event structures. Information & Computation\u00a0204(2), 231\u2013274 (2006)","journal-title":"Information & Computation"},{"key":"27_CR5","unstructured":"Abbes, S., Benveniste, A.: Concurrency, \u03c3-algebras and probabilistic fairness. Technical report, PPS\/Universit\u00e9 Paris 7 Denis Diderot (2008), http:\/\/hal.archives-ouvertes.fr\/hal-00267518\/en\/"},{"key":"27_CR6","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.tcs.2007.09.018","volume":"390","author":"S. Abbes","year":"2008","unstructured":"Abbes, S., Benveniste, A.: Probabilistic true-concurrency models: Markov nets and a Law of large numbers. Theoretical Computer Science\u00a0390, 129\u2013170 (2008)","journal-title":"Theoretical Computer Science"},{"key":"27_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0033581","volume-title":"Stationary regime and stability of free-choice Petri nets","author":"F. Baccelli","year":"1994","unstructured":"Baccelli, F., Gaujal, B.: Stationary regime and stability of free-choice Petri nets. Springer, Heidelberg (1994)"},{"key":"27_CR8","volume-title":"Probability","author":"L. Breiman","year":"1968","unstructured":"Breiman, L.: Probability. SIAM, Philadelphia (1968)"},{"key":"27_CR9","unstructured":"Buchholz, P.: Compositional analysis of a Markovian process algebra. In: Rettelbach, M., Herzog, U. (eds.) Proceedings of 2nd process algebra and performance modelling workshop. Arbeitsberichte des IMMD, vol.\u00a027 (1994)"},{"key":"27_CR10","first-page":"157","volume":"87","author":"V. Danos","year":"2004","unstructured":"Danos, V., Desharnais, J., Panangaden, P.: Labelled Markov processes: stronger and faster approximations. ENTCS\u00a087, 157\u2013203 (2004)","journal-title":"ENTCS"},{"key":"27_CR11","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0304-3975(92)90390-2","volume":"97","author":"P. Darondeau","year":"1992","unstructured":"Darondeau, P., Nolte, D., Priese, L., Yoccoz, S.: Fairness, distance and degrees. Theoretical Computer Science\u00a097, 131\u2013142 (1992)","journal-title":"Theoretical Computer Science"},{"key":"27_CR12","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/S1571-0661(05)80597-3","volume":"22","author":"L. Alfaro de","year":"1999","unstructured":"de Alfaro, L.: From fairness to chance. Electronic Notes in Theoretical Computer Science\u00a022, 55\u201387 (1999)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"issue":"1","key":"27_CR13","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/S0890-5401(03)00051-8","volume":"184","author":"J. Desharnais","year":"2003","unstructured":"Desharnais, J., Gupta, V., Jagadeesan, R., Panangaden, P.: Approximating labeled Markov processes. Information and Computation\u00a0184(1), 160\u2013200 (2003)","journal-title":"Information and Computation"},{"key":"27_CR14","unstructured":"G\u00f6tz, N., Herzog, U., Rettelbach, M.: Multiprocessor and distributed system design: the integration of functional specification and performance analysis using stochastic process algebras. In: Proceedings of Performance 1993 (1993)"},{"key":"27_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/3-540-46432-8_10","volume-title":"Foundation of Software Science and Computation Structures","author":"O.M. Herescu","year":"2000","unstructured":"Herescu, O.M., Palamidessi, C.: Probabilistic asynchronous \u03c0-calculus. In: Tiuryn, J. (ed.) FOSSACS 2000. LNCS, vol.\u00a01784, pp. 146\u2013160. Springer, Heidelberg (2000)"},{"key":"27_CR16","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":"27_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/BFb0039071","volume-title":"CONCUR \u201990","author":"C. Jou","year":"1990","unstructured":"Jou, C., Smolka, S.: Equivalences, congruences and complete axiomatizations of probabilistic processes. In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol.\u00a0458, pp. 367\u2013383. Springer, Heidelberg (1990)"},{"issue":"1","key":"27_CR18","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":"27_CR19","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BFb0017309","volume-title":"Theoretical Computer Science","author":"D. Park","year":"1981","unstructured":"Park, D.: Concurrency and automata on infinite sequences. In: Theoretical Computer Science, pp. 167\u2013183. Springer, Heidelberg (1981)"},{"issue":"2","key":"27_CR20","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.tcs.2006.01.015","volume":"358","author":"D. Varacca","year":"2006","unstructured":"Varacca, D., V\u00f6lzer, H., Winskel, G.: Probabilistic event structures and domains. Theoretical Computer Science\u00a0358(2), 173\u2013199 (2006)","journal-title":"Theoretical Computer Science"},{"key":"27_CR21","doi-asserted-by":"crossref","DOI":"10.1201\/9781420010664","volume-title":"Stochastic modelling for systems biology","author":"D. Wilkinson","year":"2006","unstructured":"Wilkinson, D.: Stochastic modelling for systems biology. Chapman & Hamm\/CRC, Boca Raton (2006)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00596-1_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,3]],"date-time":"2021-10-03T17:16:46Z","timestamp":1633281406000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00596-1_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642005954","9783642005961"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00596-1_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}