[{"quality_controlled":"1","publication":"Neuroscience Letters","month":"09","status":"public","article_type":"original","abstract":[{"text":"Chemical irritation of the urinary bladder with formalin in the rat induced c-fos protein-like immunoreactivity in more than 80% of substance P receptor-like immunoreactive (SPR-LI) neurons of the dorsal commissural nucleus, sacral parasympathetic nucleus and lamina I in the 6th lumbar and 1st sacral cord segments. These neurons with SPR-LI may receive noxious information from the urinary bladder through the primary afferent fibers with substance P.","lang":"eng"}],"publisher":"Elsevier","publist_id":"4338","_id":"2560","page":"139 - 142","date_created":"2018-12-11T11:58:23Z","volume":198,"title":"Expression of c-fos protein in substance P receptor-like immunoreactive neurons in response to noxious stimuli on the urinary bladder: an observation in the lumbosacral cord segments of the rat","citation":{"ama":"Lü Y, Jin S, Xu T, et al. Expression of c-fos protein in substance P receptor-like immunoreactive neurons in response to noxious stimuli on the urinary bladder: an observation in the lumbosacral cord segments of the rat. <i>Neuroscience Letters</i>. 1995;198(2):139-142. doi:<a href=\"https://doi.org/10.1016/0304-3940(95)11991-5\">10.1016/0304-3940(95)11991-5</a>","chicago":"Lü, Yan, Shan Jin, Tian Xu, Bing Qin, Ji Li, Yu Ding, Ryuichi Shigemoto, and Noboru Mizuno. “Expression of C-Fos Protein in Substance P Receptor-like Immunoreactive Neurons in Response to Noxious Stimuli on the Urinary Bladder: An Observation in the Lumbosacral Cord Segments of the Rat.” <i>Neuroscience Letters</i>. Elsevier, 1995. <a href=\"https://doi.org/10.1016/0304-3940(95)11991-5\">https://doi.org/10.1016/0304-3940(95)11991-5</a>.","ieee":"Y. Lü <i>et al.</i>, “Expression of c-fos protein in substance P receptor-like immunoreactive neurons in response to noxious stimuli on the urinary bladder: an observation in the lumbosacral cord segments of the rat,” <i>Neuroscience Letters</i>, vol. 198, no. 2. Elsevier, pp. 139–142, 1995.","apa":"Lü, Y., Jin, S., Xu, T., Qin, B., Li, J., Ding, Y., … Mizuno, N. (1995). Expression of c-fos protein in substance P receptor-like immunoreactive neurons in response to noxious stimuli on the urinary bladder: an observation in the lumbosacral cord segments of the rat. <i>Neuroscience Letters</i>. Elsevier. <a href=\"https://doi.org/10.1016/0304-3940(95)11991-5\">https://doi.org/10.1016/0304-3940(95)11991-5</a>","mla":"Lü, Yan, et al. “Expression of C-Fos Protein in Substance P Receptor-like Immunoreactive Neurons in Response to Noxious Stimuli on the Urinary Bladder: An Observation in the Lumbosacral Cord Segments of the Rat.” <i>Neuroscience Letters</i>, vol. 198, no. 2, Elsevier, 1995, pp. 139–42, doi:<a href=\"https://doi.org/10.1016/0304-3940(95)11991-5\">10.1016/0304-3940(95)11991-5</a>.","ista":"Lü Y, Jin S, Xu T, Qin B, Li J, Ding Y, Shigemoto R, Mizuno N. 1995. Expression of c-fos protein in substance P receptor-like immunoreactive neurons in response to noxious stimuli on the urinary bladder: an observation in the lumbosacral cord segments of the rat. Neuroscience Letters. 198(2), 139–142.","short":"Y. Lü, S. Jin, T. Xu, B. Qin, J. Li, Y. Ding, R. Shigemoto, N. Mizuno, Neuroscience Letters 198 (1995) 139–142."},"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/0304394095119915?via%3Dihub"}],"article_processing_charge":"No","date_published":"1995-09-29T00:00:00Z","language":[{"iso":"eng"}],"year":"1995","publication_identifier":{"issn":["0304-3940"]},"type":"journal_article","date_updated":"2022-06-28T12:54:14Z","day":"29","intvolume":"       198","issue":"2","publication_status":"published","extern":"1","pmid":1,"external_id":{"pmid":["8592640"]},"oa_version":"None","doi":"10.1016/0304-3940(95)11991-5","author":[{"last_name":"Lü","full_name":"Lü, Yan","first_name":"Yan"},{"first_name":"Shan","full_name":"Jin, Shan","last_name":"Jin"},{"last_name":"Xu","full_name":"Xu, Tian","first_name":"Tian"},{"first_name":"Bing","full_name":"Qin, Bing","last_name":"Qin"},{"first_name":"Ji","last_name":"Li","full_name":"Li, Ji"},{"last_name":"Ding","full_name":"Ding, Yu","first_name":"Yu"},{"id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","first_name":"Ryuichi","full_name":"Shigemoto, Ryuichi","last_name":"Shigemoto","orcid":"0000-0001-8761-9444"},{"first_name":"Noboru","last_name":"Mizuno","full_name":"Mizuno, Noboru"}]},{"_id":"2561","publist_id":"4337","page":"85 - 88","date_created":"2018-12-11T11:58:24Z","publisher":"Elsevier","acknowledgement":"We are grateful to Mr. Akira Uesugi for photographic help.","abstract":[{"lang":"eng","text":"An antibody which recognizes specifically a metabotropic glutamate receptor, mGluR7, was produced by using a trpE fusion protein containing a C-terminal sequence of rat mGluR7. Neuropil in laminae I and II of the dorsal horn of the rat, as well as many neuronal cell bodies in the dorsal root ganglion, showed mGluR7-like immunoreactivity; the immunoreactivity in neuropil was seen in axon terminals, which were filled with round synaptic vesicles and constituted axodendritic and axosomatic asymmetric synapses. The mGluR7-like immunoreactivity in laminae I and II in the dorsal horn was reduced after dorsal rhizotomy. The results indicate that some axon terminals of the primary afferent fibers to laminae I and II of the dorsal horn are provided with mGluR7."}],"article_type":"original","month":"12","publication":"Neuroscience Letters","status":"public","quality_controlled":"1","day":"01","date_updated":"2022-06-28T12:44:57Z","publication_identifier":{"issn":["0304-3940"]},"type":"journal_article","year":"1995","language":[{"iso":"eng"}],"date_published":"1995-12-01T00:00:00Z","main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/0304394095122079?via%3Dihub"}],"article_processing_charge":"No","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","title":"Presynaptic localization of a metabotropic glutamate receptor, mGluR7, in the primary afferent neurons: An immunohistochemical study in the rat","citation":{"ista":"Ohishi H, Nomura S, Ding Y, Shigemoto R, Wada E, Kinoshita A, Li J, Neki A, Nakanishi S, Mizuno N. 1995. Presynaptic localization of a metabotropic glutamate receptor, mGluR7, in the primary afferent neurons: An immunohistochemical study in the rat. Neuroscience Letters. 202(1–2), 85–88.","mla":"Ohishi, Hitoshi, et al. “Presynaptic Localization of a Metabotropic Glutamate Receptor, MGluR7, in the Primary Afferent Neurons: An Immunohistochemical Study in the Rat.” <i>Neuroscience Letters</i>, vol. 202, no. 1–2, Elsevier, 1995, pp. 85–88, doi:<a href=\"https://doi.org/10.1016/0304-3940(95)12207-9\">10.1016/0304-3940(95)12207-9</a>.","short":"H. Ohishi, S. Nomura, Y. Ding, R. Shigemoto, E. Wada, A. Kinoshita, J. Li, A. Neki, S. Nakanishi, N. Mizuno, Neuroscience Letters 202 (1995) 85–88.","apa":"Ohishi, H., Nomura, S., Ding, Y., Shigemoto, R., Wada, E., Kinoshita, A., … Mizuno, N. (1995). Presynaptic localization of a metabotropic glutamate receptor, mGluR7, in the primary afferent neurons: An immunohistochemical study in the rat. <i>Neuroscience Letters</i>. Elsevier. <a href=\"https://doi.org/10.1016/0304-3940(95)12207-9\">https://doi.org/10.1016/0304-3940(95)12207-9</a>","ieee":"H. Ohishi <i>et al.</i>, “Presynaptic localization of a metabotropic glutamate receptor, mGluR7, in the primary afferent neurons: An immunohistochemical study in the rat,” <i>Neuroscience Letters</i>, vol. 202, no. 1–2. Elsevier, pp. 85–88, 1995.","ama":"Ohishi H, Nomura S, Ding Y, et al. Presynaptic localization of a metabotropic glutamate receptor, mGluR7, in the primary afferent neurons: An immunohistochemical study in the rat. <i>Neuroscience Letters</i>. 1995;202(1-2):85-88. doi:<a href=\"https://doi.org/10.1016/0304-3940(95)12207-9\">10.1016/0304-3940(95)12207-9</a>","chicago":"Ohishi, Hitoshi, Sakashi Nomura, Yu Ding, Ryuichi Shigemoto, Eiki Wada, Ayae Kinoshita, Jin Li, Akio Neki, Shigetada Nakanishi, and Noboru Mizuno. “Presynaptic Localization of a Metabotropic Glutamate Receptor, MGluR7, in the Primary Afferent Neurons: An Immunohistochemical Study in the Rat.” <i>Neuroscience Letters</i>. Elsevier, 1995. <a href=\"https://doi.org/10.1016/0304-3940(95)12207-9\">https://doi.org/10.1016/0304-3940(95)12207-9</a>."},"volume":202,"extern":"1","issue":"1-2","publication_status":"published","intvolume":"       202","author":[{"first_name":"Hitoshi","full_name":"Ohishi, Hitoshi","last_name":"Ohishi"},{"first_name":"Sakashi","full_name":"Nomura, Sakashi","last_name":"Nomura"},{"first_name":"Yu","full_name":"Ding, Yu","last_name":"Ding"},{"first_name":"Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8761-9444","last_name":"Shigemoto","full_name":"Shigemoto, Ryuichi"},{"full_name":"Wada, Eiki","last_name":"Wada","first_name":"Eiki"},{"full_name":"Kinoshita, Ayae","last_name":"Kinoshita","first_name":"Ayae"},{"full_name":"Li, Jin","last_name":"Li","first_name":"Jin"},{"first_name":"Akio","last_name":"Neki","full_name":"Neki, Akio"},{"last_name":"Nakanishi","full_name":"Nakanishi, Shigetada","first_name":"Shigetada"},{"last_name":"Mizuno","full_name":"Mizuno, Noboru","first_name":"Noboru"}],"doi":"10.1016/0304-3940(95)12207-9","oa_version":"None","external_id":{"pmid":["8787837"]},"pmid":1},{"external_id":{"pmid":["8602281"]},"pmid":1,"author":[{"first_name":"Yu","last_name":"Ding","full_name":"Ding, Yu"},{"first_name":"Masahiko","full_name":"Takada, Masahiko","last_name":"Takada"},{"full_name":"Shigemoto, Ryuichi","orcid":"0000-0001-8761-9444","last_name":"Shigemoto","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","first_name":"Ryuichi"},{"last_name":"Mizuno","full_name":"Mizuno, Noboru","first_name":"Noboru"}],"doi":"10.1016/0168-0102(95)00961-R","oa_version":"None","publication_status":"published","issue":"4","intvolume":"        23","extern":"1","article_processing_charge":"No","main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/016801029500961R?via%3Dihub"}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","citation":{"ama":"Ding Y, Takada M, Shigemoto R, Mizuno N. Trigeminoparabrachial projection neurons showing substance P receptor-like immunoreactivity in the rat. <i>Neuroscience Research</i>. 1995;23(4):415-418. doi:<a href=\"https://doi.org/10.1016/0168-0102(95)00961-R\">10.1016/0168-0102(95)00961-R</a>","ieee":"Y. Ding, M. Takada, R. Shigemoto, and N. Mizuno, “Trigeminoparabrachial projection neurons showing substance P receptor-like immunoreactivity in the rat,” <i>Neuroscience Research</i>, vol. 23, no. 4. Elsevier, pp. 415–418, 1995.","apa":"Ding, Y., Takada, M., Shigemoto, R., &#38; Mizuno, N. (1995). Trigeminoparabrachial projection neurons showing substance P receptor-like immunoreactivity in the rat. <i>Neuroscience Research</i>. Elsevier. <a href=\"https://doi.org/10.1016/0168-0102(95)00961-R\">https://doi.org/10.1016/0168-0102(95)00961-R</a>","chicago":"Ding, Yu, Masahiko Takada, Ryuichi Shigemoto, and Noboru Mizuno. “Trigeminoparabrachial Projection Neurons Showing Substance P Receptor-like Immunoreactivity in the Rat.” <i>Neuroscience Research</i>. Elsevier, 1995. <a href=\"https://doi.org/10.1016/0168-0102(95)00961-R\">https://doi.org/10.1016/0168-0102(95)00961-R</a>.","mla":"Ding, Yu, et al. “Trigeminoparabrachial Projection Neurons Showing Substance P Receptor-like Immunoreactivity in the Rat.” <i>Neuroscience Research</i>, vol. 23, no. 4, Elsevier, 1995, pp. 415–18, doi:<a href=\"https://doi.org/10.1016/0168-0102(95)00961-R\">10.1016/0168-0102(95)00961-R</a>.","ista":"Ding Y, Takada M, Shigemoto R, Mizuno N. 1995. Trigeminoparabrachial projection neurons showing substance P receptor-like immunoreactivity in the rat. Neuroscience Research. 23(4), 415–418.","short":"Y. Ding, M. Takada, R. Shigemoto, N. Mizuno, Neuroscience Research 23 (1995) 415–418."},"title":"Trigeminoparabrachial projection neurons showing substance P receptor-like immunoreactivity in the rat","volume":23,"date_updated":"2022-06-28T09:50:42Z","day":"01","type":"journal_article","publication_identifier":{"issn":["0168-0102"]},"year":"1995","language":[{"iso":"eng"}],"date_published":"1995-11-01T00:00:00Z","status":"public","month":"11","publication":"Neuroscience Research","quality_controlled":"1","page":"415 - 418","date_created":"2018-12-11T11:58:24Z","_id":"2563","publist_id":"4336","publisher":"Elsevier","abstract":[{"text":"By means of substance P receptor (SPR) immunofluorescence histochemistry combined with Fluoro-Gold fluorescent retrograde labeling, SPR-like immunoreactive neurons in the caudal subnucleus of the spinal trigeminal nucleus of the rat were observed to send their axons to the nucleus of Kolliker-Fuse and ventrolateral part of the lateral parabrachial nucleus bilaterally with a clear ipsilateral dominance. These neurons were distributed mainly in lamina I, and additionally in lamina III.","lang":"eng"}],"article_type":"original","acknowledgement":"The authors are grateful for photographic help of Ms. Miao-Li Zhang and Mr. Akira Uesugi. This work was supported in part by Grants-in-Aid for Special Research on Priority Areas 05267104, Scientific Research (B) 05454658, and Scientific Research (C) 06680735 from the Ministry of Education, Science and Culture of Japan. "},{"acknowledgement":"Work supported by the NSF grant PHY90-19433 A02, by the Alfred Sloan Foundation dissertation Fellowship and by the Erwin Schrödinger Institute for Mathematical Physics in Vienna.","abstract":[{"lang":"eng","text":"We study the generalizations of the well-known Lieb-Thirring inequality for the magnetic Schrödinger operator with a nonconstant magnetic field. We use stochastic methods to prove estimates on the moments of the negative eigenvalues."}],"extern":"1","publisher":"Birkhäuser","page":"127 - 132","date_created":"2018-12-11T11:59:12Z","publist_id":"4184","_id":"2712","quality_controlled":"1","intvolume":"        78","publication_status":"published","alternative_title":["Operator Theory: Advances and Applications"],"status":"public","month":"01","date_published":"1995-01-01T00:00:00Z","language":[{"iso":"eng"}],"oa_version":"None","year":"1995","type":"conference","doi":"10.1007/978-3-0348-9092-2_13","date_updated":"2022-06-28T09:31:20Z","day":"01","author":[{"id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","first_name":"László","full_name":"Erdös, László","last_name":"Erdös","orcid":"0000-0001-5366-9603"}],"volume":78,"citation":{"ieee":"L. Erdös, “Magnetic Lieb-Thirring inequalities and stochastic oscillatory integrals,” presented at the International Conference on Partial Differential Operators and Mathematical Physics, Holzhau, Germany, 1995, vol. 78, pp. 127–132.","chicago":"Erdös, László. “Magnetic Lieb-Thirring Inequalities and Stochastic Oscillatory Integrals,” 78:127–32. Birkhäuser, 1995. <a href=\"https://doi.org/10.1007/978-3-0348-9092-2_13\">https://doi.org/10.1007/978-3-0348-9092-2_13</a>.","ama":"Erdös L. Magnetic Lieb-Thirring inequalities and stochastic oscillatory integrals. In: Vol 78. Birkhäuser; 1995:127-132. doi:<a href=\"https://doi.org/10.1007/978-3-0348-9092-2_13\">10.1007/978-3-0348-9092-2_13</a>","apa":"Erdös, L. (1995). Magnetic Lieb-Thirring inequalities and stochastic oscillatory integrals (Vol. 78, pp. 127–132). Presented at the International Conference on Partial Differential Operators and Mathematical Physics, Holzhau, Germany: Birkhäuser. <a href=\"https://doi.org/10.1007/978-3-0348-9092-2_13\">https://doi.org/10.1007/978-3-0348-9092-2_13</a>","ista":"Erdös L. 1995. Magnetic Lieb-Thirring inequalities and stochastic oscillatory integrals. International Conference on Partial Differential Operators and Mathematical Physics, Operator Theory: Advances and Applications, vol. 78, 127–132.","mla":"Erdös, László. <i>Magnetic Lieb-Thirring Inequalities and Stochastic Oscillatory Integrals</i>. Vol. 78, Birkhäuser, 1995, pp. 127–32, doi:<a href=\"https://doi.org/10.1007/978-3-0348-9092-2_13\">10.1007/978-3-0348-9092-2_13</a>.","short":"L. Erdös, in:, Birkhäuser, 1995, pp. 127–132."},"title":"Magnetic Lieb-Thirring inequalities and stochastic oscillatory integrals","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","conference":{"location":"Holzhau, Germany","name":"International Conference on Partial Differential Operators and Mathematical Physics","end_date":"1995-07-09","start_date":"1995-07-03"},"main_file_link":[{"url":"https://link.springer.com/chapter/10.1007/978-3-0348-9092-2_13"}],"article_processing_charge":"No"},{"date_published":"1995-06-01T00:00:00Z","language":[{"iso":"eng"}],"type":"journal_article","publication_identifier":{"issn":["0010-3616"]},"year":"1995","day":"01","date_updated":"2022-06-28T09:19:36Z","volume":170,"title":"Magnetic Lieb-Thirring inequalities","citation":{"chicago":"Erdös, László. “Magnetic Lieb-Thirring Inequalities.” <i>Communications in Mathematical Physics</i>. Springer, 1995. <a href=\"https://doi.org/10.1007/BF02099152\">https://doi.org/10.1007/BF02099152</a>.","apa":"Erdös, L. (1995). Magnetic Lieb-Thirring inequalities. <i>Communications in Mathematical Physics</i>. Springer. <a href=\"https://doi.org/10.1007/BF02099152\">https://doi.org/10.1007/BF02099152</a>","ama":"Erdös L. Magnetic Lieb-Thirring inequalities. <i>Communications in Mathematical Physics</i>. 1995;170(3):629-668. doi:<a href=\"https://doi.org/10.1007/BF02099152\">10.1007/BF02099152</a>","ieee":"L. Erdös, “Magnetic Lieb-Thirring inequalities,” <i>Communications in Mathematical Physics</i>, vol. 170, no. 3. Springer, pp. 629–668, 1995.","short":"L. Erdös, Communications in Mathematical Physics 170 (1995) 629–668.","ista":"Erdös L. 1995. Magnetic Lieb-Thirring inequalities. Communications in Mathematical Physics. 170(3), 629–668.","mla":"Erdös, László. “Magnetic Lieb-Thirring Inequalities.” <i>Communications in Mathematical Physics</i>, vol. 170, no. 3, Springer, 1995, pp. 629–68, doi:<a href=\"https://doi.org/10.1007/BF02099152\">10.1007/BF02099152</a>."},"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","main_file_link":[{"url":"https://link.springer.com/article/10.1007/BF02099152"}],"article_processing_charge":"No","abstract":[{"lang":"eng","text":"We study the generalizations of the well-known Lieb-Thirring inequality for the magnetic Schrödinger operator with nonconstant magnetic field. Our main result is the naturally expected magnetic Lieb-Thirring estimate on the moments of the negative eigenvalues for a certain class of magnetic fields (including even some unbounded ones). We develop a localization technique in path space of the stochastic Feynman-Kac representation of the heat kernel which effectively estimates the oscillatory effect due to the magnetic phase factor."}],"article_type":"original","publisher":"Springer","_id":"2724","publist_id":"4168","date_created":"2018-12-11T11:59:16Z","page":"629 - 668","quality_controlled":"1","month":"06","publication":"Communications in Mathematical Physics","status":"public","oa_version":"None","doi":"10.1007/BF02099152","author":[{"first_name":"László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5366-9603","last_name":"Erdös","full_name":"Erdös, László"}],"extern":"1","intvolume":"       170","issue":"3","publication_status":"published"},{"publication_status":"published","issue":"3","intvolume":"      1231","extern":"1","external_id":{"pmid":["7578218"]},"pmid":1,"doi":"10.1016/0005-2728(95)00096-2","author":[{"id":"338D39FE-F248-11E8-B48F-1D18A9856A87","first_name":"Leonid A","full_name":"Sazanov, Leonid A","last_name":"Sazanov","orcid":"0000-0002-0977-7989"},{"first_name":"Baz","full_name":"Jackson, Baz","last_name":"Jackson"}],"oa_version":"Published Version","status":"public","oa":1,"month":"10","publication":"Biochimica et Biophysica Acta - Bioenergetics","quality_controlled":"1","date_created":"2018-12-11T11:54:50Z","page":"304 - 312","publist_id":"5142","_id":"1943","article_type":"original","acknowledgement":"L.A.S. is grateful to the Wellcome Trust for a Research Fellowship. Support from the Biotechnology and Biological Sciences Research Council is also acknowledged. We thank our colleagues. Tania Bizouarn, Mike Hutton and Nick Cotton, for advice and valuable discussion. ","abstract":[{"text":"Transhydrogenase from beef-heart mitochondria was solubilised with Triton X-100 and purified by column chromatography. The detergent-dispersed enzyme catalysed the reduction of acetylpyridine adenine dinucleotide (AcPdAD+) by NADH, but only in the presence of NADP+. Experiments showed that this reaction was cyclic; NADP(H), whilst remaining bound to the enzyme, was alternately reduced by NADH and oxidised by AcPdAD+. A period of incubation of the enzyme with NADPH at pH 6.0 led to inhibition of the simple transhydrogenation reaction between AcPdAD+ and NADPH. However, after such treatment, transhydrogenase acquired the ability to catalyse the (NADPH-dependent) reduction of AcPdAD+ by NADH. It is suggested that this is a similar cycle to the one described above. Evidently, the binding affinity for NADP+ increases as a consequence of the inhibition process resulting from prolonged incubation with NADPH. The pH dependences of simple and cyclic transhydrogenation reactions are described. Though more complex than those in Escherichia coli transhydrogenase, they are consistent with the view [Hutton, M., Day, J.M., Bizouarn, T. and Jackson, J.B. (1994) Eur. J. Biochem. 219, 1041–10511] that, also in the mitochondrial enzyme, binding the release of NADP+ and NADP are accompanied by binding and release of a proton. The enzyme was successfully reconstituted into liposomes by a cholate dilution procedure. The proteoliposomes catalysed cyclic NADPH-dependent reduction of AcPdAD+ by NADH only when they were tightly coupled. However, they catalysed cyclic NADP+-dependent reduction of AcPdAD+ by NADH only when they were uncoupled eg. by addition of carbonylcyanide-p-trifluoromethoxyphenyl hydrazone. These observations are evidence that the proton binding and release which accompany NADP+ binding and release, respectively, take place on the inside of the vesicle, and that they are components of the electrogenic processes of the enzyme.","lang":"eng"}],"publisher":"Elsevier","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","article_processing_charge":"No","main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/0005272895000962?via%3Dihub","open_access":"1"}],"volume":1231,"citation":{"ista":"Sazanov LA, Jackson B. 1995. Cyclic reactions catalysed by detergent-dispersed and reconstituted transhydrogenase from beef heart mitochondria; implications for the mechanism of proton translocation. Biochimica et Biophysica Acta - Bioenergetics. 1231(3), 304–312.","mla":"Sazanov, Leonid A., and Baz Jackson. “Cyclic Reactions Catalysed by Detergent-Dispersed and Reconstituted Transhydrogenase from Beef Heart Mitochondria; Implications for the Mechanism of Proton Translocation.” <i>Biochimica et Biophysica Acta - Bioenergetics</i>, vol. 1231, no. 3, Elsevier, 1995, pp. 304–12, doi:<a href=\"https://doi.org/10.1016/0005-2728(95)00096-2\">10.1016/0005-2728(95)00096-2</a>.","short":"L.A. Sazanov, B. Jackson, Biochimica et Biophysica Acta - Bioenergetics 1231 (1995) 304–312.","apa":"Sazanov, L. A., &#38; Jackson, B. (1995). Cyclic reactions catalysed by detergent-dispersed and reconstituted transhydrogenase from beef heart mitochondria; implications for the mechanism of proton translocation. <i>Biochimica et Biophysica Acta - Bioenergetics</i>. Elsevier. <a href=\"https://doi.org/10.1016/0005-2728(95)00096-2\">https://doi.org/10.1016/0005-2728(95)00096-2</a>","ieee":"L. A. Sazanov and B. Jackson, “Cyclic reactions catalysed by detergent-dispersed and reconstituted transhydrogenase from beef heart mitochondria; implications for the mechanism of proton translocation,” <i>Biochimica et Biophysica Acta - Bioenergetics</i>, vol. 1231, no. 3. Elsevier, pp. 304–312, 1995.","ama":"Sazanov LA, Jackson B. Cyclic reactions catalysed by detergent-dispersed and reconstituted transhydrogenase from beef heart mitochondria; implications for the mechanism of proton translocation. <i>Biochimica et Biophysica Acta - Bioenergetics</i>. 1995;1231(3):304-312. doi:<a href=\"https://doi.org/10.1016/0005-2728(95)00096-2\">10.1016/0005-2728(95)00096-2</a>","chicago":"Sazanov, Leonid A, and Baz Jackson. “Cyclic Reactions Catalysed by Detergent-Dispersed and Reconstituted Transhydrogenase from Beef Heart Mitochondria; Implications for the Mechanism of Proton Translocation.” <i>Biochimica et Biophysica Acta - Bioenergetics</i>. Elsevier, 1995. <a href=\"https://doi.org/10.1016/0005-2728(95)00096-2\">https://doi.org/10.1016/0005-2728(95)00096-2</a>."},"title":"Cyclic reactions catalysed by detergent-dispersed and reconstituted transhydrogenase from beef heart mitochondria; implications for the mechanism of proton translocation","year":"1995","publication_identifier":{"issn":["0005-2728"]},"type":"journal_article","day":"10","date_updated":"2022-06-29T15:04:47Z","language":[{"iso":"eng"}],"date_published":"1995-10-10T00:00:00Z"},{"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","main_file_link":[{"open_access":"1","url":"https://hdl.handle.net/1813/7193"}],"article_processing_charge":"No","title":"Automatic analysis of hybrid systems","citation":{"short":"P. Ho, Automatic Analysis of Hybrid Systems, Cornell University, 1995.","mla":"Ho, Pei. <i>Automatic Analysis of Hybrid Systems</i>. Cornell University, 1995, pp. 1–188.","ista":"Ho P. 1995. Automatic analysis of hybrid systems. Cornell University.","apa":"Ho, P. (1995). <i>Automatic analysis of hybrid systems</i>. Cornell University.","ama":"Ho P. Automatic analysis of hybrid systems. 1995:1-188.","ieee":"P. Ho, “Automatic analysis of hybrid systems,” Cornell University, 1995.","chicago":"Ho, Pei. “Automatic Analysis of Hybrid Systems.” Cornell University, 1995."},"type":"dissertation","year":"1995","day":"01","date_updated":"2022-06-28T07:30:34Z","author":[{"first_name":"Pei","last_name":"Ho","full_name":"Ho, Pei"}],"oa_version":"Published Version","date_published":"1995-08-01T00:00:00Z","language":[{"iso":"eng"}],"publication_status":"published","month":"08","status":"public","oa":1,"degree_awarded":"PhD","publist_id":"304","_id":"4428","date_created":"2018-12-11T12:08:48Z","page":"1 - 188","abstract":[{"text":"Hybrid systems are real-time systems that react to both discrete and continuous activities (such as analog signals, time, temperature, and speed). Typical examples of hybrid systems are embedded systems, timing-based communication protocols, and digital circuits at the transistor level. Due to the rapid development of microprocessor technology, hybrid systems directly control much of what we depend on in our daily lives. Consequently, the formal specification and verification of hybrid systems has become an active area of research. This dissertation presents the first general framework for the formal specification and verification of hybrid systems, as well as the first hybrid-system analysis tool--HyTech. The framework consists of a graphical finite-state-machine-like language for modeling hybrid systems, a temporal logic for modeling the requirements of hybrid systems, and a computer procedure that verifies modeled hybrid systems against modeled requirements. The tool HyTech is the implementation of the framework using C++ and Mathematica.\r\n\r\nMore specifically, our hybrid-system modeling language, Hybrid Automata, is an extension of timed automata with discrete and continuous variables whose dynamics are governed by differential equations. Our requirement modeling language, ICTL, is a branching-time temporal logic, and is an extension of TCTL with stop-watch variables. Our verification procedure is a symbolic model-checking procedure that verifies linear hybrid automata against ICTL formulas. To make HyTech more efficient and effective, we use model-checking strategies and abstract operators that can expedite the verification process. To enable HyTech to verify nonlinear hybrid automata, we introduce two translations from nonlinear hybrid automata to linear hybrid automata. We have applied HyTech to analyze more than 30 hybrid-system benchmarks. In this dissertation, we present the application of HyTech to three nontrivial hybrid systems taken from the literature.","lang":"eng"}],"extern":"1","publisher":"Cornell University","supervisor":[{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A"}]},{"title":"HyTech: The Cornell Hybrid Technology Tool","citation":{"short":"T.A. Henzinger, P. Ho, in:, A. Panos, W. Kohn, A. Nerode, S. Sastry (Eds.), 4th International Hybrid Systems Workshop, Springer, 1995, pp. 265–293.","ista":"Henzinger TA, Ho P. 1995. HyTech: The Cornell Hybrid Technology Tool. 4th International Hybrid Systems Workshop. Hybrid Systems IIILNCS, LNCS, vol. 999, 265–293.","mla":"Henzinger, Thomas A., and Pei Ho. “HyTech: The Cornell Hybrid Technology Tool.” <i>4th International Hybrid Systems Workshop</i>, edited by Antsaklis Panos et al., vol. 999, Springer, 1995, pp. 265–93, doi:<a href=\"https://doi.org/10.1007/3-540-60472-3_14\">10.1007/3-540-60472-3_14</a>.","ieee":"T. A. Henzinger and P. Ho, “HyTech: The Cornell Hybrid Technology Tool,” in <i>4th International Hybrid Systems Workshop</i>,  New Brunswick, NJ, United States of America, 1995, vol. 999, pp. 265–293.","apa":"Henzinger, T. A., &#38; Ho, P. (1995). HyTech: The Cornell Hybrid Technology Tool. In A. Panos, W. Kohn, A. Nerode, &#38; S. Sastry (Eds.), <i>4th International Hybrid Systems Workshop</i> (Vol. 999, pp. 265–293).  New Brunswick, NJ, United States of America: Springer. <a href=\"https://doi.org/10.1007/3-540-60472-3_14\">https://doi.org/10.1007/3-540-60472-3_14</a>","chicago":"Henzinger, Thomas A, and Pei Ho. “HyTech: The Cornell Hybrid Technology Tool.” In <i>4th International Hybrid Systems Workshop</i>, edited by Antsaklis Panos, Wolf Kohn, Anil Nerode, and Shankar Sastry, 999:265–93. LNCS. Springer, 1995. <a href=\"https://doi.org/10.1007/3-540-60472-3_14\">https://doi.org/10.1007/3-540-60472-3_14</a>.","ama":"Henzinger TA, Ho P. HyTech: The Cornell Hybrid Technology Tool. In: Panos A, Kohn W, Nerode A, Sastry S, eds. <i>4th International Hybrid Systems Workshop</i>. Vol 999. LNCS. Springer; 1995:265-293. doi:<a href=\"https://doi.org/10.1007/3-540-60472-3_14\">10.1007/3-540-60472-3_14</a>"},"volume":999,"article_processing_charge":"No","main_file_link":[{"url":"https://link.springer.com/chapter/10.1007/3-540-60472-3_14"}],"conference":{"start_date":"1995-10-22","end_date":"1955-10-25","name":"Hybrid Systems III","location":" New Brunswick, NJ, United States of America"},"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","language":[{"iso":"eng"}],"date_published":"1995-01-01T00:00:00Z","day":"01","date_updated":"2022-06-10T11:24:15Z","year":"1995","type":"conference","publication_identifier":{"isbn":["9783540683346"]},"quality_controlled":"1","publication":"4th International Hybrid Systems Workshop","series_title":"LNCS","month":"01","status":"public","publisher":"Springer","abstract":[{"text":"This paper is addressed to potential users of HyTech, the Cornell Hybrid Technology Tool, an automatic tool for analyzing hybrid systems. We review the formal technologies that have been incorporated into HyTech, and we illustrate the use of HyTech with three nontrivial case studies.","lang":"eng"}],"acknowledgement":"This research was supported in part by the National Science Foundation under grant CCR-9200794, by the Air Force Office of Scientific Research under contract F49620-93-1-0056, by the Office of Naval Research under YIP grant N00014-95-1-0520, and by the Defense Advanced Research Projects Agency under grant NAG2-892.","_id":"4447","publist_id":"281","page":"265 - 293","date_created":"2018-12-11T12:08:54Z","editor":[{"full_name":"Panos, Antsaklis","last_name":"Panos","first_name":"Antsaklis"},{"last_name":"Kohn","full_name":"Kohn, Wolf","first_name":"Wolf"},{"last_name":"Nerode","full_name":"Nerode, Anil","first_name":"Anil"},{"first_name":"Shankar","full_name":"Sastry, Shankar","last_name":"Sastry"}],"oa_version":"None","author":[{"orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Ho, Pei","last_name":"Ho","first_name":"Pei"}],"doi":"10.1007/3-540-60472-3_14","intvolume":"       999","alternative_title":["LNCS"],"publication_status":"published","extern":"1"},{"month":"01","publication":"3rd International Hybrid Systems Workshop","status":"public","quality_controlled":"1","_id":"4448","publist_id":"282","date_created":"2018-12-11T12:08:54Z","page":"252 - 264","editor":[{"full_name":"Panos, Antsaklis","last_name":"Panos","first_name":"Antsaklis"},{"first_name":"Wolf","last_name":"Kohn","full_name":"Kohn, Wolf"},{"first_name":"Anil","last_name":"Nerode","full_name":"Nerode, Anil"},{"first_name":"Shankar","last_name":"Sastry","full_name":"Sastry, Shankar"}],"publisher":"Springer","abstract":[{"text":"We report on several abstract interpretation strategies that are designed to improve the performance of HyTech, a symbolic model checker for linear hybrid systems. We (1) simultaneously compute the target region from different directions, (2) conservatively approximate the target region by dropping constraints, and (3) iteratively refine the approximation until sufficient precision is obtained. We consider the standard abstract convex-hull operator and a novel abstract extrapolation operator.","lang":"eng"}],"acknowledgement":" National Science Foundation under grant CCR-9200794, by the Air Force Office of Scientific Research under contract F49620-93-1-0056, by the Office of Naval Research under YIP grant N00014-95-1-0520, and by the Defense Advanced Research Projects Agency under grant NAG2-892.","article_processing_charge":"No","main_file_link":[{"url":"https://link.springer.com/chapter/10.1007/3-540-60472-3_13"}],"conference":{"name":"Hybrid Systems II","end_date":"1994-10-30","location":"Ithaca, NY, United States of America","start_date":"1994-10-28"},"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","title":"A note on abstract-interpretation strategies for hybrid automata","citation":{"mla":"Henzinger, Thomas A., and Pei Ho. “A Note on Abstract-Interpretation Strategies for Hybrid Automata.” <i>3rd International Hybrid Systems Workshop</i>, edited by Antsaklis Panos et al., vol. 999, Springer, 1995, pp. 252–64, doi:<a href=\"https://doi.org/10.1007/3-540-60472-3_13\">10.1007/3-540-60472-3_13</a>.","ista":"Henzinger TA, Ho P. 1995. A note on abstract-interpretation strategies for hybrid automata. 3rd International Hybrid Systems Workshop. Hybrid Systems II, LNCS, vol. 999, 252–264.","short":"T.A. Henzinger, P. Ho, in:, A. Panos, W. Kohn, A. Nerode, S. Sastry (Eds.), 3rd International Hybrid Systems Workshop, Springer, 1995, pp. 252–264.","chicago":"Henzinger, Thomas A, and Pei Ho. “A Note on Abstract-Interpretation Strategies for Hybrid Automata.” In <i>3rd International Hybrid Systems Workshop</i>, edited by Antsaklis Panos, Wolf Kohn, Anil Nerode, and Shankar Sastry, 999:252–64. Springer, 1995. <a href=\"https://doi.org/10.1007/3-540-60472-3_13\">https://doi.org/10.1007/3-540-60472-3_13</a>.","apa":"Henzinger, T. A., &#38; Ho, P. (1995). A note on abstract-interpretation strategies for hybrid automata. In A. Panos, W. Kohn, A. Nerode, &#38; S. Sastry (Eds.), <i>3rd International Hybrid Systems Workshop</i> (Vol. 999, pp. 252–264). Ithaca, NY, United States of America: Springer. <a href=\"https://doi.org/10.1007/3-540-60472-3_13\">https://doi.org/10.1007/3-540-60472-3_13</a>","ieee":"T. A. Henzinger and P. Ho, “A note on abstract-interpretation strategies for hybrid automata,” in <i>3rd International Hybrid Systems Workshop</i>, Ithaca, NY, United States of America, 1995, vol. 999, pp. 252–264.","ama":"Henzinger TA, Ho P. A note on abstract-interpretation strategies for hybrid automata. In: Panos A, Kohn W, Nerode A, Sastry S, eds. <i>3rd International Hybrid Systems Workshop</i>. Vol 999. Springer; 1995:252-264. doi:<a href=\"https://doi.org/10.1007/3-540-60472-3_13\">10.1007/3-540-60472-3_13</a>"},"volume":999,"day":"01","date_updated":"2022-06-10T11:48:59Z","publication_identifier":{"isbn":["9783540604723"]},"year":"1995","type":"conference","date_published":"1995-01-01T00:00:00Z","language":[{"iso":"eng"}],"alternative_title":["LNCS"],"publication_status":"published","intvolume":"       999","extern":"1","author":[{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Ho, Pei","last_name":"Ho","first_name":"Pei"}],"doi":"10.1007/3-540-60472-3_13","oa_version":"None"},{"alternative_title":["LNCS"],"publication_status":"published","intvolume":"       939","extern":"1","author":[{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"first_name":"Pei","last_name":"Ho","full_name":"Ho, Pei"}],"doi":"10.1007/3-540-60045-0_53","oa_version":"None","month":"01","publication":"7th International Conference on Computer Aided Verification","status":"public","quality_controlled":"1","publist_id":"280","_id":"4450","page":"225 - 238","date_created":"2018-12-11T12:08:55Z","scopus_import":"1","publisher":"Springer","acknowledgement":"This research was supported in part by the NSF grant CCR-9200794, by the AFOSR contract F49620-93-1-0056, and by the DARPA grant NAG2-892.","abstract":[{"text":"Hybrid systems model discrete programs that are embedded in continuous environments. Model-checking tools are available for the analysis of linear hybrid systems, whose continuous variables are bounded by piecewise-linear trajectories. Most embedded programs, however, operate in nonlinear environments. We present, analyze, and apply two algorithms for translating nonlinear hybrid systems into linear hybrid systems.\r\nThe clock translation replaces nonlinear variables by clock variables; the rate translation approximates nonlinear variables by piecewise-linear envelopes. Both translations are sound for reachability; that is, if we establish a safety property of the translated linear system, we may conclude that the original nonlinear system satisfies the property. The clock translation is also complete for reachability; that is, the original system and the translated system satisfy the same safety properties. The two translations apply to incomparable classes of nonlinear hybrid systems. From the clock translation we obtain a new decidability result for hybrid systems.\r\nWith the help of Hytech, a symbolic model checker for linear hybrid systems, we automatically verify a nonlinear railroad gate control program using the clock translation, and a nonlinear temperature control program using the rate translation.","lang":"eng"}],"main_file_link":[{"url":"https://link.springer.com/chapter/10.1007/3-540-60045-0_53"}],"article_processing_charge":"No","conference":{"start_date":"1995-07-03","name":"CAV: Computer Aided Verification","end_date":"1995-07-05","location":"Liege, Belgium"},"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","title":"Algorithmic analysis of nonlinear hybrid systems","citation":{"short":"T.A. Henzinger, P. Ho, in:, 7th International Conference on Computer Aided Verification, Springer, 1995, pp. 225–238.","mla":"Henzinger, Thomas A., and Pei Ho. “Algorithmic Analysis of Nonlinear Hybrid Systems.” <i>7th International Conference on Computer Aided Verification</i>, vol. 939, Springer, 1995, pp. 225–38, doi:<a href=\"https://doi.org/10.1007/3-540-60045-0_53\">10.1007/3-540-60045-0_53</a>.","ista":"Henzinger TA, Ho P. 1995. Algorithmic analysis of nonlinear hybrid systems. 7th International Conference on Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 939, 225–238.","ama":"Henzinger TA, Ho P. Algorithmic analysis of nonlinear hybrid systems. In: <i>7th International Conference on Computer Aided Verification</i>. Vol 939. Springer; 1995:225-238. doi:<a href=\"https://doi.org/10.1007/3-540-60045-0_53\">10.1007/3-540-60045-0_53</a>","ieee":"T. A. Henzinger and P. Ho, “Algorithmic analysis of nonlinear hybrid systems,” in <i>7th International Conference on Computer Aided Verification</i>, Liege, Belgium, 1995, vol. 939, pp. 225–238.","chicago":"Henzinger, Thomas A, and Pei Ho. “Algorithmic Analysis of Nonlinear Hybrid Systems.” In <i>7th International Conference on Computer Aided Verification</i>, 939:225–38. Springer, 1995. <a href=\"https://doi.org/10.1007/3-540-60045-0_53\">https://doi.org/10.1007/3-540-60045-0_53</a>.","apa":"Henzinger, T. A., &#38; Ho, P. (1995). Algorithmic analysis of nonlinear hybrid systems. In <i>7th International Conference on Computer Aided Verification</i> (Vol. 939, pp. 225–238). Liege, Belgium: Springer. <a href=\"https://doi.org/10.1007/3-540-60045-0_53\">https://doi.org/10.1007/3-540-60045-0_53</a>"},"volume":939,"day":"01","date_updated":"2022-06-10T09:48:52Z","type":"conference","year":"1995","publication_identifier":{"isbn":["9783540494133"]},"language":[{"iso":"eng"}],"date_published":"1995-01-01T00:00:00Z"},{"extern":"1","intvolume":"      1019","alternative_title":["LNCS"],"publication_status":"published","oa_version":"None","doi":"10.1007/3-540-60630-0_3","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724"},{"last_name":"Ho","full_name":"Ho, Pei","first_name":"Pei"},{"first_name":"Howard","last_name":"Wong Toi","full_name":"Wong Toi, Howard"}],"acknowledgement":"This research was supported in part by the ONR YIP award N00014-95-1-0520, by the NSF CAREER award CCR-9501708, by the NSF grants CCR-9200794 and CCR-9504469, by the AFOSR contract F49620-93-1-0056, and by the ARPA grant NAG2-892.","abstract":[{"lang":"eng","text":"HyTech is a tool for the automated analysis of embedded systems. This document, designed for the first-time user of HyTech, guides the reader through the underlying system model, and through the input language for describing and analyzing systems. The guide gives several examples of usage, and some hints for gaining maximal computational efficiency from the tool.\r\nThe version of HyTech described in this guide was released in August 1995, and is available through anonymous ftp from ftp.cs.cornell.edu in the directory pub/tah/HyTech, and through the World-Wide Web via HyTech's home page http:/www.cs.cornell.edu/Info/People/tah/hytech.html."}],"publisher":"Springer","publist_id":"230","_id":"4497","page":"41 - 71","scopus_import":"1","date_created":"2018-12-11T12:09:09Z","quality_controlled":"1","month":"01","publication":"1st International Workshop on Tools and Algorithms for the Construction and Analysis of Systems","status":"public","date_published":"1995-01-01T00:00:00Z","language":[{"iso":"eng"}],"year":"1995","type":"conference","publication_identifier":{"isbn":["9783540606307"]},"date_updated":"2022-06-10T09:00:05Z","day":"01","volume":1019,"title":"A user guide to HyTech","citation":{"ista":"Henzinger TA, Ho P, Wong Toi H. 1995. A user guide to HyTech. 1st International Workshop on Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 1019, 41–71.","mla":"Henzinger, Thomas A., et al. “A User Guide to HyTech.” <i>1st International Workshop on Tools and Algorithms for the Construction and Analysis of Systems</i>, vol. 1019, Springer, 1995, pp. 41–71, doi:<a href=\"https://doi.org/10.1007/3-540-60630-0_3\">10.1007/3-540-60630-0_3</a>.","short":"T.A. Henzinger, P. Ho, H. Wong Toi, in:, 1st International Workshop on Tools and Algorithms for the Construction and Analysis of Systems, Springer, 1995, pp. 41–71.","chicago":"Henzinger, Thomas A, Pei Ho, and Howard Wong Toi. “A User Guide to HyTech.” In <i>1st International Workshop on Tools and Algorithms for the Construction and Analysis of Systems</i>, 1019:41–71. Springer, 1995. <a href=\"https://doi.org/10.1007/3-540-60630-0_3\">https://doi.org/10.1007/3-540-60630-0_3</a>.","apa":"Henzinger, T. A., Ho, P., &#38; Wong Toi, H. (1995). A user guide to HyTech. In <i>1st International Workshop on Tools and Algorithms for the Construction and Analysis of Systems</i> (Vol. 1019, pp. 41–71). Aarhus, Denmark: Springer. <a href=\"https://doi.org/10.1007/3-540-60630-0_3\">https://doi.org/10.1007/3-540-60630-0_3</a>","ieee":"T. A. Henzinger, P. Ho, and H. Wong Toi, “A user guide to HyTech,” in <i>1st International Workshop on Tools and Algorithms for the Construction and Analysis of Systems</i>, Aarhus, Denmark, 1995, vol. 1019, pp. 41–71.","ama":"Henzinger TA, Ho P, Wong Toi H. A user guide to HyTech. In: <i>1st International Workshop on Tools and Algorithms for the Construction and Analysis of Systems</i>. Vol 1019. Springer; 1995:41-71. doi:<a href=\"https://doi.org/10.1007/3-540-60630-0_3\">10.1007/3-540-60630-0_3</a>"},"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","main_file_link":[{"url":"https://link.springer.com/chapter/10.1007/3-540-60630-0_3"}],"article_processing_charge":"No","conference":{"location":"Aarhus, Denmark","end_date":"1995-05-20","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","start_date":"1995-05-19"}},{"quality_controlled":"1","publication":"Proceedings of IEEE 36th Annual Foundations of Computer Science","month":"11","status":"public","publication_status":"published","publisher":"IEEE","extern":"1","abstract":[{"text":"We present algorithms for computing similarity relations of labeled graphs. Similarity relations have applications for the refinement and verification of reactive systems. For finite graphs, we present an O(mn) algorithm for computing the similarity relation of a graph with n vertices and m edges (assuming m⩾n). For effectively presented infinite graphs, we present a symbolic similarity-checking procedure that terminates if a finite similarity relation exists. We show that 2D rectangular automata, which model discrete reactive systems with continuous environments, define effectively presented infinite graphs with finite similarity relations. It follows that the refinement problem and the ∀CTL* model-checking problem are decidable for 2D rectangular automata","lang":"eng"}],"_id":"4498","publist_id":"231","date_created":"2018-12-11T12:09:10Z","page":"453 - 462","scopus_import":"1","title":"Computing simulations on finite and infinite graphs","citation":{"short":"M. Henzinger, T.A. Henzinger, P. Kopke, in:, Proceedings of IEEE 36th Annual Foundations of Computer Science, IEEE, 1995, pp. 453–462.","ista":"Henzinger M, Henzinger TA, Kopke P. 1995. Computing simulations on finite and infinite graphs. Proceedings of IEEE 36th Annual Foundations of Computer Science. FOCS: Foundations of Computer Science, 453–462.","mla":"Henzinger, Monika, et al. “Computing Simulations on Finite and Infinite Graphs.” <i>Proceedings of IEEE 36th Annual Foundations of Computer Science</i>, IEEE, 1995, pp. 453–62, doi:<a href=\"https://doi.org/10.1109/SFCS.1995.492576\">10.1109/SFCS.1995.492576</a>.","chicago":"Henzinger, Monika, Thomas A Henzinger, and Peter Kopke. “Computing Simulations on Finite and Infinite Graphs.” In <i>Proceedings of IEEE 36th Annual Foundations of Computer Science</i>, 453–62. IEEE, 1995. <a href=\"https://doi.org/10.1109/SFCS.1995.492576\">https://doi.org/10.1109/SFCS.1995.492576</a>.","apa":"Henzinger, M., Henzinger, T. A., &#38; Kopke, P. (1995). Computing simulations on finite and infinite graphs. In <i>Proceedings of IEEE 36th Annual Foundations of Computer Science</i> (pp. 453–462). Milwaukee, WI, United States of America: IEEE. <a href=\"https://doi.org/10.1109/SFCS.1995.492576\">https://doi.org/10.1109/SFCS.1995.492576</a>","ieee":"M. Henzinger, T. A. Henzinger, and P. Kopke, “Computing simulations on finite and infinite graphs,” in <i>Proceedings of IEEE 36th Annual Foundations of Computer Science</i>, Milwaukee, WI, United States of America, 1995, pp. 453–462.","ama":"Henzinger M, Henzinger TA, Kopke P. Computing simulations on finite and infinite graphs. In: <i>Proceedings of IEEE 36th Annual Foundations of Computer Science</i>. IEEE; 1995:453-462. doi:<a href=\"https://doi.org/10.1109/SFCS.1995.492576\">10.1109/SFCS.1995.492576</a>"},"article_processing_charge":"No","conference":{"start_date":"1995-10-23","name":"FOCS: Foundations of Computer Science","end_date":"1995-10-25","location":"Milwaukee, WI, United States of America"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"None","language":[{"iso":"eng"}],"date_published":"1995-11-01T00:00:00Z","author":[{"full_name":"Henzinger, Monika H","last_name":"Henzinger","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"last_name":"Kopke","full_name":"Kopke, Peter","first_name":"Peter"}],"day":"01","date_updated":"2024-11-06T12:02:08Z","doi":"10.1109/SFCS.1995.492576","publication_identifier":{"isbn":["0818671831"],"issn":["0272-5428"]},"type":"conference","year":"1995"},{"publist_id":"232","_id":"4499","date_created":"2018-12-11T12:09:10Z","scopus_import":"1","page":"56 - 65","publisher":"IEEE","extern":"1","abstract":[{"lang":"eng","text":"We describe a new implementation of HYTECH, a symbolic model checker for hybrid systems. Given a parametric description of an embedded system as a collection of communicating automata, HYTECH automatically computes the conditions on the parameters under which the system satisfies its safety and timing requirements. While the original HYTECH prototype was based on the symbolic algebra tool Mathematica, the new implementation is written in C++ and builds on geometric algorithms instead of formula manipulation. The new HYTECH offers a cleaner and more expressive input language, greater portability, superior performance (typically two to three orders of magnitude), and new features such as diagnostic error-trace generation. We illustrate the effectiveness of the new implementation by applying HYTECH to the automatic parametric analysis of the generic railroad crossing benchmark problem and to an active structure control algorithm"}],"publication":"Proceedings 16th IEEE Real-Time Systems Symposium","month":"01","status":"public","publication_status":"published","quality_controlled":"1","date_updated":"2022-06-10T09:33:19Z","day":"01","author":[{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Ho, Pei","last_name":"Ho","first_name":"Pei"},{"first_name":"Howard","full_name":"Wong Toi, Howard","last_name":"Wong Toi"}],"doi":"10.1109/REAL.1995.495196 ","year":"1995","publication_identifier":{"isbn":["0818673370"]},"type":"conference","oa_version":"None","date_published":"1995-01-01T00:00:00Z","language":[{"iso":"eng"}],"article_processing_charge":"No","main_file_link":[{"url":"https://ieeexplore.ieee.org/document/495196"}],"conference":{"name":"RTSS: Real-Time Systems Symposium","end_date":"1995-12-07","location":"Pisa, Italy","start_date":"1995-12-05"},"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","title":"HyTech: The next generation","citation":{"ama":"Henzinger TA, Ho P, Wong Toi H. HyTech: The next generation. In: <i>Proceedings 16th IEEE Real-Time Systems Symposium</i>. IEEE; 1995:56-65. doi:<a href=\"https://doi.org/10.1109/REAL.1995.495196 \">10.1109/REAL.1995.495196 </a>","chicago":"Henzinger, Thomas A, Pei Ho, and Howard Wong Toi. “HyTech: The next Generation.” In <i>Proceedings 16th IEEE Real-Time Systems Symposium</i>, 56–65. IEEE, 1995. <a href=\"https://doi.org/10.1109/REAL.1995.495196 \">https://doi.org/10.1109/REAL.1995.495196 </a>.","ieee":"T. A. Henzinger, P. Ho, and H. Wong Toi, “HyTech: The next generation,” in <i>Proceedings 16th IEEE Real-Time Systems Symposium</i>, Pisa, Italy, 1995, pp. 56–65.","apa":"Henzinger, T. A., Ho, P., &#38; Wong Toi, H. (1995). HyTech: The next generation. In <i>Proceedings 16th IEEE Real-Time Systems Symposium</i> (pp. 56–65). Pisa, Italy: IEEE. <a href=\"https://doi.org/10.1109/REAL.1995.495196 \">https://doi.org/10.1109/REAL.1995.495196 </a>","short":"T.A. Henzinger, P. Ho, H. Wong Toi, in:, Proceedings 16th IEEE Real-Time Systems Symposium, IEEE, 1995, pp. 56–65.","ista":"Henzinger TA, Ho P, Wong Toi H. 1995. HyTech: The next generation. Proceedings 16th IEEE Real-Time Systems Symposium. RTSS: Real-Time Systems Symposium, 56–65.","mla":"Henzinger, Thomas A., et al. “HyTech: The next Generation.” <i>Proceedings 16th IEEE Real-Time Systems Symposium</i>, IEEE, 1995, pp. 56–65, doi:<a href=\"https://doi.org/10.1109/REAL.1995.495196 \">10.1109/REAL.1995.495196 </a>."}},{"day":"01","date_updated":"2022-06-09T14:58:31Z","publication_identifier":{"isbn":["9783540600848"]},"year":"1995","type":"conference","date_published":"1995-01-01T00:00:00Z","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://link.springer.com/chapter/10.1007/3-540-60084-1_93"}],"article_processing_charge":"No","conference":{"location":"Szeged, Hungary","end_date":"1995-07-14","name":"ICALP: Automata, Languages and Programming","start_date":"1995-07-10"},"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","title":"The expressive power of clocks","citation":{"short":"T.A. Henzinger, P. Kopke, H. Wong Toi, in:, 22nd International Colloquium on Automata, Languages and Programming , Springer, 1995, pp. 417–428.","mla":"Henzinger, Thomas A., et al. “The Expressive Power of Clocks.” <i>22nd International Colloquium on Automata, Languages and Programming </i>, vol. 944, Springer, 1995, pp. 417–28, doi:<a href=\"https://doi.org/10.1007/3-540-60084-1_93\">10.1007/3-540-60084-1_93</a>.","ista":"Henzinger TA, Kopke P, Wong Toi H. 1995. The expressive power of clocks. 22nd International Colloquium on Automata, Languages and Programming . ICALP: Automata, Languages and Programming, LNCS, vol. 944, 417–428.","chicago":"Henzinger, Thomas A, Peter Kopke, and Howard Wong Toi. “The Expressive Power of Clocks.” In <i>22nd International Colloquium on Automata, Languages and Programming </i>, 944:417–28. Springer, 1995. <a href=\"https://doi.org/10.1007/3-540-60084-1_93\">https://doi.org/10.1007/3-540-60084-1_93</a>.","ieee":"T. A. Henzinger, P. Kopke, and H. Wong Toi, “The expressive power of clocks,” in <i>22nd International Colloquium on Automata, Languages and Programming </i>, Szeged, Hungary, 1995, vol. 944, pp. 417–428.","apa":"Henzinger, T. A., Kopke, P., &#38; Wong Toi, H. (1995). The expressive power of clocks. In <i>22nd International Colloquium on Automata, Languages and Programming </i> (Vol. 944, pp. 417–428). Szeged, Hungary: Springer. <a href=\"https://doi.org/10.1007/3-540-60084-1_93\">https://doi.org/10.1007/3-540-60084-1_93</a>","ama":"Henzinger TA, Kopke P, Wong Toi H. The expressive power of clocks. In: <i>22nd International Colloquium on Automata, Languages and Programming </i>. Vol 944. Springer; 1995:417-428. doi:<a href=\"https://doi.org/10.1007/3-540-60084-1_93\">10.1007/3-540-60084-1_93</a>"},"volume":944,"publist_id":"229","_id":"4500","page":"417 - 428","date_created":"2018-12-11T12:09:10Z","publisher":"Springer","acknowledgement":"This research was supported in part by the National Science Foundation under grant CCR-9200794, by the United States Air Force Office of Scientific Research under contract F49620-93-1-0056, by the Defense Advanced Research Projects Agency under grant NAG2-892, and by the U.S. Army Research Office through the Mathematical Sciences Institute of Cornell University, Contract Number DAAL03-91-C-0027.\r\nThe full version of this paper is available from the Department of Computer Science, Cornell University, Ithaca, NY 14853, as Technical Report TR95-1496.","abstract":[{"lang":"eng","text":"We investigate the expressive power of timing restrictions on labeled transition systems. In particular, we show how constraints on clock variables together with a uniform liveness condition—the divergence of time—can express Büchi, Muller, Streett, Rabin, and weak and strong fairness conditions on a given labeled transition system. We then consider the effect, on both timed and time-abstract expressiveness, of varying the following parameters: time domain (discrete or dense), number of clocks, number of states, and size of constants used in timing restrictions."}],"month":"01","publication":"22nd International Colloquium on Automata, Languages and Programming ","status":"public","quality_controlled":"1","author":[{"orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Peter","last_name":"Kopke","full_name":"Kopke, Peter"},{"last_name":"Wong Toi","full_name":"Wong Toi, Howard","first_name":"Howard"}],"doi":"10.1007/3-540-60084-1_93","oa_version":"None","extern":"1","alternative_title":["LNCS"],"publication_status":"published","intvolume":"       944"},{"publisher":"ACM","extern":"1","acknowledgement":"We thank Howard Wong-Toi for a careful reading.\r\n","abstract":[{"lang":"eng","text":"Hybrid automata model systems with both digital and analog components, such as embedded control programs. Many verification tasks for such programs can be expressed as reachability problems for hybrid automata. By improving on previous decidability and undecidability results, we identify the precise boundary between decidability and undecidability of the reachability problem for hybrid automata.\r\n\r\nOn the positive side, we give an (optimal) PSPACE reachability algorithm for the case of initialized rectangular automata, where all analog variables follow trajectories within piecewise-linear envelopes and are reinitialized whenever the envelope changes. Our algorithm is based on the construction of a timed automaton that contains all reachability information about a given initialized rectangular automaton. The translation has practical significance for verification, because it guarantees the termination of symbolic procedures for the reachability analysis of initialized rectangular automata. The translation also preserves the omega-languages of initialized rectangular automata with bounded nondeterminism.\r\n\r\nOn the negative side, we show that several slight generalizations of initialized rectangular automata lead to an undecidable reachability problem. In particular, we prove that the reachability problem is undecidable for timed automata augmented with a single stopwatch."}],"publist_id":"228","_id":"4502","page":"373 - 382","date_created":"2018-12-11T12:09:11Z","quality_controlled":"1","month":"01","publication":"Proceedings of the 27th annual ACM symposium on Theory of computing","oa":1,"status":"public","publication_status":"published","oa_version":"Published Version","date_published":"1995-01-01T00:00:00Z","language":[{"iso":"eng"}],"day":"01","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724"},{"first_name":"Peter","last_name":"Kopke","full_name":"Kopke, Peter"},{"full_name":"Puri, Anuj","last_name":"Puri","first_name":"Anuj"},{"last_name":"Varaiya","full_name":"Varaiya, P.","first_name":"P."}],"date_updated":"2022-06-09T14:40:29Z","doi":"10.1145/225058.225162","publication_identifier":{"isbn":["9780897917186"]},"type":"conference","year":"1995","title":"What's decidable about hybrid automata?","citation":{"ama":"Henzinger TA, Kopke P, Puri A, Varaiya P. What’s decidable about hybrid automata? In: <i>Proceedings of the 27th Annual ACM Symposium on Theory of Computing</i>. ACM; 1995:373-382. doi:<a href=\"https://doi.org/10.1145/225058.225162\">10.1145/225058.225162</a>","chicago":"Henzinger, Thomas A, Peter Kopke, Anuj Puri, and P. Varaiya. “What’s Decidable about Hybrid Automata?” In <i>Proceedings of the 27th Annual ACM Symposium on Theory of Computing</i>, 373–82. ACM, 1995. <a href=\"https://doi.org/10.1145/225058.225162\">https://doi.org/10.1145/225058.225162</a>.","apa":"Henzinger, T. A., Kopke, P., Puri, A., &#38; Varaiya, P. (1995). What’s decidable about hybrid automata? In <i>Proceedings of the 27th annual ACM symposium on Theory of computing</i> (pp. 373–382). Las Vegas, NV, United States of America: ACM. <a href=\"https://doi.org/10.1145/225058.225162\">https://doi.org/10.1145/225058.225162</a>","ieee":"T. A. Henzinger, P. Kopke, A. Puri, and P. Varaiya, “What’s decidable about hybrid automata?,” in <i>Proceedings of the 27th annual ACM symposium on Theory of computing</i>, Las Vegas, NV, United States of America, 1995, pp. 373–382.","mla":"Henzinger, Thomas A., et al. “What’s Decidable about Hybrid Automata?” <i>Proceedings of the 27th Annual ACM Symposium on Theory of Computing</i>, ACM, 1995, pp. 373–82, doi:<a href=\"https://doi.org/10.1145/225058.225162\">10.1145/225058.225162</a>.","ista":"Henzinger TA, Kopke P, Puri A, Varaiya P. 1995. What’s decidable about hybrid automata? Proceedings of the 27th annual ACM symposium on Theory of computing. STOC: Symposium on the Theory of Computing, 373–382.","short":"T.A. Henzinger, P. Kopke, A. Puri, P. Varaiya, in:, Proceedings of the 27th Annual ACM Symposium on Theory of Computing, ACM, 1995, pp. 373–382."},"article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"https://dl.acm.org/doi/10.1145/225058.225162"}],"conference":{"start_date":"1995-05-29","location":"Las Vegas, NV, United States of America","name":"STOC: Symposium on the Theory of Computing","end_date":"1995-06-01"},"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17"},{"author":[{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"doi":"10.1007/3-540-60084-1_85","oa_version":"None","extern":"1","publication_status":"published","alternative_title":["LNCS"],"intvolume":"       944","day":"01","date_updated":"2025-06-26T08:47:29Z","year":"1995","publication_identifier":{"isbn":["9783540600848"]},"type":"conference","date_published":"1995-01-01T00:00:00Z","language":[{"iso":"eng"}],"conference":{"name":"ICALP: Automata, Languages and Programming","end_date":"1995-07-14","location":"Szeged, Hungary","start_date":"1995-07-10"},"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Henzinger, Thomas A. “Hybrid Automata with Finite Bisimulations.” <i>22nd International Colloquium on Automata, Languages and Programming </i>, vol. 944, Springer, 1995, pp. 324–35, doi:<a href=\"https://doi.org/10.1007/3-540-60084-1_85\">10.1007/3-540-60084-1_85</a>.","ista":"Henzinger TA. 1995. Hybrid automata with finite bisimulations. 22nd International Colloquium on Automata, Languages and Programming . ICALP: Automata, Languages and Programming, LNCS, vol. 944, 324–335.","short":"T.A. Henzinger, in:, 22nd International Colloquium on Automata, Languages and Programming , Springer, 1995, pp. 324–335.","apa":"Henzinger, T. A. (1995). Hybrid automata with finite bisimulations. In <i>22nd International Colloquium on Automata, Languages and Programming </i> (Vol. 944, pp. 324–335). Szeged, Hungary: Springer. <a href=\"https://doi.org/10.1007/3-540-60084-1_85\">https://doi.org/10.1007/3-540-60084-1_85</a>","chicago":"Henzinger, Thomas A. “Hybrid Automata with Finite Bisimulations.” In <i>22nd International Colloquium on Automata, Languages and Programming </i>, 944:324–35. Springer, 1995. <a href=\"https://doi.org/10.1007/3-540-60084-1_85\">https://doi.org/10.1007/3-540-60084-1_85</a>.","ieee":"T. A. Henzinger, “Hybrid automata with finite bisimulations,” in <i>22nd International Colloquium on Automata, Languages and Programming </i>, Szeged, Hungary, 1995, vol. 944, pp. 324–335.","ama":"Henzinger TA. Hybrid automata with finite bisimulations. In: <i>22nd International Colloquium on Automata, Languages and Programming </i>. Vol 944. Springer; 1995:324-335. doi:<a href=\"https://doi.org/10.1007/3-540-60084-1_85\">10.1007/3-540-60084-1_85</a>"},"title":"Hybrid automata with finite bisimulations","volume":944,"date_created":"2018-12-11T12:09:16Z","page":"324 - 335","publist_id":"212","_id":"4518","publisher":"Springer","abstract":[{"lang":"eng","text":"The analysis, verification, and control of hybrid automata with finite bisimulations can be reduced to finite-state problems. We advocate a time-abstract, phase-based methodology for checking if a given hybrid automaton has a finite bisimulation. First, we factor the automaton into two components, a boolean automaton with a discrete dynamics on the finite state space B m and a euclidean automaton with a continuous dynamics on the infinite state space  n . Second, we investigate the phase portrait of the euclidean component. In this fashion, we obtain new decidability results for hybrid systems as well as new, uniform proofs of known decidability results."}],"acknowledgement":"This research was supported in part by the NSF grant CCR-9200794, by the AFOSR contract F49620-93-1-0056, and by the DARPA grant NAG2-892.\r\n","status":"public","publication":"22nd International Colloquium on Automata, Languages and Programming ","month":"01","quality_controlled":"1"},{"alternative_title":["LNCS"],"publication_status":"published","intvolume":"       939","extern":"1","doi":"10.1007/3-540-60045-0_49","author":[{"last_name":"Alur","full_name":"Alur, Rajeev","first_name":"Rajeev"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger"}],"oa_version":"None","publication":"7th International Conference on Computer Aided Verification","month":"01","status":"public","quality_controlled":"1","publist_id":"120","_id":"4587","date_created":"2018-12-11T12:09:37Z","page":"166 - 179","acknowledgement":"Supported in part by the NSF grant CCR-9200794, by the AFOSR contract F49620-93-1-0056, and by the DARPA grant NAG2-892.","abstract":[{"text":"We argue that the standard constraints on liveness conditions in nonblocking trace models—machine closure for closed systems, and receptiveness for open systems—are unnecessarily weak and complex, and that liveness should, instead, be specified by augmenting transition systems with acceptance conditions that satisfy a locality constraint. First, locality implies machine closure and receptiveness, and thus permits the composition and modular verification of live transition systems. Second, while machine closure and receptiveness are based on infinite games, locality is based on repeated finite games, and thus easier to check. Third, no expressive power is lost by the restriction to local liveness conditions. We illustrate the appeal of local liveness using the model of Fair Reactive Systems, a nonblocking trace model of communicating processes.","lang":"eng"}],"publisher":"Springer","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","article_processing_charge":"No","main_file_link":[{"url":"https://link.springer.com/chapter/10.1007/3-540-60045-0_49"}],"conference":{"start_date":"1995-07-03","location":"Liege, Belgium","end_date":"1995-07-05","name":"CAV: Computer Aided Verification"},"volume":939,"title":"Local liveness for compositional modeling of fair reactive systems","citation":{"apa":"Alur, R., &#38; Henzinger, T. A. (1995). Local liveness for compositional modeling of fair reactive systems. In <i>7th International Conference on Computer Aided Verification</i> (Vol. 939, pp. 166–179). Liege, Belgium: Springer. <a href=\"https://doi.org/10.1007/3-540-60045-0_49\">https://doi.org/10.1007/3-540-60045-0_49</a>","chicago":"Alur, Rajeev, and Thomas A Henzinger. “Local Liveness for Compositional Modeling of Fair Reactive Systems.” In <i>7th International Conference on Computer Aided Verification</i>, 939:166–79. Springer, 1995. <a href=\"https://doi.org/10.1007/3-540-60045-0_49\">https://doi.org/10.1007/3-540-60045-0_49</a>.","ama":"Alur R, Henzinger TA. Local liveness for compositional modeling of fair reactive systems. In: <i>7th International Conference on Computer Aided Verification</i>. Vol 939. Springer; 1995:166-179. doi:<a href=\"https://doi.org/10.1007/3-540-60045-0_49\">10.1007/3-540-60045-0_49</a>","ieee":"R. Alur and T. A. Henzinger, “Local liveness for compositional modeling of fair reactive systems,” in <i>7th International Conference on Computer Aided Verification</i>, Liege, Belgium, 1995, vol. 939, pp. 166–179.","ista":"Alur R, Henzinger TA. 1995. Local liveness for compositional modeling of fair reactive systems. 7th International Conference on Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 939, 166–179.","mla":"Alur, Rajeev, and Thomas A. Henzinger. “Local Liveness for Compositional Modeling of Fair Reactive Systems.” <i>7th International Conference on Computer Aided Verification</i>, vol. 939, Springer, 1995, pp. 166–79, doi:<a href=\"https://doi.org/10.1007/3-540-60045-0_49\">10.1007/3-540-60045-0_49</a>.","short":"R. Alur, T.A. Henzinger, in:, 7th International Conference on Computer Aided Verification, Springer, 1995, pp. 166–179."},"year":"1995","publication_identifier":{"isbn":["978-3-540-60045-9"]},"type":"conference","day":"01","date_updated":"2022-06-09T14:05:04Z","language":[{"iso":"eng"}],"date_published":"1995-01-01T00:00:00Z"},{"quality_controlled":"1","publication":"Theoretical Computer Science","month":"02","status":"public","abstract":[{"lang":"eng","text":"We present a general framework for the formal specification and algorithmic analysis of hybrid systems. A hybrid system consists of a discrete program with an analog environment. We model hybrid systems as finite automata equipped with variables that evolve continuously with time according to dynamical laws. For verification purposes, we restrict ourselves to linear hybrid systems, where all variables follow piecewise-linear trajectories. We provide decidability and undecidability results for classes of linear hybrid systems, and we show that standard program-analysis techniques can be adapted to linear hybrid systems. In particular, we consider symbolic model-checking and minimization procedures that are based on the reachability analysis of an infinite state space. The procedures iteratively compute state sets that are definable as unions of convex polyhedra in multidimensional real space. We also present approximation techniques for dealing with systems for which the iterative procedures do not converge."}],"article_type":"original","publisher":"Elsevier","_id":"4613","publist_id":"94","date_created":"2018-12-11T12:09:45Z","page":"3 - 34","volume":138,"title":"The algorithmic analysis of hybrid systems","citation":{"ieee":"R. Alur <i>et al.</i>, “The algorithmic analysis of hybrid systems,” <i>Theoretical Computer Science</i>, vol. 138, no. 1. Elsevier, pp. 3–34, 1995.","chicago":"Alur, Rajeev, Costas Courcoubetis, Nicolas Halbwachs, Thomas A Henzinger, Pei Ho, Xavier Nicollin, Alfredo Olivero, Joseph Sifakis, and Sergio Yovine. “The Algorithmic Analysis of Hybrid Systems.” <i>Theoretical Computer Science</i>. Elsevier, 1995. <a href=\"https://doi.org/10.1016/0304-3975(94)00202-T\">https://doi.org/10.1016/0304-3975(94)00202-T</a>.","apa":"Alur, R., Courcoubetis, C., Halbwachs, N., Henzinger, T. A., Ho, P., Nicollin, X., … Yovine, S. (1995). The algorithmic analysis of hybrid systems. <i>Theoretical Computer Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/0304-3975(94)00202-T\">https://doi.org/10.1016/0304-3975(94)00202-T</a>","ama":"Alur R, Courcoubetis C, Halbwachs N, et al. The algorithmic analysis of hybrid systems. <i>Theoretical Computer Science</i>. 1995;138(1):3-34. doi:<a href=\"https://doi.org/10.1016/0304-3975(94)00202-T\">10.1016/0304-3975(94)00202-T</a>","mla":"Alur, Rajeev, et al. “The Algorithmic Analysis of Hybrid Systems.” <i>Theoretical Computer Science</i>, vol. 138, no. 1, Elsevier, 1995, pp. 3–34, doi:<a href=\"https://doi.org/10.1016/0304-3975(94)00202-T\">10.1016/0304-3975(94)00202-T</a>.","ista":"Alur R, Courcoubetis C, Halbwachs N, Henzinger TA, Ho P, Nicollin X, Olivero A, Sifakis J, Yovine S. 1995. The algorithmic analysis of hybrid systems. Theoretical Computer Science. 138(1), 3–34.","short":"R. Alur, C. Courcoubetis, N. Halbwachs, T.A. Henzinger, P. Ho, X. Nicollin, A. Olivero, J. Sifakis, S. Yovine, Theoretical Computer Science 138 (1995) 3–34."},"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/030439759400202T?via%3Dihub"}],"article_processing_charge":"No","language":[{"iso":"eng"}],"date_published":"1995-02-06T00:00:00Z","type":"journal_article","publication_identifier":{"issn":["0304-3975"]},"year":"1995","day":"06","date_updated":"2022-06-09T13:40:48Z","intvolume":"       138","issue":"1","publication_status":"published","extern":"1","oa_version":"None","doi":"10.1016/0304-3975(94)00202-T","author":[{"first_name":"Rajeev","full_name":"Alur, Rajeev","last_name":"Alur"},{"last_name":"Courcoubetis","full_name":"Courcoubetis, Costas","first_name":"Costas"},{"first_name":"Nicolas","last_name":"Halbwachs","full_name":"Halbwachs, Nicolas"},{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Pei","last_name":"Ho","full_name":"Ho, Pei"},{"last_name":"Nicollin","full_name":"Nicollin, Xavier","first_name":"Xavier"},{"full_name":"Olivero, Alfredo","last_name":"Olivero","first_name":"Alfredo"},{"first_name":"Joseph","full_name":"Sifakis, Joseph","last_name":"Sifakis"},{"first_name":"Sergio","full_name":"Yovine, Sergio","last_name":"Yovine"}]},{"language":[{"iso":"eng"}],"date_published":"1995-01-15T00:00:00Z","oa_version":"None","publication_identifier":{"issn":["08909369"]},"type":"journal_article","year":"1995","doi":"10.1101/gad.9.2.155","author":[{"last_name":"de Bono","orcid":"0000-0001-8347-0443","full_name":"de Bono, Mario","first_name":"Mario","id":"4E3FF80E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"D.","full_name":"Zarkower, D.","last_name":"Zarkower"},{"first_name":"J.","full_name":"Hodgkin, J.","last_name":"Hodgkin"}],"day":"15","date_updated":"2021-01-12T08:06:29Z","volume":9,"pmid":1,"citation":{"short":"M. de Bono, D. Zarkower, J. Hodgkin, Genes and Development 9 (1995) 155–167.","ista":"de Bono M, Zarkower D, Hodgkin J. 1995. Dominant feminizing mutations implicate protein-protein interactions as the main mode of regulation of the nematode sex-determining gene tra-1. Genes and Development. 9(2), 155–167.","mla":"de Bono, Mario, et al. “Dominant Feminizing Mutations Implicate Protein-Protein Interactions as the Main Mode of Regulation of the Nematode Sex-Determining Gene Tra-1.” <i>Genes and Development</i>, vol. 9, no. 2, CSH Press, 1995, pp. 155–67, doi:<a href=\"https://doi.org/10.1101/gad.9.2.155\">10.1101/gad.9.2.155</a>.","chicago":"Bono, Mario de, D. Zarkower, and J. Hodgkin. “Dominant Feminizing Mutations Implicate Protein-Protein Interactions as the Main Mode of Regulation of the Nematode Sex-Determining Gene Tra-1.” <i>Genes and Development</i>. CSH Press, 1995. <a href=\"https://doi.org/10.1101/gad.9.2.155\">https://doi.org/10.1101/gad.9.2.155</a>.","apa":"de Bono, M., Zarkower, D., &#38; Hodgkin, J. (1995). Dominant feminizing mutations implicate protein-protein interactions as the main mode of regulation of the nematode sex-determining gene tra-1. <i>Genes and Development</i>. CSH Press. <a href=\"https://doi.org/10.1101/gad.9.2.155\">https://doi.org/10.1101/gad.9.2.155</a>","ieee":"M. de Bono, D. Zarkower, and J. Hodgkin, “Dominant feminizing mutations implicate protein-protein interactions as the main mode of regulation of the nematode sex-determining gene tra-1,” <i>Genes and Development</i>, vol. 9, no. 2. CSH Press, pp. 155–167, 1995.","ama":"de Bono M, Zarkower D, Hodgkin J. Dominant feminizing mutations implicate protein-protein interactions as the main mode of regulation of the nematode sex-determining gene tra-1. <i>Genes and Development</i>. 1995;9(2):155-167. doi:<a href=\"https://doi.org/10.1101/gad.9.2.155\">10.1101/gad.9.2.155</a>"},"title":"Dominant feminizing mutations implicate protein-protein interactions as the main mode of regulation of the nematode sex-determining gene tra-1","external_id":{"pmid":["7851791"]},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"The tra-1 gene is the terminal global selector of somatic sex in Caenorhabditis elegans: High tra-1 activity elicits female somatic development while low tra-1 activity elicits male development. Previous genetic studies defined a cascade of negatively interacting genes that regulates tra-1 activity in response to the primary sex-determining signal. Here, we investigate the last step in this regulatory cascade, by studying rare gain-of-function (gf) mutations of tra-1 that direct female somatic development irrespective of the upstream sex-determining signal. These mutations appear to abolish negative regulation of tra-1 in male tissues. We identify the lesions associated with 29 of these mutations and find that all affect a short stretch of amino acid residues present in both protein products of the tra-1 gene. Twenty-six alleles are associated with single nonconservative amino acid substitutions. Two alleles affect tra-1 RNA splicing and generate messages that omit part or all of the exon encoding this short stretch. These results suggest that sexual regulation of tra-1 is achieved post-translationally, by an inhibitory protein-protein interaction. The amino acid stretch altered by the tra-1(gf) mutations may define a site of interaction for negative regulators of tra-1. The stretch includes a potential phosphorylation site for glycogen synthase kinase 3 and may be conserved in the human gene GLI3, a homolog of tra-1 identified previously."}],"publisher":"CSH Press","extern":"1","date_created":"2019-03-21T11:57:40Z","page":"155-167","_id":"6162","quality_controlled":"1","intvolume":"         9","publication_status":"published","issue":"2","status":"public","month":"01","publication":"Genes and Development"},{"publication_identifier":{"isbn":["978-0-306-44870-6"]},"year":"1995","type":"book_chapter","doi":"10.1007/978-1-4419-1229-9_16","author":[{"first_name":"Hannah","full_name":"Monyer, Hannah","last_name":"Monyer"},{"first_name":"Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","last_name":"Jonas","orcid":"0000-0001-5001-4804","full_name":"Jonas, Peter M"}],"date_updated":"2022-06-28T09:13:01Z","day":"01","date_published":"1995-01-01T00:00:00Z","language":[{"iso":"eng"}],"oa_version":"None","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","article_processing_charge":"No","main_file_link":[{"url":"https://link.springer.com/chapter/10.1007/978-1-4419-1229-9_16"}],"citation":{"ista":"Monyer H, Jonas PM. 1995.Polymerase chain reaction analysis of ion channel expression in single neurons of brain slices. In: Single-channel recording. , 357–373.","mla":"Monyer, Hannah, and Peter M. Jonas. “Polymerase Chain Reaction Analysis of Ion Channel Expression in Single Neurons of Brain Slices.” <i>Single-Channel Recording</i>, edited by Bert Sakmann and Erwin Neher, Plenum, 1995, pp. 357–73, doi:<a href=\"https://doi.org/10.1007/978-1-4419-1229-9_16\">10.1007/978-1-4419-1229-9_16</a>.","short":"H. Monyer, P.M. Jonas, in:, B. Sakmann, E. Neher (Eds.), Single-Channel Recording, Plenum, 1995, pp. 357–373.","ama":"Monyer H, Jonas PM. Polymerase chain reaction analysis of ion channel expression in single neurons of brain slices. In: Sakmann B, Neher E, eds. <i>Single-Channel Recording</i>. Plenum; 1995:357-373. doi:<a href=\"https://doi.org/10.1007/978-1-4419-1229-9_16\">10.1007/978-1-4419-1229-9_16</a>","apa":"Monyer, H., &#38; Jonas, P. M. (1995). Polymerase chain reaction analysis of ion channel expression in single neurons of brain slices. In B. Sakmann &#38; E. Neher (Eds.), <i>Single-channel recording</i> (pp. 357–373). Plenum. <a href=\"https://doi.org/10.1007/978-1-4419-1229-9_16\">https://doi.org/10.1007/978-1-4419-1229-9_16</a>","chicago":"Monyer, Hannah, and Peter M Jonas. “Polymerase Chain Reaction Analysis of Ion Channel Expression in Single Neurons of Brain Slices.” In <i>Single-Channel Recording</i>, edited by Bert Sakmann and Erwin Neher, 357–73. Plenum, 1995. <a href=\"https://doi.org/10.1007/978-1-4419-1229-9_16\">https://doi.org/10.1007/978-1-4419-1229-9_16</a>.","ieee":"H. Monyer and P. M. Jonas, “Polymerase chain reaction analysis of ion channel expression in single neurons of brain slices,” in <i>Single-channel recording</i>, B. Sakmann and E. Neher, Eds. Plenum, 1995, pp. 357–373."},"title":"Polymerase chain reaction analysis of ion channel expression in single neurons of brain slices","editor":[{"first_name":"Bert","full_name":"Sakmann, Bert","last_name":"Sakmann"},{"first_name":"Erwin","full_name":"Neher, Erwin","last_name":"Neher"}],"date_created":"2018-12-11T12:03:25Z","page":"357 - 373","publist_id":"2933","_id":"3454","abstract":[{"text":"The study of gene expression and regulation in the central nervous system (CNS) is a daunting task because of the diversity of neuronal phenotypes and the complexity of many protein classes. Molecular cloning revealed the presence of a large number of different protein families in the CNS, each comprising several members. Ligand-gated ion channels may serve as an example to illustrate this point (for review, see Unwin, 1993). Heterologous expression combined with electrophysiological analysis suggests that ligand-gated channels are multimeric proteins with functional properties depending on the subunit composition. Very little is known, however, about how the functional properties of the recombinant and native receptors relate to each other. Thus, it is of eminent importance to elucidate the subunit expression profile in different types of neurons in the CNS and to correlate this with the functional properties of the native receptors.","lang":"eng"}],"publisher":"Plenum","extern":"1","publication_status":"published","status":"public","month":"01","publication":"Single-channel recording","quality_controlled":"1"}]