{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:25:49Z","timestamp":1740122749041,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,8,5]],"date-time":"2017-08-05T00:00:00Z","timestamp":1501891200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Event Dyn Syst"],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1007\/s10626-017-0259-4","type":"journal-article","created":{"date-parts":[[2017,8,5]],"date-time":"2017-08-05T02:35:29Z","timestamp":1501900529000},"page":"83-108","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Opacity for linear constraint Markov chains"],"prefix":"10.1007","volume":"28","author":[{"given":"B\u00e9atrice","family":"B\u00e9rard","sequence":"first","affiliation":[]},{"given":"Olga","family":"Kouchnarenko","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7963-4433","authenticated-orcid":false,"given":"John","family":"Mullins","sequence":"additional","affiliation":[]},{"given":"Mathieu","family":"Sassolas","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,5]]},"reference":[{"key":"259_CR1","doi-asserted-by":"crossref","unstructured":"Alur R, \u010cern\u00fd P, Zdancewic S (2006) Preserving secrecy under refinement. In: Proc. ICALP\u201906, LNCS, vol 4052. Springer, pp 107\u2013118","DOI":"10.1007\/11787006_10"},{"key":"259_CR2","unstructured":"Baier C, Katoen JP (2008) Principles of model checking (representation and mind series). The MIT Press"},{"key":"259_CR3","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/j.ic.2005.03.001","volume":"200","author":"C Baier","year":"2005","unstructured":"Baier C, Katoen JP, Hermanns H, Wolf V (2005) Comparative branching-time semantics for Markov chains. Inf Comput 200:149\u2013214","journal-title":"Inf Comput"},{"key":"259_CR4","doi-asserted-by":"crossref","unstructured":"Benedikt M, Lenhardt R, Worrell J (2013) LTL model checking of interval Markov chains. In: Proc. TACAS\u201913, LNCS, vol 7795. Springer, pp 32\u201346","DOI":"10.1007\/978-3-642-36742-7_3"},{"key":"259_CR5","doi-asserted-by":"crossref","unstructured":"B\u00e9rard B, Mullins J, Sassolas M (2010) Quantifying opacity. In: Ciardo G, Segala R (eds) Proc. QEST\u201910. IEEE Computer Society, pp 263\u2013272","DOI":"10.1109\/QEST.2010.40"},{"issue":"1","key":"259_CR6","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/j.ipl.2014.09.001","volume":"115","author":"B B\u00e9rard","year":"2015","unstructured":"B\u00e9rard B, Chatterjee K, Sznajder N (2015a) Probabilistic opacity for Markov decision processes. Inf Process Lett 115(1):52\u201359","journal-title":"Inf Process Lett"},{"issue":"2","key":"259_CR7","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1017\/S0960129513000637","volume":"25","author":"B B\u00e9rard","year":"2015","unstructured":"B\u00e9rard B, Mullins J, Sassolas M (2015b) Quantifying opacity. Math Struct Comput Sci 25(2):361\u2013403","journal-title":"Math Struct Comput Sci"},{"key":"259_CR8","doi-asserted-by":"crossref","unstructured":"B\u00e9rard B, Kouchnarenko O, Mullins J, Sassolas M (2016) Preserving opacity on interval Markov chains under simulation. In: Cassandras CG, Giua A, Li Z (eds) Proceedings of 13th international workshop on discrete event systems, WODES\u201916. IEEE, pp 319\u2013324","DOI":"10.1109\/WODES.2016.7497866"},{"key":"259_CR9","doi-asserted-by":"crossref","unstructured":"Bhargava M, Palamidessi C (2005) Probabilistic anonymity. In: Abadi M, de Alfaro L (eds) Proc. CONCUR\u201905, LNCS, vol 3653, pp 171\u2013185","DOI":"10.1007\/11539452_16"},{"key":"259_CR10","unstructured":"Billingsley P (1995) Probability and measure, 3rd edn. Wiley"},{"issue":"5\u20136","key":"259_CR11","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1016\/j.jlamp.2014.05.001","volume":"83","author":"F Biondi","year":"2014","unstructured":"Biondi F, Legay A, Nielsen BF, Wa\u0327sowski A (2014) Maximizing entropy over Markov processes. J Logic Algebr Methods Programm 83(5\u20136):384\u2013399","journal-title":"J Logic Algebr Methods Programm"},{"issue":"6","key":"259_CR12","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/s10207-008-0058-x","volume":"7","author":"JW Bryans","year":"2008","unstructured":"Bryans JW, Koutny M, Mazar\u00e9 L, Ryan PYA (2008) Opacity generalised to transition systems. Int J Inf Secur 7(6):421\u2013435","journal-title":"Int J Inf Secur"},{"issue":"34","key":"259_CR13","doi-asserted-by":"crossref","first-page":"4373","DOI":"10.1016\/j.tcs.2011.05.010","volume":"412","author":"B Caillaud","year":"2011","unstructured":"Caillaud B, Delahaye B, Larsen KG, Legay A, Pedersen ML, Wasowski A (2011) Constraint Markov chains. Theor Comput Sci 412(34):4373\u20134404","journal-title":"Theor Comput Sci"},{"key":"259_CR14","unstructured":"Chatterjee K, Henzinger T, Sen K (2008) Model-checking omega-regular properties of interval Markov chains. In Amadio RM (ed) Proc. FoSSaCS\u201908, pp 302\u2013317"},{"key":"259_CR15","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF00206326","volume":"1","author":"D Chaum","year":"1988","unstructured":"Chaum D (1988) The dining cryptographers problem: unconditional sender and recipient untraceability. J Cryptol 1:65\u201375","journal-title":"J Cryptol"},{"issue":"6","key":"259_CR16","doi-asserted-by":"crossref","first-page":"1157","DOI":"10.3233\/JCS-2009-0393","volume":"18","author":"MR Clarkson","year":"2010","unstructured":"Clarkson MR, Schneider FB (2010) Hyperproperties. J Comput Secur 18(6):1157\u20131210","journal-title":"J Comput Secur"},{"key":"259_CR17","unstructured":"Delahaye B (2015) Consistency for parametric interval Markov chains. In: Andr\u00e9 \u00c9, Frehse G (eds) Proc SynCoP\u201915, OASICS, vol 44. Schloss Dagstuhl - LZI, pp 17\u201332"},{"key":"259_CR18","doi-asserted-by":"crossref","unstructured":"Jonsson B, Larsen KG (1991) Specification and refinement of probabilistic processes. In: Proceedings LICS\u201991. IEEE Computer Society, , pp 266\u2013277","DOI":"10.1109\/LICS.1991.151651"},{"key":"259_CR19","doi-asserted-by":"crossref","unstructured":"Mazar\u00e9 L. (2005) Decidability of opacity with non-atomic keys. In: Proceedings FAST\u201904, international federation for information processing, vol 173. Springer, pp 71\u201384","DOI":"10.1007\/0-387-24098-5_6"},{"key":"259_CR20","doi-asserted-by":"crossref","unstructured":"Piterman N (2007) From nondeterministic B\u00fcchi and Streett automata to deterministic parity automata. Logic Methods Comput Sci 3(3)","DOI":"10.2168\/LMCS-3(3:5)2007"},{"key":"259_CR21","volume-title":"Theory and algorithms for linear optimization. An interior point approach","author":"C Roos","year":"1997","unstructured":"Roos C, Terlaky T, Vial JP (1997) Theory and algorithms for linear optimization. An interior point approach. John Wiley & Sons Ltd, Wiley-Interscience"},{"issue":"1","key":"259_CR22","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1109\/TAC.2013.2279914","volume":"59","author":"A Saboori","year":"2014","unstructured":"Saboori A, Hadjicostis CN (2014) Current-state opacity formulations in probabilistic finite automata. IEEE Trans Autom Control 59(1):120\u2013133","journal-title":"IEEE Trans Autom Control"},{"key":"259_CR23","unstructured":"Segala R (1995) Modeling and verification of randomized distributed real-time systems. Ph.D. thesis, MIT Department of Electrical Engineering and Computer Science"},{"key":"259_CR24","doi-asserted-by":"crossref","unstructured":"Sen K, Viswanathan M, Agha G (2006) Model-checking Markov chains in the presence of uncertainties. In: Hermanns H, Palsberg J (eds) Proceedings of 12th international conference on tools and algorithms for the construction and analysis of systems, TACAS\u201906, LNCS, vol 3920. Springer, pp 394\u2013410","DOI":"10.1007\/11691372_26"},{"key":"259_CR25","doi-asserted-by":"crossref","unstructured":"Vardi MY (1985) Automatic verification of probabilistic concurrent finite-state programs. In: Proceedings 26th annual symposium on foundations of computer science (FOCS\u201985). IEEE Computer Society, pp 327\u2013338","DOI":"10.1109\/SFCS.1985.12"}],"container-title":["Discrete Event Dynamic Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10626-017-0259-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10626-017-0259-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10626-017-0259-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T22:10:42Z","timestamp":1569967842000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10626-017-0259-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,5]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,3]]}},"alternative-id":["259"],"URL":"https:\/\/doi.org\/10.1007\/s10626-017-0259-4","relation":{},"ISSN":["0924-6703","1573-7594"],"issn-type":[{"type":"print","value":"0924-6703"},{"type":"electronic","value":"1573-7594"}],"subject":[],"published":{"date-parts":[[2017,8,5]]}}}