{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:46:52Z","timestamp":1725562012610},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540212591"},{"type":"electronic","value":"9783540247432"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24743-2_19","type":"book-chapter","created":{"date-parts":[[2010,8,2]],"date-time":"2010-08-02T15:02:22Z","timestamp":1280761342000},"page":"280-295","source":"Crossref","is-referenced-by-count":16,"title":["Non-deterministic Temporal Logics for General Flow Systems"],"prefix":"10.1007","author":[{"given":"Jennifer M.","family":"Davoren","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vangham","family":"Coulthard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Markey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Moor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1109\/32.489079","volume":"22","author":"R. Alur","year":"1996","unstructured":"Alur, R., Henzinger, T.A., Ho, P.-H.: Automatic symbolic verification of embedded systems. IEEE Transactions on Software Engineering\u00a022, 181\u2013201 (1996)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Alur, R., Henzinger, T.A., Lafferriere, G., Pappas, G.: Discrete abstractions of hybrid systems. Proceedings of the IEEE\u00a088 (July 2000)","DOI":"10.1109\/5.871304"},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1137\/S036301290036968X","volume":"40","author":"J.-P. Aubin","year":"2001","unstructured":"Aubin, J.-P.: Viability kernels and capture basins of sets under differential inclusions. Siam Journal of Control\u00a040, 853\u2013881 (2001)","journal-title":"Siam Journal of Control"},{"key":"19_CR4","unstructured":"Aubin, J.-P.: Viability kernels and capture basins: Lecture notes. Technical report, Universidad Politecnica de Cartagena, Spain (April-May 2002)"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/3-540-45873-5_8","volume-title":"Hybrid Systems: Computation and Control","author":"J.-P. Aubin","year":"2002","unstructured":"Aubin, J.-P., Dordan, O.: Dynamical qualitative analysis of evolutionary systems. In: Tomlin, C.J., Greenstreet, M.R. (eds.) HSCC 2002. LNCS, vol.\u00a02289, pp. 62\u201375. Springer, Heidelberg (2002)"},{"key":"19_CR6","volume-title":"Set-Valued Analysis","author":"J.-P. Aubin","year":"1990","unstructured":"Aubin, J.-P., Frankowska, H.: Set-Valued Analysis. Birkhauser, Boston (1990)"},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1109\/9.981719","volume":"47","author":"J.-P. Aubin","year":"2002","unstructured":"Aubin, J.-P., Lygeros, J., Quincampoix, M., Sastry, S., Seube, N.: Impulse differential inclusions:A viability approach to hybrid systems. IEEE Transactions on Automatic Control\u00a047, 2\u201320 (2002)","journal-title":"IEEE Transactions on Automatic Control"},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1305\/ndjfl\/1093870149","volume":"23","author":"J.P. Burgess","year":"1982","unstructured":"Burgess, J.P.: Axioms for tense logic I: \u201cSince\u201d and \u201cUntil\u201d. Notre Dame Journal of Formal Logic\u00a023, 367\u2013374 (1982)","journal-title":"Notre Dame Journal of Formal Logic"},{"key":"19_CR9","unstructured":"Coulthard, V.: Temporal Logics of Dynamical Systems in Discrete and Dense Time. PhD thesis, RSISE, The Australian National University (2004) (in preparation)"},{"key":"19_CR10","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1145\/4904.4999","volume":"33","author":"E.A. Emerson","year":"1986","unstructured":"Emerson, E.A., Halpern, J.Y.: \u201cSometimes\u201d and \u201cNot Never\u201d revisited: on branching versus linear time. Journal of the Association of Computing Machinery\u00a033, 151\u2013178 (1986)","journal-title":"Journal of the Association of Computing Machinery"},{"key":"19_CR11","volume-title":"Proc. 29th IEEE Foundations of Computer Science (FOCS 1988)","author":"E.A. Emerson","year":"1988","unstructured":"Emerson, E.A., Jutla, C.: Complexity of tree automata and modal logics of programs. In: Proc. 29th IEEE Foundations of Computer Science (FOCS 1988), IEEE, Los Alamitos (1988)"},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/S0019-9958(84)80047-9","volume":"61","author":"E.A. Emerson","year":"1984","unstructured":"Emerson, E.A., Sistla, A.: Deciding Full Branching Time Logic. Information and Control\u00a061, 175\u2013201 (1984)","journal-title":"Information and Control"},{"key":"19_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0013976","volume-title":"Temporal Logic: Mathematical Foundations and Computational Aspects","author":"D.M. Gabbay","year":"1994","unstructured":"Gabbay, D.M., Hodkinson, I., Reynolds, M.: Temporal Logic: Mathematical Foundations and Computational Aspects, vol.\u00a01. Clarendon Press, Oxford (1994)"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Henzinger, T.A.: The theory of hybrid automata. In: Proc. of 11th Annual IEEE Symposium on Logic in Computer Science, pp. 278\u2013292 (1996)","DOI":"10.1109\/LICS.1996.561342"},{"key":"19_CR15","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1109\/TAC.2002.806650","volume":"48","author":"J. Lygeros","year":"2003","unstructured":"Lygeros, J., Henrik, K.H., Simi\u0107, S.N., Sastry, S.S.: Dynamical properties of hybrid automata. IEEE Transactions on Automatic Control\u00a048, 2\u201317 (2003)","journal-title":"IEEE Transactions on Automatic Control"},{"key":"19_CR16","doi-asserted-by":"publisher","first-page":"1011","DOI":"10.2307\/2695091","volume":"66","author":"M. Reynolds","year":"2001","unstructured":"Reynolds, M.: An Axiomatization of Full Computation Tree Logic. J. Symbolic Logic\u00a066, 1011\u20131057 (2001)","journal-title":"J. Symbolic Logic"},{"key":"19_CR17","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1093\/oso\/9780198537618.003.0005","volume-title":"Handbook of Logic in Computer Science","author":"C. Stirling","year":"1992","unstructured":"Stirling, C.: Modal and temporal logics. In: Handbook of Logic in Computer Science, vol.\u00a02, pp. 477\u2013563. Oxford University Press, Oxford (1992)"},{"key":"19_CR18","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1109\/9.73561","volume":"36","author":"J.C. Willems","year":"1991","unstructured":"Willems, J.C.: Paradigms and puzzles in the theory of dynamical systems. IEEE Transactions on Automatic Control\u00a036, 259\u2013294 (1991)","journal-title":"IEEE Transactions on Automatic Control"}],"container-title":["Lecture Notes in Computer Science","Hybrid Systems: Computation and Control"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24743-2_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,28]],"date-time":"2024-03-28T23:23:06Z","timestamp":1711668186000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24743-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212591","9783540247432"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24743-2_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}