{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,26]],"date-time":"2025-07-26T09:00:17Z","timestamp":1753520417085},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540437031"},{"type":"electronic","value":"9783540478843"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-47884-1_3","type":"book-chapter","created":{"date-parts":[[2007,5,19]],"date-time":"2007-05-19T20:46:26Z","timestamp":1179607586000},"page":"29-48","source":"Crossref","is-referenced-by-count":5,"title":["Stochastic Process Algebras Meet Eden"],"prefix":"10.1007","author":[{"given":"Natalia","family":"L\u00f3pez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manuel","family":"N\u00fa\u00f1ez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fernando","family":"Rubio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,4,23]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"J.C.M. Baeten and C.A. Middelburg. Process algebra with timing: Real time and discrete time. In J.A. Bergstra, A. Ponse, and S.A. Smolka, editors, Handbook of process algebra, chapter 10. North Holland, 2001.","DOI":"10.1016\/B978-044482830-9\/50028-X"},{"key":"3_CR2","unstructured":"J.A. Bergstra, A. Ponse, and S.A. Smolka, editors. Handbook of Process Algebra. North Holland, 2001."},{"key":"3_CR3","unstructured":"M. Bernardo. Theory and application of extended markovian process algebra. PhD thesis, Universit\u00e0 di Bologna, 1999."},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00127-8","volume":"202","author":"M. Bernardo","year":"1998","unstructured":"M. Bernardo and R. Gorrieri. A tutorial on 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":"3_CR5","doi-asserted-by":"crossref","unstructured":"M. Bravetti and R. Gorrieri. The theory of interactive generalized semi-markov processes. To appear in Theoretical Computer Science., 2001.","DOI":"10.1016\/S0304-3975(01)00043-3"},{"key":"3_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/BFb0055435","volume-title":"Implementation of Functional Languages","author":"S. Breitinger","year":"1998","unstructured":"S. Breitinger, U. Klusik, R. Loogen, Y. Ortega, and R. Pe\u00f1a. DREAM: the distributed Eden abstract machine. In Implementation of Functional Languages. LNCS 1467., pages 250\u2013269. Springer, 1998."},{"key":"3_CR7","volume-title":"Technical Report, Bericht 96-10","author":"S. Breitinger","year":"1998","unstructured":"S. Breitinger, R. Loogen, Y. Ortega, and R. Pe\u00f1a. Eden: Language definition and operational semantics. Technical Report, Bericht 96-10, Philipps-Universit\u00e4t Marburg, Germany, 1998."},{"key":"3_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/3-540-60218-6_20","volume-title":"CONCUR\u201995","author":"J. Bryans","year":"1995","unstructured":"J. Bryans, J. Davies, and S. Schneider. Towards a denotational semantics for ET-LOTOS. In CONCUR\u201995, LNCS 962, pages 269\u2013283, 1995."},{"key":"3_CR9","unstructured":"E.M. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 1999."},{"issue":"2","key":"3_CR10","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1006\/inco.1999.2808","volume":"154","author":"R. Cleaveland","year":"1999","unstructured":"R. Cleaveland, Z. Dayar, S.A. Smolka, and S. Yuen. Testing preorders for probabilistic processes. Information and Computation, 154(2):93\u2013148, 1999.","journal-title":"Information and Computation"},{"key":"3_CR11","unstructured":"P.R. D\u2019Argenio. Algebras and Automata for Timed and Stochastic Systems. PhD thesis, Department of Computer Science. University of Twente, 1999."},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0304-3975(94)00169-J","volume":"138","author":"J. Davies","year":"1995","unstructured":"J. Davies and S. Schneider. A brief history of timed CSP. Theoretical Computer Science, 138:243\u2013271, 1995.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"3_CR13","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1006\/inco.1995.1123","volume":"121","author":"R. Glabbeek van","year":"1995","unstructured":"R. van Glabbeek, S.A. Smolka, and B. Steffen. Reactive, generative and stratified models of probabilistic processes. Information and Computation, 121(1):59\u201380, 1995.","journal-title":"Information and Computation"},{"key":"3_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BFb0013851","volume-title":"16th Int. Symp. on Computer Performance Modelling, Measurement and Evaluation (PERFORMANCE\u201993)","author":"N. G\u00f6tz","year":"1993","unstructured":"N. G\u00f6tz, U. Herzog, and M. Rettelbach. Multiprocessor and distributed system design: The integration of functional specification and performance analysis using stochastic process algebras. In 16th Int. Symp. on Computer Performance Modelling, Measurement and Evaluation (PERFORMANCE\u201993), LNCS 729, pages 121\u2013146. Springer, 1993."},{"key":"3_CR15","unstructured":"C. Gregorio and M. N\u00fa\u00f1ez. Specifying and verifying the Alternating Bit Protocol with Probabilistic-Timed LOTOS. In COST 247 International Workshop on Applied Formal Methods in System Design, pages 38\u201350, 1996."},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0304-3975(93)90111-6","volume":"118","author":"J. F. Groote","year":"1993","unstructured":"Jan Friso Groote. Transition system specifications with negative premises. Theoretical Computer Science, 118:263\u2013299, 1993.","journal-title":"Theoretical Computer Science"},{"key":"3_CR17","unstructured":"H. Hansson. Time and Probability in Formal Design of Distributed Systems. PhD thesis, Department of Computer Systems. Uppsala University, 1991."},{"key":"3_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1007\/3-540-40911-4_24","volume-title":"IFM 2000","author":"H. Hermanns","year":"2000","unstructured":"H. Hermanns, J-P. Katoen, J. Meyer-Kayser, and M. Siegle. Towards model checking stochastic process algebra. In IFM 2000, LNCS 1945, pages 420\u2013440. Springer, 2000."},{"key":"3_CR19","unstructured":"F. Hern\u00e1ndez, R. Pe\u00f1a, and F. Rubio. From GranSim to Paradise. In Trends in Functional Programming, pages 11\u201319. Intellect, 2000."},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"J. Hillston. A Compositional Approach to Performance Modelling. Cambridge University Press, 1996.","DOI":"10.1017\/CBO9780511569951"},{"key":"3_CR21","unstructured":"IEEE. 802.5: Token ring access method. IEEE, 1985."},{"key":"3_CR22","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/3-540-44804-7_4","volume-title":"PAPM-PROBMIV 2001","author":"G.G. Infante L\u00f3pez","year":"2001","unstructured":"G.G. Infante L\u00f3pez, H. Hermanns, and J.-P. Katoen. Beyond memoryless distributions: Model checking semi-Markov chains. In PAPM-PROBMIV 2001, LNCS 2165, pages 57\u201370. Springer, 2001."},{"key":"3_CR23","unstructured":"B. Jonsson, W. Yi, and K.G. Larsen. Probabilistic extensions of process algebras. In J.A. Bergstra, A. Ponse, and S.A. Smolka, editors, Handbook of process algebra, chapter 11. North Holland, 2001."},{"key":"3_CR24","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45361-X_5","volume-title":"Implementation of Functional Languages, IFL\u201900","author":"U. Klusik","year":"2001","unstructured":"U. Klusik, R. Loogen, S. Priebe, and F. Rubio. Implementation skeletons in Eden: Low-effort parallel programming. In Implementation of Functional Languages, IFL\u201900, LNCS 2011. Springer, 2001."},{"key":"3_CR25","unstructured":"H.W. Loidl. GranSim User\u2019s Guide. Department of Computing Science, Glasgow University, 1996."},{"key":"3_CR26","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/3-540-44685-0_22","volume-title":"CONCUR 2001","author":"N. L\u00f3pez","year":"2001","unstructured":"N. L\u00f3pez and M. N\u00fa\u00f1ez. A testing theory for generally distributed stochastic processes. In CONCUR 2001, LNCS 2154, pages 321\u2013335. Springer, 2001."},{"key":"3_CR27","unstructured":"N. L\u00f3pez, M. N\u00fa\u00f1ez, and F. Rubio. Implementation relation between VPSPA and Eden, 2002. http:\/\/dalila.sip.ucm.es\/~natalia\/ifm02\/appendix.ps ."},{"key":"3_CR28","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/0304-3975(94)00171-E","volume":"138","author":"G. Lowe","year":"1995","unstructured":"G. Lowe. Probabilistic and prioritized models of timed CSP. Theoretical Computer Science, 138:315\u2013352, 1995.","journal-title":"Theoretical Computer Science"},{"key":"3_CR29","unstructured":"J.A. Ma\u00f1as and T. de Miguel. From LOTOS to C. In International Conference on Formal Description Techniques for Distributed Systems and Communications Protocols, pages 79\u201384. Elsevier, 1988."},{"key":"3_CR30","series-title":"Lect Notes Comput Sci","first-page":"376","volume-title":"Computer Aided Verification\u201991","author":"X. Nicollin","year":"1991","unstructured":"X. Nicollin and J. Sifakis. An overview and synthesis on timed process algebras. In Computer Aided Verification\u201991, LNCS 8575, pages 376\u2013398, 1991."},{"key":"3_CR31","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/3-540-60218-6_18","volume-title":"CONCUR\u201995","author":"M. N\u00fa\u00f1ez","year":"1995","unstructured":"M. N\u00fa\u00f1ez, D. de Frutos, and L. Llana. Acceptance trees for probabilistic processes. In CONCUR\u201995, LNCS 962, pages 249\u2013263. Springer, 1995."},{"key":"3_CR32","doi-asserted-by":"crossref","unstructured":"R. Pe\u00f1a and F. Rubio. Parallel Functional Programming at Two Levels of Abstraction. In Principles and Practice of Declarative Programming (PPDP01), pages 187\u2013198. ACM Press, 2001.","DOI":"10.1145\/773184.773204"},{"key":"3_CR33","doi-asserted-by":"crossref","unstructured":"S.L. Peyton Jones, A. Gordon, and S. Finne. Concurrent Haskell. In ACM Symp. on Principles of Prog. Lang. POPL\u201996, pages 295\u2013308. ACM Press, 1996.","DOI":"10.1145\/237721.237794"},{"key":"3_CR34","unstructured":"S.L. Peyton Jones and J. Hughes, editors. Report on the Programming Language Haskell 98. Available at http:\/\/www.haskell.org , 1999."}],"container-title":["Lecture Notes in Computer Science","Integrated Formal Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-47884-1_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T05:37:56Z","timestamp":1556429876000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47884-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540437031","9783540478843"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/3-540-47884-1_3","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}