{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T01:10:03Z","timestamp":1745975403989,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642370632"},{"type":"electronic","value":"9783642370649"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37064-9_13","type":"book-chapter","created":{"date-parts":[[2013,3,15]],"date-time":"2013-03-15T08:07:12Z","timestamp":1363334832000},"page":"128-140","source":"Crossref","is-referenced-by-count":4,"title":["Maximizing Entropy over Markov Processes"],"prefix":"10.1007","author":[{"given":"Fabrizio","family":"Biondi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Axel","family":"Legay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo Friis","family":"Nielsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"W\u0105sowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","unstructured":"de Alfaro, L.: Formal Verification of Probabilistic Systems. Ph.D. thesis, Stanford (1997)"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/11539452_16","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"M. Bhargava","year":"2005","unstructured":"Bhargava, M., Palamidessi, C.: Probabilistic Anonymity. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol.\u00a03653, pp. 171\u2013185. Springer, Heidelberg (2005)"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-642-35873-9_7","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"F. Biondi","year":"2013","unstructured":"Biondi, F., Legay, A., Malacaria, P., W\u0105sowski, A.: Quantifying Information Leakage of Randomized Protocols. In: Giacobazzi, R., Berdine, J., Mastroeni, I. (eds.) VMCAI 2013. LNCS, vol.\u00a07737, pp. 68\u201387. Springer, Heidelberg (2013), http:\/\/dx.doi.org\/10.1007\/978-3-642-35873-9_7"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/978-3-540-78499-9_22","volume-title":"Foundations of Software Science and Computational Structures","author":"K. Chatterjee","year":"2008","unstructured":"Chatterjee, K., Sen, K., Henzinger, T.A.: Model-Checking \u03c9-Regular Properties of Interval Markov Chains. In: Amadio, R.M. (ed.) FOSSACS 2008. LNCS, vol.\u00a04962, pp. 302\u2013317. Springer, Heidelberg (2008)"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-540-75336-0_18","volume-title":"Trustworthy Global Computing","author":"K. Chatzikokolakis","year":"2007","unstructured":"Chatzikokolakis, K., Palamidessi, C., Panangaden, P.: Anonymity Protocols as Noisy Channels. In: Montanari, U., Sannella, D., Bruni, R. (eds.) TGC 2006. LNCS, vol.\u00a04661, pp. 281\u2013300. Springer, Heidelberg (2007)"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Chen, H., Malacaria, P.: Quantifying maximal loss of anonymity in protocols. In: Li, W., Susilo, W., Tupakula, U.K., Safavi-Naini, R. (eds.) ASIACCS. ACM (2009)","DOI":"10.1145\/1533057.1533087"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Clark, D., Hunt, S., Malacaria, P.: A static analysis for quantifying information flow in a simple imperative language. Journal of Computer Security 15 (2007)","DOI":"10.3233\/JCS-2007-15302"},{"key":"13_CR8","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611","volume-title":"Elements of information theory","author":"T. Cover","year":"1991","unstructured":"Cover, T., Thomas, J.: Elements of information theory. Wiley, New York (1991)"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1023\/B:MCAP.0000012418.88825.18","volume":"6","author":"V. Girardin","year":"2004","unstructured":"Girardin, V.: Entropy maximization for markov and semi-markov processes. Methodology and Computing in Applied Probability\u00a06, 109\u2013127 (2004)","journal-title":"Methodology and Computing in Applied Probability"},{"issue":"4","key":"13_CR10","first-page":"620","volume":"106","author":"E.T. Jaynes","year":"1957","unstructured":"Jaynes, E.T.: Information Theory and Statistical Mechanics. Physical Review Online Archive (Prola)\u00a0106(4), 620\u2013630 (1957)","journal-title":"Physical Review Online Archive (Prola)"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Jonsson, B., Larsen, K.G.: Specification and refinement of probabilistic processes. In: LICS, pp. 266\u2013277. IEEE Computer Society (1991)","DOI":"10.1109\/LICS.1991.151651"},{"issue":"2","key":"13_CR12","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1023\/A:1014745904458","volume":"8","author":"I. Kozine","year":"2002","unstructured":"Kozine, I., Utkin, L.V.: Interval-valued finite markov chains. Reliable Computing\u00a08(2), 97\u2013113 (2002)","journal-title":"Reliable Computing"},{"key":"13_CR13","unstructured":"Malacaria, P.: Algebraic foundations for information theoretical, probabilistic and guessability measures of information flow. CoRR abs\/1101.3453 (2011)"},{"key":"13_CR14","first-page":"135","volume-title":"PLAS 2008","author":"P. Malacaria","year":"2008","unstructured":"Malacaria, P., Chen, H.: Lagrange multipliers and maximum information leakage in different observational models. In: PLAS 2008, pp. 135\u2013146. ACM, New York (2008)"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Millen, J.K.: Covert channel capacity. In: IEEE Symposium on Security and Privacy, pp. 60\u201366 (1987)","DOI":"10.1109\/SP.1987.10013"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Puterman, M.L.: Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley-Interscience (April 1994)","DOI":"10.1002\/9780470316887"},{"key":"13_CR17","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"C.E. Shannon","year":"1948","unstructured":"Shannon, C.E.: A mathematical theory of communication. The Bell System Technical Journal\u00a027, 379\u2013423 (1948)","journal-title":"The Bell System Technical Journal"},{"key":"13_CR18","unstructured":"Stoer, J., Bulirsch, R., Bartels, R., Gautschi, W., Witzgall, C.: Introduction to Numerical Analysis. Texts in Applied Mathematics. Springer (2010)"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37064-9_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T00:38:42Z","timestamp":1745973522000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-37064-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642370632","9783642370649"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37064-9_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}