{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T09:36:19Z","timestamp":1648546579233},"reference-count":23,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3850,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,1]]},"DOI":"10.1016\/s0304-3975(02)00036-1","type":"journal-article","created":{"date-parts":[[2002,10,28]],"date-time":"2002-10-28T17:15:47Z","timestamp":1035825347000},"page":"565-597","source":"Crossref","is-referenced-by-count":0,"title":["Hybrid diagrams"],"prefix":"10.1016","volume":"290","author":[{"given":"Luca","family":"de Alfaro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arjun","family":"Kapur","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0304-3975(02)00036-1_BIB1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(94)00202-T","article-title":"The algorithmic analysis of hybrid systems","volume":"138","author":"Alur","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(02)00036-1_BIB2","series-title":"Workshop on Hybrid Systems","first-page":"209","article-title":"Hybrid automata","volume":"Vol. 736","author":"Alur","year":"1993"},{"key":"10.1016\/S0304-3975(02)00036-1_BIB3","unstructured":"A. Bouajjani, Y. Lakhnech, Logics vs. automata: the hybrid case, in: Hybrid Systems Workshop DIMACS \u201995, Lecture Notes in Computer Science, Vol. 1066, Springer, Berlin, 1995."},{"key":"10.1016\/S0304-3975(02)00036-1_BIB4","series-title":"Proc. 7th Conf. on Computer Aided Verification, CAV \u201995","first-page":"196","article-title":"From duration calculus to hybrid automata","volume":"Vol. 939","author":"Bouajjani","year":"1995"},{"key":"10.1016\/S0304-3975(02)00036-1_BIB5","series-title":"Proc. 7th Conf. on Computer Aided Verification, CAV \u201995","first-page":"437","article-title":"Verifying \u03c9-regular properties for a subclass of linear hybrid systems","volume":"Vol. 939","author":"Bouajjani","year":"1995"},{"key":"10.1016\/S0304-3975(02)00036-1_BIB6","doi-asserted-by":"crossref","unstructured":"Z. Chaochen, A.P. Ravn, M.R. Hansen, An extended duration calculus for hybrid real-time systems, in: Hybrid Systems, Lecture Notes in Computer Science, Vol. 736, Springer, Berlin, 1993, pp. 36\u201359.","DOI":"10.1007\/3-540-57318-6_23"},{"key":"10.1016\/S0304-3975(02)00036-1_BIB7","doi-asserted-by":"crossref","unstructured":"L. de Alfaro, A. Kapur, Z. Manna, Hybrid diagrams: a deductive-algorithmic approach to hybrid system verification, in: Proc. 14th Annu. Symp. on Theoretical Aspects of Computer Science, STACS \u201997, Lecture Notes in Computer Science, Vol. 1200, Springer, Berlin, 1997, pp. 153\u2013164.","DOI":"10.1007\/BFb0023456"},{"key":"10.1016\/S0304-3975(02)00036-1_BIB8","doi-asserted-by":"crossref","unstructured":"L. de Alfaro, Z. Manna, Temporal verification by diagram transformations, in: Proc. 8th Conf. on Computer Aided Verification, CAV \u201996, Lecture Notes in Computer Science, Vol. 1102, Springer, Berlin, 1996, pp. 288\u2013299.","DOI":"10.1007\/3-540-61474-5_77"},{"key":"10.1016\/S0304-3975(02)00036-1_BIB9","doi-asserted-by":"crossref","unstructured":"L. de Alfaro, Z. Manna, H.B. Sipma, T.E. Uribe, Visual verification of reactive systems, in: Proc. on Tools and Algorithms for the Construction and Analysis of Systems, TACAS, Lecture Notes in Computer Science, Vol. 1217, Springer, Berlin, 1997, pp. 334\u2013350.","DOI":"10.1007\/BFb0035398"},{"key":"10.1016\/S0304-3975(02)00036-1_BIB10","doi-asserted-by":"crossref","unstructured":"T.A. Henzinger, The theory of hbybrid automata, in: Proc. 11th IEEE Symp. on Logic in Computer Science, LICS \u201992, IEEE Computer Society Press, Silver Spring, MD, 1996, pp. 278\u2013292.","DOI":"10.1109\/LICS.1996.561342"},{"key":"10.1016\/S0304-3975(02)00036-1_BIB11","doi-asserted-by":"crossref","unstructured":"A. Kapur, T.A. Henzinger, Z. Manna, A. Pnueli, Proving safety properties of hybrid systems, in: Proc. Symp. on Formal Techniques in Real-Time and Fault-Tolerant Systems, FTRTFT \u201994, Lecture Notes in Computer Science, Vol. 863, Springer, Berlin, 1994, pp. 431\u2013454.","DOI":"10.1007\/3-540-58468-4_177"},{"key":"10.1016\/S0304-3975(02)00036-1_BIB12","doi-asserted-by":"crossref","unstructured":"Y. Kesten, Z. Manna, A. Pnueli, Verifying clocked transition systems, in: Hybrid Systems III, Lecture Notes in Computer Science, Vol. 1066, Springer, Berlin, 1996, pp. 13\u201340.","DOI":"10.1007\/BFb0020933"},{"key":"10.1016\/S0304-3975(02)00036-1_BIB13","doi-asserted-by":"crossref","unstructured":"L. Lamport, Hybrid systems in TLA+, in: Hybrid Systems, Lecture Notes in Computer Science, Vol. 736, Springer, Berlin, 1993, pp. 77\u2013102.","DOI":"10.1007\/3-540-57318-6_25"},{"key":"10.1016\/S0304-3975(02)00036-1_BIB14","doi-asserted-by":"crossref","unstructured":"D. Lehmann, A. Pnueli, J. Stavi, Impartiality, justice and fairness: the ethics of concurrent termination, in: Proc. 8th Internat. Colloq. on Automata, Languages, and Programming, ICALP \u201981, Lecture Notes in Computer Science, Springer, Berlin, 1981, pp. 264\u2013277.","DOI":"10.1007\/3-540-10843-2_22"},{"key":"10.1016\/S0304-3975(02)00036-1_BIB15","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF02252683","article-title":"Using mappings to prove timing properties","volume":"6","author":"Lynch","year":"1992","journal-title":"Distrib. Comput."},{"key":"10.1016\/S0304-3975(02)00036-1_BIB16","unstructured":"O. Maler, Z. Manna, A. Pnueli, From timed to hybrid systems, in: Proc. REX Workshop Real-Time: Theory in Practice, Lecture Notes in Computer Science, Vol. 600, Springer, Berlin, 1992, pp. 447\u2013484."},{"issue":"1","key":"10.1016\/S0304-3975(02)00036-1_BIB17","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0304-3975(91)90041-Y","article-title":"Completing the temporal picture","volume":"83","author":"Manna","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(02)00036-1_BIB18","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1007\/BF01191722","article-title":"Models for reactivity","volume":"30","author":"Manna","year":"1993","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(02)00036-1_BIB19","doi-asserted-by":"crossref","unstructured":"X. Nicollin, A. Olivero, J. Sifakis, S. Yovine, An approach to the description and analysis of hybrid systems, in: Hybrid Systems, Lecture Notes in Computer Science, Vol. 736, Springer, Berlin, 1993, pp. 149\u2013178.","DOI":"10.1007\/3-540-57318-6_28"},{"key":"10.1016\/S0304-3975(02)00036-1_BIB20","doi-asserted-by":"crossref","unstructured":"S. Safra, On the complexity of \u03c9-automata, in: Proc. 29th IEEE Symp. on Foundations of Computer Science, FOCS \u201988, IEEE Computer Society Press, Silver Spring, MD, 1988, pp. 319\u2013327.","DOI":"10.1109\/SFCS.1988.21948"},{"key":"10.1016\/S0304-3975(02)00036-1_BIB21","doi-asserted-by":"crossref","unstructured":"S. Safra, Exponential determinization for \u03c9-automata with strong-fairness acceptance condition, in: Proc. ACM Symp. on Theory of Computing, STOC \u201992, ACM Press, New York, 1992, pp. 275\u2013282.","DOI":"10.1145\/129712.129739"},{"key":"10.1016\/S0304-3975(02)00036-1_BIB22","doi-asserted-by":"crossref","unstructured":"H.B. Sipma, T.E. Uribe, Z. Manna, Deductive model checking, in: Proc. 8th Conf. on Computer Aided Verification, CAV \u201996, Lecture Notes in Computer Science, Vol. 1102, Springer, Berlin, 1996, pp. 208\u2013219.","DOI":"10.1007\/3-540-61474-5_70"},{"key":"10.1016\/S0304-3975(02)00036-1_BIB23","unstructured":"M.Y. Vardi, P. Wolper, An automata-theoretic approach to automatic program verification, in: Proc. 1st IEEE Symp. on Logic in Computer Science, LICS \u201986, IEEE Computer Society Press, Silver Spring, MD, 1986, pp. 332\u2013344."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502000361?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502000361?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T07:06:21Z","timestamp":1578467181000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502000361"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,1]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,1]]}},"alternative-id":["S0304397502000361"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00036-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,1]]}}}