{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:03:05Z","timestamp":1725894185369},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540689805"},{"type":"electronic","value":"9783540689829"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68982-9_18","type":"book-chapter","created":{"date-parts":[[2008,6,2]],"date-time":"2008-06-02T07:20:54Z","timestamp":1212391254000},"page":"249-263","source":"Crossref","is-referenced-by-count":6,"title":["Perfect Simulation of Stochastic Automata Networks"],"prefix":"10.1007","author":[{"given":"Paulo","family":"Fernandes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Marc","family":"Vincent","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thais","family":"Webber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","volume-title":"Introduction to the numerical solution of Markov chains","author":"W.J. Stewart","year":"1994","unstructured":"Stewart, W.J.: Introduction to the numerical solution of Markov chains. Princeton University Press, Princeton (1994)"},{"key":"18_CR2","first-page":"147","volume-title":"ACM Sigmetrics Conference on Measurements and Modeling of Computer Systems","author":"B. Plateau","year":"1985","unstructured":"Plateau, B.: On the stochastic structure of parallelism and synchronization models for distributed algorithms. In: ACM Sigmetrics Conference on Measurements and Modeling of Computer Systems, pp. 147\u2013154. ACM Press, New York (1985)"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Benoit, A., Fernandes, P., Plateau, B., Stewart, W.J.: On the benefits of using functional transitions and Kronecker algebra. Performance Evaluation (in Press, 2004)","DOI":"10.1016\/j.peva.2004.04.002"},{"issue":"3","key":"18_CR4","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1287\/ijoc.12.3.203.12634","volume":"13","author":"P. Buchholz","year":"2000","unstructured":"Buchholz, P., Ciardo, G., Donatelli, S., Kemper, P.: Complexity of memory efficient Kronecker operations with applications to the solution of Markov models. INFORMS Journal on Computing\u00a013(3), 203\u2013222 (2000)","journal-title":"INFORMS Journal on Computing"},{"issue":"3","key":"18_CR5","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1145\/278298.278303","volume":"45","author":"P. Fernandes","year":"1998","unstructured":"Fernandes, P., Plateau, B., Stewart, W.J.: Efficient vector-descriptor multiplication in Stochastic Automata Networks. Journal of the ACM\u00a045(3), 381\u2013414 (1998)","journal-title":"Journal of the ACM"},{"issue":"3","key":"18_CR6","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1023\/A:1020321222420","volume":"21","author":"P. Buchholz","year":"2002","unstructured":"Buchholz, P., Kemper, P.: Hierarchical reachability graph generation for Petri nets. Formal Methods in Systems Design\u00a021(3), 281\u2013315 (2002)","journal-title":"Formal Methods in Systems Design"},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1007\/3-540-48745-X_2","volume-title":"Application and Theory of Petri Nets 1999","author":"A.S. Miner","year":"1999","unstructured":"Miner, A.S., Ciardo, G.: Efficient Reachability Set Generation and Storage Using Decision Diagrams. In: Donatelli, S., Kleijn, J. (eds.) ICATPN 1999. LNCS, vol.\u00a01639, pp. 6\u201325. Springer, Heidelberg (1999)"},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1051\/ro:2001108","volume":"35","author":"R. Jungblut-Hessel","year":"2001","unstructured":"Jungblut-Hessel, R., Plateau, B., Stewart, W.J., Ycart, B.: Fast simulation for Road Traffic Network. RAIRO Operational Research\u00a035, 229\u2013250 (2001)","journal-title":"RAIRO Operational Research"},{"key":"18_CR9","series-title":"Based on lecture notes","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511613586","volume-title":"Finite Markov Chains and Algorithmic Applications","author":"O. H\u00e4ggstr\u00f6m","year":"2002","unstructured":"H\u00e4ggstr\u00f6m, O.: Finite Markov Chains and Algorithmic Applications. Based on lecture notes. Cambridge University Press, Cambridge (2002)"},{"issue":"1-2","key":"18_CR10","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1002\/(SICI)1098-2418(199608\/09)9:1\/2<223::AID-RSA14>3.0.CO;2-O","volume":"9","author":"J.G. Propp","year":"1996","unstructured":"Propp, J.G., Wilson, D.B.: Exact Sampling with Coupled Markov Chains and Applications to Statistical Mechanics. Random Structures and Algorithms\u00a09(1-2), 223\u2013252 (1996)","journal-title":"Random Structures and Algorithms"},{"issue":"10","key":"18_CR11","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 modelling parallel systems. IEEE Transactions on Software Engineering\u00a017(10), 1093\u20131108 (1991)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"18_CR12","unstructured":"Brenner, L., Fernandes, P., Sales, A.: The Need for and the Advantages of Generalized Tensor Algebra for Kronecker Structured Representations. In: 20\n                    th\n                   Annual UK Performance Engineering Workshop, Bradford, UK, July 2004, pp. 48\u201360 (2004)"},{"key":"18_CR13","volume-title":"Monotone structure in discrete-event systems","author":"P. Glasserman","year":"1994","unstructured":"Glasserman, P., Yao, D.D.: Monotone structure in discrete-event systems. John Wiley & Sons, Inc., New York (1994)"},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/BF00994261","volume":"34","author":"A.A. Borovkov","year":"1994","unstructured":"Borovkov, A.A., Foss, S.G.: Two ergodicity criteria for stochastically recursive sequences. ACTA Applicande Math.\u00a034, 125\u2013134 (1994)","journal-title":"ACTA Applicande Math."},{"issue":"1","key":"18_CR15","first-page":"27","volume":"49","author":"O. Stenflo","year":"2001","unstructured":"Stenflo, O.: Ergodic Theorems for Markov chains represented by Iterated Function Systems. Bull. Polish Acad. Sci. Math.\u00a049(1), 27\u201343 (2001)","journal-title":"Bull. Polish Acad. Sci. Math."},{"key":"18_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1007\/978-3-540-45232-4_7","volume-title":"Computer Performance Evaluations. Modelling Techniques and Tools","author":"A. Benoit","year":"2003","unstructured":"Benoit, A., Brenner, L., Fernandes, P., Plateau, B., Stewart, W.J.: The PEPS Software Tool. In: Kemper, P., Sanders, W.H. (eds.) TOOLS 2003. LNCS, vol.\u00a02794, pp. 98\u2013115. Springer, Heidelberg (2003)"},{"key":"18_CR17","first-page":"163","volume-title":"QEST 2007","author":"L. Brenner","year":"2007","unstructured":"Brenner, L., Fernandes, P., Plateau, B., Sbeity, I.: PEPS2007 - Stochastic Automata Networks Software Tool. In: QEST 2007, pp. 163\u2013164. IEEE Press, Los Alamitos (2007)"},{"key":"18_CR18","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1109\/WSC.2005.1574291","volume-title":"Winter Simulation Conference","author":"J.M. Vincent","year":"2005","unstructured":"Vincent, J.M.: Perfect simulation of monotone systems for rare event probability estimation. In: Winter Simulation Conference, pp. 528\u2013537. ACM, New York (2005)"},{"key":"18_CR19","first-page":"268","volume-title":"International Symposium on Applications and the Internet Workshops: SAINT Workshops","author":"J.M. Vincent","year":"2005","unstructured":"Vincent, J.M.: Perfect Simulation of Queueing Networks with Blocking and Rejection. In: International Symposium on Applications and the Internet Workshops: SAINT Workshops, pp. 268\u2013271. IEEE Computer Society, Los Alamitos (2005)"},{"issue":"2","key":"18_CR20","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1145\/1168134.1168146","volume":"34","author":"J.M. Vincent","year":"2006","unstructured":"Vincent, J.M., Vienne, J.: Perfect simulation of index based routing queueing networks. SIGMETRICS Performance Evaluation Review\u00a034(2), 24\u201325 (2006)","journal-title":"SIGMETRICS Performance Evaluation Review"},{"issue":"1","key":"18_CR21","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1111\/j.1751-5823.2001.tb00478.x","volume":"69","author":"X.K. Dimakos","year":"2001","unstructured":"Dimakos, X.K.: A Guide to Exact Simulation. International Statistical Review\u00a069(1), 27\u201348 (2001)","journal-title":"International Statistical Review"}],"container-title":["Lecture Notes in Computer Science","Analytical and Stochastic Modeling Techniques and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68982-9_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:21:31Z","timestamp":1620015691000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68982-9_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540689805","9783540689829"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68982-9_18","relation":{},"subject":[]}}