{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:38:02Z","timestamp":1743097082627,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319213972"},{"type":"electronic","value":"9783319213989"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-21398-9_50","type":"book-chapter","created":{"date-parts":[[2015,6,23]],"date-time":"2015-06-23T15:12:41Z","timestamp":1435072361000},"page":"635-647","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Quantifying Communication in Synchronized Languages"],"prefix":"10.1007","author":[{"given":"Zhe","family":"Dang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas R.","family":"Fischer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"suffix":"III","given":"William J.","family":"Hutton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oscar H.","family":"Ibarra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qin","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,24]]},"reference":[{"key":"50_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-642-04081-8_6","volume-title":"CONCUR 2009 - Concurrency Theory","author":"E Asarin","year":"2009","unstructured":"Asarin, E., Degorre, A.: Volume and entropy of regular timed languages: discretization approach. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol. 5710, pp. 69\u201383. Springer, Heidelberg (2009)"},{"issue":"2","key":"50_CR2","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R Alur","year":"1994","unstructured":"Alur, R., Dill, D.L.: A theory of timed automata. Theoretical Computer Science 126(2), 183\u2013235 (1994)","journal-title":"Theoretical Computer Science"},{"key":"50_CR3","doi-asserted-by":"crossref","unstructured":"Chen, H., Malacaria, P.: Quantitative analysis of leakage for multi-threaded programs. In: PLAS 2007, pp. 31\u201340. ACM (2007)","DOI":"10.1145\/1255329.1255335"},{"key":"50_CR4","unstructured":"Cover, T.M., Thomas, J.A.: Elements of information theory, 2nd edn. Wiley-Interscience (2006)"},{"key":"50_CR5","doi-asserted-by":"crossref","unstructured":"Cui, C. , Dang, Z., Fischer, T., Ibarra, O.: Execution information rate for some classes of automata. Information and Computation (2015) to appear","DOI":"10.1016\/j.ic.2015.11.006"},{"key":"50_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/978-3-662-44522-8_20","volume-title":"Mathematical Foundations of Computer Science 2014","author":"C Cui","year":"2014","unstructured":"Cui, C., Dang, Z., Fischer, T.R., Ibarra, O.H.: Information rate of some classes of non-regular languages: an automata-theoretic approach. In: Csuhaj-Varj\u00fa, E., Dietzfelbinger, M., \u00c9sik, Z. (eds.) MFCS 2014, Part I. LNCS, vol. 8634, pp. 232\u2013243. Springer, Heidelberg (2014)"},{"key":"50_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-642-37064-9_21","volume-title":"Language and Automata Theory and Applications","author":"C Cui","year":"2013","unstructured":"Cui, C., Dang, Z., Fischer, T.R., Ibarra, O.H.: Execution information rate for some classes of automata. In: Dediu, A.-H., Mart\u00edn-Vide, C., Truthe, B. (eds.) LATA 2013. LNCS, vol. 7810, pp. 226\u2013237. Springer, Heidelberg (2013)"},{"key":"50_CR8","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/S0019-9958(58)90082-2","volume":"1","author":"N Chomsky","year":"1958","unstructured":"Chomsky, N., Miller, G.A.: Finite state languages. Information and Control 1, 91\u2013112 (1958)","journal-title":"Information and Control"},{"key":"50_CR9","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.tcs.2013.05.040","volume":"498","author":"C Cui","year":"2013","unstructured":"Cui, C., Dang, Z., Fischer, T.R., Ibarra, O.H.: Similarity in languages and programs. Theor. Comput. Sci. 498, 58\u201375 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"50_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/10722167_9","volume-title":"Computer Aided Verification","author":"Z Dang","year":"2000","unstructured":"Dang, Z., Ibarra, O., Bultan, T., Kemmerer, R., Su, J.: Binary reachability analysis of discrete pushdown timed automata. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 69\u201384. Springer, Heidelberg (2000)"},{"key":"50_CR11","doi-asserted-by":"crossref","unstructured":"Dang, Z., Ibarra, O., Li, Q.: Sampling a two-way finite automaton. In: Automata, Universality, Computation, the series book: Emergence, Complexity and Computation. Springer (2014)","DOI":"10.1007\/978-3-319-09039-9_4"},{"issue":"13","key":"50_CR12","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/S0304-3975(02)00743-0","volume":"301","author":"Z Dang","year":"2003","unstructured":"Dang, Z.: Pushdown timed automata: a binary reachability characterization and safety verification. Theoretical Computer Science 301(13), 93\u2013121 (2003)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"50_CR13","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/0022-0000(81)90028-3","volume":"22","author":"EM Gurari","year":"1981","unstructured":"Gurari, E.M., Ibarra, O.H.: The complexity of decision problems for finite-turn multicounter machines. Journal of Computer and System Sciences 22(2), 220\u2013229 (1981)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"50_CR14","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/322047.322058","volume":"25","author":"OH Ibarra","year":"1978","unstructured":"Ibarra, O.H.: Reversal-bounded multicounter machines and their decision problems. J. ACM 25(1), 116\u2013133 (1978)","journal-title":"J. ACM"},{"key":"50_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/978-3-540-45138-9_42","volume-title":"Mathematical Foundations of Computer Science 2003","author":"OH Ibarra","year":"2003","unstructured":"Ibarra, O.H., Dang, Z., Egecioglu, O., Saxena, G.: Characterizations of catalytic membrane computing systems. In: Rovan, B., Vojt\u00e1\u0161, P. (eds.) MFCS 2003. LNCS, vol. 2747, pp. 480\u2013489. Springer, Heidelberg (2003)"},{"issue":"2","key":"50_CR16","first-page":"175","volume":"17","author":"FP Kaminger","year":"1970","unstructured":"Kaminger, F.P.: The noncomputability of the channel capacity of context-sensitive languages. Inf. Comput. 17(2), 175\u2013182 (1970)","journal-title":"Inf. Comput."},{"issue":"2","key":"50_CR17","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/S0019-9958(70)90105-1","volume":"16","author":"W Kuich","year":"1970","unstructured":"Kuich, W.: On the entropy of context-free languages. Information and Control 16(2), 173\u201320 (1970)","journal-title":"Information and Control"},{"key":"50_CR18","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/S0065-2458(08)60342-3","volume":"44","author":"E Kushilevitz","year":"1997","unstructured":"Kushilevitz, E.: Communication complexity. Advances in Computers 44, 331\u2013360 (1997)","journal-title":"Advances in Computers"},{"issue":"10","key":"50_CR19","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1145\/2398857.2384621","volume":"47","author":"S Muller","year":"2012","unstructured":"Muller, S., Chong, S.: Towards a practical secure concurrent language. SIGPLAN Not. 47(10), 57\u201374 (2012)","journal-title":"SIGPLAN Not."},{"key":"50_CR20","unstructured":"Paun, G.: Membrane Computing, an Introduction. Springer (2000)"},{"issue":"2","key":"50_CR21","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1016\/0022-0000(84)90069-2","volume":"28","author":"CH Papadimitriou","year":"1984","unstructured":"Papadimitriou, C.H., Sipser, M.: Communication complexity. Journal of Computer and System Sciences 28(2), 260\u2013269 (1984)","journal-title":"Journal of Computer and System Sciences"},{"key":"50_CR22","unstructured":"Shannon, C.E., Weaver, W.: The Mathematical Theory of Communication. University of Illinois Press (1949)"},{"key":"50_CR23","doi-asserted-by":"crossref","unstructured":"Shaffer, A.B., Auguston, M., Irvine, C.E., Levin, T.E.: A security domain model to assess software for exploitable covert channels. In: PLAS 2008, pp. 45\u201356. ACM (2008)","DOI":"10.1145\/1375696.1375703"},{"key":"50_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/3-540-46011-X_12","volume-title":"Developments in Language Theory","author":"L Staiger","year":"2002","unstructured":"Staiger, L.: The entropy of Lukasiewicz-languages. In: Kuich, W., Rozenberg, G., Salomaa, A. (eds.) DLT 2001. LNCS, vol. 2295, pp. 155\u2013165. Springer, Heidelberg (2002)"},{"issue":"2","key":"50_CR25","first-page":"196","volume":"25","author":"E Wang","year":"2014","unstructured":"Wang, E., Cui, C., Dang, Z., Fischer, T.R., Yang, L.: Zero-knowledge black box testing: where are the faults? International Journal of Foundations of Computer Science 25(2), 196\u2013218 (2014)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"50_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1007\/3-540-45061-0_53","volume-title":"Automata, Languages and Programming","author":"G Xie","year":"2003","unstructured":"Xie, G., Dang, Z., Ibarra, O.: A solvable class of quadratic Diophantine equations with applications to verification of infinite-state systems. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 668\u2013680. Springer, Heidelberg (2003)"},{"key":"50_CR27","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Some complexity questions related to distributive computing (preliminary report). In: STOC 1979, pp. 209\u2013213. ACM (1979)","DOI":"10.1145\/800135.804414"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21398-9_50","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T13:02:16Z","timestamp":1675861336000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21398-9_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319213972","9783319213989"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21398-9_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"24 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}