{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:15:15Z","timestamp":1725578115252},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642192364"},{"type":"electronic","value":"9783642192371"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-19237-1_10","type":"book-chapter","created":{"date-parts":[[2011,2,10]],"date-time":"2011-02-10T02:15:37Z","timestamp":1297304137000},"page":"71-86","source":"Crossref","is-referenced-by-count":2,"title":["Reasoning about Finite-State Switched Systems"],"prefix":"10.1007","author":[{"given":"Dana","family":"Fisman","sequence":"first","affiliation":[]},{"given":"Orna","family":"Kupferman","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/978-3-540-45187-7_28","volume-title":"CONCUR 2003 - Concurrency Theory","author":"N. Amla","year":"2003","unstructured":"Amla, N., Emerson, E.A., Namjoshi, K.S., Trefler, R.J.: Abstract Patterns of Compositional Reasoning. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol.\u00a02761, pp. 431\u2013445. Springer, Heidelberg (2003)"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Antsaklis, P.: Proceedings of the IEEE, special issue on hybrid systems: theory and applications 88(7) (2000)","DOI":"10.1109\/JPROC.2000.871299"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/j.bulm.2003.08.010","volume":"66","author":"H. Jong de","year":"2004","unstructured":"de Jong, H., Gouze, J.-L., Hernandez, C., Page, M., Sari, T., Geiselmann, J.: Qualitative simulation of genetic regulatory networks using piecewise-linear models. Bulletin of Mathematical Biology\u00a066, 301\u2013340 (2004)","journal-title":"Bulletin of Mathematical Biology"},{"key":"10_CR4","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/3-540-15648-8_7","volume-title":"Proc. Workshop on Logic of Programs","author":"E. Emerson","year":"1985","unstructured":"Emerson, E.: Automata, tableaux, and temporal logics. In: Proc. Workshop on Logic of Programs. LNCS, vol.\u00a0193, pp. 79\u201387. Springer, Heidelberg (1985)"},{"key":"10_CR5","unstructured":"Emerson, E., Lei, C.-L.: Efficient model checking in fragments of the propositional \u03bc-calculus. In: Proc. 1st LICS, pp. 267\u2013278 (1986)"},{"key":"10_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/b100747","volume-title":"Fundamentals of power electronics","author":"R. Erickson","year":"2001","unstructured":"Erickson, R., Maksimovic, D.: Fundamentals of power electronics. Kluwer, Dordrecht (2001)"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/3-540-45351-2_25","volume-title":"Hybrid Systems: Computation and Control","author":"J. Hespanha","year":"2001","unstructured":"Hespanha, J., Bohacek, S., Obraczka, K., Lee, J.: Hybrid modeling of TCP congestion control. In: Di Benedetto, M.D., Sangiovanni-Vincentelli, A.L. (eds.) HSCC 2001. LNCS, vol.\u00a02034, pp. 291\u2013304. Springer, Heidelberg (2001)"},{"key":"10_CR8","unstructured":"Johansson, K., Lygeros, J., Sastry, S.: Modeling of hybrid systems. Encyclopedia of life support systems (2004)"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Kozen, D.: Lower bounds for natural proof systems. In: 18th FOCS, pp. 254\u2013266 (1977)","DOI":"10.1109\/SFCS.1977.16"},{"issue":"4","key":"10_CR10","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/BF01691063","volume":"3","author":"L.H. Landweber","year":"1969","unstructured":"Landweber, L.H.: Decision Problems for omega-Automata. Mathematical Systems Theory\u00a03(4), 376\u2013384 (1969)","journal-title":"Mathematical Systems Theory"},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/PL00009858","volume":"13","author":"G. Lafferriere","year":"2000","unstructured":"Lafferriere, G., Pappas, G., Sastry, S.: O-minimal hybrid systems. Math. Control Signal Systems\u00a013, 1\u201321 (2000)","journal-title":"Math. Control Signal Systems"},{"key":"10_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0017-8","volume-title":"Switching in Systems and Control","author":"D. Liberzon","year":"2003","unstructured":"Liberzon, D.: Switching in Systems and Control. Birkhauser, Basel (2003)"},{"issue":"12","key":"10_CR13","doi-asserted-by":"publisher","first-page":"2059","DOI":"10.1016\/j.automatica.2006.06.020","volume":"42","author":"M. Margaliot","year":"2006","unstructured":"Margaliot, M.: Stability analysis of switched systems using variational principles: an introduction. Automatica\u00a042(12), 2059\u20132077 (2006)","journal-title":"Automatica"},{"issue":"6","key":"10_CR14","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1109\/MWC.2003.1265848","volume":"10","author":"A.F. Molisch","year":"2003","unstructured":"Molisch, A.F., Foerster, J.R., Pendergrass, M.: Channel models for ultrawideband personal area networks. IEEE Wireless Communications\u00a010(6), 14\u201321 (2003)","journal-title":"IEEE Wireless Communications"},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1006\/inco.1994.1098","volume":"115","author":"A.J. Mayer","year":"1994","unstructured":"Mayer, A.J., Stockmeyer, L.J.: The complexity of word problems - this time with interleaving. Information and Computation\u00a0115, 293\u2013311 (1994)","journal-title":"Information and Computation"},{"key":"10_CR16","series-title":"NATO Advanced Summer Institutes","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-642-82453-1_5","volume-title":"Logics and Models of Concurrent Systems","author":"A. Pnueli","year":"1985","unstructured":"Pnueli, A.: In transition from global to modular temporal reasoning about programs. In: Logics and Models of Concurrent Systems. NATO Advanced Summer Institutes, vol.\u00a0F-13, pp. 123\u2013144. Springer, Heidelberg (1985)"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: Proc. 16th POPL, pp. 179\u2013190 (1989)","DOI":"10.1145\/75277.75293"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Pnueli, A., Rosner, R.: Distributed Reactive Systems are Hard to Synthesize. In: 31st FOCS, pp. 746\u2013757 (1990)","DOI":"10.1109\/FSCS.1990.89597"},{"key":"10_CR19","first-page":"1","volume":"141","author":"M. Rabin","year":"1969","unstructured":"Rabin, M.: Decidability of second order theories and automata on infinite trees. Trans. of the AMS\u00a0141, 1\u201335 (1969)","journal-title":"Trans. of the AMS"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Safra, S.: On the complexity of \u03c9-automata. In: Proc. 29th FOCS, pp. 319\u2013327 (1988)","DOI":"10.1109\/SFCS.1988.21948"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Safra, S.: Exponential determinization for \u03c9-automata with strong-fairness acceptance condition. In: Proc. 24th STOC (1992)","DOI":"10.1145\/129712.129739"},{"key":"10_CR22","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1016\/j.automatica.2004.09.017","volume":"41","author":"R. Shorten","year":"2005","unstructured":"Shorten, R., Leith, D., Foy, J., Kilduff, R.: Analysis and design of AIMD congestion control algorithms in communication networks. Automatica\u00a041, 725\u2013730 (2005)","journal-title":"Automatica"},{"issue":"1","key":"10_CR23","first-page":"1","volume":"115","author":"M. Vardi","year":"1994","unstructured":"Vardi, M., Wolper, P.: Reasoning about infinite computations. I& C\u00a0115(1), 1\u201337 (1994)","journal-title":"I& C"},{"key":"10_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1007\/978-3-540-71493-4_46","volume-title":"Hybrid Systems: Computation and Control","author":"G. Weiss","year":"2007","unstructured":"Weiss, G., Alur, R.: Automata Based Interfaces for Control and Scheduling. In: Bemporad, A., Bicchi, A., Buttazzo, G. (eds.) HSCC 2007. LNCS, vol.\u00a04416, pp. 601\u2013613. Springer, Heidelberg (2007)"},{"key":"10_CR25","first-page":"109","volume-title":"Mathematical Puzzles: A Connoisseur\u2019s Collection","author":"P. Winkler","year":"2004","unstructured":"Winkler, P.: Mathematical Puzzles: A Connoisseur\u2019s Collection, pp. 109\u2013111. A K Peters, Wellesley (2004)"}],"container-title":["Lecture Notes in Computer Science","Hardware and Software: Verification and Testing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19237-1_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T08:49:09Z","timestamp":1559983749000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19237-1_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642192364","9783642192371"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19237-1_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}