[{"quality_controlled":"1","extern":"1","date_published":"2000-06-01T00:00:00Z","author":[{"first_name":"Nicholas H","last_name":"Barton","orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No","date_updated":"2023-04-18T15:01:01Z","doi":"10.1017/S0016672300239220","date_created":"2018-12-11T12:07:59Z","oa_version":"None","publist_id":"1814","publication":"Genetics Research","title":"Population genetics of multiple loci","publisher":"Cambridge University Press","citation":{"apa":"Barton, N. H. (2000). Population genetics of multiple loci. <i>Genetics Research</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/S0016672300239220\">https://doi.org/10.1017/S0016672300239220</a>","ieee":"N. H. Barton, “Population genetics of multiple loci,” <i>Genetics Research</i>, vol. 75, no. 3. Cambridge University Press, pp. 371–373, 2000.","chicago":"Barton, Nicholas H. “Population Genetics of Multiple Loci.” <i>Genetics Research</i>. Cambridge University Press, 2000. <a href=\"https://doi.org/10.1017/S0016672300239220\">https://doi.org/10.1017/S0016672300239220</a>.","short":"N.H. Barton, Genetics Research 75 (2000) 371–373.","mla":"Barton, Nicholas H. “Population Genetics of Multiple Loci.” <i>Genetics Research</i>, vol. 75, no. 3, Cambridge University Press, 2000, pp. 371–73, doi:<a href=\"https://doi.org/10.1017/S0016672300239220\">10.1017/S0016672300239220</a>.","ista":"Barton NH. 2000. Population genetics of multiple loci. Genetics Research. 75(3), 371–373.","ama":"Barton NH. Population genetics of multiple loci. <i>Genetics Research</i>. 2000;75(3):371-373. doi:<a href=\"https://doi.org/10.1017/S0016672300239220\">10.1017/S0016672300239220</a>"},"month":"06","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0016-6723"]},"status":"public","issue":"3","day":"01","_id":"4276","intvolume":"        75","main_file_link":[{"url":"https://www.cambridge.org/core/journals/genetics-research/article/population-genetics-of-multiple-loci-by-f-b-christiansen-wiley-series-in-mathematical-and-computational-biology-ed-s-levin-john-wiley-sons-1999-isbn-0-471-979791-365-pages-price-80-hardback/9F9E954479B9FB87B0A07250AD6AAD9C"}],"year":"2000","publication_status":"published","volume":75,"page":"371 - 373","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","type":"review"},{"month":"01","language":[{"iso":"eng"}],"day":"01","publication_status":"published","intvolume":"      1785","quality_controlled":"1","scopus_import":"1","article_processing_charge":"No","alternative_title":["LNCS"],"doi":"10.1007/3-540-46419-0_21","date_updated":"2023-04-18T13:11:07Z","date_published":"2000-01-01T00:00:00Z","author":[{"orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"last_name":"Rajamani","first_name":"Sriram","full_name":"Rajamani, Sriram"}],"conference":{"location":"Berlin, Germany","start_date":"2000-03-25","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","end_date":"2000-04-02"},"publication_identifier":{"isbn":["9783540672821"]},"citation":{"ama":"Henzinger TA, Rajamani S. Fair bisimulation. In: <i>Proceedings of the 6th International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>. Vol 1785. Springer; 2000:299-314. doi:<a href=\"https://doi.org/10.1007/3-540-46419-0_21\">10.1007/3-540-46419-0_21</a>","short":"T.A. Henzinger, S. Rajamani, in:, Proceedings of the 6th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Springer, 2000, pp. 299–314.","mla":"Henzinger, Thomas A., and Sriram Rajamani. “Fair Bisimulation.” <i>Proceedings of the 6th International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, vol. 1785, Springer, 2000, pp. 299–314, doi:<a href=\"https://doi.org/10.1007/3-540-46419-0_21\">10.1007/3-540-46419-0_21</a>.","ista":"Henzinger TA, Rajamani S. 2000. Fair bisimulation. Proceedings of the 6th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 1785, 299–314.","chicago":"Henzinger, Thomas A, and Sriram Rajamani. “Fair Bisimulation.” In <i>Proceedings of the 6th International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, 1785:299–314. Springer, 2000. <a href=\"https://doi.org/10.1007/3-540-46419-0_21\">https://doi.org/10.1007/3-540-46419-0_21</a>.","ieee":"T. A. Henzinger and S. Rajamani, “Fair bisimulation,” in <i>Proceedings of the 6th International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, Berlin, Germany, 2000, vol. 1785, pp. 299–314.","apa":"Henzinger, T. A., &#38; Rajamani, S. (2000). Fair bisimulation. In <i>Proceedings of the 6th International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i> (Vol. 1785, pp. 299–314). Berlin, Germany: Springer. <a href=\"https://doi.org/10.1007/3-540-46419-0_21\">https://doi.org/10.1007/3-540-46419-0_21</a>"},"acknowledgement":"This research was supported in part by the DARPA (NASA) grant NAG2-1214, the SRC contract 99-TJ-683.003, the MARCO grant 98-DT-660, the DARPA (MARCO) grant MDA972-99-1-0001, and the NSF CAREER award CCR-9501708.","status":"public","year":"2000","_id":"4433","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","type":"conference","volume":1785,"page":"299 - 314","extern":"1","abstract":[{"text":"Bisimulations enjoy numerous applications in the analysis of labeled transition systems. Many of these applications are based on two central observations: first, bisimilar systems satisfy the same branching-time properties; second, bisimilarity can be checked efficiently for finite-state systems. The local character of bisimulation, however, makes it difficult to address liveness concerns. Indeed, the definitions of fair bisimulation that have been proposed in the literature sacrifice locality, and with it, also efficient checkability. We put forward a new definition of fair bisimulation which does not suffer from this drawback.\r\nThe bisimilarity of two systems can be viewed in terms of a game played between a protagonist and an adversary. In each step of the infinite bisimulation game, the adversary chooses one system, makes a move, and the protagonist matches it with a move of the other system. Consistent with this game-based view, we call two fair transition systems bisimilar if in the bisimulation game, the infinite path produced in the first system is fair iff the infinite path produced in the second system is fair.\r\nWe show that this notion of fair bisimulation enjoys the following properties. First, fairly bisimilar systems satisfy the same formulas of the logics Fair-AFMC (the fair alternation-free μ-calculus) and Fair-CTL*. Therefore, fair bisimulations can serve as property-preserving abstractions for these logics and weaker ones, such as Fair-CTL and LTL. Indeed, Fair-AFMC provides an exact logical characterization of fair bisimilarity. Second, it can be checked in time polynomial in the number of states if two systems are fairly bisimilar. This is in stark contrast to all trace-based equivalences, which are traditionally used for addressing liveness but require exponential time for checking.","lang":"eng"}],"publist_id":"297","date_created":"2018-12-11T12:08:50Z","oa_version":"None","publisher":"Springer","publication":"Proceedings of the 6th International Conference on Tools and Algorithms for the Construction and Analysis of Systems","title":"Fair bisimulation"},{"intvolume":"      1790","publication_status":"published","language":[{"iso":"eng"}],"month":"01","day":"01","conference":{"end_date":"2000-03-25","name":"HSCC: Hybrid Systems - Computation and Control","start_date":"2000-03-23","location":"Pittsburgh, PA, USA"},"scopus_import":"1","quality_controlled":"1","author":[{"first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Raskin, Jean","last_name":"Raskin","first_name":"Jean"}],"date_published":"2000-01-01T00:00:00Z","date_updated":"2023-04-18T13:16:13Z","alternative_title":["LNCS"],"doi":"10.1007/3-540-46430-1_15","article_processing_charge":"No","_id":"4434","year":"2000","page":"145 - 159","volume":1790,"type":"conference","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","citation":{"ama":"Henzinger TA, Raskin J. Robust undecidability of timed and hybrid systems. In: <i>Proceedings of the 3rd International Workshop on Hybrid Systems</i>. Vol 1790. Springer; 2000:145-159. doi:<a href=\"https://doi.org/10.1007/3-540-46430-1_15\">10.1007/3-540-46430-1_15</a>","short":"T.A. Henzinger, J. Raskin, in:, Proceedings of the 3rd International Workshop on Hybrid Systems, Springer, 2000, pp. 145–159.","ista":"Henzinger TA, Raskin J. 2000. Robust undecidability of timed and hybrid systems. Proceedings of the 3rd International Workshop on Hybrid Systems. HSCC: Hybrid Systems - Computation and Control, LNCS, vol. 1790, 145–159.","mla":"Henzinger, Thomas A., and Jean Raskin. “Robust Undecidability of Timed and Hybrid Systems.” <i>Proceedings of the 3rd International Workshop on Hybrid Systems</i>, vol. 1790, Springer, 2000, pp. 145–59, doi:<a href=\"https://doi.org/10.1007/3-540-46430-1_15\">10.1007/3-540-46430-1_15</a>.","ieee":"T. A. Henzinger and J. Raskin, “Robust undecidability of timed and hybrid systems,” in <i>Proceedings of the 3rd International Workshop on Hybrid Systems</i>, Pittsburgh, PA, USA, 2000, vol. 1790, pp. 145–159.","chicago":"Henzinger, Thomas A, and Jean Raskin. “Robust Undecidability of Timed and Hybrid Systems.” In <i>Proceedings of the 3rd International Workshop on Hybrid Systems</i>, 1790:145–59. Springer, 2000. <a href=\"https://doi.org/10.1007/3-540-46430-1_15\">https://doi.org/10.1007/3-540-46430-1_15</a>.","apa":"Henzinger, T. A., &#38; Raskin, J. (2000). Robust undecidability of timed and hybrid systems. In <i>Proceedings of the 3rd International Workshop on Hybrid Systems</i> (Vol. 1790, pp. 145–159). Pittsburgh, PA, USA: Springer. <a href=\"https://doi.org/10.1007/3-540-46430-1_15\">https://doi.org/10.1007/3-540-46430-1_15</a>"},"publication_identifier":{"isbn":["9783540672593"]},"acknowledgement":"This research was supported in part by the DARPA (NASA) grant NAG2-1214, the DARPA (Wright-Patterson AFB) grant F33615-C-98-3614, the ARO MURI grant DAAH-04-96-1-0341, and the NSF CAREER award CCR-9501708. ","status":"public","oa_version":"None","date_created":"2018-12-11T12:08:50Z","publist_id":"298","title":"Robust undecidability of timed and hybrid systems","publication":"Proceedings of the 3rd International Workshop on Hybrid Systems","publisher":"Springer","abstract":[{"lang":"eng","text":"The algorithmic approach to the analysis of timed and hybrid systems is fundamentally limited by undecidability, of universality in the timed case (where all continuous variables are clocks), and of emptiness in the rectangular case (which includes drifting clocks). Traditional proofs of undecidability encode a single Turing computation by a single timed trajectory. These proofs have nurtured the hope that the introduction of “fuzziness” into timed and hybrid models (in the sense that a system cannot distinguish between trajectories that are sufficiently similar) may lead to decidability. We show that this is not the case, by sharpening both fundamental undecidability results. Besides the obvious blow our results deal to the algorithmic method, they also prove that the standard model of timed and hybrid systems, while not “robust” in its definition of trajectory acceptance (which is affected by tiny perturbations in the timing of events), is quite robust in its mathematical properties: the undecidability barriers are not affected by reasonable perturbations of the model."}],"extern":"1"},{"status":"public","acknowledgement":"This research was supported in part by the DARPA (NASA) grant NAG2-1214, the DARPA (Wright-Patterson AFB) grant F33615-C-98-3614, the MARCO grant 98-DT-660, the ARO MURI grant DAAH-04-96-1-0341, and the NSF CAREER award CCR-9501708.","citation":{"apa":"Henzinger, T. A., &#38; Majumdar, R. (2000). Symbolic model checking for rectangular hybrid systems. In <i>Proceedings of the 6th International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i> (Vol. 1785, pp. 142–156). Berlin, Germany: Springer. <a href=\"https://doi.org/10.1007/3-540-46419-0_11\">https://doi.org/10.1007/3-540-46419-0_11</a>","chicago":"Henzinger, Thomas A, and Ritankar Majumdar. “Symbolic Model Checking for Rectangular Hybrid Systems.” In <i>Proceedings of the 6th International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, 1785:142–56. Springer, 2000. <a href=\"https://doi.org/10.1007/3-540-46419-0_11\">https://doi.org/10.1007/3-540-46419-0_11</a>.","ieee":"T. A. Henzinger and R. Majumdar, “Symbolic model checking for rectangular hybrid systems,” in <i>Proceedings of the 6th International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, Berlin, Germany, 2000, vol. 1785, pp. 142–156.","ista":"Henzinger TA, Majumdar R. 2000. Symbolic model checking for rectangular hybrid systems. Proceedings of the 6th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 1785, 142–156.","mla":"Henzinger, Thomas A., and Ritankar Majumdar. “Symbolic Model Checking for Rectangular Hybrid Systems.” <i>Proceedings of the 6th International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, vol. 1785, Springer, 2000, pp. 142–56, doi:<a href=\"https://doi.org/10.1007/3-540-46419-0_11\">10.1007/3-540-46419-0_11</a>.","short":"T.A. Henzinger, R. Majumdar, in:, Proceedings of the 6th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Springer, 2000, pp. 142–156.","ama":"Henzinger TA, Majumdar R. Symbolic model checking for rectangular hybrid systems. In: <i>Proceedings of the 6th International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>. Vol 1785. Springer; 2000:142-156. doi:<a href=\"https://doi.org/10.1007/3-540-46419-0_11\">10.1007/3-540-46419-0_11</a>"},"publication_identifier":{"isbn":["9783540672821"]},"page":"142 - 156","volume":1785,"type":"conference","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","_id":"4435","year":"2000","abstract":[{"text":"An important case of hybrid systems are the rectangular automata. First, rectangular dynamics can naturally and arbitrarily closely approximate more general, nonlinear dynamics. Second, rectangular automata are the most general type of hybrid systems for which model checking -in particular, Ltl model checking- is decidable. However, on one hand, the original proofs of decidability did not suggest practical algorithms and, on the other hand, practical symbolic model-checking procedures -such as those implemented in HyTech- were not known to terminate on rectangular automata. We remedy this unsatisfactory situation: we present a symbolic method for Ltl model checking which can be performed by HyTech and is guaranteed to terminate on all rectangular automata. We do so by proving that our method for symbolic Ltl model checking terminates on an infinite-state transition system if the trace-equivalence relation of the system has finite index, which is the case for all rectangular automata.","lang":"eng"}],"extern":"1","title":"Symbolic model checking for rectangular hybrid systems","publication":"Proceedings of the 6th International Conference on Tools and Algorithms for the Construction and Analysis of Systems","publisher":"Springer","oa_version":"None","date_created":"2018-12-11T12:08:50Z","publist_id":"293","day":"01","language":[{"iso":"eng"}],"month":"01","intvolume":"      1785","publication_status":"published","date_published":"2000-01-01T00:00:00Z","author":[{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724"},{"full_name":"Majumdar, Ritankar","first_name":"Ritankar","last_name":"Majumdar"}],"date_updated":"2023-04-18T13:08:09Z","alternative_title":["LNCS"],"doi":"10.1007/3-540-46419-0_11","article_processing_charge":"No","scopus_import":"1","quality_controlled":"1","conference":{"location":"Berlin, Germany","start_date":"2000-03-25","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","end_date":"2000-04-02"}},{"date_published":"2000-01-01T00:00:00Z","author":[{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"first_name":"Ritankar","last_name":"Majumdar","full_name":"Majumdar, Ritankar"}],"alternative_title":["LNCS"],"date_updated":"2023-04-18T13:02:39Z","doi":"10.1007/3-540-46541-3_2","article_processing_charge":"No","scopus_import":"1","quality_controlled":"1","conference":{"name":"STACS: Theoretical Aspects of Computer Science","end_date":"2000-02-19","location":"Lille, France","start_date":"2000-02-17"},"day":"01","language":[{"iso":"eng"}],"month":"01","intvolume":"      1770","publication_status":"published","abstract":[{"text":"We define five increasingly comprehensive classes of infinite-state systems, called STS1–5, whose state spaces have finitary structure. For four of these classes, we provide examples from hybrid systems.\r\nSTS1 These are the systems with finite bisimilarity quotients. They can be analyzed symbolically by (1) iterating the predecessor and boolean operations starting from a finite set of observable state sets, and (2) terminating when no new state sets are generated. This enables model checking of the μ-calculus.\r\nSTS2 These are the systems with finite similarity quotients. They can be analyzed symbolically by iterating the predecessor and positive boolean operations. This enables model checking of the existential and universal fragments of the μ-calculus.\r\nSTS3 These are the systems with finite trace-equivalence quotients. They can be analyzed symbolically by iterating the predecessor operation and a restricted form of positive boolean operations (intersection is restricted to intersection with observables). This enables model checking of linear temporal logic.\r\nSTS4 These are the systems with finite distance-equivalence quotients (two states are equivalent if for every distance d, the same observables can be reached in d transitions). The systems in this class can be analyzed symbolically by iterating the predecessor operation and terminating when no new state sets are generated. This enables model checking of the existential conjunction-free and universal disjunction-free fragments of the μ-calculus.\r\nSTS5 These are the systems with finite bounded-reachability quotients (two states are equivalent if for every distance d, the same observables can be reached in d or fewer transitions). The systems in this class can be analyzed symbolically by iterating the predecessor operation and terminating when no new states are encountered. This enables model checking of reachability properties.","lang":"eng"}],"extern":"1","title":"A classification of symbolic transition systems","publication":"Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science","publisher":"Springer","oa_version":"None","date_created":"2018-12-11T12:08:51Z","publist_id":"292","status":"public","acknowledgement":"This research was supported in part by the DARPA (NASA) grant NAG2-1214, the DARPA (Wright-Patterson AFB) grant F33615-C-98-3614, the MARCO grant 98-DT-660, the ARO MURI grant DAAH-04-96-1-0341, and the NSF CAREER award CCR-9501708.","citation":{"ama":"Henzinger TA, Majumdar R. A classification of symbolic transition systems. In: <i>Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science</i>. Vol 1770. Springer; 2000:13-34. doi:<a href=\"https://doi.org/10.1007/3-540-46541-3_2\">10.1007/3-540-46541-3_2</a>","short":"T.A. Henzinger, R. Majumdar, in:, Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science, Springer, 2000, pp. 13–34.","ista":"Henzinger TA, Majumdar R. 2000. A classification of symbolic transition systems. Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science. STACS: Theoretical Aspects of Computer Science, LNCS, vol. 1770, 13–34.","mla":"Henzinger, Thomas A., and Ritankar Majumdar. “A Classification of Symbolic Transition Systems.” <i>Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science</i>, vol. 1770, Springer, 2000, pp. 13–34, doi:<a href=\"https://doi.org/10.1007/3-540-46541-3_2\">10.1007/3-540-46541-3_2</a>.","chicago":"Henzinger, Thomas A, and Ritankar Majumdar. “A Classification of Symbolic Transition Systems.” In <i>Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science</i>, 1770:13–34. Springer, 2000. <a href=\"https://doi.org/10.1007/3-540-46541-3_2\">https://doi.org/10.1007/3-540-46541-3_2</a>.","ieee":"T. A. Henzinger and R. Majumdar, “A classification of symbolic transition systems,” in <i>Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science</i>, Lille, France, 2000, vol. 1770, pp. 13–34.","apa":"Henzinger, T. A., &#38; Majumdar, R. (2000). A classification of symbolic transition systems. In <i>Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science</i> (Vol. 1770, pp. 13–34). Lille, France: Springer. <a href=\"https://doi.org/10.1007/3-540-46541-3_2\">https://doi.org/10.1007/3-540-46541-3_2</a>"},"publication_identifier":{"isbn":["9783540671411"]},"page":"13 - 34","volume":1770,"type":"conference","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","_id":"4439","year":"2000"},{"acknowledgement":"This research was supported in part by the DARPA (NASA) grant NAG2-1214, the DARPA (Wright-Patterson AFB) grant F33615-C-98-3614, the ARO MURI grant DAAH-04-96-1-0341, and the NSF CAREER award CCR-9501708.","status":"public","citation":{"ista":"Henzinger TA, Horowitz B, Majumdar R, Wong Toi H. 2000. Beyond HyTech: Hybrid systems analysis using interval numerical methods. Proceedings of the 3rd International Workshop on Hybrid Systems. HSCC: Hybrid Systems - Computation and Control, LNCS, vol. 1790, 130–144.","short":"T.A. Henzinger, B. Horowitz, R. Majumdar, H. Wong Toi, in:, Proceedings of the 3rd International Workshop on Hybrid Systems, Springer, 2000, pp. 130–144.","mla":"Henzinger, Thomas A., et al. “Beyond HyTech: Hybrid Systems Analysis Using Interval Numerical Methods.” <i>Proceedings of the 3rd International Workshop on Hybrid Systems</i>, vol. 1790, Springer, 2000, pp. 130–44, doi:<a href=\"https://doi.org/10.1007/3-540-46430-1_14\">10.1007/3-540-46430-1_14</a>.","ama":"Henzinger TA, Horowitz B, Majumdar R, Wong Toi H. Beyond HyTech: Hybrid systems analysis using interval numerical methods. In: <i>Proceedings of the 3rd International Workshop on Hybrid Systems</i>. Vol 1790. Springer; 2000:130-144. doi:<a href=\"https://doi.org/10.1007/3-540-46430-1_14\">10.1007/3-540-46430-1_14</a>","apa":"Henzinger, T. A., Horowitz, B., Majumdar, R., &#38; Wong Toi, H. (2000). Beyond HyTech: Hybrid systems analysis using interval numerical methods. In <i>Proceedings of the 3rd International Workshop on Hybrid Systems</i> (Vol. 1790, pp. 130–144). Pittsburgh, PA, USA: Springer. <a href=\"https://doi.org/10.1007/3-540-46430-1_14\">https://doi.org/10.1007/3-540-46430-1_14</a>","chicago":"Henzinger, Thomas A, Benjamin Horowitz, Ritankar Majumdar, and Howard Wong Toi. “Beyond HyTech: Hybrid Systems Analysis Using Interval Numerical Methods.” In <i>Proceedings of the 3rd International Workshop on Hybrid Systems</i>, 1790:130–44. Springer, 2000. <a href=\"https://doi.org/10.1007/3-540-46430-1_14\">https://doi.org/10.1007/3-540-46430-1_14</a>.","ieee":"T. A. Henzinger, B. Horowitz, R. Majumdar, and H. Wong Toi, “Beyond HyTech: Hybrid systems analysis using interval numerical methods,” in <i>Proceedings of the 3rd International Workshop on Hybrid Systems</i>, Pittsburgh, PA, USA, 2000, vol. 1790, pp. 130–144."},"publication_identifier":{"isbn":["9783540672593"]},"page":"130 - 144","volume":1790,"type":"conference","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","_id":"4481","year":"2000","abstract":[{"lang":"eng","text":"Since hybrid embedded systems are pervasive and often safety-critical, guarantees about their correct performance are desirable. The hybrid systems model checker HyTech provides such guarantees and has successfully verified some systems. However, HyTech severely restricts the continuous dynamics of the system being analyzed and, therefore, often forces the use of prohibitively expensive discrete and polyhedral abstractions. We have designed a new algorithm, which is capable of directly verifying hybrid systems with general continuous dynamics, such as linear and nonlinear differential equations. The new algorithm conservatively overapproximates the reachable states of a hybrid automaton by using interval numerical methods. Interval numerical methods return sets of points that enclose the true result of numerical computation and, thus, avoid distortions due to the accumulation of round-off errors. We have implemented the new algorithm in a successor tool to HyTech called HyperTech. We consider three examples: a thermostat with delay, a two-tank water system, and an air-traffic collision avoidance protocol. HyperTech enables the direct, fully automatic analysis of these systems, which is also more accurate than the use of polyhedral abstractions."}],"extern":"1","title":"Beyond HyTech: Hybrid systems analysis using interval numerical methods","publication":"Proceedings of the 3rd International Workshop on Hybrid Systems","publisher":"Springer","oa_version":"None","date_created":"2018-12-11T12:09:04Z","publist_id":"247","day":"01","language":[{"iso":"eng"}],"month":"01","intvolume":"      1790","publication_status":"published","date_published":"2000-01-01T00:00:00Z","author":[{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"full_name":"Horowitz, Benjamin","last_name":"Horowitz","first_name":"Benjamin"},{"first_name":"Ritankar","last_name":"Majumdar","full_name":"Majumdar, Ritankar"},{"full_name":"Wong Toi, Howard","first_name":"Howard","last_name":"Wong Toi"}],"date_updated":"2023-04-18T12:44:52Z","doi":"10.1007/3-540-46430-1_14","alternative_title":["LNCS"],"article_processing_charge":"No","scopus_import":"1","quality_controlled":"1","conference":{"name":"HSCC: Hybrid Systems - Computation and Control","end_date":"2000-03-25","location":"Pittsburgh, PA, USA","start_date":"2000-03-23"}},{"publisher":"Springer","publication":"Proceedings of the 7th International Symposium on Static Analysis","title":"Abstract interpretation of game properties","publist_id":"248","date_created":"2018-12-11T12:09:04Z","oa_version":"None","extern":"1","abstract":[{"lang":"eng","text":"We apply the theory of abstract interpretation to the verification of game properties for reactive systems. Unlike properties expressed in standard temporal logics, game properties can distinguish adversarial from collaborative relationships between the processes of a concurrent program, or the components of a parallel system. We consider two-player concurrent games –say, component vs. environment– and specify properties of such games –say, the component has a winning strategy to obtain a resource, no matter how the environment behaves– in the alternating-time μ-calculus (Aμ ). A sound abstraction of such a game must at the same time restrict the behaviors of the component and increase the behaviors of the environment: if a less powerful component can win against a more powerful environment, then surely the original component can win against the original environment.\r\nWe formalize the concrete semantics of a concurrent game in terms of controllable and uncontrollable predecessor predicates, which suffice for model checking all Aμ properties by applying boolean operations and iteration. We then define the abstract semantics of a concurrent game in terms of abstractions for the controllable and uncontrollable predecessor predicates. This allows us to give general characterizations for the soundness and completeness of abstract games with respect to Aμ properties. We also present a simple programming language for multi-process programs, and show how approximations of the maximal abstraction (w.r.t. Aμ properties) can be obtained from the program text. We apply the theory to two practical verification examples, a communication protocol developed at the Berkeley Wireless Research Center, and a protocol converter. In the wireless protocol, both the use of a game property for specification and the use of abstraction for automatic verification were instrumental to uncover a subtle bug."}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","type":"conference","volume":1824,"page":"220 - 239","year":"2000","_id":"4482","status":"public","acknowledgement":"This research was supported in part by the DARPA (NASA) grant NAG2-1214, the DARPA (Wright-Patterson AFB) grant F33615-C-98-3614, the MARCO grant 98-DT-660, the ARO MURI grant DAAH-04-96-1-0341, and the NSF CAREER award CCR-9501708.","publication_identifier":{"isbn":["9783540676683"]},"citation":{"mla":"Henzinger, Thomas A., et al. “Abstract Interpretation of Game Properties.” <i>Proceedings of the 7th International Symposium on Static Analysis</i>, vol. 1824, Springer, 2000, pp. 220–39, doi:<a href=\"https://doi.org/10.1007/978-3-540-45099-3_12\">10.1007/978-3-540-45099-3_12</a>.","ista":"Henzinger TA, Majumdar R, Mang F, Raskin J. 2000. Abstract interpretation of game properties. Proceedings of the 7th International Symposium on Static Analysis. SAS: Static Analysis Symposium, LNCS, vol. 1824, 220–239.","short":"T.A. Henzinger, R. Majumdar, F. Mang, J. Raskin, in:, Proceedings of the 7th International Symposium on Static Analysis, Springer, 2000, pp. 220–239.","ama":"Henzinger TA, Majumdar R, Mang F, Raskin J. Abstract interpretation of game properties. In: <i>Proceedings of the 7th International Symposium on Static Analysis</i>. Vol 1824. Springer; 2000:220-239. doi:<a href=\"https://doi.org/10.1007/978-3-540-45099-3_12\">10.1007/978-3-540-45099-3_12</a>","apa":"Henzinger, T. A., Majumdar, R., Mang, F., &#38; Raskin, J. (2000). Abstract interpretation of game properties. In <i>Proceedings of the 7th International Symposium on Static Analysis</i> (Vol. 1824, pp. 220–239). Santa Barbara, CA, USA: Springer. <a href=\"https://doi.org/10.1007/978-3-540-45099-3_12\">https://doi.org/10.1007/978-3-540-45099-3_12</a>","chicago":"Henzinger, Thomas A, Ritankar Majumdar, Freddy Mang, and Jean Raskin. “Abstract Interpretation of Game Properties.” In <i>Proceedings of the 7th International Symposium on Static Analysis</i>, 1824:220–39. Springer, 2000. <a href=\"https://doi.org/10.1007/978-3-540-45099-3_12\">https://doi.org/10.1007/978-3-540-45099-3_12</a>.","ieee":"T. A. Henzinger, R. Majumdar, F. Mang, and J. Raskin, “Abstract interpretation of game properties,” in <i>Proceedings of the 7th International Symposium on Static Analysis</i>, Santa Barbara, CA, USA, 2000, vol. 1824, pp. 220–239."},"conference":{"name":"SAS: Static Analysis Symposium","end_date":"2000-07-06","location":"Santa Barbara, CA, USA","start_date":"2000-06-29"},"article_processing_charge":"No","alternative_title":["LNCS"],"doi":"10.1007/978-3-540-45099-3_12","date_updated":"2023-04-18T12:49:56Z","date_published":"2000-01-01T00:00:00Z","author":[{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724"},{"last_name":"Majumdar","first_name":"Ritankar","full_name":"Majumdar, Ritankar"},{"full_name":"Mang, Freddy","first_name":"Freddy","last_name":"Mang"},{"first_name":"Jean","last_name":"Raskin","full_name":"Raskin, Jean"}],"quality_controlled":"1","scopus_import":"1","publication_status":"published","intvolume":"      1824","day":"01","month":"01","language":[{"iso":"eng"}]},{"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","type":"conference","page":"245 - 252","year":"2000","publication_status":"published","_id":"4483","day":"01","status":"public","acknowledgement":"Supported in part by DARPA Information Technology Office, by the MARC0 Gigascale Silicon Research Center, and by the National Science Foundation. ","month":"01","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["0780364457"]},"citation":{"chicago":"Henzinger, Thomas A, Shaz Qadeer, and Sriram Rajamani. “Decomposing Refinement Proofs Using Assume-Guarantee Reasoning.” In <i>Proceedings of the 2000 International Conference on Computer-Aided Design</i>, 245–52. IEEE, 2000. <a href=\"https://doi.org/10.1109/ICCAD.2000.896481\">https://doi.org/10.1109/ICCAD.2000.896481</a>.","ieee":"T. A. Henzinger, S. Qadeer, and S. Rajamani, “Decomposing refinement proofs using assume-guarantee reasoning,” in <i>Proceedings of the 2000 International Conference on Computer-Aided Design</i>, San Jose, CA, USA, 2000, pp. 245–252.","apa":"Henzinger, T. A., Qadeer, S., &#38; Rajamani, S. (2000). Decomposing refinement proofs using assume-guarantee reasoning. In <i>Proceedings of the 2000 International Conference on Computer-Aided Design</i> (pp. 245–252). San Jose, CA, USA: IEEE. <a href=\"https://doi.org/10.1109/ICCAD.2000.896481\">https://doi.org/10.1109/ICCAD.2000.896481</a>","ama":"Henzinger TA, Qadeer S, Rajamani S. Decomposing refinement proofs using assume-guarantee reasoning. In: <i>Proceedings of the 2000 International Conference on Computer-Aided Design</i>. IEEE; 2000:245-252. doi:<a href=\"https://doi.org/10.1109/ICCAD.2000.896481\">10.1109/ICCAD.2000.896481</a>","mla":"Henzinger, Thomas A., et al. “Decomposing Refinement Proofs Using Assume-Guarantee Reasoning.” <i>Proceedings of the 2000 International Conference on Computer-Aided Design</i>, IEEE, 2000, pp. 245–52, doi:<a href=\"https://doi.org/10.1109/ICCAD.2000.896481\">10.1109/ICCAD.2000.896481</a>.","ista":"Henzinger TA, Qadeer S, Rajamani S. 2000. Decomposing refinement proofs using assume-guarantee reasoning. Proceedings of the 2000 International Conference on Computer-Aided Design. ICCAD: Computer-Aided Design, 245–252.","short":"T.A. Henzinger, S. Qadeer, S. Rajamani, in:, Proceedings of the 2000 International Conference on Computer-Aided Design, IEEE, 2000, pp. 245–252."},"publisher":"IEEE","publication":"Proceedings of the 2000 International Conference on Computer-Aided Design","title":"Decomposing refinement proofs using assume-guarantee reasoning","publist_id":"249","date_created":"2018-12-11T12:09:05Z","conference":{"start_date":"2000-11-05","location":"San Jose, CA, USA","end_date":"2000-11-09","name":"ICCAD: Computer-Aided Design"},"oa_version":"None","article_processing_charge":"No","doi":"10.1109/ICCAD.2000.896481","date_updated":"2023-04-18T12:57:52Z","date_published":"2000-01-01T00:00:00Z","author":[{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724"},{"full_name":"Qadeer, Shaz","last_name":"Qadeer","first_name":"Shaz"},{"last_name":"Rajamani","first_name":"Sriram","full_name":"Rajamani, Sriram"}],"extern":"1","quality_controlled":"1","abstract":[{"text":"Model-checking algorithms can be used to verify, formally and automatically, if a low-level description of a design conforms with a high-level description. However, for designs with very large state spaces, prior to the application of an algorithm, the refinement-checking task needs to be decomposed into subtasks of manageable complexity. It is natural to decompose the task following the component structure of the design. However, an individual component often does not satisfy its requirements unless the component is put into the right context, which constrains the inputs to the component. Thus, in order to verify each component individually, we need to make assumptions about its inputs, which are provided by the other components of the design. This reasoning is circular: component A is verified under the assumption that context B behaves correctly, and symmetrically, B is verified assuming the correctness of A. The assume-guarantee paradigm provides a systematic theory and methodology for ensuring the soundness of the circular style of postulating and discharging assumptions in component-based reasoning.We give a tutorial introduction to the assume-guarantee paradigm for decomposing refinement-checking tasks. To illustrate the method, we step in detail through the formal verification of a processor pipeline against an instruction set architecture. In this example, the verification of a three-stage pipeline is broken up into three subtasks, one for each stage of the pipeline.","lang":"eng"}]},{"_id":"4512","year":"2000","volume":1872,"page":"549 - 563","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","type":"conference","citation":{"mla":"Henzinger, Thomas A. “Masaccio: A Formal Model for Embedded Components.” <i>Proceedings of the 1st International Conference on Theoretical Computer Science </i>, vol. 1872, Springer, 2000, pp. 549–63, doi:<a href=\"https://doi.org/10.1007/3-540-44929-9_38\">10.1007/3-540-44929-9_38</a>.","short":"T.A. Henzinger, in:, Proceedings of the 1st International Conference on Theoretical Computer Science , Springer, 2000, pp. 549–563.","ista":"Henzinger TA. 2000. Masaccio: A formal model for embedded components. Proceedings of the 1st International Conference on Theoretical Computer Science . TCS: Theoretical Computer Science, LNCS, vol. 1872, 549–563.","ama":"Henzinger TA. Masaccio: A formal model for embedded components. In: <i>Proceedings of the 1st International Conference on Theoretical Computer Science </i>. Vol 1872. Springer; 2000:549-563. doi:<a href=\"https://doi.org/10.1007/3-540-44929-9_38\">10.1007/3-540-44929-9_38</a>","apa":"Henzinger, T. A. (2000). Masaccio: A formal model for embedded components. In <i>Proceedings of the 1st International Conference on Theoretical Computer Science </i> (Vol. 1872, pp. 549–563). Sendai, Japan: Springer. <a href=\"https://doi.org/10.1007/3-540-44929-9_38\">https://doi.org/10.1007/3-540-44929-9_38</a>","ieee":"T. A. Henzinger, “Masaccio: A formal model for embedded components,” in <i>Proceedings of the 1st International Conference on Theoretical Computer Science </i>, Sendai, Japan, 2000, vol. 1872, pp. 549–563.","chicago":"Henzinger, Thomas A. “Masaccio: A Formal Model for Embedded Components.” In <i>Proceedings of the 1st International Conference on Theoretical Computer Science </i>, 1872:549–63. Springer, 2000. <a href=\"https://doi.org/10.1007/3-540-44929-9_38\">https://doi.org/10.1007/3-540-44929-9_38</a>."},"publication_identifier":{"isbn":["9783540678236"]},"status":"public","acknowledgement":"This research was supported in part by the DARPA grants NAG2-1214 and F33615-C-98-3614, and by the MARCO grant 98-DT-660.","date_created":"2018-12-11T12:09:14Z","oa_version":"None","publist_id":"215","publication":"Proceedings of the 1st International Conference on Theoretical Computer Science ","title":"Masaccio: A formal model for embedded components","publisher":"Springer","abstract":[{"text":"Masaccio is a formal model for hybrid dynamical systems which are built from atomic discrete components (difference equations) and atomic continuous components (differential equations) by parallel and serial composition, arbitrarily nested. Each system component consists of an interface, which determines the possible ways of using the component, and a set of executions, which define the possible behaviors of the component in real time.\r\nVersion 1.0 (May 2000).\r\n","lang":"eng"}],"extern":"1","intvolume":"      1872","publication_status":"published","month":"01","language":[{"iso":"eng"}],"day":"01","conference":{"location":"Sendai, Japan","start_date":"2000-08-17","name":"TCS: Theoretical Computer Science","end_date":"2000-08-19"},"scopus_import":"1","quality_controlled":"1","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","first_name":"Thomas A"}],"date_published":"2000-01-01T00:00:00Z","article_processing_charge":"No","doi":"10.1007/3-540-44929-9_38","alternative_title":["LNCS"],"date_updated":"2023-04-13T13:48:08Z"},{"year":"2000","_id":"4513","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","type":"book_chapter","volume":170,"page":"265 - 292","publication_identifier":{"isbn":["9783642596155"]},"citation":{"apa":"Henzinger, T. A. (2000). The theory of hybrid automata. In M. Inan &#38; R. Kurshan (Eds.), <i>Verification of Digital and Hybrid Systems</i> (Vol. 170, pp. 265–292). Springer. <a href=\"https://doi.org/10.1007/978-3-642-59615-5\">https://doi.org/10.1007/978-3-642-59615-5</a>","chicago":"Henzinger, Thomas A. “The Theory of Hybrid Automata.” In <i>Verification of Digital and Hybrid Systems</i>, edited by M. Inan and Robert Kurshan, 170:265–92. Springer, 2000. <a href=\"https://doi.org/10.1007/978-3-642-59615-5\">https://doi.org/10.1007/978-3-642-59615-5</a>.","ieee":"T. A. Henzinger, “The theory of hybrid automata,” in <i>Verification of Digital and Hybrid Systems</i>, vol. 170, M. Inan and R. Kurshan, Eds. Springer, 2000, pp. 265–292.","short":"T.A. Henzinger, in:, M. Inan, R. Kurshan (Eds.), Verification of Digital and Hybrid Systems, Springer, 2000, pp. 265–292.","mla":"Henzinger, Thomas A. “The Theory of Hybrid Automata.” <i>Verification of Digital and Hybrid Systems</i>, edited by M. Inan and Robert Kurshan, vol. 170, Springer, 2000, pp. 265–92, doi:<a href=\"https://doi.org/10.1007/978-3-642-59615-5\">10.1007/978-3-642-59615-5</a>.","ista":"Henzinger TA. 2000.The theory of hybrid automata. In: Verification of Digital and Hybrid Systems. NATO ASI Series F: Computer and Systems Sciences, vol. 170, 265–292.","ama":"Henzinger TA. The theory of hybrid automata. In: Inan M, Kurshan R, eds. <i>Verification of Digital and Hybrid Systems</i>. Vol 170. Springer; 2000:265-292. doi:<a href=\"https://doi.org/10.1007/978-3-642-59615-5\">10.1007/978-3-642-59615-5</a>"},"acknowledgement":"This research was supported in part by the Office of Naval Research Young Investigator award N00014-95-1-0520, by the National Science Foundation CAREER award CCR-9501708, by the National Science Foundation grant CR9504469, by the Air Force Office of Scientific Research contract F49620-93-1-0056, by the Army Research Office MURI grant DAAH-04-96-1-0341, by the Advanced Research Projects Agency grant NAG2-892, and by the Semiconductor Research Corporation contract 96-DC-324.036. ","status":"public","publist_id":"216","date_created":"2018-12-11T12:09:14Z","oa_version":"None","publisher":"Springer","publication":"Verification of Digital and Hybrid Systems","title":"The theory of hybrid automata","extern":"1","abstract":[{"text":"A hybrid automaton is a formal model for a mixed discrete-continuous system. We classify hybrid automata according to what questions about their behavior can be answered algorithmically. The classification reveals structure on mixed discrete-continuous state spaces that was previously studied on purely discrete state spaces only. In particular, various classes of hybrid automata induce finitary trace equivalence (or similarity, or bisimilarity) relations on an uncountable state space, thus permitting the application of various model-checking techniques that were originally developed for finitestate systems. ","lang":"eng"}],"publication_status":"published","intvolume":"       170","month":"04","language":[{"iso":"eng"}],"day":"28","quality_controlled":"1","scopus_import":"1","article_processing_charge":"No","doi":"10.1007/978-3-642-59615-5","alternative_title":["NATO ASI Series F: Computer and Systems Sciences"],"date_updated":"2023-04-18T12:37:17Z","date_published":"2000-04-28T00:00:00Z","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","first_name":"Thomas A"}],"editor":[{"full_name":"Inan, M.","last_name":"Inan","first_name":"M."},{"first_name":"Robert","last_name":"Kurshan","full_name":"Kurshan, Robert"}]},{"_id":"2591","year":"1999","volume":259,"page":"119 - 122","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","type":"journal_article","citation":{"mla":"Kummer, Wolfgang, et al. “Smooth Muscle Cells Are the Site of Neurokinin-1 Receptor Localization in the Arterial Supply of the Rat Sciatic Nerve.” <i>Neuroscience Letters</i>, vol. 259, no. 2, Elsevier, 1999, pp. 119–22, doi:<a href=\"https://doi.org/10.1016/S0304-3940(98)00926-4\">10.1016/S0304-3940(98)00926-4</a>.","ista":"Kummer W, Shigemoto R, Haberberger R. 1999. Smooth muscle cells are the site of neurokinin-1 receptor localization in the arterial supply of the rat sciatic nerve. Neuroscience Letters. 259(2), 119–122.","short":"W. Kummer, R. Shigemoto, R. Haberberger, Neuroscience Letters 259 (1999) 119–122.","ama":"Kummer W, Shigemoto R, Haberberger R. Smooth muscle cells are the site of neurokinin-1 receptor localization in the arterial supply of the rat sciatic nerve. <i>Neuroscience Letters</i>. 1999;259(2):119-122. doi:<a href=\"https://doi.org/10.1016/S0304-3940(98)00926-4\">10.1016/S0304-3940(98)00926-4</a>","apa":"Kummer, W., Shigemoto, R., &#38; Haberberger, R. (1999). Smooth muscle cells are the site of neurokinin-1 receptor localization in the arterial supply of the rat sciatic nerve. <i>Neuroscience Letters</i>. Elsevier. <a href=\"https://doi.org/10.1016/S0304-3940(98)00926-4\">https://doi.org/10.1016/S0304-3940(98)00926-4</a>","ieee":"W. Kummer, R. Shigemoto, and R. Haberberger, “Smooth muscle cells are the site of neurokinin-1 receptor localization in the arterial supply of the rat sciatic nerve,” <i>Neuroscience Letters</i>, vol. 259, no. 2. Elsevier, pp. 119–122, 1999.","chicago":"Kummer, Wolfgang, Ryuichi Shigemoto, and Rainer Haberberger. “Smooth Muscle Cells Are the Site of Neurokinin-1 Receptor Localization in the Arterial Supply of the Rat Sciatic Nerve.” <i>Neuroscience Letters</i>. Elsevier, 1999. <a href=\"https://doi.org/10.1016/S0304-3940(98)00926-4\">https://doi.org/10.1016/S0304-3940(98)00926-4</a>."},"publication_identifier":{"issn":["0304-3940"]},"acknowledgement":"The skillful technical assistance of Ms. T. Fischbach and Ms. K. Michael and the secretarial help of Ms. P. Berger are gratefully appreciated.","status":"public","issue":"2","article_type":"original","external_id":{"pmid":["10025572"]},"date_created":"2018-12-11T11:58:33Z","oa_version":"None","publist_id":"4307","publication":"Neuroscience Letters","title":"Smooth muscle cells are the site of neurokinin-1 receptor localization in the arterial supply of the rat sciatic nerve","publisher":"Elsevier","abstract":[{"text":"The occurrence and distribution of the preferred receptor for the neuropeptide, substance P (SP), the neurokinin-1 receptor (NK1R) was investigated in the vascular supply of the rat sciatic nerve. Messenger RNA for NK1R was demonstrated by RT-PCR in the epineurial layer where the majority of small arteries and arterioles feeding the endoneurial vasculature are located. Immunoreactivity to NK1R-protein was localized on the smooth muscle cells of these arterial vessels by means of immunofluorescence using a polyclonal NK1R antiserum. This muscular localization of NK1R explains the previously reported [Zochodne, D.W. and Ho, L.T., J. Physiol. 444 (1991) 615- 630] moderate vasoconstrictor rather than vasodilator effects of SP in this vascular bed.","lang":"eng"}],"extern":"1","intvolume":"       259","publication_status":"published","month":"01","language":[{"iso":"eng"}],"pmid":1,"day":"08","scopus_import":"1","quality_controlled":"1","date_published":"1999-01-08T00:00:00Z","author":[{"full_name":"Kummer, Wolfgang","last_name":"Kummer","first_name":"Wolfgang"},{"full_name":"Shigemoto, Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","first_name":"Ryuichi","orcid":"0000-0001-8761-9444","last_name":"Shigemoto"},{"full_name":"Haberberger, Rainer","first_name":"Rainer","last_name":"Haberberger"}],"article_processing_charge":"No","date_updated":"2023-03-27T10:11:02Z","doi":"10.1016/S0304-3940(98)00926-4"},{"date_created":"2018-12-11T11:58:33Z","oa_version":"Published Version","publist_id":"4306","publication":"Journal of Neuroscience","title":"Metabotropic glutamate receptor subtype 7 ablation causes deficit in fear response and conditioned taste aversion","publisher":"Society for Neuroscience","abstract":[{"lang":"eng","text":"Metabotropic glutamate receptors (mGluRs) consist of eight different subtypes and exert their effects or second messengers and ion channels via G- proteins. The function of individual mGluR subtypes in the CNS, however, largely remains to be clarified. We examined the fear response of freezing after electric shock in wild-type and mGluR7(-/-) knockout littermates. Wild- type mice displayed freezing immediately after and 1 d after footshock. In comparison, mGluR7(-/-) knockout mice showed significantly reduced levels in both immediate postshock and delayed freezing responses. However, the knockout mice exhibited no abnormalities in pain sensitivity and locomotor activity. To further examine amygdala-dependent behavior, we performed conditioned taste aversion (CTA) experiments. In wild-type mice, the administration of saccharin followed by intraperitoneal injection of the malaise-inducing agent LiCl resulted in an association between saccharin and LiCl. This association caused strong CTA toward saccharin n contrast, mGluR7(-/-) knockout mice failed to associate between the taste and the negative reinforcer in CTA experiments. Again, the knockout mice showed no abnormalities in taste preference and in the sensitivity to LiCl toxicity. These results indicate that mGluR7 deficiency causes an impairment of two distinct amygdala-dependent behavioral paradigms. Immunohistochemical and immunoelectron-microscopic analyses showed that mGluR7 is highly expressed in amygdala and preferentially localized at the presynaptic axon terminals of glutamatergic neurons. Together, these findings strongly suggest that mGluR7 is involved in neural processes subserving amygdala-dependent averse responses."}],"extern":"1","_id":"2592","year":"1999","volume":19,"page":"955 - 963","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","type":"journal_article","citation":{"chicago":"Masugi, Miwako, Mineto Yokoi, Ryuichi Shigemoto, Keiko Muguruma, Yasuyoshi Watanabe, Gilles Sansig, Herman Van Der Putten, and Shigetada Nakanishi. “Metabotropic Glutamate Receptor Subtype 7 Ablation Causes Deficit in Fear Response and Conditioned Taste Aversion.” <i>Journal of Neuroscience</i>. Society for Neuroscience, 1999. <a href=\"https://doi.org/10.1523/JNEUROSCI.19-03-00955.1999\">https://doi.org/10.1523/JNEUROSCI.19-03-00955.1999</a>.","ieee":"M. Masugi <i>et al.</i>, “Metabotropic glutamate receptor subtype 7 ablation causes deficit in fear response and conditioned taste aversion,” <i>Journal of Neuroscience</i>, vol. 19, no. 3. Society for Neuroscience, pp. 955–963, 1999.","apa":"Masugi, M., Yokoi, M., Shigemoto, R., Muguruma, K., Watanabe, Y., Sansig, G., … Nakanishi, S. (1999). Metabotropic glutamate receptor subtype 7 ablation causes deficit in fear response and conditioned taste aversion. <i>Journal of Neuroscience</i>. Society for Neuroscience. <a href=\"https://doi.org/10.1523/JNEUROSCI.19-03-00955.1999\">https://doi.org/10.1523/JNEUROSCI.19-03-00955.1999</a>","ama":"Masugi M, Yokoi M, Shigemoto R, et al. Metabotropic glutamate receptor subtype 7 ablation causes deficit in fear response and conditioned taste aversion. <i>Journal of Neuroscience</i>. 1999;19(3):955-963. doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.19-03-00955.1999\">10.1523/JNEUROSCI.19-03-00955.1999</a>","mla":"Masugi, Miwako, et al. “Metabotropic Glutamate Receptor Subtype 7 Ablation Causes Deficit in Fear Response and Conditioned Taste Aversion.” <i>Journal of Neuroscience</i>, vol. 19, no. 3, Society for Neuroscience, 1999, pp. 955–63, doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.19-03-00955.1999\">10.1523/JNEUROSCI.19-03-00955.1999</a>.","ista":"Masugi M, Yokoi M, Shigemoto R, Muguruma K, Watanabe Y, Sansig G, Van Der Putten H, Nakanishi S. 1999. Metabotropic glutamate receptor subtype 7 ablation causes deficit in fear response and conditioned taste aversion. Journal of Neuroscience. 19(3), 955–963.","short":"M. Masugi, M. Yokoi, R. Shigemoto, K. Muguruma, Y. Watanabe, G. Sansig, H. Van Der Putten, S. Nakanishi, Journal of Neuroscience 19 (1999) 955–963."},"publication_identifier":{"issn":["0270-6474"]},"oa":1,"status":"public","acknowledgement":"This work was supported in part by research grants from the Ministry of Education, Science and Culture of Japan, the Ministry of Health and Welfare of Japan, the Sankyo Foundation, the Yamanouchi Foundation, and the Biomolecular Engineering Research Institute. We thank Takashi Yamamoto for advice on CTA experiments, Fumitaka Ushikubi for advice on the nociception test, Markus Schroeder for back-crossing of mutant mice, Ayae Kinoshita for the kind gift of antibodies, Akira Uesugi for photography, and Kumlesh K. Dev for careful reading of this manuscript.","issue":"3","article_type":"original","external_id":{"pmid":["9920659"]},"scopus_import":"1","quality_controlled":"1","author":[{"last_name":"Masugi","first_name":"Miwako","full_name":"Masugi, Miwako"},{"full_name":"Yokoi, Mineto","first_name":"Mineto","last_name":"Yokoi"},{"last_name":"Shigemoto","orcid":"0000-0001-8761-9444","first_name":"Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","full_name":"Shigemoto, Ryuichi"},{"first_name":"Keiko","last_name":"Muguruma","full_name":"Muguruma, Keiko"},{"full_name":"Watanabe, Yasuyoshi","first_name":"Yasuyoshi","last_name":"Watanabe"},{"first_name":"Gilles","last_name":"Sansig","full_name":"Sansig, Gilles"},{"full_name":"Van Der Putten, Herman","last_name":"Van Der Putten","first_name":"Herman"},{"full_name":"Nakanishi, Shigetada","first_name":"Shigetada","last_name":"Nakanishi"}],"date_published":"1999-02-01T00:00:00Z","article_processing_charge":"No","doi":"10.1523/JNEUROSCI.19-03-00955.1999","date_updated":"2023-03-27T10:00:42Z","intvolume":"        19","main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6782134/"}],"publication_status":"published","month":"02","language":[{"iso":"eng"}],"pmid":1,"day":"01"},{"year":"1999","_id":"2593","type":"journal_article","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","page":"3545 - 3555","volume":19,"publication_identifier":{"issn":["0270-6474"]},"citation":{"ieee":"X. Yu, E. Zhang, A. Craig, R. Shigemoto, A. Ribeiro Da Silva, and Y. De Koninck, “NK-1 receptor immunoreactivity in distinct morphological types of lamina I neurons of the primate spinal cord,” <i>Journal of Neuroscience</i>, vol. 19, no. 9. Society for Neuroscience, pp. 3545–3555, 1999.","chicago":"Yu, Xiao, En Zhang, Arthur Craig, Ryuichi Shigemoto, Alfredo Ribeiro Da Silva, and Yves De Koninck. “NK-1 Receptor Immunoreactivity in Distinct Morphological Types of Lamina I Neurons of the Primate Spinal Cord.” <i>Journal of Neuroscience</i>. Society for Neuroscience, 1999. <a href=\"https://doi.org/10.1523/JNEUROSCI.19-09-03545.1999\">https://doi.org/10.1523/JNEUROSCI.19-09-03545.1999</a>.","apa":"Yu, X., Zhang, E., Craig, A., Shigemoto, R., Ribeiro Da Silva, A., &#38; De Koninck, Y. (1999). NK-1 receptor immunoreactivity in distinct morphological types of lamina I neurons of the primate spinal cord. <i>Journal of Neuroscience</i>. Society for Neuroscience. <a href=\"https://doi.org/10.1523/JNEUROSCI.19-09-03545.1999\">https://doi.org/10.1523/JNEUROSCI.19-09-03545.1999</a>","ama":"Yu X, Zhang E, Craig A, Shigemoto R, Ribeiro Da Silva A, De Koninck Y. NK-1 receptor immunoreactivity in distinct morphological types of lamina I neurons of the primate spinal cord. <i>Journal of Neuroscience</i>. 1999;19(9):3545-3555. doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.19-09-03545.1999\">10.1523/JNEUROSCI.19-09-03545.1999</a>","mla":"Yu, Xiao, et al. “NK-1 Receptor Immunoreactivity in Distinct Morphological Types of Lamina I Neurons of the Primate Spinal Cord.” <i>Journal of Neuroscience</i>, vol. 19, no. 9, Society for Neuroscience, 1999, pp. 3545–55, doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.19-09-03545.1999\">10.1523/JNEUROSCI.19-09-03545.1999</a>.","ista":"Yu X, Zhang E, Craig A, Shigemoto R, Ribeiro Da Silva A, De Koninck Y. 1999. NK-1 receptor immunoreactivity in distinct morphological types of lamina I neurons of the primate spinal cord. Journal of Neuroscience. 19(9), 3545–3555.","short":"X. Yu, E. Zhang, A. Craig, R. Shigemoto, A. Ribeiro Da Silva, Y. De Koninck, Journal of Neuroscience 19 (1999) 3545–3555."},"article_type":"original","external_id":{"pmid":["10212314"]},"issue":"9","acknowledgement":"This study was supported by National Institute of Health Grants NS 34022 to Y.D.K. and NS 25616 to A.D.C., by Canadian Medical Research Council (MRC) Grants MT 12942 to Y.D.K. and MT 12170 to A.R.S., and by the Barrow Neurological Foundation. Y.D.K. is a Scholar of the Canadian MRC. We thank A. Constantin and A. Forster for expert technical assistance and Dr. M. Wikstrom for generously supplying monoclonal antibodies against CTb.","oa":1,"status":"public","publist_id":"4305","oa_version":"None","date_created":"2018-12-11T11:58:34Z","publisher":"Society for Neuroscience","title":"NK-1 receptor immunoreactivity in distinct morphological types of lamina I neurons of the primate spinal cord","publication":"Journal of Neuroscience","extern":"1","abstract":[{"lang":"eng","text":"In cat and monkey, lamina I cells can be classified into three basic morphological types (fusiform, pyramidal, and multipolar), and recent intracellular labeling evidence in the cat indicates that fusiform and multipolar lamina I cells are two different types of nociceptive cells, whereas pyramidal cells are innocuous thermoreceptive-specific. Because earlier observations indicated that only nociceptive dorsal horn neurons respond to substance P (SP), we examined which morphological types of lamina I neurons express receptors for SP (NK-1r). We categorized NK-1r- immunoreactive (IR) lamina I neurons in serial horizontal sections from the cervical and lumbar enlargements of four monkeys. Consistent results were obtained by two independent teams of observers. Nearly all NK-1r-IR cells were fusiform (42%) or multipolar (43%), but only 6% were pyramidal (with 9% unclassified). We obtained similar findings in three monkeys in which we used double-labeling immunocytochemistry to identify NK-1r-IR and spinothalamic lamina I neurons retrogradely labeled with cholera toxin subunit b from the thalamus; most NK-1r-IR lamina I spinothalamic neurons were fusiform (48%) or multipolar (33%), and only 10% were pyramidal. In contrast, most (~75%) pyramidal and some (~25%) fusiform and multipolar lamina I spinothalamic neurons did not display NK-1r immunoreactivity. These data indicate that most fusiform and multipolar lamina I neurons in the monkey can express NK-1r, consistent with the idea that both types are nociceptive, whereas only a small proportion of lamina I pyramidal cells express this receptor, consistent with the previous finding that they are nonnociceptive. However, these findings also indicate that not all nociceptive lamina I neurons express receptors for SP."}],"publication_status":"published","intvolume":"        19","main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6782224/"}],"language":[{"iso":"eng"}],"month":"05","day":"01","pmid":1,"quality_controlled":"1","scopus_import":"1","date_updated":"2023-03-27T09:54:40Z","doi":"10.1523/JNEUROSCI.19-09-03545.1999","article_processing_charge":"No","date_published":"1999-05-01T00:00:00Z","author":[{"full_name":"Yu, Xiao","last_name":"Yu","first_name":"Xiao"},{"last_name":"Zhang","first_name":"En","full_name":"Zhang, En"},{"full_name":"Craig, Arthur","first_name":"Arthur","last_name":"Craig"},{"id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","full_name":"Shigemoto, Ryuichi","last_name":"Shigemoto","orcid":"0000-0001-8761-9444","first_name":"Ryuichi"},{"last_name":"Ribeiro Da Silva","first_name":"Alfredo","full_name":"Ribeiro Da Silva, Alfredo"},{"first_name":"Yves","last_name":"De Koninck","full_name":"De Koninck, Yves"}]},{"day":"07","pmid":1,"language":[{"iso":"eng"}],"month":"05","publication_status":"published","intvolume":"       266","date_updated":"2022-09-13T10:05:26Z","doi":"10.1016/S0304-3940(99)00283-9","article_processing_charge":"No","author":[{"full_name":"Ding, Yu","first_name":"Yu","last_name":"Ding"},{"last_name":"Zheng","first_name":"Heng","full_name":"Zheng, Heng"},{"first_name":"Dian","last_name":"Wang","full_name":"Wang, Dian"},{"full_name":"Xu, Jun","last_name":"Xu","first_name":"Jun"},{"full_name":"Gong, Liang","first_name":"Liang","last_name":"Gong"},{"full_name":"Lü, Yan","first_name":"Yan","last_name":"Lü"},{"full_name":"Qin, Bing","first_name":"Bing","last_name":"Qin"},{"last_name":"Shi","first_name":"Juan","full_name":"Shi, Juan"},{"full_name":"Li, Hua","first_name":"Hua","last_name":"Li"},{"last_name":"Li","first_name":"Ji","full_name":"Li, Ji"},{"first_name":"Ryuichi","last_name":"Shigemoto","orcid":"0000-0001-8761-9444","full_name":"Shigemoto, Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Kaneko","first_name":"Takeshi","full_name":"Kaneko, Takeshi"},{"full_name":"Mizuno, Noboru","last_name":"Mizuno","first_name":"Noboru"}],"date_published":"1999-05-07T00:00:00Z","quality_controlled":"1","article_type":"original","external_id":{"pmid":["10353345 "]},"issue":"2","status":"public","acknowledgement":"This work was supported in part by Grants-in-Aid from the National Natural Science Foundation of China (39600045) and the Ministry of Education, Science, Sports and Culture of Japan (08279106, 09480211, 10164225, 10680701).","publication_identifier":{"issn":["0304-3940"]},"citation":{"ama":"Ding Y, Zheng H, Wang D, et al. The distribution of substance P receptor (NK1)-like immunoreactive neurons in the newborn and adult human spinal cord. <i>Neuroscience Letters</i>. 1999;266(2):133-136. doi:<a href=\"https://doi.org/10.1016/S0304-3940(99)00283-9\">10.1016/S0304-3940(99)00283-9</a>","ista":"Ding Y, Zheng H, Wang D, Xu J, Gong L, Lü Y, Qin B, Shi J, Li H, Li J, Shigemoto R, Kaneko T, Mizuno N. 1999. The distribution of substance P receptor (NK1)-like immunoreactive neurons in the newborn and adult human spinal cord. Neuroscience Letters. 266(2), 133–136.","short":"Y. Ding, H. Zheng, D. Wang, J. Xu, L. Gong, Y. Lü, B. Qin, J. Shi, H. Li, J. Li, R. Shigemoto, T. Kaneko, N. Mizuno, Neuroscience Letters 266 (1999) 133–136.","mla":"Ding, Yu, et al. “The Distribution of Substance P Receptor (NK1)-like Immunoreactive Neurons in the Newborn and Adult Human Spinal Cord.” <i>Neuroscience Letters</i>, vol. 266, no. 2, Elsevier, 1999, pp. 133–36, doi:<a href=\"https://doi.org/10.1016/S0304-3940(99)00283-9\">10.1016/S0304-3940(99)00283-9</a>.","chicago":"Ding, Yu, Heng Zheng, Dian Wang, Jun Xu, Liang Gong, Yan Lü, Bing Qin, et al. “The Distribution of Substance P Receptor (NK1)-like Immunoreactive Neurons in the Newborn and Adult Human Spinal Cord.” <i>Neuroscience Letters</i>. Elsevier, 1999. <a href=\"https://doi.org/10.1016/S0304-3940(99)00283-9\">https://doi.org/10.1016/S0304-3940(99)00283-9</a>.","ieee":"Y. Ding <i>et al.</i>, “The distribution of substance P receptor (NK1)-like immunoreactive neurons in the newborn and adult human spinal cord,” <i>Neuroscience Letters</i>, vol. 266, no. 2. Elsevier, pp. 133–136, 1999.","apa":"Ding, Y., Zheng, H., Wang, D., Xu, J., Gong, L., Lü, Y., … Mizuno, N. (1999). The distribution of substance P receptor (NK1)-like immunoreactive neurons in the newborn and adult human spinal cord. <i>Neuroscience Letters</i>. Elsevier. <a href=\"https://doi.org/10.1016/S0304-3940(99)00283-9\">https://doi.org/10.1016/S0304-3940(99)00283-9</a>"},"type":"journal_article","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","page":"133 - 136","volume":266,"year":"1999","_id":"2594","extern":"1","abstract":[{"lang":"eng","text":"Substance P receptor (i.e. NK1)-like immunoreactive (SPR-LI) neurons were observed in the newborn and adult human spinal cord. Substance P receptor-like immunoreactive neuronal cell bodies were seen most frequently in lamina I, and were scattered throughout the remaining laminae of the dorsal horn and the area around the central canal. Some neurons in the intermediolateral nucleus also showed weak immunoreactivity. The pattern of distribution of SPR-LI neurons in the adult spinal cord was essentially the same as that in the newborn spinal cord. However, SPR-LI neurons cell bodies were seen much more frequently in the newborn than in the adult dorsal horn, especially in lamina II."}],"publisher":"Elsevier","title":"The distribution of substance P receptor (NK1)-like immunoreactive neurons in the newborn and adult human spinal cord","publication":"Neuroscience Letters","publist_id":"4304","oa_version":"None","date_created":"2018-12-11T11:58:34Z"},{"publication_status":"published","intvolume":"        38","day":"01","pmid":1,"language":[{"iso":"eng"}],"month":"10","date_updated":"2022-09-13T08:23:20Z","doi":"10.1016/S0028-3908(99)00124-0","article_processing_charge":"No","author":[{"full_name":"Lafon Cazal, Mireille","first_name":"Mireille","last_name":"Lafon Cazal"},{"full_name":"Viennois, Gaëlle","first_name":"Gaëlle","last_name":"Viennois"},{"first_name":"Rainer","last_name":"Kühn","full_name":"Kühn, Rainer"},{"first_name":"Barbara","last_name":"Malitschek","full_name":"Malitschek, Barbara"},{"full_name":"Pin, Jean","last_name":"Pin","first_name":"Jean"},{"id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","full_name":"Shigemoto, Ryuichi","orcid":"0000-0001-8761-9444","last_name":"Shigemoto","first_name":"Ryuichi"},{"last_name":"Bockaërt","first_name":"Joël","full_name":"Bockaërt, Joël"}],"date_published":"1999-10-01T00:00:00Z","quality_controlled":"1","scopus_import":"1","type":"journal_article","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","page":"1631 - 1640","volume":38,"year":"1999","_id":"2595","external_id":{"pmid":["10530824 "]},"article_type":"original","issue":"10","acknowledgement":"We thank A. Turner-Madeuf for English revision, M. Passama and L. Charvet for the illustrations, Isabelle Brabet, Cécile Joly and Jaroslav Blahos for helpful technical assistance. This work was supported by the CNRS, Bayer \r\nFrance/Troponwerke (Germany), and CEE-Biomed BMH4-2 CT 960228.","status":"public","publication_identifier":{"issn":["0028-3908"]},"citation":{"ieee":"M. Lafon Cazal <i>et al.</i>, “mGluR7-like receptor and GABA(B) receptor activation enhance neurotoxic effects of N-methyl-D-aspartate in cultured mouse striatal GABAergic neurones,” <i>Neuropharmacology</i>, vol. 38, no. 10. Elsevier, pp. 1631–1640, 1999.","chicago":"Lafon Cazal, Mireille, Gaëlle Viennois, Rainer Kühn, Barbara Malitschek, Jean Pin, Ryuichi Shigemoto, and Joël Bockaërt. “MGluR7-like Receptor and GABA(B) Receptor Activation Enhance Neurotoxic Effects of N-Methyl-D-Aspartate in Cultured Mouse Striatal GABAergic Neurones.” <i>Neuropharmacology</i>. Elsevier, 1999. <a href=\"https://doi.org/10.1016/S0028-3908(99)00124-0\">https://doi.org/10.1016/S0028-3908(99)00124-0</a>.","apa":"Lafon Cazal, M., Viennois, G., Kühn, R., Malitschek, B., Pin, J., Shigemoto, R., &#38; Bockaërt, J. (1999). mGluR7-like receptor and GABA(B) receptor activation enhance neurotoxic effects of N-methyl-D-aspartate in cultured mouse striatal GABAergic neurones. <i>Neuropharmacology</i>. Elsevier. <a href=\"https://doi.org/10.1016/S0028-3908(99)00124-0\">https://doi.org/10.1016/S0028-3908(99)00124-0</a>","ama":"Lafon Cazal M, Viennois G, Kühn R, et al. mGluR7-like receptor and GABA(B) receptor activation enhance neurotoxic effects of N-methyl-D-aspartate in cultured mouse striatal GABAergic neurones. <i>Neuropharmacology</i>. 1999;38(10):1631-1640. doi:<a href=\"https://doi.org/10.1016/S0028-3908(99)00124-0\">10.1016/S0028-3908(99)00124-0</a>","ista":"Lafon Cazal M, Viennois G, Kühn R, Malitschek B, Pin J, Shigemoto R, Bockaërt J. 1999. mGluR7-like receptor and GABA(B) receptor activation enhance neurotoxic effects of N-methyl-D-aspartate in cultured mouse striatal GABAergic neurones. Neuropharmacology. 38(10), 1631–1640.","short":"M. Lafon Cazal, G. Viennois, R. Kühn, B. Malitschek, J. Pin, R. Shigemoto, J. Bockaërt, Neuropharmacology 38 (1999) 1631–1640.","mla":"Lafon Cazal, Mireille, et al. “MGluR7-like Receptor and GABA(B) Receptor Activation Enhance Neurotoxic Effects of N-Methyl-D-Aspartate in Cultured Mouse Striatal GABAergic Neurones.” <i>Neuropharmacology</i>, vol. 38, no. 10, Elsevier, 1999, pp. 1631–40, doi:<a href=\"https://doi.org/10.1016/S0028-3908(99)00124-0\">10.1016/S0028-3908(99)00124-0</a>."},"publisher":"Elsevier","title":"mGluR7-like receptor and GABA(B) receptor activation enhance neurotoxic effects of N-methyl-D-aspartate in cultured mouse striatal GABAergic neurones","publication":"Neuropharmacology","publist_id":"4302","oa_version":"None","date_created":"2018-12-11T11:58:34Z","extern":"1","abstract":[{"lang":"eng","text":"Presynaptic metabotropic glutamate receptors (mGluRs) of group III constitute possible targets for putative neuroprotective drugs acting against glutamate excitotoxic insults. Indeed, in glutamatergic cerebellar granule neurones in culture, high concentrations of L-2-amino-4-phosphonobutyrate (L-AP4, above 0.3 mM, thus activating mGluR7) inhibit NMDA-induced cell death. In contrast, in striatal cultures which are enriched in GABAergic neurones, we show that high concentrations of L-AP4 increased neuronal death in control as well as in NMDA-stimulated cultures. Moreover, similar results were obtained with the GABA(B)R agonist, baclofen. Both the neuroprotective effects in cerebellar granule cells and the neurotoxic effects in striatal neurones were mediated via Gi-Go-coupled mGluRs, suggesting that these effects were probably mediated by mGluR7a or b and GABA(B)R expressed in these neurones. In striatal neurones, we found that L-AP4 and baclofen inhibited both basal and NMDA-stimulated GABA release. These inhibitions of GABA release may be responsible for the increase in basal and NMDA-stimulated neuronal death. Indeed, blockade of GABA(A) receptors with bicuculline increased neuronal death of control and NMDA-treated striatal cultures. Taken together, these results suggest that L-AP4 and baclofen, via mGluR7 and GABA(B)R, reduced the neuroprotective effect of GABA present in striatal cultures acting via GABA(A) receptors. Although caution must be taken when extrapolating from in vitro to in vivo situations, the present experiments and the recent observations that mGluR7 and GABA(B)R are expressed in heterologous synapses, should be taken into consideration when evaluating the neuroprotective action of future mGluR7 specific agonists or GABA(B)R specific antagonists."}]},{"title":"Spatial distribution of GABA(B)R1 receptor mRNA and binding sites in the rat brain^","publication":"Journal of Comparative Neurology","publisher":"Wiley-Blackwell","oa_version":"None","date_created":"2018-12-11T11:58:35Z","publist_id":"4303","abstract":[{"text":"A γ-aminobutyric acid (GABA)(B) receptor (named GABA(B)R1) has been recently cloned in the rat and human brain and two variants generated by alternative RNA splicing were identified. In the present study, we addressed the question as to whether these variants contribute to the diversity of GABA(B) receptor-mediated physiological responses and constitute real receptor subtypes with distinct functions. To this aim, we have mapped the GABA(B)R1 (R1a) and GABA(B)R1b (R1b) transcript distribution in the rat brain using in situ hybridization. We have compared the mRNA distribution with the distribution of [ 3H]CGP54626-labeled binding GABA(B)R1 receptor sites as assessed in adjacent cryosections by quantitative autoradiography. We found that GABA(B) receptor transcripts and binding sites are expressed in the brain in almost all neuronal cell populations. Expression in glial cells, if any, is marginal. We observed a good parallelism between GABA(B)R1 mRNA transcripts and binding sites in broad neuroanatomical entities with highest densities in hippocampus, thalamic nuclei, and cerebellum. By contrast, R1a and R1b transcripts exhibit marked differences in their regional and cellular distribution pattern. A typical example is the cerebellum with an almost exclusive expression of R1b in the Purkinje cells and of R1a in the granule, stellate, and basket cells. Data pointing at a pre- versus postsynaptic localization for R1a and R1b, respectively, at some neuronal sites are presented.\r\n","lang":"eng"}],"extern":"1","page":"1 - 16","volume":412,"type":"journal_article","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","_id":"2596","year":"1999","status":"public","acknowledgement":"We  thank W. Froestl  and  S.J.  Mickel for synthesis of GABAB ligands, and H. van der Putten for helpful discussions. Many thanks to S. Pfister (former graduate student in our group), and P. Dreja, M. Kohler, P. Schwarb, P.Kaindl (Carl Zeiss A.G., Zurich, Switzerland) for their help in the design of computer macros for the quantitative analysis of in situ  hybridization sections. The critical review of the manuscript by J. Mosbacher (NovartisPharma, TA Nervous System)  and J. Koenig (Maryland Psychiatric Research Center, Baltimore, MD) are gratefully acknowledged.","external_id":{"pmid":["10440706 "]},"article_type":"original","issue":"1","citation":{"ista":"Bischoff S, Leonhard S, Reymann N, Schuler V, Shigemoto R, Kaupmann K, Bettler B. 1999. Spatial distribution of GABA(B)R1 receptor mRNA and binding sites in the rat brain^. Journal of Comparative Neurology. 412(1), 1–16.","mla":"Bischoff, Serge, et al. “Spatial Distribution of GABA(B)R1 Receptor MRNA and Binding Sites in the Rat Brain^.” <i>Journal of Comparative Neurology</i>, vol. 412, no. 1, Wiley-Blackwell, 1999, pp. 1–16, doi:<a href=\"https://doi.org/10.1002/(SICI)1096-9861(19990913)412:1&#38;lt;1::AID-CNE1&#38;gt;3.0.CO;2-D\">10.1002/(SICI)1096-9861(19990913)412:1&#38;lt;1::AID-CNE1&#38;gt;3.0.CO;2-D</a>.","short":"S. Bischoff, S. Leonhard, N. Reymann, V. Schuler, R. Shigemoto, K. Kaupmann, B. Bettler, Journal of Comparative Neurology 412 (1999) 1–16.","ama":"Bischoff S, Leonhard S, Reymann N, et al. Spatial distribution of GABA(B)R1 receptor mRNA and binding sites in the rat brain^. <i>Journal of Comparative Neurology</i>. 1999;412(1):1-16. doi:<a href=\"https://doi.org/10.1002/(SICI)1096-9861(19990913)412:1&#38;lt;1::AID-CNE1&#38;gt;3.0.CO;2-D\">10.1002/(SICI)1096-9861(19990913)412:1&#38;lt;1::AID-CNE1&#38;gt;3.0.CO;2-D</a>","apa":"Bischoff, S., Leonhard, S., Reymann, N., Schuler, V., Shigemoto, R., Kaupmann, K., &#38; Bettler, B. (1999). Spatial distribution of GABA(B)R1 receptor mRNA and binding sites in the rat brain^. <i>Journal of Comparative Neurology</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1002/(SICI)1096-9861(19990913)412:1&#38;lt;1::AID-CNE1&#38;gt;3.0.CO;2-D\">https://doi.org/10.1002/(SICI)1096-9861(19990913)412:1&#38;lt;1::AID-CNE1&#38;gt;3.0.CO;2-D</a>","chicago":"Bischoff, Serge, Sabine Leonhard, Nicole Reymann, Valérie Schuler, Ryuichi Shigemoto, Klemens Kaupmann, and Bernhard Bettler. “Spatial Distribution of GABA(B)R1 Receptor MRNA and Binding Sites in the Rat Brain^.” <i>Journal of Comparative Neurology</i>. Wiley-Blackwell, 1999. <a href=\"https://doi.org/10.1002/(SICI)1096-9861(19990913)412:1&#38;lt;1::AID-CNE1&#38;gt;3.0.CO;2-D\">https://doi.org/10.1002/(SICI)1096-9861(19990913)412:1&#38;lt;1::AID-CNE1&#38;gt;3.0.CO;2-D</a>.","ieee":"S. Bischoff <i>et al.</i>, “Spatial distribution of GABA(B)R1 receptor mRNA and binding sites in the rat brain^,” <i>Journal of Comparative Neurology</i>, vol. 412, no. 1. Wiley-Blackwell, pp. 1–16, 1999."},"publication_identifier":{"issn":["0021-9967"]},"date_published":"1999-09-13T00:00:00Z","author":[{"full_name":"Bischoff, Serge","last_name":"Bischoff","first_name":"Serge"},{"last_name":"Leonhard","first_name":"Sabine","full_name":"Leonhard, Sabine"},{"first_name":"Nicole","last_name":"Reymann","full_name":"Reymann, Nicole"},{"first_name":"Valérie","last_name":"Schuler","full_name":"Schuler, Valérie"},{"id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","full_name":"Shigemoto, Ryuichi","orcid":"0000-0001-8761-9444","last_name":"Shigemoto","first_name":"Ryuichi"},{"last_name":"Kaupmann","first_name":"Klemens","full_name":"Kaupmann, Klemens"},{"full_name":"Bettler, Bernhard","first_name":"Bernhard","last_name":"Bettler"}],"doi":"10.1002/(SICI)1096-9861(19990913)412:1&lt;1::AID-CNE1&gt;3.0.CO;2-D","date_updated":"2022-09-13T08:30:25Z","article_processing_charge":"No","scopus_import":"1","quality_controlled":"1","intvolume":"       412","publication_status":"published","pmid":1,"day":"13","language":[{"iso":"eng"}],"month":"09"},{"scopus_import":"1","quality_controlled":"1","author":[{"last_name":"Bushell","first_name":"Trevor","full_name":"Bushell, Trevor"},{"first_name":"Chong","last_name":"Lee","full_name":"Lee, Chong"},{"first_name":"Ryuichi","orcid":"0000-0001-8761-9444","last_name":"Shigemoto","full_name":"Shigemoto, Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Miller","first_name":"Richard","full_name":"Miller, Richard"}],"date_published":"1999-10-01T00:00:00Z","doi":"10.1016/S0028-3908(99)00103-3","date_updated":"2022-09-13T08:15:55Z","article_processing_charge":"No","language":[{"iso":"eng"}],"month":"10","pmid":1,"day":"01","intvolume":"        38","publication_status":"published","abstract":[{"text":"Metabotropic glutamate receptors (mGlus) are known to modulate synaptic transmission in various pathways of the central nervous system, but the exact mechanisms by which this modulation occurs remain unclear. Here we utilise electrophysiological and immunocytochemical techniques on cultured autaptic hippocampal neurones to investigate the mechanism of action and distribution of mGlus. Agonists at all three groups of mGlus depressed glutamatergic transmission, whereas only agonists at group I mGlus depressed GABAergic transmission. Agonists at all mGlus failed to modulate Ca2+ and K+ channels in glutamatergic autapses whereas an agonist at group III mGlus did depress the frequency of miniature excitatory postsynaptic currents (mEPSCs). Agonists failed to modulate Ca2+ or K+ channels and miniature inhibitory postsynaptic currents (mIPSCs) in GABAergic autapses. Distribution studies using selective antibodies revealed punctate staining for group III mGlus that co-localised with the synaptic marker, synaptophysin. Staining for the remaining mGlus was more diffuse throughout the soma and processes with little co-localisation with synaptophysin. The distribution of the group III receptors is consistent with the direct 'downstream' modulation of mEPSCs, although the exact mechanism of action for the remaining receptors remains unclear.","lang":"eng"}],"extern":"1","oa_version":"None","date_created":"2018-12-11T11:58:35Z","publist_id":"4301","title":"Modulation of synaptic transmission and differential localisation of mGlus in cultured hippocampal autapses","publication":"Neuropharmacology","publisher":"Elsevier","citation":{"apa":"Bushell, T., Lee, C., Shigemoto, R., &#38; Miller, R. (1999). Modulation of synaptic transmission and differential localisation of mGlus in cultured hippocampal autapses. <i>Neuropharmacology</i>. Elsevier. <a href=\"https://doi.org/10.1016/S0028-3908(99)00103-3\">https://doi.org/10.1016/S0028-3908(99)00103-3</a>","chicago":"Bushell, Trevor, Chong Lee, Ryuichi Shigemoto, and Richard Miller. “Modulation of Synaptic Transmission and Differential Localisation of MGlus in Cultured Hippocampal Autapses.” <i>Neuropharmacology</i>. Elsevier, 1999. <a href=\"https://doi.org/10.1016/S0028-3908(99)00103-3\">https://doi.org/10.1016/S0028-3908(99)00103-3</a>.","ieee":"T. Bushell, C. Lee, R. Shigemoto, and R. Miller, “Modulation of synaptic transmission and differential localisation of mGlus in cultured hippocampal autapses,” <i>Neuropharmacology</i>, vol. 38, no. 10. Elsevier, pp. 1553–1567, 1999.","ista":"Bushell T, Lee C, Shigemoto R, Miller R. 1999. Modulation of synaptic transmission and differential localisation of mGlus in cultured hippocampal autapses. Neuropharmacology. 38(10), 1553–1567.","mla":"Bushell, Trevor, et al. “Modulation of Synaptic Transmission and Differential Localisation of MGlus in Cultured Hippocampal Autapses.” <i>Neuropharmacology</i>, vol. 38, no. 10, Elsevier, 1999, pp. 1553–67, doi:<a href=\"https://doi.org/10.1016/S0028-3908(99)00103-3\">10.1016/S0028-3908(99)00103-3</a>.","short":"T. Bushell, C. Lee, R. Shigemoto, R. Miller, Neuropharmacology 38 (1999) 1553–1567.","ama":"Bushell T, Lee C, Shigemoto R, Miller R. Modulation of synaptic transmission and differential localisation of mGlus in cultured hippocampal autapses. <i>Neuropharmacology</i>. 1999;38(10):1553-1567. doi:<a href=\"https://doi.org/10.1016/S0028-3908(99)00103-3\">10.1016/S0028-3908(99)00103-3</a>"},"publication_identifier":{"issn":["0028-3908"]},"status":"public","acknowledgement":"This work was supported by a Wellcome International Travel Fellowship to TJB and by the Public Service Grants DA02121, MH40165, NS33502 and NS33826 for CCL and RJM. We are grateful to Dr Graeme I. Bell for use of his microscope for the antibody studies.","article_type":"original","external_id":{"pmid":["10530817"]},"issue":"10","_id":"2597","year":"1999","page":"1553 - 1567","volume":38,"type":"journal_article","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17"},{"publist_id":"4185","date_created":"2018-12-11T11:59:12Z","oa_version":"None","publisher":"World Scientific Publishing","publication":"Proceedings of the 7th QMath Conference","title":"Linear Boltzmann equation as the weak coupling limit of the random Schrödinger equation","extern":"1","abstract":[{"text":"We study the long time evolution of a quantum particle in a Gaussian random environment. We show that in the weak coupling limit the Wigner distribution of the wave function converges to the solution of a linear Boltzmann equation globally in time. The Boltzmann collision kernel is given by the Born approximation of the quantum scattering cross section.","lang":"eng"}],"year":"1999","_id":"2711","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","type":"conference","volume":108,"page":"233 - 242","publication_identifier":{"isbn":["9783034897549"]},"citation":{"chicago":"Erdös, László. “Linear Boltzmann Equation as the Weak Coupling Limit of the Random Schrödinger Equation.” In <i>Proceedings of the 7th QMath Conference</i>, 108:233–42. World Scientific Publishing, 1999. <a href=\"https://doi.org/10.1007/978-3-0348-8745-8_20\">https://doi.org/10.1007/978-3-0348-8745-8_20</a>.","ieee":"L. Erdös, “Linear Boltzmann equation as the weak coupling limit of the random Schrödinger equation,” in <i>Proceedings of the 7th QMath Conference</i>, Prague, Czech Republik, 1999, vol. 108, pp. 233–242.","apa":"Erdös, L. (1999). Linear Boltzmann equation as the weak coupling limit of the random Schrödinger equation. In <i>Proceedings of the 7th QMath Conference</i> (Vol. 108, pp. 233–242). Prague, Czech Republik: World Scientific Publishing. <a href=\"https://doi.org/10.1007/978-3-0348-8745-8_20\">https://doi.org/10.1007/978-3-0348-8745-8_20</a>","ama":"Erdös L. Linear Boltzmann equation as the weak coupling limit of the random Schrödinger equation. In: <i>Proceedings of the 7th QMath Conference</i>. Vol 108. World Scientific Publishing; 1999:233-242. doi:<a href=\"https://doi.org/10.1007/978-3-0348-8745-8_20\">10.1007/978-3-0348-8745-8_20</a>","mla":"Erdös, László. “Linear Boltzmann Equation as the Weak Coupling Limit of the Random Schrödinger Equation.” <i>Proceedings of the 7th QMath Conference</i>, vol. 108, World Scientific Publishing, 1999, pp. 233–42, doi:<a href=\"https://doi.org/10.1007/978-3-0348-8745-8_20\">10.1007/978-3-0348-8745-8_20</a>.","ista":"Erdös L. 1999. Linear Boltzmann equation as the weak coupling limit of the random Schrödinger equation. Proceedings of the 7th QMath Conference. QMath: Mathematical Results in Quantum Physics, Operator Theory: Advances and Applications, vol. 108, 233–242.","short":"L. Erdös, in:, Proceedings of the 7th QMath Conference, World Scientific Publishing, 1999, pp. 233–242."},"status":"public","conference":{"name":"QMath: Mathematical Results in Quantum Physics","end_date":"1999-09-26","location":"Prague, Czech Republik","start_date":"1998-06-22"},"quality_controlled":"1","scopus_import":"1","article_processing_charge":"No","doi":"10.1007/978-3-0348-8745-8_20","date_updated":"2022-09-13T08:02:52Z","alternative_title":["Operator Theory: Advances and Applications"],"author":[{"first_name":"László","orcid":"0000-0001-5366-9603","last_name":"Erdös","full_name":"Erdös, László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87"}],"date_published":"1999-01-01T00:00:00Z","publication_status":"published","intvolume":"       108","month":"01","language":[{"iso":"eng"}],"day":"01"},{"publisher":"Duke University Press","title":"Semiclassical eigenvalue estimates for the Pauli operator with strong nonhomogeneous magnetic fields, I: Nonasymptotic Lieb-Thirring-type estimate","publication":"Duke Mathematical Journal","publist_id":"4162","oa_version":"None","date_created":"2018-12-11T11:59:18Z","extern":"1","abstract":[{"lang":"eng","text":"We give the leading order semiclassical asymptotics for the sum of the negative eigenvalues of the Pauli operator (in dimension two and three) with a strong non-homogeneous magnetic field. This result can be used to prove that the magnetic Thomas-Fermi theory gives the leading order ground state energy of large atoms. We develop a new localization scheme well suited to the anisotropic character of the strong magnetic field. We also use the basic Lieb-Thirring estimate obtained earlier (1996). (orig.) 19 refs."}],"type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"127 - 173","volume":96,"year":"1999","_id":"2730","article_type":"original","issue":"1","status":"public","acknowledgement":"The first author gratefully acknowledges financial support from the Eidgen6ssiche Technische Hochschule, Forschungsinstitut für Mathematik, Zürich, where this work was started. He is also grateful for the hospitality and support of Aarhus University during his visits there.","publication_identifier":{"issn":["0012-7094"]},"citation":{"chicago":"Erdös, László, and Jan Solovej. “Semiclassical Eigenvalue Estimates for the Pauli Operator with Strong Nonhomogeneous Magnetic Fields, I: Nonasymptotic Lieb-Thirring-Type Estimate.” <i>Duke Mathematical Journal</i>. Duke University Press, 1999. <a href=\"https://doi.org/10.1215/S0012-7094-99-09604-7\">https://doi.org/10.1215/S0012-7094-99-09604-7</a>.","ieee":"L. Erdös and J. Solovej, “Semiclassical eigenvalue estimates for the Pauli operator with strong nonhomogeneous magnetic fields, I: Nonasymptotic Lieb-Thirring-type estimate,” <i>Duke Mathematical Journal</i>, vol. 96, no. 1. Duke University Press, pp. 127–173, 1999.","apa":"Erdös, L., &#38; Solovej, J. (1999). Semiclassical eigenvalue estimates for the Pauli operator with strong nonhomogeneous magnetic fields, I: Nonasymptotic Lieb-Thirring-type estimate. <i>Duke Mathematical Journal</i>. Duke University Press. <a href=\"https://doi.org/10.1215/S0012-7094-99-09604-7\">https://doi.org/10.1215/S0012-7094-99-09604-7</a>","ama":"Erdös L, Solovej J. Semiclassical eigenvalue estimates for the Pauli operator with strong nonhomogeneous magnetic fields, I: Nonasymptotic Lieb-Thirring-type estimate. <i>Duke Mathematical Journal</i>. 1999;96(1):127-173. doi:<a href=\"https://doi.org/10.1215/S0012-7094-99-09604-7\">10.1215/S0012-7094-99-09604-7</a>","short":"L. Erdös, J. Solovej, Duke Mathematical Journal 96 (1999) 127–173.","ista":"Erdös L, Solovej J. 1999. Semiclassical eigenvalue estimates for the Pauli operator with strong nonhomogeneous magnetic fields, I: Nonasymptotic Lieb-Thirring-type estimate. Duke Mathematical Journal. 96(1), 127–173.","mla":"Erdös, László, and Jan Solovej. “Semiclassical Eigenvalue Estimates for the Pauli Operator with Strong Nonhomogeneous Magnetic Fields, I: Nonasymptotic Lieb-Thirring-Type Estimate.” <i>Duke Mathematical Journal</i>, vol. 96, no. 1, Duke University Press, 1999, pp. 127–73, doi:<a href=\"https://doi.org/10.1215/S0012-7094-99-09604-7\">10.1215/S0012-7094-99-09604-7</a>."},"date_updated":"2023-02-20T07:34:48Z","doi":"10.1215/S0012-7094-99-09604-7","article_processing_charge":"No","author":[{"first_name":"László","last_name":"Erdös","orcid":"0000-0001-5366-9603","full_name":"Erdös, László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Solovej, Jan","first_name":"Jan","last_name":"Solovej"}],"date_published":"1999-01-15T00:00:00Z","quality_controlled":"1","scopus_import":"1","publication_status":"published","intvolume":"        96","day":"15","language":[{"iso":"eng"}],"month":"01"},{"day":"01","month":"10","language":[{"iso":"eng"}],"intvolume":"        11","publication_status":"published","author":[{"id":"3A374330-F248-11E8-B48F-1D18A9856A87","full_name":"Hof, Björn","last_name":"Hof","orcid":"0000-0003-2057-2754","first_name":"Björn"},{"first_name":"Peter","last_name":"Lucas","full_name":"Lucas, Peter"},{"last_name":"Mullin","first_name":"Tom","full_name":"Mullin, Tom"}],"date_published":"1999-10-01T00:00:00Z","article_processing_charge":"No","date_updated":"2022-09-09T09:24:10Z","doi":"10.1063/1.870178 ","scopus_import":"1","quality_controlled":"1","status":"public","issue":"10","article_type":"original","citation":{"apa":"Hof, B., Lucas, P., &#38; Mullin, T. (1999). Flow state multiplicity in convection. <i>Physics of Fluids</i>. American Institute of Physics. <a href=\"https://doi.org/10.1063/1.870178 \">https://doi.org/10.1063/1.870178 </a>","ieee":"B. Hof, P. Lucas, and T. Mullin, “Flow state multiplicity in convection,” <i>Physics of Fluids</i>, vol. 11, no. 10. American Institute of Physics, pp. 2815–2817, 1999.","chicago":"Hof, Björn, Peter Lucas, and Tom Mullin. “Flow State Multiplicity in Convection.” <i>Physics of Fluids</i>. American Institute of Physics, 1999. <a href=\"https://doi.org/10.1063/1.870178 \">https://doi.org/10.1063/1.870178 </a>.","short":"B. Hof, P. Lucas, T. Mullin, Physics of Fluids 11 (1999) 2815–2817.","mla":"Hof, Björn, et al. “Flow State Multiplicity in Convection.” <i>Physics of Fluids</i>, vol. 11, no. 10, American Institute of Physics, 1999, pp. 2815–17, doi:<a href=\"https://doi.org/10.1063/1.870178 \">10.1063/1.870178 </a>.","ista":"Hof B, Lucas P, Mullin T. 1999. Flow state multiplicity in convection. Physics of Fluids. 11(10), 2815–2817.","ama":"Hof B, Lucas P, Mullin T. Flow state multiplicity in convection. <i>Physics of Fluids</i>. 1999;11(10):2815-2817. doi:<a href=\"https://doi.org/10.1063/1.870178 \">10.1063/1.870178 </a>"},"publication_identifier":{"issn":["0031-9171"]},"volume":11,"page":"2815 - 2817","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","type":"journal_article","_id":"2783","year":"1999","abstract":[{"text":"Pattern formation in a layer of fluid heated from below is an example of macroscopic ordering in continuous media. Here we show that in a relatively compact experimental version of the problem, a rich and diverse set of stable flows can be found. These flows, many of which are novel, can be categorized and understood in terms of their symmetry properties. This approach shows promise for providing insight into the more complicated fluid motion that occurs as the lateral dimension of the layer is increased.","lang":"eng"}],"extern":"1","publication":"Physics of Fluids","title":"Flow state multiplicity in convection","publisher":"American Institute of Physics","date_created":"2018-12-11T11:59:34Z","oa_version":"None","publist_id":"4106"}]
