[{"_id":"4368","status":"public","month":"09","title":"AMT: a property-based monitoring tool for analog systems","doi":"1567","page":"304 - 319","date_published":"2007-09-20T00:00:00Z","citation":{"mla":"Nickovic, Dejan, and Oded Maler. <i>AMT: A Property-Based Monitoring Tool for Analog Systems</i>. Springer, 2007, pp. 304–19, doi:<a href=\"https://doi.org/1567\">1567</a>.","ista":"Nickovic D, Maler O. 2007. AMT: a property-based monitoring tool for analog systems. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS, , 304–319.","ieee":"D. Nickovic and O. Maler, “AMT: a property-based monitoring tool for analog systems,” presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, 2007, pp. 304–319.","ama":"Nickovic D, Maler O. AMT: a property-based monitoring tool for analog systems. In: Springer; 2007:304-319. doi:<a href=\"https://doi.org/1567\">1567</a>","chicago":"Nickovic, Dejan, and Oded Maler. “AMT: A Property-Based Monitoring Tool for Analog Systems,” 304–19. Springer, 2007. <a href=\"https://doi.org/1567\">https://doi.org/1567</a>.","apa":"Nickovic, D., &#38; Maler, O. (2007). AMT: a property-based monitoring tool for analog systems (pp. 304–319). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Springer. <a href=\"https://doi.org/1567\">https://doi.org/1567</a>","short":"D. Nickovic, O. Maler, in:, Springer, 2007, pp. 304–319."},"day":"20","publisher":"Springer","extern":1,"conference":{"name":"FORMATS: Formal Modeling and Analysis of Timed Systems"},"author":[{"first_name":"Dejan","full_name":"Dejan Nickovic","last_name":"Nickovic","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Maler","full_name":"Maler, Oded","first_name":"Oded"}],"date_updated":"2021-01-12T07:56:27Z","year":"2007","type":"conference","date_created":"2018-12-11T12:08:30Z","publication_status":"published","quality_controlled":0,"alternative_title":["LNCS"],"publist_id":"1089"},{"day":"01","publisher":"Springer","extern":1,"conference":{"name":"CAV: Computer Aided Verification"},"author":[{"full_name":"Maler, Oded","last_name":"Maler","first_name":"Oded"},{"first_name":"Dejan","last_name":"Nickovic","full_name":"Dejan Nickovic","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Pnueli,Amir","last_name":"Pnueli","first_name":"Amir"}],"doi":"1568","_id":"4370","month":"01","status":"public","title":"On synthesizing controllers from bounded-response properties","date_published":"2007-01-01T00:00:00Z","citation":{"short":"O. Maler, D. Nickovic, A. Pnueli, in:, Springer, 2007, pp. 95–107.","ista":"Maler O, Nickovic D, Pnueli A. 2007. On synthesizing controllers from bounded-response properties. CAV: Computer Aided Verification, Lecture Notes in Computer Science, , 95–107.","ieee":"O. Maler, D. Nickovic, and A. Pnueli, “On synthesizing controllers from bounded-response properties,” presented at the CAV: Computer Aided Verification, 2007, pp. 95–107.","mla":"Maler, Oded, et al. <i>On Synthesizing Controllers from Bounded-Response Properties</i>. Springer, 2007, pp. 95–107, doi:<a href=\"https://doi.org/1568\">1568</a>.","apa":"Maler, O., Nickovic, D., &#38; Pnueli, A. (2007). On synthesizing controllers from bounded-response properties (pp. 95–107). Presented at the CAV: Computer Aided Verification, Springer. <a href=\"https://doi.org/1568\">https://doi.org/1568</a>","chicago":"Maler, Oded, Dejan Nickovic, and Amir Pnueli. “On Synthesizing Controllers from Bounded-Response Properties,” 95–107. Springer, 2007. <a href=\"https://doi.org/1568\">https://doi.org/1568</a>.","ama":"Maler O, Nickovic D, Pnueli A. On synthesizing controllers from bounded-response properties. In: Springer; 2007:95-107. doi:<a href=\"https://doi.org/1568\">1568</a>"},"page":"95 - 107","publication_status":"published","quality_controlled":0,"alternative_title":["Lecture Notes in Computer Science"],"publist_id":"1086","year":"2007","date_updated":"2021-01-12T07:56:28Z","type":"conference","date_created":"2018-12-11T12:08:30Z"},{"publist_id":"1062","alternative_title":["LNCS 4349"],"quality_controlled":0,"publication_status":"published","type":"conference","date_created":"2018-12-11T12:08:37Z","date_updated":"2021-01-12T07:56:39Z","year":"2007","author":[{"last_name":"Bouillaguet","full_name":"Bouillaguet,Charles","first_name":"Charles"},{"first_name":"Viktor","last_name":"Kuncak","full_name":"Kuncak, Viktor"},{"id":"447BFB88-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas","full_name":"Thomas Wies","last_name":"Wies"},{"last_name":"Zee","full_name":"Zee,Karen","first_name":"Karen"},{"first_name":"Martin","last_name":"Rinard","full_name":"Rinard,Martin C."}],"extern":1,"conference":{"name":"VMCAI: Verification, Model Checking and Abstract Interpretation"},"day":"01","publisher":"Springer","page":"74 - 88","citation":{"ista":"Bouillaguet C, Kuncak V, Wies T, Zee K, Rinard M. 2007. Using First-Order Theorem Provers in the Jahob Data Structure Verification System. VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS 4349, , 74–88.","ieee":"C. Bouillaguet, V. Kuncak, T. Wies, K. Zee, and M. Rinard, “Using First-Order Theorem Provers in the Jahob Data Structure Verification System,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, 2007, pp. 74–88.","mla":"Bouillaguet, Charles, et al. <i>Using First-Order Theorem Provers in the Jahob Data Structure Verification System</i>. Springer, 2007, pp. 74–88, doi:<a href=\"https://doi.org/1552\">1552</a>.","apa":"Bouillaguet, C., Kuncak, V., Wies, T., Zee, K., &#38; Rinard, M. (2007). Using First-Order Theorem Provers in the Jahob Data Structure Verification System (pp. 74–88). Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Springer. <a href=\"https://doi.org/1552\">https://doi.org/1552</a>","chicago":"Bouillaguet, Charles, Viktor Kuncak, Thomas Wies, Karen Zee, and Martin Rinard. “Using First-Order Theorem Provers in the Jahob Data Structure Verification System,” 74–88. Springer, 2007. <a href=\"https://doi.org/1552\">https://doi.org/1552</a>.","ama":"Bouillaguet C, Kuncak V, Wies T, Zee K, Rinard M. Using First-Order Theorem Provers in the Jahob Data Structure Verification System. In: Springer; 2007:74-88. doi:<a href=\"https://doi.org/1552\">1552</a>","short":"C. Bouillaguet, V. Kuncak, T. Wies, K. Zee, M. Rinard, in:, Springer, 2007, pp. 74–88."},"date_published":"2007-01-01T00:00:00Z","_id":"4394","month":"01","status":"public","title":"Using First-Order Theorem Provers in the Jahob Data Structure Verification System","doi":"1552"},{"quality_controlled":0,"publication_status":"published","publist_id":"1058","alternative_title":["LNCS 4590"],"year":"2007","date_updated":"2021-01-12T07:56:40Z","type":"conference","date_created":"2018-12-11T12:08:39Z","author":[{"last_name":"Berdine","full_name":"Berdine,Josh","first_name":"Josh"},{"full_name":"Calcagno,Cristiano","last_name":"Calcagno","first_name":"Cristiano"},{"first_name":"Byron","last_name":"Cook","full_name":"Cook,Byron"},{"full_name":"Distefano,Dino","last_name":"Distefano","first_name":"Dino"},{"first_name":"Peter","full_name":"O'Hearn,Peter W.","last_name":"O'Hearn"},{"id":"447BFB88-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas","full_name":"Thomas Wies","last_name":"Wies"},{"last_name":"Yang","full_name":"Yang,Hongseok","first_name":"Hongseok"}],"publisher":"Springer","day":"01","conference":{"name":"CAV: Computer Aided Verification"},"extern":1,"doi":"1553","_id":"4398","status":"public","title":"Shape Analysis for Composite Data Structures","month":"01","citation":{"ama":"Berdine J, Calcagno C, Cook B, et al. Shape Analysis for Composite Data Structures. In: Springer; 2007:178-192. doi:<a href=\"https://doi.org/1553\">1553</a>","chicago":"Berdine, Josh, Cristiano Calcagno, Byron Cook, Dino Distefano, Peter O’Hearn, Thomas Wies, and Hongseok Yang. “Shape Analysis for Composite Data Structures,” 178–92. Springer, 2007. <a href=\"https://doi.org/1553\">https://doi.org/1553</a>.","apa":"Berdine, J., Calcagno, C., Cook, B., Distefano, D., O’Hearn, P., Wies, T., &#38; Yang, H. (2007). Shape Analysis for Composite Data Structures (pp. 178–192). Presented at the CAV: Computer Aided Verification, Springer. <a href=\"https://doi.org/1553\">https://doi.org/1553</a>","mla":"Berdine, Josh, et al. <i>Shape Analysis for Composite Data Structures</i>. Springer, 2007, pp. 178–92, doi:<a href=\"https://doi.org/1553\">1553</a>.","ieee":"J. Berdine <i>et al.</i>, “Shape Analysis for Composite Data Structures,” presented at the CAV: Computer Aided Verification, 2007, pp. 178–192.","ista":"Berdine J, Calcagno C, Cook B, Distefano D, O’Hearn P, Wies T, Yang H. 2007. Shape Analysis for Composite Data Structures. CAV: Computer Aided Verification, LNCS 4590, , 178–192.","short":"J. Berdine, C. Calcagno, B. Cook, D. Distefano, P. O’Hearn, T. Wies, H. Yang, in:, Springer, 2007, pp. 178–192."},"date_published":"2007-01-01T00:00:00Z","page":"178 - 192"},{"citation":{"mla":"Beyer, Dirk, et al. <i>Algorithms for Interface Synthesis</i>. Vol. 4590, Springer, 2007, pp. 4–19, doi:<a href=\"https://doi.org/10.1007/978-3-540-73368-3_4\">10.1007/978-3-540-73368-3_4</a>.","ieee":"D. Beyer, T. A. Henzinger, and V. Singh, “Algorithms for interface synthesis,” presented at the CAV: Computer Aided Verification, 2007, vol. 4590, pp. 4–19.","ista":"Beyer D, Henzinger TA, Singh V. 2007. Algorithms for interface synthesis. CAV: Computer Aided Verification, LNCS, vol. 4590, 4–19.","ama":"Beyer D, Henzinger TA, Singh V. Algorithms for interface synthesis. In: Vol 4590. Springer; 2007:4-19. doi:<a href=\"https://doi.org/10.1007/978-3-540-73368-3_4\">10.1007/978-3-540-73368-3_4</a>","apa":"Beyer, D., Henzinger, T. A., &#38; Singh, V. (2007). Algorithms for interface synthesis (Vol. 4590, pp. 4–19). Presented at the CAV: Computer Aided Verification, Springer. <a href=\"https://doi.org/10.1007/978-3-540-73368-3_4\">https://doi.org/10.1007/978-3-540-73368-3_4</a>","chicago":"Beyer, Dirk, Thomas A Henzinger, and Vasu Singh. “Algorithms for Interface Synthesis,” 4590:4–19. Springer, 2007. <a href=\"https://doi.org/10.1007/978-3-540-73368-3_4\">https://doi.org/10.1007/978-3-540-73368-3_4</a>.","short":"D. Beyer, T.A. Henzinger, V. Singh, in:, Springer, 2007, pp. 4–19."},"date_published":"2007-07-02T00:00:00Z","page":"4 - 19","doi":"10.1007/978-3-540-73368-3_4","intvolume":"      4590","_id":"4399","status":"public","month":"07","title":"Algorithms for interface synthesis","author":[{"first_name":"Dirk","full_name":"Beyer, Dirk","last_name":"Beyer"},{"full_name":"Thomas Henzinger","last_name":"Henzinger","orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Singh","full_name":"Vasu Singh","first_name":"Vasu","id":"4DAE2708-F248-11E8-B48F-1D18A9856A87"}],"conference":{"name":"CAV: Computer Aided Verification"},"extern":1,"day":"02","volume":4590,"publisher":"Springer","acknowledgement":"This research was supported in part by the grant SFU/PRG 06-3, and by the Swiss National Science Foundation.","type":"conference","date_created":"2018-12-11T12:08:39Z","abstract":[{"text":"A temporal interface for a software component is a finite automaton that specifies the legal sequences of calls to functions that are provided by the component. We compare and evaluate three different algorithms for automatically extracting temporal interfaces from program code: (1) a game algorithm that computes the interface as a representation of the most general environment strategy to avoid a safety violation; (2) a learning algorithm that repeatedly queries the program to construct the minimal interface automaton; and (3) a CEGAR algorithm that iteratively refines an abstract interface hypothesis by adding relevant program variables. For comparison purposes, we present and implement the three algorithms in a unifying formal setting. While the three algorithms compute the same output and have similar worst-case complexities, their actual running times may differ considerably for a given input program. On the theoretical side, we provide for each of the three algorithms a family of input programs on which that algorithm outperforms the two alternatives. On the practical side, we evaluate the three algorithms experimentally on a variety of Java libraries. ","lang":"eng"}],"year":"2007","date_updated":"2021-01-12T07:56:41Z","alternative_title":["LNCS"],"publist_id":"1059","quality_controlled":0,"publication_status":"published"},{"author":[{"first_name":"Rajeev","last_name":"Alur","full_name":"Alur, Rajeev"},{"first_name":"Pavol","full_name":"Pavol Cerny","last_name":"Cerny","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Chaudhuri,Swarat","last_name":"Chaudhuri","first_name":"Swarat"}],"extern":1,"publisher":"Springer","day":"01","conference":{"name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems"},"citation":{"short":"R. Alur, P. Cerny, S. Chaudhuri, in:, Springer, 2007, pp. 664–678.","ista":"Alur R, Cerny P, Chaudhuri S. 2007. Model Checking on Trees with Path Equivalences. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, , 664–678.","ieee":"R. Alur, P. Cerny, and S. Chaudhuri, “Model Checking on Trees with Path Equivalences,” presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, 2007, pp. 664–678.","mla":"Alur, Rajeev, et al. <i>Model Checking on Trees with Path Equivalences</i>. Springer, 2007, pp. 664–78, doi:<a href=\"https://doi.org/1544\">1544</a>.","chicago":"Alur, Rajeev, Pavol Cerny, and Swarat Chaudhuri. “Model Checking on Trees with Path Equivalences,” 664–78. Springer, 2007. <a href=\"https://doi.org/1544\">https://doi.org/1544</a>.","apa":"Alur, R., Cerny, P., &#38; Chaudhuri, S. (2007). Model Checking on Trees with Path Equivalences (pp. 664–678). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Springer. <a href=\"https://doi.org/1544\">https://doi.org/1544</a>","ama":"Alur R, Cerny P, Chaudhuri S. Model Checking on Trees with Path Equivalences. In: Springer; 2007:664-678. doi:<a href=\"https://doi.org/1544\">1544</a>"},"date_published":"2007-01-01T00:00:00Z","page":"664 - 678","doi":"1544","status":"public","_id":"4402","title":"Model Checking on Trees with Path Equivalences","month":"01","alternative_title":["LNCS"],"publist_id":"1055","quality_controlled":0,"publication_status":"published","date_created":"2018-12-11T12:08:40Z","type":"conference","year":"2007","date_updated":"2021-01-12T07:56:43Z"},{"intvolume":"         1","doi":"10.1186/1752-0509-1-4","status":"public","_id":"4405","month":"01","title":"Qualitative networks: A symbolic approach to analyze biological signaling networks","date_published":"2007-01-08T00:00:00Z","citation":{"mla":"Schaub, Marc, et al. “Qualitative Networks: A Symbolic Approach to Analyze Biological Signaling Networks.” <i>BMC Systems Biology</i>, vol. 1, no. 4, BioMed Central, 2007, doi:<a href=\"https://doi.org/10.1186/1752-0509-1-4\">10.1186/1752-0509-1-4</a>.","ieee":"M. Schaub, T. A. Henzinger, and J. Fisher, “Qualitative networks: A symbolic approach to analyze biological signaling networks,” <i>BMC Systems Biology</i>, vol. 1, no. 4. BioMed Central, 2007.","ista":"Schaub M, Henzinger TA, Fisher J. 2007. Qualitative networks: A symbolic approach to analyze biological signaling networks. BMC Systems Biology. 1(4).","ama":"Schaub M, Henzinger TA, Fisher J. Qualitative networks: A symbolic approach to analyze biological signaling networks. <i>BMC Systems Biology</i>. 2007;1(4). doi:<a href=\"https://doi.org/10.1186/1752-0509-1-4\">10.1186/1752-0509-1-4</a>","apa":"Schaub, M., Henzinger, T. A., &#38; Fisher, J. (2007). Qualitative networks: A symbolic approach to analyze biological signaling networks. <i>BMC Systems Biology</i>. BioMed Central. <a href=\"https://doi.org/10.1186/1752-0509-1-4\">https://doi.org/10.1186/1752-0509-1-4</a>","chicago":"Schaub, Marc, Thomas A Henzinger, and Jasmin Fisher. “Qualitative Networks: A Symbolic Approach to Analyze Biological Signaling Networks.” <i>BMC Systems Biology</i>. BioMed Central, 2007. <a href=\"https://doi.org/10.1186/1752-0509-1-4\">https://doi.org/10.1186/1752-0509-1-4</a>.","short":"M. Schaub, T.A. Henzinger, J. Fisher, BMC Systems Biology 1 (2007)."},"publication":"BMC Systems Biology","day":"08","volume":1,"publisher":"BioMed Central","extern":1,"author":[{"last_name":"Schaub","full_name":"Schaub, Marc A","first_name":"Marc"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger","full_name":"Thomas Henzinger"},{"last_name":"Fisher","full_name":"Fisher, Jasmin","first_name":"Jasmin"}],"license":"https://creativecommons.org/licenses/by/4.0/","year":"2007","date_updated":"2021-01-12T07:56:44Z","abstract":[{"text":"Background\nA central goal of Systems Biology is to model and analyze biological signaling pathways that interact with one another to form complex networks. Here we introduce Qualitative networks, an extension of Boolean networks. With this framework, we use formal verification methods to check whether a model is consistent with the laboratory experimental observations on which it is based. If the model does not conform to the data, we suggest a revised model and the new hypotheses are tested in-silico.\n\nResults\nWe consider networks in which elements range over a small finite domain allowing more flexibility than Boolean values, and add target functions that allow to model a rich set of behaviors. We propose a symbolic algorithm for analyzing the steady state of these networks, allowing us to scale up to a system consisting of 144 elements and state spaces of approximately 1086 states. We illustrate the usefulness of this approach through a model of the interaction between the Notch and the Wnt signaling pathways in mammalian skin, and its extensive analysis.\n\nConclusion\nWe introduce an approach for constructing computational models of biological systems that extends the framework of Boolean networks and uses formal verification methods for the analysis of the model. This approach can scale to multicellular models of complex pathways, and is therefore a useful tool for the analysis of complex biological systems. The hypotheses formulated during in-silico testing suggest new avenues to explore experimentally. Hence, this approach has the potential to efficiently complement experimental studies in biology.","lang":"eng"}],"type":"journal_article","date_created":"2018-12-11T12:08:41Z","issue":"4","publication_status":"published","main_file_link":[{"url":"http://www.biomedcentral.com/1752-0509/1/4","open_access":"0"}],"quality_controlled":0,"publist_id":"325","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"}},{"publication_status":"published","quality_controlled":0,"publist_id":"314","alternative_title":["LNCS"],"date_updated":"2021-01-12T07:56:49Z","year":"2007","abstract":[{"lang":"eng","text":"Counterexample-guided abstraction refinement (CEGAR) is a powerful technique to scale automatic program analysis techniques to large programs. However, so far it has been used primarily for model checking in the context of predicate abstraction. We formalize CEGAR for general powerset domains. If a spurious abstract counterexample needs to be removed through abstraction refinement, there are often several choices, such as which program location(s) to refine, which abstract domain(s) to use at different locations, and which abstract values to compute. We define several plausible preference orderings on abstraction refinements, such as refining as “late” as possible and as “coarse” as possible. We present generic algorithms for finding refinements that are optimal with respect to the different preference orderings. We also compare the different orderings with respect to desirable properties, including the property if locally optimal refinements compose to a global optimum. Finally, we point out some difficulties with CEGAR for non-powerset domains."}],"type":"book_chapter","date_created":"2018-12-11T12:08:45Z","acknowledgement":"This research is partially supported by the Clore Fellowship Programme. Supported in part by the Swiss National Science Foundation.","publisher":"Springer","volume":4444,"day":"30","extern":1,"author":[{"first_name":"Roman","last_name":"Manevich","full_name":"Manevich, Roman"},{"last_name":"Field","full_name":"Field, John","first_name":"John"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger","full_name":"Thomas Henzinger"},{"last_name":"Ramalingam","full_name":"Ramalingam, Ganesan","first_name":"Ganesan"},{"first_name":"Mooly","last_name":"Sagiv","full_name":"Sagiv, Mooly"}],"_id":"4417","title":"Abstract counterexample-based refinement for powerset domains","status":"public","month":"03","intvolume":"      4444","doi":"10.1007/978-3-540-71322-7_13","page":"273 - 292","publication":"Program Analysis and Compilation, Theory and Practice: Essays Dedicated to Reinhard Wilhelm on the Occasion of His 60th Birthday","date_published":"2007-03-30T00:00:00Z","citation":{"mla":"Manevich, Roman, et al. “Abstract Counterexample-Based Refinement for Powerset Domains.” <i>Program Analysis and Compilation, Theory and Practice: Essays Dedicated to Reinhard Wilhelm on the Occasion of His 60th Birthday</i>, vol. 4444, Springer, 2007, pp. 273–92, doi:<a href=\"https://doi.org/10.1007/978-3-540-71322-7_13\">10.1007/978-3-540-71322-7_13</a>.","ista":"Manevich R, Field J, Henzinger TA, Ramalingam G, Sagiv M. 2007.Abstract counterexample-based refinement for powerset domains. In: Program Analysis and Compilation, Theory and Practice: Essays Dedicated to Reinhard Wilhelm on the Occasion of His 60th Birthday. LNCS, vol. 4444, 273–292.","ieee":"R. Manevich, J. Field, T. A. Henzinger, G. Ramalingam, and M. Sagiv, “Abstract counterexample-based refinement for powerset domains,” in <i>Program Analysis and Compilation, Theory and Practice: Essays Dedicated to Reinhard Wilhelm on the Occasion of His 60th Birthday</i>, vol. 4444, Springer, 2007, pp. 273–292.","ama":"Manevich R, Field J, Henzinger TA, Ramalingam G, Sagiv M. Abstract counterexample-based refinement for powerset domains. In: <i>Program Analysis and Compilation, Theory and Practice: Essays Dedicated to Reinhard Wilhelm on the Occasion of His 60th Birthday</i>. Vol 4444. Springer; 2007:273-292. doi:<a href=\"https://doi.org/10.1007/978-3-540-71322-7_13\">10.1007/978-3-540-71322-7_13</a>","apa":"Manevich, R., Field, J., Henzinger, T. A., Ramalingam, G., &#38; Sagiv, M. (2007). Abstract counterexample-based refinement for powerset domains. In <i>Program Analysis and Compilation, Theory and Practice: Essays Dedicated to Reinhard Wilhelm on the Occasion of His 60th Birthday</i> (Vol. 4444, pp. 273–292). Springer. <a href=\"https://doi.org/10.1007/978-3-540-71322-7_13\">https://doi.org/10.1007/978-3-540-71322-7_13</a>","chicago":"Manevich, Roman, John Field, Thomas A Henzinger, Ganesan Ramalingam, and Mooly Sagiv. “Abstract Counterexample-Based Refinement for Powerset Domains.” In <i>Program Analysis and Compilation, Theory and Practice: Essays Dedicated to Reinhard Wilhelm on the Occasion of His 60th Birthday</i>, 4444:273–92. Springer, 2007. <a href=\"https://doi.org/10.1007/978-3-540-71322-7_13\">https://doi.org/10.1007/978-3-540-71322-7_13</a>.","short":"R. Manevich, J. Field, T.A. Henzinger, G. Ramalingam, M. Sagiv, in:, Program Analysis and Compilation, Theory and Practice: Essays Dedicated to Reinhard Wilhelm on the Occasion of His 60th Birthday, Springer, 2007, pp. 273–292."}},{"extern":1,"publisher":"ACM","day":"01","volume":29,"author":[{"orcid":"0000−0002−2985−7724","first_name":"Thomas A","full_name":"Thomas Henzinger","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Kirsch","full_name":"Kirsch, Christoph M","first_name":"Christoph"}],"_id":"4446","status":"public","title":"The embedded machine: Predictable, portable real-time code","month":"10","intvolume":"        29","doi":"10.1145/1286821.1286824","publication":"ACM Transactions on Programming Languages and Systems (TOPLAS)","date_published":"2007-10-01T00:00:00Z","citation":{"short":"T.A. Henzinger, C. Kirsch, ACM Transactions on Programming Languages and Systems (TOPLAS) 29 (2007).","ama":"Henzinger TA, Kirsch C. The embedded machine: Predictable, portable real-time code. <i>ACM Transactions on Programming Languages and Systems (TOPLAS)</i>. 2007;29(393). doi:<a href=\"https://doi.org/10.1145/1286821.1286824\">10.1145/1286821.1286824</a>","apa":"Henzinger, T. A., &#38; Kirsch, C. (2007). The embedded machine: Predictable, portable real-time code. <i>ACM Transactions on Programming Languages and Systems (TOPLAS)</i>. ACM. <a href=\"https://doi.org/10.1145/1286821.1286824\">https://doi.org/10.1145/1286821.1286824</a>","chicago":"Henzinger, Thomas A, and Christoph Kirsch. “The Embedded Machine: Predictable, Portable Real-Time Code.” <i>ACM Transactions on Programming Languages and Systems (TOPLAS)</i>. ACM, 2007. <a href=\"https://doi.org/10.1145/1286821.1286824\">https://doi.org/10.1145/1286821.1286824</a>.","mla":"Henzinger, Thomas A., and Christoph Kirsch. “The Embedded Machine: Predictable, Portable Real-Time Code.” <i>ACM Transactions on Programming Languages and Systems (TOPLAS)</i>, vol. 29, no. 393, ACM, 2007, doi:<a href=\"https://doi.org/10.1145/1286821.1286824\">10.1145/1286821.1286824</a>.","ista":"Henzinger TA, Kirsch C. 2007. The embedded machine: Predictable, portable real-time code. ACM Transactions on Programming Languages and Systems (TOPLAS). 29(393).","ieee":"T. A. Henzinger and C. Kirsch, “The embedded machine: Predictable, portable real-time code,” <i>ACM Transactions on Programming Languages and Systems (TOPLAS)</i>, vol. 29, no. 393. ACM, 2007."},"publication_status":"published","quality_controlled":0,"issue":393,"publist_id":"286","date_updated":"2021-01-12T07:57:01Z","year":"2007","abstract":[{"lang":"eng","text":"The Embedded Machine is a virtual machine that mediates in real time the interaction between software processes and physical processes. It separates the compilation of embedded programs into two phases. The first phase, the platform-independent compiler phase, generates E code (code executed by the Embedded Machine), which supervises the timing, not the scheduling of, application tasks relative to external events such as clock ticks and sensor interrupts. E code is portable and, given an input behavior, exhibits predictable (i.e., deterministic) timing and output behavior. The second phase, the platform-dependent compiler phase, checks the time safety of the E code, that is, whether platform performance (determined by the hardware) and platform utilization (determined by the scheduler of the operating system) enable its timely execution. We have used the Embedded Machine to compile and execute high-performance control applications written in Giotto, such as the flight control system of an autonomous model helicopter."}],"date_created":"2018-12-11T12:08:53Z","type":"journal_article"},{"doi":"10.1007/978-3-540-73208-2_2","intvolume":"      4588","_id":"4511","month":"06","title":"Quantitative generalizations of languages","status":"public","date_published":"2007-06-21T00:00:00Z","citation":{"chicago":"Henzinger, Thomas A. “Quantitative Generalizations of Languages,” 4588:20–22. Springer, 2007. <a href=\"https://doi.org/10.1007/978-3-540-73208-2_2\">https://doi.org/10.1007/978-3-540-73208-2_2</a>.","apa":"Henzinger, T. A. (2007). Quantitative generalizations of languages (Vol. 4588, pp. 20–22). Presented at the DLT: Developments in Language Theory, Springer. <a href=\"https://doi.org/10.1007/978-3-540-73208-2_2\">https://doi.org/10.1007/978-3-540-73208-2_2</a>","ama":"Henzinger TA. Quantitative generalizations of languages. In: Vol 4588. Springer; 2007:20-22. doi:<a href=\"https://doi.org/10.1007/978-3-540-73208-2_2\">10.1007/978-3-540-73208-2_2</a>","ieee":"T. A. Henzinger, “Quantitative generalizations of languages,” presented at the DLT: Developments in Language Theory, 2007, vol. 4588, pp. 20–22.","ista":"Henzinger TA. 2007. Quantitative generalizations of languages. DLT: Developments in Language Theory, LNCS, vol. 4588, 20–22.","mla":"Henzinger, Thomas A. <i>Quantitative Generalizations of Languages</i>. Vol. 4588, Springer, 2007, pp. 20–22, doi:<a href=\"https://doi.org/10.1007/978-3-540-73208-2_2\">10.1007/978-3-540-73208-2_2</a>.","short":"T.A. Henzinger, in:, Springer, 2007, pp. 20–22."},"page":"20 - 22","publisher":"Springer","volume":4588,"conference":{"name":"DLT: Developments in Language Theory"},"day":"21","extern":1,"author":[{"orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger","full_name":"Thomas Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"year":"2007","date_updated":"2021-01-12T07:59:21Z","acknowledgement":"This research was supported in part by the Swiss National Science Foundation and by the NSF grant CCR-0225610.","abstract":[{"lang":"eng","text":"In the traditional view, a language is a set of words, i.e., a function from words to boolean values. We call this view “qualitative,” because each word either belongs to or does not belong to a language. Let Σ be an alphabet, and let us consider infinite words over Σ. Formally, a qualitative language over Σ is a function A: B . There are many applications of qualitative languages. For example, qualitative languages are used to specify the legal behaviors of systems, and zero-sum objectives of games played on graphs. In the former case, each behavior of a system is either legal or illegal; in the latter case, each outcome of a game is either winning or losing. For defining languages, it is convenient to use finite acceptors (or generators). In particular, qualitative languages are often defined using finite-state machines (so-called ω-automata) whose transitions are labeled by letters from Σ. For example, the states of an ω-automaton may represent states of a system, and the transition labels may represent atomic observables of a behavior. There is a rich and well-studied theory of finite-state acceptors of qualitative languages, namely, the theory of theω-regular languages."}],"date_created":"2018-12-11T12:09:14Z","type":"conference","publication_status":"published","quality_controlled":0,"alternative_title":["LNCS"],"publist_id":"218"},{"month":"01","_id":"4514","title":"Games, time, and probability: Graph models for system design and analysis","status":"public","intvolume":"      4362","doi":"10.1007/978-3-540-69507-3_7","page":"103 - 110","citation":{"apa":"Henzinger, T. A. (2007). Games, time, and probability: Graph models for system design and analysis (Vol. 4362, pp. 103–110). Presented at the SOFSEM: Current Trends in Theory and Practice of Computer Science, Springer. <a href=\"https://doi.org/10.1007/978-3-540-69507-3_7\">https://doi.org/10.1007/978-3-540-69507-3_7</a>","chicago":"Henzinger, Thomas A. “Games, Time, and Probability: Graph Models for System Design and Analysis,” 4362:103–10. Springer, 2007. <a href=\"https://doi.org/10.1007/978-3-540-69507-3_7\">https://doi.org/10.1007/978-3-540-69507-3_7</a>.","ama":"Henzinger TA. Games, time, and probability: Graph models for system design and analysis. In: Vol 4362. Springer; 2007:103-110. doi:<a href=\"https://doi.org/10.1007/978-3-540-69507-3_7\">10.1007/978-3-540-69507-3_7</a>","ieee":"T. A. Henzinger, “Games, time, and probability: Graph models for system design and analysis,” presented at the SOFSEM: Current Trends in Theory and Practice of Computer Science, 2007, vol. 4362, pp. 103–110.","ista":"Henzinger TA. 2007. Games, time, and probability: Graph models for system design and analysis. SOFSEM: Current Trends in Theory and Practice of Computer Science, LNCS, vol. 4362, 103–110.","mla":"Henzinger, Thomas A. <i>Games, Time, and Probability: Graph Models for System Design and Analysis</i>. Vol. 4362, Springer, 2007, pp. 103–10, doi:<a href=\"https://doi.org/10.1007/978-3-540-69507-3_7\">10.1007/978-3-540-69507-3_7</a>.","short":"T.A. Henzinger, in:, Springer, 2007, pp. 103–110."},"date_published":"2007-01-04T00:00:00Z","author":[{"first_name":"Thomas A","orcid":"0000−0002−2985−7724","full_name":"Thomas Henzinger","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"volume":4362,"publisher":"Springer","day":"04","extern":1,"conference":{"name":"SOFSEM: Current Trends in Theory and Practice of Computer Science"},"date_updated":"2021-01-12T07:59:22Z","year":"2007","type":"conference","date_created":"2018-12-11T12:09:15Z","abstract":[{"text":"Digital technology is increasingly deployed in safety-critical situations. This calls for systematic design and verification methodologies that can cope with three major sources of system complexity: concurrency, real time, and uncertainty. We advocate a two-step process: formal modeling followed by algorithmic analysis (or, “model building” followed by “model checking”). We model the concurrent components of a reactive system as potential collaborators or adversaries in a multi-player game with temporal objectives, such as system safety. The real-time aspect of embedded systems requires models that combine discrete state transitions and continuous state evolutions. Uncertainty in the environment is naturally modeled by probabilistic state changes. As a result, we obtain three orthogonal extensions of the basic state-transition graph model for reactive systems —game graphs, timed graphs, and stochastic graphs— as well as combinations thereof. In this short text, we provide a uniform exposition of the underlying definitions. For verification algorithms, we refer the reader to the literature.","lang":"eng"}],"acknowledgement":"This research was supported in part by the Swiss National Science Foundation, and by the NSF ITR grant CCR-0225610.","quality_controlled":0,"publication_status":"published","alternative_title":["LNCS"],"publist_id":"217"},{"page":"1239 - 1249","publication":"Nature Biotechnology","date_published":"2007-01-01T00:00:00Z","citation":{"short":"J. Fisher, T.A. Henzinger, Nature Biotechnology 25 (2007) 1239–1249.","apa":"Fisher, J., &#38; Henzinger, T. A. (2007). Executable cell biology. <i>Nature Biotechnology</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/nbt1356\">https://doi.org/10.1038/nbt1356</a>","chicago":"Fisher, Jasmin, and Thomas A Henzinger. “Executable Cell Biology.” <i>Nature Biotechnology</i>. Nature Publishing Group, 2007. <a href=\"https://doi.org/10.1038/nbt1356\">https://doi.org/10.1038/nbt1356</a>.","ama":"Fisher J, Henzinger TA. Executable cell biology. <i>Nature Biotechnology</i>. 2007;25:1239-1249. doi:<a href=\"https://doi.org/10.1038/nbt1356\">10.1038/nbt1356</a>","ieee":"J. Fisher and T. A. Henzinger, “Executable cell biology,” <i>Nature Biotechnology</i>, vol. 25. Nature Publishing Group, pp. 1239–1249, 2007.","ista":"Fisher J, Henzinger TA. 2007. Executable cell biology. Nature Biotechnology. 25, 1239–1249.","mla":"Fisher, Jasmin, and Thomas A. Henzinger. “Executable Cell Biology.” <i>Nature Biotechnology</i>, vol. 25, Nature Publishing Group, 2007, pp. 1239–49, doi:<a href=\"https://doi.org/10.1038/nbt1356\">10.1038/nbt1356</a>."},"_id":"4529","status":"public","title":"Executable cell biology","month":"01","doi":"10.1038/nbt1356","intvolume":"        25","extern":1,"publisher":"Nature Publishing Group","day":"01","volume":25,"author":[{"first_name":"Jasmin","last_name":"Fisher","full_name":"Fisher, Jasmin"},{"orcid":"0000−0002−2985−7724","first_name":"Thomas A","full_name":"Thomas Henzinger","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"abstract":[{"lang":"eng","text":"Computational modeling of biological systems is becoming increasingly important in efforts to better understand complex biological behaviors. In this review, we distinguish between two types of biological models—mathematical and computational—which differ in their representations of biological phenomena. We call the approach of constructing computational models of biological systems 'executable biology', as it focuses on the design of executable computer algorithms that mimic biological phenomena. We survey the main modeling efforts in this direction, emphasize the applicability and benefits of executable models in biological research and highlight some of the challenges that executable biology poses for biology and computer science. We claim that for executable biology to reach its full potential as a mainstream biological technique, formal and algorithmic approaches must be integrated into biological research. This will drive biology toward a more precise engineering discipline."}],"type":"journal_article","date_created":"2018-12-11T12:09:19Z","date_updated":"2021-01-12T07:59:28Z","year":"2007","publist_id":"198","publication_status":"published","quality_controlled":0},{"author":[{"full_name":"Duparc, Jacques","last_name":"Duparc","first_name":"Jacques"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Thomas Henzinger","last_name":"Henzinger","orcid":"0000−0002−2985−7724","first_name":"Thomas A"}],"extern":1,"volume":4646,"publisher":"Springer","day":"01","publication":"CSL: Computer Science Logic","citation":{"short":"J. Duparc, T.A. Henzinger, CSL: Computer Science Logic , Springer, 2007.","ama":"Duparc J, Henzinger TA. <i>CSL: Computer Science Logic </i>. Vol 4646. Springer; 2007. doi:<a href=\"https://doi.org/10.1007/978-3-540-74915-8\">10.1007/978-3-540-74915-8</a>","chicago":"Duparc, Jacques, and Thomas A Henzinger. <i>CSL: Computer Science Logic </i>. <i>CSL: Computer Science Logic</i>. Vol. 4646. Springer, 2007. <a href=\"https://doi.org/10.1007/978-3-540-74915-8\">https://doi.org/10.1007/978-3-540-74915-8</a>.","apa":"Duparc, J., &#38; Henzinger, T. A. (2007). <i>CSL: Computer Science Logic </i>. <i>CSL: Computer Science Logic</i> (Vol. 4646). Springer. <a href=\"https://doi.org/10.1007/978-3-540-74915-8\">https://doi.org/10.1007/978-3-540-74915-8</a>","mla":"Duparc, Jacques, and Thomas A. Henzinger. “CSL: Computer Science Logic .” <i>CSL: Computer Science Logic</i>, vol. 4646, Springer, 2007, doi:<a href=\"https://doi.org/10.1007/978-3-540-74915-8\">10.1007/978-3-540-74915-8</a>.","ista":"Duparc J, Henzinger TA. 2007. CSL: Computer Science Logic , Springer,p.","ieee":"J. Duparc and T. A. Henzinger, <i>CSL: Computer Science Logic </i>, vol. 4646. Springer, 2007."},"date_published":"2007-09-01T00:00:00Z","_id":"4530","status":"public","title":"CSL: Computer Science Logic ","month":"09","doi":"10.1007/978-3-540-74915-8","intvolume":"      4646","alternative_title":["LNCS"],"publist_id":"194","quality_controlled":0,"publication_status":"published","type":"conference_editor","date_created":"2018-12-11T12:09:20Z","abstract":[{"lang":"eng","text":"This book constitutes the refereed proceedings of the 21st International Workshop on Computer Science Logic, CSL 2007, held as the 16th Annual Conference of the EACSL in Lausanne, Switzerland. The 36 revised full papers presented together with the abstracts of six invited lectures are organized in topical sections on logic and games, expressiveness, games and trees, logic and deduction, lambda calculus, finite model theory, linear logic, proof theory, and game semantics."}],"date_updated":"2019-08-02T12:38:32Z","year":"2007"},{"_id":"4531","status":"public","month":"05","title":"Predictive modeling of signaling crosstalk during C. elegans vulval development","doi":"10.1371/journal.pcbi.0030092","publication":"PLoS Computational Biology","date_published":"2007-05-18T00:00:00Z","citation":{"short":"J. Fisher, N. Piterman, A. Hajnal, T.A. Henzinger, PLoS Computational Biology 3(5):e92 (2007).","ista":"Fisher J, Piterman N, Hajnal A, Henzinger TA. 2007. Predictive modeling of signaling crosstalk during C. elegans vulval development. PLoS Computational Biology. 3(5):e92.","ieee":"J. Fisher, N. Piterman, A. Hajnal, and T. A. Henzinger, “Predictive modeling of signaling crosstalk during C. elegans vulval development,” <i>PLoS Computational Biology</i>, vol. 3(5):e92. Public Library of Science, 2007.","mla":"Fisher, Jasmin, et al. “Predictive Modeling of Signaling Crosstalk during C. Elegans Vulval Development.” <i>PLoS Computational Biology</i>, vol. 3(5):e92, Public Library of Science, 2007, doi:<a href=\"https://doi.org/10.1371/journal.pcbi.0030092\">10.1371/journal.pcbi.0030092</a>.","chicago":"Fisher, Jasmin, Nir Piterman, Alex Hajnal, and Thomas A Henzinger. “Predictive Modeling of Signaling Crosstalk during C. Elegans Vulval Development.” <i>PLoS Computational Biology</i>. Public Library of Science, 2007. <a href=\"https://doi.org/10.1371/journal.pcbi.0030092\">https://doi.org/10.1371/journal.pcbi.0030092</a>.","apa":"Fisher, J., Piterman, N., Hajnal, A., &#38; Henzinger, T. A. (2007). Predictive modeling of signaling crosstalk during C. elegans vulval development. <i>PLoS Computational Biology</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pcbi.0030092\">https://doi.org/10.1371/journal.pcbi.0030092</a>","ama":"Fisher J, Piterman N, Hajnal A, Henzinger TA. Predictive modeling of signaling crosstalk during C. elegans vulval development. <i>PLoS Computational Biology</i>. 2007;3(5):e92. doi:<a href=\"https://doi.org/10.1371/journal.pcbi.0030092\">10.1371/journal.pcbi.0030092</a>"},"extern":1,"publisher":"Public Library of Science","day":"18","volume":"3(5):e92","author":[{"first_name":"Jasmin","full_name":"Fisher, Jasmin","last_name":"Fisher"},{"first_name":"Nir","full_name":"Piterman, Nir","last_name":"Piterman"},{"first_name":"Alex","last_name":"Hajnal","full_name":"Hajnal, Alex"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","full_name":"Thomas Henzinger","last_name":"Henzinger"}],"date_updated":"2021-01-12T07:59:29Z","year":"2007","abstract":[{"text":"Caenorhabditis elegans vulval development provides an important paradigm for studying the process of cell fate determination and pattern formation during animal development. Although many genes controlling vulval cell fate specification have been identified, how they orchestrate themselves to generate a robust and invariant pattern of cell fates is not yet completely understood. Here, we have developed a dynamic computational model incorporating the current mechanistic understanding of gene interactions during this patterning process. A key feature of our model is the inclusion of multiple modes of crosstalk between the epidermal growth factor receptor (EGFR) and LIN-12/Notch signaling pathways, which together determine the fates of the six vulval precursor cells (VPCs). Computational analysis, using the model-checking technique, provides new biological insights into the regulatory network governing VPC fate specification and predicts novel negative feedback loops. In addition, our analysis shows that most mutations affecting vulval development lead to stable fate patterns in spite of variations in synchronicity between VPCs. Computational searches for the basis of this robustness show that a sequential activation of the EGFR-mediated inductive signaling and LIN-12 / Notch-mediated lateral signaling pathways is key to achieve a stable cell fate pattern. We demonstrate experimentally a time-delay between the activation of the inductive and lateral signaling pathways in wild-type animals and the loss of sequential signaling in mutants showing unstable fate patterns; thus, validating two key predictions provided by our modeling work. The insights gained by our modeling study further substantiate the usefulness of executing and analyzing mechanistic models to investigate complex biological behaviors.","lang":"eng"}],"type":"journal_article","date_created":"2018-12-11T12:09:20Z","acknowledgement":"This work was supported in part by the Swiss National Science Foundation (grant 205321–111840).","publication_status":"published","quality_controlled":0,"publist_id":"195","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"}},{"author":[{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Krishnendu Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Thomas Henzinger"}],"publisher":"Springer","extern":1,"volume":4424,"day":"01","conference":{"name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems"},"page":"261 - 275","citation":{"mla":"Chatterjee, Krishnendu, and Thomas A. Henzinger. <i>Assume-Guarantee Synthesis</i>. Vol. 4424, Springer, 2007, pp. 261–75, doi:<a href=\"https://doi.org/10.1007/978-3-540-71209-1_21\">10.1007/978-3-540-71209-1_21</a>.","ista":"Chatterjee K, Henzinger TA. 2007. Assume-guarantee synthesis. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 4424, 261–275.","ieee":"K. Chatterjee and T. A. Henzinger, “Assume-guarantee synthesis,” presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, 2007, vol. 4424, pp. 261–275.","ama":"Chatterjee K, Henzinger TA. Assume-guarantee synthesis. In: Vol 4424. Springer; 2007:261-275. doi:<a href=\"https://doi.org/10.1007/978-3-540-71209-1_21\">10.1007/978-3-540-71209-1_21</a>","chicago":"Chatterjee, Krishnendu, and Thomas A Henzinger. “Assume-Guarantee Synthesis,” 4424:261–75. Springer, 2007. <a href=\"https://doi.org/10.1007/978-3-540-71209-1_21\">https://doi.org/10.1007/978-3-540-71209-1_21</a>.","apa":"Chatterjee, K., &#38; Henzinger, T. A. (2007). Assume-guarantee synthesis (Vol. 4424, pp. 261–275). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Springer. <a href=\"https://doi.org/10.1007/978-3-540-71209-1_21\">https://doi.org/10.1007/978-3-540-71209-1_21</a>","short":"K. Chatterjee, T.A. Henzinger, in:, Springer, 2007, pp. 261–275."},"date_published":"2007-01-01T00:00:00Z","status":"public","_id":"4537","title":"Assume-guarantee synthesis","month":"01","doi":"10.1007/978-3-540-71209-1_21","intvolume":"      4424","publist_id":"186","alternative_title":["LNCS"],"quality_controlled":0,"publication_status":"published","date_created":"2018-12-11T12:09:22Z","type":"conference","abstract":[{"lang":"eng","text":"The classical synthesis problem for reactive systems asks, given a proponent process A and an opponent process B, to refine A so that the closed-loop system A parallel to B satisfies a given specification Phi. The solution of this problem requires the computation of a winning strategy for proponent A in a game against opponent B. We define and study the co-synthesis problem, where the proponent A consists itself of two independent processes, A = A(1)parallel to A(2), with specifications Phi(1) and Phi(2), and the goal is to refine both A(1) and A(2) so that A(1)parallel to A(2)parallel to B satisfies Phi(1) boolean AND Phi(2). For example, if the opponent B is a fair scheduler for the two processes A(1) and A(2), and Phi(i) specifies the requirements of mutual exclusion for A(i) (e.g., starvation freedom), then the co-synthesis problem asks for the automatic synthesis of a mutual-exclusion protocol. We show that co-synthesis defined classically, with the processes A(1) and A(2) either collaborating or competing, does not capture desirable solutions. Instead, the proper formulation of co-synthesis is the one where process A, competes with A(2) but not at the price of violating Phi(1), and vice versa. We call this assume-guarantee synthesis and show that it can be solved by computing secure-equilibrium strategies. In particular, from mutual-exclusion requirements the assume-guarantee synthesis algorithm automatically computes Peterson's protocol."}],"acknowledgement":"This research was supported in part by the Swiss National Science Foundation and by the NSF grants CCR-0225610 and CCR-0234690.","date_updated":"2021-01-12T07:59:32Z","year":"2007"},{"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"publist_id":"167","issue":184,"quality_controlled":0,"publication_status":"published","acknowledgement":"This research was supported in part by the NSF grants CCR-0225610 and CCR-0234690 by the SNSF under the Indo-Swiss Joint Research Programme and by the FRFC project “Centre Fédéré en Vérification” funded by the FNRS under grant 2.4530.02.","type":"journal_article","date_created":"2018-12-11T12:09:25Z","abstract":[{"text":"We study observation-based strategies for two-player turn-based games on graphs with omega-regular objectives. An observation-based strategy relies on imperfect information about the history of a play, namely, on the past sequence of observations. Such games occur in the synthesis of a controller that does not see the private state of the plant. Our main results are twofold. First, we give a fixed-point algorithm for computing the set of states from which a player can win with a deterministic observation-based strategy for any omega-regular objective. The fixed point is computed in the lattice of antichains of state sets. This algorithm has the advantages of being directed by the objective and of avoiding an explicit subset construction on the game graph. Second, we give an algorithm for computing the set of states from which a player can win with probability 1 with a randomized observation-based strategy for a Buechi objective. This set is of interest because in the absence of perfect information, randomized strategies are more powerful than deterministic ones. We show that our algorithms are optimal by proving matching lower bounds.","lang":"eng"}],"year":"2007","date_updated":"2021-01-12T07:59:36Z","author":[{"first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Krishnendu Chatterjee","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Laurent","last_name":"Doyen","full_name":"Doyen, Laurent"},{"full_name":"Thomas Henzinger","last_name":"Henzinger","orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Raskin, Jean-François","last_name":"Raskin","first_name":"Jean"}],"day":"27","publisher":"International Federation of Computational Logic","extern":1,"volume":3,"citation":{"short":"K. Chatterjee, L. Doyen, T.A. Henzinger, J. Raskin, Logical Methods in Computer Science 3 (2007) 1–23.","ama":"Chatterjee K, Doyen L, Henzinger TA, Raskin J. Algorithms for omega-regular games with imperfect information. <i>Logical Methods in Computer Science</i>. 2007;3(184):1-23. doi:<a href=\"https://doi.org/10.2168/LMCS-3(3:4)2007\">10.2168/LMCS-3(3:4)2007</a>","chicago":"Chatterjee, Krishnendu, Laurent Doyen, Thomas A Henzinger, and Jean Raskin. “Algorithms for Omega-Regular Games with Imperfect Information.” <i>Logical Methods in Computer Science</i>. International Federation of Computational Logic, 2007. <a href=\"https://doi.org/10.2168/LMCS-3(3:4)2007\">https://doi.org/10.2168/LMCS-3(3:4)2007</a>.","apa":"Chatterjee, K., Doyen, L., Henzinger, T. A., &#38; Raskin, J. (2007). Algorithms for omega-regular games with imperfect information. <i>Logical Methods in Computer Science</i>. International Federation of Computational Logic. <a href=\"https://doi.org/10.2168/LMCS-3(3:4)2007\">https://doi.org/10.2168/LMCS-3(3:4)2007</a>","mla":"Chatterjee, Krishnendu, et al. “Algorithms for Omega-Regular Games with Imperfect Information.” <i>Logical Methods in Computer Science</i>, vol. 3, no. 184, International Federation of Computational Logic, 2007, pp. 1–23, doi:<a href=\"https://doi.org/10.2168/LMCS-3(3:4)2007\">10.2168/LMCS-3(3:4)2007</a>.","ieee":"K. Chatterjee, L. Doyen, T. A. Henzinger, and J. Raskin, “Algorithms for omega-regular games with imperfect information,” <i>Logical Methods in Computer Science</i>, vol. 3, no. 184. International Federation of Computational Logic, pp. 1–23, 2007.","ista":"Chatterjee K, Doyen L, Henzinger TA, Raskin J. 2007. Algorithms for omega-regular games with imperfect information. Logical Methods in Computer Science. 3(184), 1–23."},"date_published":"2007-07-27T00:00:00Z","publication":"Logical Methods in Computer Science","page":"1 - 23","doi":"10.2168/LMCS-3(3:4)2007","intvolume":"         3","title":"Algorithms for omega-regular games with imperfect information","_id":"4547","status":"public","month":"07"},{"publist_id":"4239","issue":"6","publication_status":"published","quality_controlled":0,"abstract":[{"lang":"eng","text":"The highest densities of the two metabotropic GABA subunits, GABA B1 and GABAB2, have been reported as occurring around the glutamatergic synapses between Purkinje cell spines and parallel fibre varicosities. In order to determine how this distribution is achieved during development, we investigated the expression pattern and the cellular and subcellular localization of the GABAB1 and GABAB2 subunits in the rat cerebellum during postnatal development. At the light microscopic level, immunoreactivity for the GABAB1 and GABAB2 subunits was very prominent in the developing molecular layer, especially in Purkinje cells. Using double immunofluorescence, we demonstrated that GABAB1 was transiently expressed in glial cells. At the electron microscopic level, immunoreactivity for GABAB receptors was always detected both pre- and postsynaptically. Presynaptically, GABAB1 and GABAB2 were localized in the extrasynaptic membrane of parallel fibres at all ages, and only rarely in GABAergic axons. Postsynaptically, GABAB receptors were localized to the extrasynaptic and perisynaptic plasma membrane of Purkinje cell dendrites and spines throughout development. Quantitative analysis and three-dimensional reconstructions further revealed a progressive developmental movement of the GABAB1 subunit on the surface of Purkinje cells from dendritic shafts to its final destination, the dendritic spines. Together, these results indicate that GABAB receptors undergo dynamic regulation during cerebellar development in association with the establishment and maturation of glutamatergic synapses to Purkinje cells."}],"type":"journal_article","date_created":"2018-12-11T11:58:54Z","year":"2006","date_updated":"2021-01-12T06:58:52Z","publisher":"Wiley-Blackwell","extern":1,"volume":23,"day":"01","author":[{"first_name":"Rafael","full_name":"Luján, Rafael","last_name":"Luján"},{"id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8761-9444","first_name":"Ryuichi","full_name":"Ryuichi Shigemoto","last_name":"Shigemoto"}],"date_published":"2006-03-01T00:00:00Z","citation":{"short":"R. Luján, R. Shigemoto, European Journal of Neuroscience 23 (2006) 1479–1490.","chicago":"Luján, Rafael, and Ryuichi Shigemoto. “Localization of Metabotropic GABA Receptor Subunits GABAB1 and GABAB2 Relative to Synaptic Sites in the Rat Developing Cerebellum.” <i>European Journal of Neuroscience</i>. Wiley-Blackwell, 2006. <a href=\"https://doi.org/10.1111/j.1460-9568.2006.04669.x\">https://doi.org/10.1111/j.1460-9568.2006.04669.x</a>.","apa":"Luján, R., &#38; Shigemoto, R. (2006). Localization of metabotropic GABA receptor subunits GABAB1 and GABAB2 relative to synaptic sites in the rat developing cerebellum. <i>European Journal of Neuroscience</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/j.1460-9568.2006.04669.x\">https://doi.org/10.1111/j.1460-9568.2006.04669.x</a>","ama":"Luján R, Shigemoto R. Localization of metabotropic GABA receptor subunits GABAB1 and GABAB2 relative to synaptic sites in the rat developing cerebellum. <i>European Journal of Neuroscience</i>. 2006;23(6):1479-1490. doi:<a href=\"https://doi.org/10.1111/j.1460-9568.2006.04669.x\">10.1111/j.1460-9568.2006.04669.x</a>","ista":"Luján R, Shigemoto R. 2006. Localization of metabotropic GABA receptor subunits GABAB1 and GABAB2 relative to synaptic sites in the rat developing cerebellum. European Journal of Neuroscience. 23(6), 1479–1490.","ieee":"R. Luján and R. Shigemoto, “Localization of metabotropic GABA receptor subunits GABAB1 and GABAB2 relative to synaptic sites in the rat developing cerebellum,” <i>European Journal of Neuroscience</i>, vol. 23, no. 6. Wiley-Blackwell, pp. 1479–1490, 2006.","mla":"Luján, Rafael, and Ryuichi Shigemoto. “Localization of Metabotropic GABA Receptor Subunits GABAB1 and GABAB2 Relative to Synaptic Sites in the Rat Developing Cerebellum.” <i>European Journal of Neuroscience</i>, vol. 23, no. 6, Wiley-Blackwell, 2006, pp. 1479–90, doi:<a href=\"https://doi.org/10.1111/j.1460-9568.2006.04669.x\">10.1111/j.1460-9568.2006.04669.x</a>."},"page":"1479 - 1490","publication":"European Journal of Neuroscience","intvolume":"        23","doi":"10.1111/j.1460-9568.2006.04669.x","status":"public","_id":"2657","title":"Localization of metabotropic GABA receptor subunits GABAB1 and GABAB2 relative to synaptic sites in the rat developing cerebellum","month":"03"},{"author":[{"full_name":"Inamura, Mihoko","last_name":"Inamura","first_name":"Mihoko"},{"last_name":"Itakura","full_name":"Itakura, Makoto","first_name":"Makoto"},{"full_name":"Okamoto, Hirotsugu","last_name":"Okamoto","first_name":"Hirotsugu"},{"last_name":"Hoka","full_name":"Hoka, Sumio","first_name":"Sumio"},{"full_name":"Mizoguchi, Akira","last_name":"Mizoguchi","first_name":"Akira"},{"first_name":"Yugo","last_name":"Fukazawa","full_name":"Fukazawa, Yugo"},{"orcid":"0000-0001-8761-9444","first_name":"Ryuichi","last_name":"Shigemoto","full_name":"Ryuichi Shigemoto","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Saori","full_name":"Yamamori, Saori","last_name":"Yamamori"},{"last_name":"Takahashi","full_name":"Takahashi, Masami","first_name":"Masami"}],"publisher":"Elsevier","day":"01","volume":55,"extern":1,"intvolume":"        55","doi":"10.1016/j.neures.2006.01.004","status":"public","_id":"2659","title":" Differential localization and regulation of stargazin-like protein, γ-8 and stargazin in the plasma membrane of hippocampal and cortical neurons","month":"05","citation":{"short":"M. Inamura, M. Itakura, H. Okamoto, S. Hoka, A. Mizoguchi, Y. Fukazawa, R. Shigemoto, S. Yamamori, M. Takahashi, Neuroscience Research 55 (2006) 45–53.","mla":"Inamura, Mihoko, et al. “ Differential Localization and Regulation of Stargazin-like Protein, γ-8 and Stargazin in the Plasma Membrane of Hippocampal and Cortical Neurons.” <i>Neuroscience Research</i>, vol. 55, no. 1, Elsevier, 2006, pp. 45–53, doi:<a href=\"https://doi.org/10.1016/j.neures.2006.01.004\">10.1016/j.neures.2006.01.004</a>.","ieee":"M. Inamura <i>et al.</i>, “ Differential localization and regulation of stargazin-like protein, γ-8 and stargazin in the plasma membrane of hippocampal and cortical neurons,” <i>Neuroscience Research</i>, vol. 55, no. 1. Elsevier, pp. 45–53, 2006.","ista":"Inamura M, Itakura M, Okamoto H, Hoka S, Mizoguchi A, Fukazawa Y, Shigemoto R, Yamamori S, Takahashi M. 2006.  Differential localization and regulation of stargazin-like protein, γ-8 and stargazin in the plasma membrane of hippocampal and cortical neurons. Neuroscience Research. 55(1), 45–53.","ama":"Inamura M, Itakura M, Okamoto H, et al.  Differential localization and regulation of stargazin-like protein, γ-8 and stargazin in the plasma membrane of hippocampal and cortical neurons. <i>Neuroscience Research</i>. 2006;55(1):45-53. doi:<a href=\"https://doi.org/10.1016/j.neures.2006.01.004\">10.1016/j.neures.2006.01.004</a>","apa":"Inamura, M., Itakura, M., Okamoto, H., Hoka, S., Mizoguchi, A., Fukazawa, Y., … Takahashi, M. (2006).  Differential localization and regulation of stargazin-like protein, γ-8 and stargazin in the plasma membrane of hippocampal and cortical neurons. <i>Neuroscience Research</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.neures.2006.01.004\">https://doi.org/10.1016/j.neures.2006.01.004</a>","chicago":"Inamura, Mihoko, Makoto Itakura, Hirotsugu Okamoto, Sumio Hoka, Akira Mizoguchi, Yugo Fukazawa, Ryuichi Shigemoto, Saori Yamamori, and Masami Takahashi. “ Differential Localization and Regulation of Stargazin-like Protein, γ-8 and Stargazin in the Plasma Membrane of Hippocampal and Cortical Neurons.” <i>Neuroscience Research</i>. Elsevier, 2006. <a href=\"https://doi.org/10.1016/j.neures.2006.01.004\">https://doi.org/10.1016/j.neures.2006.01.004</a>."},"date_published":"2006-05-01T00:00:00Z","publication":"Neuroscience Research","page":"45 - 53","issue":"1","quality_controlled":0,"publication_status":"published","publist_id":"4238","year":"2006","date_updated":"2021-01-12T06:58:52Z","type":"journal_article","date_created":"2018-12-11T11:58:55Z","abstract":[{"text":"Transmembrane AMPA receptor regulatory proteins (TARPs), including stargazin/γ-2, are associated with AMPA receptors and participate in their surface delivery and anchoring at the postsynaptic membrane. TARPs may also act as a positive modulator of the AMPA receptor ion channel function; however, little is known about other TARP members except for stargazin/γ-2. We examined the synaptic localization of stargazin/γ-2 and γ-8 by immunoelectron microscopy and biochemical analysis. The analysis of sodium dodecyl sulfate-digested freeze-fracture replica labeling revealed that stargazin/γ-2 was concentrated in the postsynaptic area, whereas γ-8 was distributed both in synaptic and extra-synaptic plasma membranes of the hippocampal neuron. When a synaptic plasma membrane-enriched brain fraction was treated with Triton X-100 and separated by sucrose density gradient ultracentrifugation, a large proportion of NMDA receptor and stargazin/γ-2 was accumulated in raft-enriched fractions, whereas AMPA receptor and γ-8 were distributed in both the raft-enriched fractions and other Triton-insoluble fractions. Phosphorylation of stargazin/γ-2 and γ-8 was regulated by different sets of kinases and phosphatases in cultured cortical neurons. These results suggested that stargazin/γ-2 and γ-8 have distinct roles in postsynaptic membranes under the regulation of different intracellular signaling pathways.","lang":"eng"}]},{"extern":1,"publisher":"Nature Publishing Group","day":"01","volume":9,"author":[{"first_name":"Hamdy","last_name":"Shaban","full_name":"Shaban, Hamdy"},{"first_name":"Yann","full_name":"Humeau, Yann","last_name":"Humeau"},{"full_name":"Herry, Cyril","last_name":"Herry","first_name":"Cyril"},{"last_name":"Cassasus","full_name":"Cassasus, Guillaume","first_name":"Guillaume"},{"first_name":"Ryuichi","orcid":"0000-0001-8761-9444","full_name":"Ryuichi Shigemoto","last_name":"Shigemoto","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Stéphane","full_name":"Ciocchi, Stéphane","last_name":"Ciocchi"},{"full_name":"Barbieri, Samuel","last_name":"Barbieri","first_name":"Samuel"},{"first_name":"Herman","full_name":"Van Der Putten, Herman V","last_name":"Van Der Putten"},{"first_name":"Klemens","last_name":"Kaupmann","full_name":"Kaupmann, Klemens"},{"last_name":"Bettler","full_name":"Bettler, Bernhard","first_name":"Bernhard"},{"last_name":"Lüthi","full_name":"Lüthi, Andreas","first_name":"Andreas"}],"doi":"10.1038/nn1732","intvolume":"         9","month":"08","_id":"2660","status":"public","title":"Generalization of amygdala LTP and conditioned fear in the absence of presynaptic inhibition","date_published":"2006-08-01T00:00:00Z","citation":{"mla":"Shaban, Hamdy, et al. “Generalization of Amygdala LTP and Conditioned Fear in the Absence of Presynaptic Inhibition.” <i>Nature Neuroscience</i>, vol. 9, no. 8, Nature Publishing Group, 2006, pp. 1028–35, doi:<a href=\"https://doi.org/10.1038/nn1732\">10.1038/nn1732</a>.","ista":"Shaban H, Humeau Y, Herry C, Cassasus G, Shigemoto R, Ciocchi S, Barbieri S, Van Der Putten H, Kaupmann K, Bettler B, Lüthi A. 2006. Generalization of amygdala LTP and conditioned fear in the absence of presynaptic inhibition. Nature Neuroscience. 9(8), 1028–1035.","ieee":"H. Shaban <i>et al.</i>, “Generalization of amygdala LTP and conditioned fear in the absence of presynaptic inhibition,” <i>Nature Neuroscience</i>, vol. 9, no. 8. Nature Publishing Group, pp. 1028–1035, 2006.","ama":"Shaban H, Humeau Y, Herry C, et al. Generalization of amygdala LTP and conditioned fear in the absence of presynaptic inhibition. <i>Nature Neuroscience</i>. 2006;9(8):1028-1035. doi:<a href=\"https://doi.org/10.1038/nn1732\">10.1038/nn1732</a>","chicago":"Shaban, Hamdy, Yann Humeau, Cyril Herry, Guillaume Cassasus, Ryuichi Shigemoto, Stéphane Ciocchi, Samuel Barbieri, et al. “Generalization of Amygdala LTP and Conditioned Fear in the Absence of Presynaptic Inhibition.” <i>Nature Neuroscience</i>. Nature Publishing Group, 2006. <a href=\"https://doi.org/10.1038/nn1732\">https://doi.org/10.1038/nn1732</a>.","apa":"Shaban, H., Humeau, Y., Herry, C., Cassasus, G., Shigemoto, R., Ciocchi, S., … Lüthi, A. (2006). Generalization of amygdala LTP and conditioned fear in the absence of presynaptic inhibition. <i>Nature Neuroscience</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/nn1732\">https://doi.org/10.1038/nn1732</a>","short":"H. Shaban, Y. Humeau, C. Herry, G. Cassasus, R. Shigemoto, S. Ciocchi, S. Barbieri, H. Van Der Putten, K. Kaupmann, B. Bettler, A. Lüthi, Nature Neuroscience 9 (2006) 1028–1035."},"page":"1028 - 1035","publication":"Nature Neuroscience","issue":"8","publication_status":"published","quality_controlled":0,"publist_id":"4236","year":"2006","date_updated":"2021-01-12T06:58:53Z","abstract":[{"text":"Pavlovian fear conditioning, a simple form of associative learning, is thought to involve the induction of associative, NMDA receptor-dependent long-term potentiation (LTP) in the lateral amygdala. Using a combined genetic and electrophysiological approach, we show here that lack of a specific GABAB receptor subtype, GABAB(1a,2), unmasks a nonassociative, NMDA receptor-independent form of presynaptic LTP at cortico-amygdala afferents. Moreover, the level of presynaptic GABA B(1a,2) receptor activation, and hence the balance between associative and nonassociative forms of LTP, can be dynamically modulated by local inhibitory activity. At the behavioral level, genetic loss of GABA B(1a) results in a generalization of conditioned fear to nonconditioned stimuli. Our findings indicate that presynaptic inhibition through GABAB(1a,2) receptors serves as an activity-dependent constraint on the induction of homosynaptic plasticity, which may be important to prevent the generalization of conditioned fear.","lang":"eng"}],"type":"journal_article","date_created":"2018-12-11T11:58:55Z"},{"status":"public","_id":"2661","month":"05","title":"Differential Compartmentalization and Distinct Functions of GABAB Receptor Variants","intvolume":"        50","doi":"10.1016/j.neuron.2006.04.014","page":"589 - 601","publication":"Neuron","date_published":"2006-05-18T00:00:00Z","citation":{"short":"R. Vigot, S. Barbieri, H. Bräuner Osborne, R. Tureček, R. Shigemoto, Y. Zhang, R. Luján, L. Jacobson, B. Biermann, J. Fritschy, C. Vacher, M. Müller, G. Sansig, N. Guetg, J. Cryan, K. Kaupmann, M. Gassmann, T. Oertner, B. Bettler, Neuron 50 (2006) 589–601.","ama":"Vigot R, Barbieri S, Bräuner Osborne H, et al. Differential Compartmentalization and Distinct Functions of GABAB Receptor Variants. <i>Neuron</i>. 2006;50(4):589-601. doi:<a href=\"https://doi.org/10.1016/j.neuron.2006.04.014\">10.1016/j.neuron.2006.04.014</a>","chicago":"Vigot, Réjan, Samuel Barbieri, Hans Bräuner Osborne, Rostislav Tureček, Ryuichi Shigemoto, Yan Zhang, Rafael Luján, et al. “Differential Compartmentalization and Distinct Functions of GABAB Receptor Variants.” <i>Neuron</i>. Elsevier, 2006. <a href=\"https://doi.org/10.1016/j.neuron.2006.04.014\">https://doi.org/10.1016/j.neuron.2006.04.014</a>.","apa":"Vigot, R., Barbieri, S., Bräuner Osborne, H., Tureček, R., Shigemoto, R., Zhang, Y., … Bettler, B. (2006). Differential Compartmentalization and Distinct Functions of GABAB Receptor Variants. <i>Neuron</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.neuron.2006.04.014\">https://doi.org/10.1016/j.neuron.2006.04.014</a>","mla":"Vigot, Réjan, et al. “Differential Compartmentalization and Distinct Functions of GABAB Receptor Variants.” <i>Neuron</i>, vol. 50, no. 4, Elsevier, 2006, pp. 589–601, doi:<a href=\"https://doi.org/10.1016/j.neuron.2006.04.014\">10.1016/j.neuron.2006.04.014</a>.","ieee":"R. Vigot <i>et al.</i>, “Differential Compartmentalization and Distinct Functions of GABAB Receptor Variants,” <i>Neuron</i>, vol. 50, no. 4. Elsevier, pp. 589–601, 2006.","ista":"Vigot R, Barbieri S, Bräuner Osborne H, Tureček R, Shigemoto R, Zhang Y, Luján R, Jacobson L, Biermann B, Fritschy J, Vacher C, Müller M, Sansig G, Guetg N, Cryan J, Kaupmann K, Gassmann M, Oertner T, Bettler B. 2006. Differential Compartmentalization and Distinct Functions of GABAB Receptor Variants. Neuron. 50(4), 589–601."},"day":"18","volume":50,"extern":1,"publisher":"Elsevier","author":[{"first_name":"Réjan","full_name":"Vigot, Réjan","last_name":"Vigot"},{"full_name":"Barbieri, Samuel","last_name":"Barbieri","first_name":"Samuel"},{"last_name":"Bräuner Osborne","full_name":"Bräuner-Osborne, Hans","first_name":"Hans"},{"first_name":"Rostislav","last_name":"Tureček","full_name":"Tureček, Rostislav"},{"full_name":"Ryuichi Shigemoto","last_name":"Shigemoto","first_name":"Ryuichi","orcid":"0000-0001-8761-9444","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Yan","last_name":"Zhang","full_name":"Zhang, Yan Ping"},{"full_name":"Luján, Rafael","last_name":"Luján","first_name":"Rafael"},{"first_name":"Laura","full_name":"Jacobson, Laura H","last_name":"Jacobson"},{"first_name":"Barbara","last_name":"Biermann","full_name":"Biermann, Barbara"},{"first_name":"Jean","full_name":"Fritschy, Jean-Marc","last_name":"Fritschy"},{"first_name":"Claire","last_name":"Vacher","full_name":"Vacher, Claire-Marie"},{"first_name":"Matthias","full_name":"Müller, Matthias P","last_name":"Müller"},{"last_name":"Sansig","full_name":"Sansig, Gilles","first_name":"Gilles"},{"last_name":"Guetg","full_name":"Guetg, Nicole","first_name":"Nicole"},{"first_name":"John","full_name":"Cryan, John F","last_name":"Cryan"},{"first_name":"Klemens","full_name":"Kaupmann, Klemens","last_name":"Kaupmann"},{"first_name":"Martin","full_name":"Gassmann, Martin","last_name":"Gassmann"},{"first_name":"Thomas","last_name":"Oertner","full_name":"Oertner, Thomas G"},{"first_name":"Bernhard","last_name":"Bettler","full_name":"Bettler, Bernhard"}],"date_updated":"2021-01-12T06:58:54Z","year":"2006","abstract":[{"text":"GABAB receptors are the G protein-coupled receptors for the main inhibitory neurotransmitter in the brain, γ-aminobutyric acid (GABA). Molecular diversity in the GABAB system arises from the GABAB1a and GABAB1b subunit isoforms that solely differ in their ectodomains by a pair of sushi repeats that is unique to GABAB1a. Using a combined genetic, physiological, and morphological approach, we now demonstrate that GABAB1 isoforms localize to distinct synaptic sites and convey separate functions in vivo. At hippocampal CA3-to-CA1 synapses, GABAB1a assembles heteroreceptors inhibiting glutamate release, while predominantly GABAB1b mediates postsynaptic inhibition. Electron microscopy reveals a synaptic distribution of GABAB1 isoforms that agrees with the observed functional differences. Transfected CA3 neurons selectively express GABAB1a in distal axons, suggesting that the sushi repeats, a conserved protein interaction motif, specify heteroreceptor localization. The constitutive absence of GABAB1a but not GABAB1b results in impaired synaptic plasticity and hippocampus-dependent memory, emphasizing molecular differences in synaptic GABAB functions.","lang":"eng"}],"type":"journal_article","date_created":"2018-12-11T11:58:56Z","publication_status":"published","quality_controlled":0,"issue":"4","publist_id":"4237"}]