{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:11:24Z","timestamp":1742994684425,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642162640"},{"type":"electronic","value":"9783642162657"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16265-7_13","type":"book-chapter","created":{"date-parts":[[2010,9,30]],"date-time":"2010-09-30T21:45:41Z","timestamp":1285883141000},"page":"168-182","source":"Crossref","is-referenced-by-count":1,"title":["Satisfaction Meets Expectations"],"prefix":"10.1007","author":[{"given":"Martin","family":"Fr\u00e4nzle","sequence":"first","affiliation":[]},{"given":"Tino","family":"Teige","sequence":"additional","affiliation":[]},{"given":"Andreas","family":"Eggers","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","unstructured":"Barrett, C., Sebastiani, R., Seshia, S.A., Tinelli, C.: Satisfiability modulo theories. In: Biere, et al. (eds.) [2], ch. 26, pp. 825\u2013885."},{"key":"13_CR2","series-title":"Frontiers in Artificial Intelligence and Applications","volume-title":"Handbook of Satisfiability","year":"2009","unstructured":"Biere, A., Heule, M.J.H., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol.\u00a0185. IOS Press, Amsterdam (February 2009)"},{"key":"13_CR3","first-page":"209","volume":"1","author":"M. Fr\u00e4nzle","year":"2007","unstructured":"Fr\u00e4nzle, M., Herde, C., Teige, T., Ratschan, S., Schubert, T.: Efficient Solving of Large Non-linear Arithmetic Constraint Systems with Complex Boolean Structure. JSAT Special Issue on SAT\/CP Integration\u00a01, 209\u2013236 (2007)","journal-title":"JSAT Special Issue on SAT\/CP Integration"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/978-3-540-78929-1_13","volume-title":"Hybrid Systems: Computation and Control","author":"M. Fr\u00e4nzle","year":"2008","unstructured":"Fr\u00e4nzle, M., Hermanns, H., Teige, T.: Stochastic Satisfiability Modulo Theory: A Novel Technique for the Analysis of Probabilistic Hybrid Systems. In: Egerstedt, M., Mishra, B. (eds.) HSCC 2008. LNCS, vol.\u00a04981, pp. 172\u2013186. Springer, Heidelberg (2008)"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Greifeneder, J., Frey, G.: Probabilistic hybrid automata with variable step width applied to the analysis of networked automation systems. In: Proc. 3rd IFAC Workshop on Discrete Event System Design. IFAC, pp. 283\u2013288 (2006)","DOI":"10.3182\/20060926-3-PL-4904.00047"},{"key":"13_CR6","unstructured":"Majercik, S.M.: Stochastic Boolean satisfiability. In: Biere, et al. (eds.) [2], ch. 27, pp. 887\u2013925"},{"issue":"2","key":"13_CR7","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1016\/0022-0000(85)90045-5","volume":"31","author":"C.H. Papadimitriou","year":"1985","unstructured":"Papadimitriou, C.H.: Games against nature. J. Comput. Syst. Sci.\u00a031(2), 288\u2013301 (1985)","journal-title":"J. Comput. Syst. Sci."},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Teige, T., Eggers, A., Fr\u00e4nzle, M.: Constraint-based analysis of concurrent probabilistic hybrid systems: An application to networked automation systems. In: Nonlinear Analysis: Hybrid Systems (accepted for publication 2010)","DOI":"10.1016\/j.nahs.2010.04.009"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-3-540-68155-7_20","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"T. Teige","year":"2008","unstructured":"Teige, T., Fr\u00e4nzle, M.: Stochastic Satisfiability modulo Theories for Non-linear Arithmetic. In: Perron, L., Trick, M.A. (eds.) CPAIOR 2008. LNCS, vol.\u00a05015, pp. 248\u2013262. Springer, Heidelberg (2008)"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/978-3-642-14295-6_21","volume-title":"Computer Aided Verification","author":"L. Zhang","year":"2010","unstructured":"Zhang, L., She, Z., Ratschan, S., Hermanns, H., Hahn, E.M.: Safety verification for probabilistic hybrid systems. In: Touili, T., Cook, B., Jackson, P. (eds.) Computer Aided Verification. LNCS, vol.\u00a06174, pp. 196\u2013211. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Integrated Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16265-7_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T21:46:35Z","timestamp":1578519995000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16265-7_13"}},"subtitle":["Computing Expected Values of Probabilistic Hybrid Systems with SMT"],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642162640","9783642162657"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16265-7_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}