{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T19:49:22Z","timestamp":1725738562806},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642392115"},{"type":"electronic","value":"9783642392122"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39212-2_9","type":"book-chapter","created":{"date-parts":[[2013,7,2]],"date-time":"2013-07-02T13:09:19Z","timestamp":1372770559000},"page":"61-73","source":"Crossref","is-referenced-by-count":4,"title":["A Maximal Entropy Stochastic Process for a Timed Automaton,"],"prefix":"10.1007","author":[{"given":"Nicolas","family":"Basset","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"9_CR1","doi-asserted-by":"publisher","first-page":"899","DOI":"10.1214\/aop\/1176991794","volume":"16","author":"P.H. Algoet","year":"1988","unstructured":"Algoet, P.H., Cover, T.M.: A sandwich proof of the Shannon-McMillan-Breiman theorem. The Annals of Probability\u00a016(2), 899\u2013909 (1988)","journal-title":"The Annals of Probability"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/11730637_5","volume-title":"Hybrid Systems: Computation and Control","author":"R. Alur","year":"2006","unstructured":"Alur, R., Bernadsky, M.: Bounded model checking for GSMP models of stochastic real-time systems. In: Hespanha, J.P., Tiwari, A. (eds.) HSCC 2006. LNCS, vol.\u00a03927, pp. 19\u201333. Springer, Heidelberg (2006)"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","volume-title":"Automata, Languages and Programming","author":"R. Alur","year":"1991","unstructured":"Alur, R., Courcoubetis, C., Dill, D.L.: Model-checking for probabilistic real-time systems. In: Leach Albert, J., Monien, B., Rodr\u00edguez-Artalejo, M. (eds.) ICALP 1991. LNCS, vol.\u00a0510, Springer, Heidelberg (1991)"},{"key":"9_CR4","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\u00a0126, 183\u2013235 (1994)","journal-title":"Theoretical Computer Science"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-642-33365-1_4","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"E. Asarin","year":"2012","unstructured":"Asarin, E., Basset, N., B\u00e9al, M.-P., Degorre, A., Perrin, D.: Toward a timed theory of channel coding. In: Jurdzi\u0144ski, M., Ni\u010dkovi\u0107, D. (eds.) FORMATS 2012. LNCS, vol.\u00a07595, pp. 27\u201342. Springer, Heidelberg (2012)"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-642-04368-0_4","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"E. Asarin","year":"2009","unstructured":"Asarin, E., Degorre, A.: Volume and entropy of regular timed languages: Analytic approach. In: Ouaknine, J., Vaandrager, F.W. (eds.) FORMATS 2009. LNCS, vol.\u00a05813, pp. 13\u201327. Springer, Heidelberg (2009)"},{"key":"9_CR7","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.\u00a05710, pp. 69\u201383. Springer, Heidelberg (2009)"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-540-77050-3_15","volume-title":"FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science","author":"C. Baier","year":"2007","unstructured":"Baier, C., Bertrand, N., Bouyer, P., Brihaye, T., Gr\u00f6\u00dfer, M.: Probabilistic and topological semantics for timed automata. In: Arvind, V., Prasad, S. (eds.) FSTTCS 2007. LNCS, vol.\u00a04855, pp. 179\u2013191. Springer, Heidelberg (2007)"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-642-24310-3_9","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"N. Basset","year":"2011","unstructured":"Basset, N., Asarin, E.: Thin and thick timed regular languages. In: Fahrenberg, U., Tripakis, S. (eds.) FORMATS 2011. LNCS, vol.\u00a06919, pp. 113\u2013128. Springer, Heidelberg (2011)"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-540-71493-4_10","volume-title":"Hybrid Systems: Computation and Control","author":"M. Bernadsky","year":"2007","unstructured":"Bernadsky, M., Alur, R.: Symbolic analysis for GSMP models with one stateful clock. In: Bemporad, A., Bicchi, A., Buttazzo, G. (eds.) HSCC 2007. LNCS, vol.\u00a04416, pp. 90\u2013103. Springer, Heidelberg (2007)"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Bertrand, N., Bouyer, P., Brihaye, T., Markey, N.: Quantitative model-checking of one-clock timed automata under probabilistic semantics. In: QEST, pp. 55\u201364. IEEE Computer Society (2008)","DOI":"10.1109\/QEST.2008.19"},{"key":"9_CR12","unstructured":"Billingsley, P.: Probability and measure, vol.\u00a0939. Wiley (2012)"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Bouyer, P., Brihaye, T., Jurdzi\u0144ski, M., Menet, Q.: Almost-sure model-checking of reactive timed automata. QEST 2012, 138\u2013147 (2012)","DOI":"10.1109\/QEST.2012.10"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Cover, T.M., Thomas, J.A.: Elements of information theory, 2nd edn. Wiley (2006)","DOI":"10.1002\/047174882X"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-642-24310-3_7","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"A. David","year":"2011","unstructured":"David, A., Larsen, K.G., Legay, A., Miku\u010dionis, M., Poulsen, D.B., van Vliet, J., Wang, Z.: Statistical model checking for networks of priced timed automata. In: Fahrenberg, U., Tripakis, S. (eds.) FORMATS 2011. LNCS, vol.\u00a06919, pp. 80\u201396. Springer, Heidelberg (2011)"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/978-3-642-36742-7_27","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"J.-F. Kempf","year":"2013","unstructured":"Kempf, J.-F., Bozga, M., Maler, O.: As soon as probable: Optimal scheduling under stochastic uncertainty. In: Piterman, N., Smolka, S.A. (eds.) TACAS 2013 (ETAPS 2013). LNCS, vol.\u00a07795, pp. 385\u2013400. Springer, Heidelberg (2013)"},{"key":"9_CR17","volume-title":"Positive Linear Systems: the Method of Positive Operators","author":"M.A. Krasnosel\u2019skij","year":"1989","unstructured":"Krasnosel\u2019skij, M.A., Lifshits, E.A., Sobolev, A.V.: Positive Linear Systems: the Method of Positive Operators. Heldermann Verlag, Berlin (1989)"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Lind, D., Marcus, B.: An Introduction to Symbolic Dynamics and Coding. Cambridge University Press (1995)","DOI":"10.1017\/CBO9780511626302"},{"key":"9_CR19","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107341005","volume-title":"Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)","author":"M. Lothaire","year":"2005","unstructured":"Lothaire, M.: Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications). Cambridge University Press, New York (2005)"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Parry, W.: Intrinsic Markov chains. Transactions of the American Mathematical Society, 55\u201366 (1964)","DOI":"10.2307\/1994009"},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"Shannon, C.E.: A mathematical theory of communication. Bell Sys. Tech. J.\u00a027, 379\u2013423, 623\u2013656 (1948)","DOI":"10.1002\/j.1538-7305.1948.tb00917.x"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39212-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T01:43:09Z","timestamp":1558316589000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39212-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642392115","9783642392122"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39212-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}