{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T22:10:06Z","timestamp":1748815806315,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662496299"},{"type":"electronic","value":"9783662496305"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-49630-5_21","type":"book-chapter","created":{"date-parts":[[2016,3,21]],"date-time":"2016-03-21T09:04:32Z","timestamp":1458551072000},"page":"353-369","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Distributed Synthesis in Continuous Time"],"prefix":"10.1007","author":[{"given":"Holger","family":"Hermanns","sequence":"first","affiliation":[]},{"given":"Jan","family":"Kr\u010d\u00e1l","sequence":"additional","affiliation":[]},{"given":"Steen","family":"Vester","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"21_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2108242.2108243","volume":"59","author":"C Baier","year":"2012","unstructured":"Baier, C., Gr\u00f6\u00dfer, M., Bertrand, N.: Probabilistic $$\\omega $$ \u03c9 -automata. J. ACM 59(1), 1 (2012)","journal-title":"J. ACM"},{"key":"21_CR2","volume-title":"Principles of Model Checking","author":"C Baier","year":"2008","unstructured":"Baier, C., Katoen, J.P.: Principles of Model Checking. MIT Press, Cambridge (2008)"},{"issue":"4","key":"21_CR3","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1287\/moor.27.4.819.297","volume":"27","author":"DS Bernstein","year":"2002","unstructured":"Bernstein, D.S., Givan, R., Immerman, N., Zilberstein, S.: The complexity of decentralized control of Markov decision processes. Math. Oper. Res. 27(4), 819\u2013840 (2002)","journal-title":"Math. Oper. Res."},{"key":"21_CR4","series-title":"Lecture Notes in Computer Science","volume-title":"Automata, Languages and Programming","author":"A Bertoni","year":"1997","unstructured":"Bertoni, A., Mauri, G., Torelli, M.: Some recursively unsolvable problems relating to isolated cutpoints in probabilistic automata. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol. 1256. Springer, Heidelberg (1997)"},{"issue":"4","key":"21_CR5","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s10849-009-9115-8","volume":"19","author":"D Berwanger","year":"2010","unstructured":"Berwanger, D., Kaiser, L.: Information tracking in games on graphs. J. Logic Lang. Inform. 19(4), 395\u2013412 (2010)","journal-title":"J. Logic Lang. Inform."},{"issue":"3","key":"21_CR6","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1145\/828.833","volume":"31","author":"SD Brookes","year":"1984","unstructured":"Brookes, S.D., Hoare, C.A.R., Roscoe, A.W.: A theory of communicating sequential processes. J. ACM 31(3), 560\u2013599 (1984)","journal-title":"J. ACM"},{"issue":"1","key":"21_CR7","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s10626-007-0032-1","volume":"18","author":"R Canetti","year":"2008","unstructured":"Canetti, R., Cheung, L., Kaynar, D.K., Liskov, M., Lynch, N.A., Pereira, O., Segala, R.: Analyzing security protocols using time-bounded task-PIOAs. Discrete Event Dyn. Syst. 18(1), 111\u2013159 (2008)","journal-title":"Discrete Event Dyn. Syst."},{"issue":"1\u20132","key":"21_CR8","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.tcs.2006.07.033","volume":"365","author":"L Cheung","year":"2006","unstructured":"Cheung, L., Lynch, N.A., Segala, R., Vaandrager, F.W.: Switched PIOA: parallel composition via distributed scheduling. Theoret. Comput. Sci. 365(1\u20132), 83\u2013108 (2006)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"21_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ic.2005.07.001","volume":"203","author":"PR D\u2019Argenio","year":"2005","unstructured":"D\u2019Argenio, P.R., Katoen, J.-P.: A theory of stochastic systems part I: stochastic automata. Inf. Comput. 203(1), 1\u201338 (2005)","journal-title":"Inf. Comput."},{"key":"21_CR10","series-title":"Lecture Notes in Computer Science","volume-title":"CONCUR 1996: Concurrency Theory","author":"M Droste","year":"1996","unstructured":"Droste, M., Gastin, P.: Asynchronous cellular automata for pomsets without auto-concurrency. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol. 1119. Springer, Heidelberg (1996)"},{"key":"21_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/978-3-642-39212-2_26","volume-title":"Automata, Languages, and Programming","author":"B Genest","year":"2013","unstructured":"Genest, B., Gimbert, H., Muscholl, A., Walukiewicz, I.: Asynchronous games over tree architectures. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part II. LNCS, vol. 7966, pp. 275\u2013286. Springer, Heidelberg (2013)"},{"key":"21_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/978-3-642-14162-1_44","volume-title":"Automata, Languages and Programming","author":"H Gimbert","year":"2010","unstructured":"Gimbert, H., Oualhadj, Y.: Probabilistic automata on finite words: decidable and undecidable problems. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6199, pp. 527\u2013538. Springer, Heidelberg (2010)"},{"key":"21_CR13","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.tcs.2013.07.017","volume":"538","author":"S Giro","year":"2014","unstructured":"Giro, S., D\u2019Argenio, P.R., Fioriti, L.M.F.: Distributed probabilistic input\/output automata: Expressiveness, (un)decidability and algorithms. Theoret. Comput. Sci. 538, 84\u2013102 (2014)","journal-title":"Theoret. Comput. Sci."},{"key":"21_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1007\/978-3-642-28891-3_4","volume-title":"NASA Formal Methods","author":"D Guck","year":"2012","unstructured":"Guck, D., Han, T., Katoen, J.-P., Neuh\u00e4u\u00dfer, M.R.: Quantitative timed analysis of interactive markov chains. In: Goodloe, A.E., Person, S. (eds.) NFM 2012. LNCS, vol. 7226, pp. 8\u201323. Springer, Heidelberg (2012)"},{"key":"21_CR15","unstructured":"Hermanns, H., Johr, S.: May we reach it? Or must we? In what time? With what probability? In: MMB, pp. 125\u2013140. VDE Verlag (2008)"},{"key":"21_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45804-2","volume-title":"Interactive Markov Chains and The Quest for Quantified Quality","author":"H Hermanns","year":"2002","unstructured":"Hermanns, H.: Interactive Markov Chains and The Quest for Quantified Quality. Lecture Notes in Computer Science, vol. 2428. Springer, New York (2002)"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Hermanns, H., Vester, S., Kr\u010d\u00e1l, J.: Distributed synthesis in continuous time. CoRR abs\/1601.01587 (2016)","DOI":"10.1007\/978-3-662-49630-5_21"},{"key":"21_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-642-17071-3_16","volume-title":"Formal Methods for Components and Objects","author":"H Hermanns","year":"2010","unstructured":"Hermanns, H., Katoen, J.-P.: The how and why of interactive markov chains. In: Boer, F.S., Bonsangue, M.M., Hallerstede, S., Leuschel, M. (eds.) FMCO 2009. LNCS, vol. 6286, pp. 311\u2013338. Springer, Heidelberg (2010)"},{"key":"21_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-642-40184-8_26","volume-title":"CONCUR 2013 \u2013 Concurrency Theory","author":"H Hermanns","year":"2013","unstructured":"Hermanns, H., Kr\u010d\u00e1l, J., K\u0159et\u00ednsk\u00fd, J.: Compositional verification and optimization of interactive markov chains. In: D\u2019Argenio, P.R., Melgratti, H. (eds.) CONCUR 2013 \u2013 Concurrency Theory. LNCS, vol. 8052, pp. 364\u2013379. Springer, Heidelberg (2013)"},{"key":"21_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-642-04368-0_16","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"J-P Katoen","year":"2009","unstructured":"Katoen, J.-P., Klink, D., Neuh\u00e4u\u00dfer, M.R.: Compositional abstraction for stochastic systems. In: Ouaknine, J., Vaandrager, F.W. (eds.) FORMATS 2009. LNCS, vol. 5813, pp. 195\u2013211. Springer, Heidelberg (2009)"},{"issue":"2","key":"21_CR21","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.peva.2010.04.001","volume":"68","author":"J-P Katoen","year":"2011","unstructured":"Katoen, J.-P., Zapreev, I.S., Hahn, E.M., Hermanns, H., Jansen, D.N.: The ins and outs of the probabilistic model checker MRMC. Perform. Eval. 68(2), 90\u2013104 (2011)","journal-title":"Perform. Eval."},{"key":"21_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/3-540-48224-5_33","volume-title":"Automata, Languages and Programming","author":"P Madhusudan","year":"2001","unstructured":"Madhusudan, P., Thiagarajan, P.S.: Distributed controller synthesis for local specifications. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 396\u2013407. Springer, Heidelberg (2001)"},{"key":"21_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/3-540-45694-5_11","volume-title":"CONCUR 2002 - Concurrency Theory","author":"P Madhusudan","year":"2002","unstructured":"Madhusudan, P., Thiagarajan, P.S.: A decidable class of asynchronous distributed controllers. In: Brim, L., Jan\u010dar, P., K\u0159et\u00ednsk\u00fd, M., Ku\u010dera, A. (eds.) CONCUR 2002. LNCS, vol. 2421, pp. 145\u2013160. Springer, Heidelberg (2002)"},{"key":"21_CR24","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0304-3975(83)90114-7","volume":"25","author":"R Milner","year":"1983","unstructured":"Milner, R.: Calculi for synchrony and asynchrony. Theoret. Comput. Sci. 25, 267\u2013310 (1983)","journal-title":"Theoret. Comput. Sci."},{"key":"21_CR25","volume-title":"Matrix-Geometric Solutions in Stochastic Models: An Algorithmic Approach","author":"MF Neuts","year":"1981","unstructured":"Neuts, M.F.: Matrix-Geometric Solutions in Stochastic Models: An Algorithmic Approach. Courier Corporation, New York (1981)"},{"key":"21_CR26","volume-title":"Introduction to Probabilistic Automata","author":"A Paz","year":"1971","unstructured":"Paz, A.: Introduction to Probabilistic Automata. Academic Press Inc., London (1971)"},{"key":"21_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-642-41157-1_12","volume-title":"Trustworthy Global Computing","author":"SS Pelozo","year":"2013","unstructured":"Pelozo, S.S., D\u2019Argenio, P.R.: Security analysis in probabilistic distributed protocols via bounded reachability. In: Palamidessi, C., Ryan, M.D. (eds.) TGC 2012. LNCS, vol. 8191, pp. 182\u2013197. Springer, Heidelberg (2013)"},{"key":"21_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1007\/BFb0035790","volume-title":"Automata, Languages and Programming","author":"A Pnueli","year":"1989","unstructured":"Pnueli, A., Rosner, R.: On the synthesis of an asynchronous reactive module. In: Ausiello, G., Dezani-Ciancaglini, M., Della Rocca, S.R. (eds.) ICALP. LNCS, vol. 372, pp. 652\u2013671. Springer, Heidelberg (1989)"},{"key":"21_CR29","doi-asserted-by":"crossref","unstructured":"Pnueli, A., Rosner, R.: Distributed reactive systems are hard to synthesize. In: FOCS, pp. 746\u2013757. IEEE Computer Society (1990)","DOI":"10.1109\/FSCS.1990.89597"},{"key":"21_CR30","volume-title":"Markov Decision Processes: Discrete Stochastic Dynamic Programming","author":"ML Puterman","year":"2009","unstructured":"Puterman, M.L.: Markov Decision Processes: Discrete Stochastic Dynamic Programming. John Wiley & Sons, New York (2009)"},{"key":"21_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/978-3-662-46081-8_7","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"R Saha","year":"2015","unstructured":"Saha, R., Esparza, J., Jha, S.K., Mukund, M., Thiagarajan, P.S.: Distributed markov chains. In: D\u2019Souza, D., Lal, A., Larsen, K.G. (eds.) VMCAI 2015. LNCS, vol. 8931, pp. 117\u2013134. Springer, Heidelberg (2015)"},{"key":"21_CR32","unstructured":"Segala, R.: Modeling and Verification of Randomized Distributed Real-Time Systems. Ph.D. thesis, Massachusetts Institute of Technology (1995)"},{"key":"21_CR33","doi-asserted-by":"publisher","first-page":"1235","DOI":"10.1109\/JPROC.2003.814926","volume":"91","author":"B Sinopoli","year":"2003","unstructured":"Sinopoli, B., Sharp, C., Schenato, L., Schaffert, S., Sastry, S.S.: Distributed control applications within sensor networks. Proc. IEEE 91, 1235\u20131246 (2003)","journal-title":"Proc. IEEE"},{"issue":"1\u20132","key":"21_CR34","first-page":"1","volume":"176","author":"W Sue-Hwey","year":"1997","unstructured":"Sue-Hwey, W., Smolka, S.A., Stark, E.W.: Composition and behaviors of probabilistic I\/O automata. Theoret. Comput. Sci. 176(1\u20132), 1\u201338 (1997)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49630-5_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T21:30:03Z","timestamp":1748813403000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49630-5_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662496299","9783662496305"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49630-5_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}