[{"date_updated":"2021-01-12T07:56:31Z","conference":{"name":"FM: Formal Methods"},"extern":1,"publication_status":"published","publisher":"Springer","title":"It's Doomed; We Can Prove It","quality_controlled":0,"date_created":"2018-12-11T12:08:32Z","month":"01","doi":"1557","citation":{"ieee":"J. Hoenicke, K. R. Leino, A. Podelski, M. Schäf, and T. Wies, “It’s Doomed; We Can Prove It,” presented at the FM: Formal Methods, 2009, pp. 338–353.","short":"J. Hoenicke, K.R. Leino, A. Podelski, M. Schäf, T. Wies, in:, Springer, 2009, pp. 338–353.","mla":"Hoenicke, Jochen, et al. <i>It’s Doomed; We Can Prove It</i>. Springer, 2009, pp. 338–53, doi:<a href=\"https://doi.org/1557\">1557</a>.","chicago":"Hoenicke, Jochen, K Rustan Leino, Andreas Podelski, Martin Schäf, and Thomas Wies. “It’s Doomed; We Can Prove It,” 338–53. Springer, 2009. <a href=\"https://doi.org/1557\">https://doi.org/1557</a>.","ama":"Hoenicke J, Leino KR, Podelski A, Schäf M, Wies T. It’s Doomed; We Can Prove It. In: Springer; 2009:338-353. doi:<a href=\"https://doi.org/1557\">1557</a>","apa":"Hoenicke, J., Leino, K. R., Podelski, A., Schäf, M., &#38; Wies, T. (2009). It’s Doomed; We Can Prove It (pp. 338–353). Presented at the FM: Formal Methods, Springer. <a href=\"https://doi.org/1557\">https://doi.org/1557</a>","ista":"Hoenicke J, Leino KR, Podelski A, Schäf M, Wies T. 2009. It’s Doomed; We Can Prove It. FM: Formal Methods, LNCS 5850, , 338–353."},"alternative_title":["LNCS 5850"],"year":"2009","status":"public","author":[{"full_name":"Hoenicke,Jochen","first_name":"Jochen","last_name":"Hoenicke"},{"last_name":"Leino","first_name":"K Rustan","full_name":"Leino, K Rustan"},{"last_name":"Podelski","first_name":"Andreas","full_name":"Podelski,Andreas"},{"first_name":"Martin","full_name":"Schäf,Martin","last_name":"Schäf"},{"last_name":"Wies","id":"447BFB88-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas","full_name":"Thomas Wies"}],"date_published":"2009-01-01T00:00:00Z","day":"01","_id":"4377","publist_id":"1079","type":"conference","page":"338 - 353"},{"alternative_title":["LNCS"],"year":"2009","status":"public","doi":"10.1007/978-3-642-02658-4_26","citation":{"short":"R. Guerraoui, T.A. Henzinger, V. Singh, in:, Springer, 2009, pp. 321–336.","ieee":"R. Guerraoui, T. A. Henzinger, and V. Singh, “Software transactional memory on relaxed memory models,” presented at the CAV: Computer Aided Verification, 2009, vol. 5643, pp. 321–336.","mla":"Guerraoui, Rachid, et al. <i>Software Transactional Memory on Relaxed Memory Models</i>. Vol. 5643, Springer, 2009, pp. 321–36, doi:<a href=\"https://doi.org/10.1007/978-3-642-02658-4_26\">10.1007/978-3-642-02658-4_26</a>.","chicago":"Guerraoui, Rachid, Thomas A Henzinger, and Vasu Singh. “Software Transactional Memory on Relaxed Memory Models,” 5643:321–36. Springer, 2009. <a href=\"https://doi.org/10.1007/978-3-642-02658-4_26\">https://doi.org/10.1007/978-3-642-02658-4_26</a>.","apa":"Guerraoui, R., Henzinger, T. A., &#38; Singh, V. (2009). Software transactional memory on relaxed memory models (Vol. 5643, pp. 321–336). Presented at the CAV: Computer Aided Verification, Springer. <a href=\"https://doi.org/10.1007/978-3-642-02658-4_26\">https://doi.org/10.1007/978-3-642-02658-4_26</a>","ama":"Guerraoui R, Henzinger TA, Singh V. Software transactional memory on relaxed memory models. In: Vol 5643. Springer; 2009:321-336. doi:<a href=\"https://doi.org/10.1007/978-3-642-02658-4_26\">10.1007/978-3-642-02658-4_26</a>","ista":"Guerraoui R, Henzinger TA, Singh V. 2009. Software transactional memory on relaxed memory models. CAV: Computer Aided Verification, LNCS, vol. 5643, 321–336."},"month":"06","date_created":"2018-12-11T12:08:34Z","pubrep_id":"45","page":"321 - 336","day":"19","_id":"4383","publist_id":"1074","type":"conference","abstract":[{"text":"Pseudo-code descriptions of STMs assume sequentially consistent program execution and atomicity of high-level STM operations like read, write, and commit. These assumptions are often violated in realistic settings, as STM implementations run on relaxed memory models, with the atomicity of operations as provided by the hardware. This paper presents the first approach to verify STMs under relaxed memory models with atomicity of 32 bit loads and stores, and read-modify-write operations. We present RML, a new high-level language for expressing concurrent algorithms with a hardware-level atomicity of instructions, and whose semantics is parametrized by various relaxed memory models. We then present our tool, FOIL, which takes as input the RML description of an STM algorithm and the description of a memory model, and automatically determines the locations of fences, which if inserted, ensure the correctness of the STM algorithm under the given memory model. We use FOIL to verify DSTM, TL2, and McRT STM under the memory models of sequential consistency, total store order, partial store order, and relaxed memory order.","lang":"eng"}],"acknowledgement":"This research was supported by the Swiss National Science Foundation.","date_published":"2009-06-19T00:00:00Z","author":[{"last_name":"Guerraoui","first_name":"Rachid","full_name":"Guerraoui, Rachid"},{"orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Thomas Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Vasu Singh","first_name":"Vasu","id":"4DAE2708-F248-11E8-B48F-1D18A9856A87","last_name":"Singh"}],"conference":{"name":"CAV: Computer Aided Verification"},"oa":1,"file_date_updated":"2020-07-14T12:46:28Z","date_updated":"2021-01-12T07:56:34Z","file":[{"file_id":"5105","checksum":"df3c3e6306afd3f630a9146f91642f0a","creator":"system","file_size":265763,"file_name":"IST-2012-45-v1+1_Software_transactional_memory_on_relaxed_memory_models.pdf","content_type":"application/pdf","access_level":"open_access","date_updated":"2020-07-14T12:46:28Z","relation":"main_file","date_created":"2018-12-12T10:14:50Z"}],"volume":5643,"title":"Software transactional memory on relaxed memory models","quality_controlled":0,"publisher":"Springer","publication_status":"published","intvolume":"      5643","extern":1},{"date_updated":"2021-01-12T07:56:34Z","conference":{"name":"POPL: Principles of Programming Languages"},"publication_status":"published","publisher":"ACM","extern":1,"quality_controlled":0,"title":"Preventing versus curing: avoiding conflicts in transactional memories","citation":{"ista":"Dragojevic A, Guerraoui R, Singh A, Singh V. 2009. Preventing versus curing: avoiding conflicts in transactional memories. POPL: Principles of Programming Languages, 7–16.","apa":"Dragojevic, A., Guerraoui, R., Singh, A., &#38; Singh, V. (2009). Preventing versus curing: avoiding conflicts in transactional memories (pp. 7–16). Presented at the POPL: Principles of Programming Languages, ACM. <a href=\"https://doi.org/1533\">https://doi.org/1533</a>","ama":"Dragojevic A, Guerraoui R, Singh A, Singh V. Preventing versus curing: avoiding conflicts in transactional memories. In: ACM; 2009:7-16. doi:<a href=\"https://doi.org/1533\">1533</a>","chicago":"Dragojevic, Aleksandar, Rachid Guerraoui, Anmol Singh, and Vasu Singh. “Preventing versus Curing: Avoiding Conflicts in Transactional Memories,” 7–16. ACM, 2009. <a href=\"https://doi.org/1533\">https://doi.org/1533</a>.","mla":"Dragojevic, Aleksandar, et al. <i>Preventing versus Curing: Avoiding Conflicts in Transactional Memories</i>. ACM, 2009, pp. 7–16, doi:<a href=\"https://doi.org/1533\">1533</a>.","ieee":"A. Dragojevic, R. Guerraoui, A. Singh, and V. Singh, “Preventing versus curing: avoiding conflicts in transactional memories,” presented at the POPL: Principles of Programming Languages, 2009, pp. 7–16.","short":"A. Dragojevic, R. Guerraoui, A. Singh, V. Singh, in:, ACM, 2009, pp. 7–16."},"doi":"1533","date_created":"2018-12-11T12:08:35Z","month":"01","status":"public","year":"2009","date_published":"2009-01-01T00:00:00Z","author":[{"first_name":"Aleksandar","full_name":"Dragojevic,Aleksandar","last_name":"Dragojevic"},{"first_name":"Rachid","full_name":"Guerraoui, Rachid","last_name":"Guerraoui"},{"last_name":"Singh","first_name":"Anmol","full_name":"Singh, Anmol V"},{"id":"4DAE2708-F248-11E8-B48F-1D18A9856A87","first_name":"Vasu","full_name":"Vasu Singh","last_name":"Singh"}],"page":"7 - 16","type":"conference","_id":"4385","publist_id":"1070","day":"01"},{"date_published":"2009-07-01T00:00:00Z","author":[{"last_name":"Cerny","first_name":"Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","full_name":"Pavol Cerny"},{"last_name":"Alur","first_name":"Rajeev","full_name":"Alur, Rajeev"}],"page":"173 - 187","day":"01","_id":"4391","type":"conference","publist_id":"1067","citation":{"ista":"Cerny P, Alur R. 2009. Automated Analysis of Java Methods for Confidentiality. CAV: Computer Aided Verification, LNCS, , 173–187.","ama":"Cerny P, Alur R. Automated Analysis of Java Methods for Confidentiality. In: Springer; 2009:173-187. doi:<a href=\"https://doi.org/1548\">1548</a>","apa":"Cerny, P., &#38; Alur, R. (2009). Automated Analysis of Java Methods for Confidentiality (pp. 173–187). Presented at the CAV: Computer Aided Verification, Springer. <a href=\"https://doi.org/1548\">https://doi.org/1548</a>","chicago":"Cerny, Pavol, and Rajeev Alur. “Automated Analysis of Java Methods for Confidentiality,” 173–87. Springer, 2009. <a href=\"https://doi.org/1548\">https://doi.org/1548</a>.","mla":"Cerny, Pavol, and Rajeev Alur. <i>Automated Analysis of Java Methods for Confidentiality</i>. Springer, 2009, pp. 173–87, doi:<a href=\"https://doi.org/1548\">1548</a>.","short":"P. Cerny, R. Alur, in:, Springer, 2009, pp. 173–187.","ieee":"P. Cerny and R. Alur, “Automated Analysis of Java Methods for Confidentiality,” presented at the CAV: Computer Aided Verification, 2009, pp. 173–187."},"doi":"1548","month":"07","date_created":"2018-12-11T12:08:36Z","alternative_title":["LNCS"],"year":"2009","status":"public","publication_status":"published","publisher":"Springer","extern":1,"title":"Automated Analysis of Java Methods for Confidentiality","quality_controlled":0,"date_updated":"2021-01-12T07:56:37Z","conference":{"name":"CAV: Computer Aided Verification"}},{"extern":"1","intvolume":"      5771","publisher":"Springer","publication_status":"published","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"http://repository.upenn.edu/cis_reports/894/"}],"title":"Algorithmic analysis of array-accessing programs","related_material":{"record":[{"status":"public","id":"2967","relation":"later_version"}]},"volume":5771,"language":[{"iso":"eng"}],"date_updated":"2023-02-23T11:06:20Z","oa":1,"conference":{"end_date":"2009-09-11","location":"Coimbra, Portugal","start_date":"2009-09-07","name":"CSL: Computer Science Logic"},"date_published":"2009-09-01T00:00:00Z","author":[{"full_name":"Alur, Rajeev","first_name":"Rajeev","last_name":"Alur"},{"id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","first_name":"Pavol","full_name":"Cerny, Pavol","last_name":"Cerny"},{"last_name":"Weinstein","first_name":"Scott","full_name":"Weinstein, Scott"}],"oa_version":"Submitted Version","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"For programs whose data variables range over boolean or finite domains, program verification is decidable, and this forms the basis of recent tools for software model checking. In this paper, we consider algorithmic verification of programs that use boolean variables, and in addition, access a single read-only array whose length is potentially unbounded, and whose elements range over a potentially unbounded data domain. We show that the reachability problem, while undecidable in general, is (1) Pspace-complete for programs in which the array-accessing for-loops are not nested, (2) decidable for a restricted class of programs with doubly-nested loops. The second result establishes connections to automata and logics defining languages over data words."}],"type":"conference","_id":"4403","publist_id":"1056","day":"01","page":"86 - 101","month":"09","date_created":"2018-12-11T12:08:40Z","citation":{"short":"R. Alur, P. Cerny, S. Weinstein, in:, Springer, 2009, pp. 86–101.","ieee":"R. Alur, P. Cerny, and S. Weinstein, “Algorithmic analysis of array-accessing programs,” presented at the CSL: Computer Science Logic, Coimbra, Portugal, 2009, vol. 5771, pp. 86–101.","mla":"Alur, Rajeev, et al. <i>Algorithmic Analysis of Array-Accessing Programs</i>. Vol. 5771, Springer, 2009, pp. 86–101, doi:<a href=\"https://doi.org/10.1007/978-3-642-04027-6_9\">10.1007/978-3-642-04027-6_9</a>.","chicago":"Alur, Rajeev, Pavol Cerny, and Scott Weinstein. “Algorithmic Analysis of Array-Accessing Programs,” 5771:86–101. Springer, 2009. <a href=\"https://doi.org/10.1007/978-3-642-04027-6_9\">https://doi.org/10.1007/978-3-642-04027-6_9</a>.","apa":"Alur, R., Cerny, P., &#38; Weinstein, S. (2009). Algorithmic analysis of array-accessing programs (Vol. 5771, pp. 86–101). Presented at the CSL: Computer Science Logic, Coimbra, Portugal: Springer. <a href=\"https://doi.org/10.1007/978-3-642-04027-6_9\">https://doi.org/10.1007/978-3-642-04027-6_9</a>","ama":"Alur R, Cerny P, Weinstein S. Algorithmic analysis of array-accessing programs. In: Vol 5771. Springer; 2009:86-101. doi:<a href=\"https://doi.org/10.1007/978-3-642-04027-6_9\">10.1007/978-3-642-04027-6_9</a>","ista":"Alur R, Cerny P, Weinstein S. 2009. Algorithmic analysis of array-accessing programs. CSL: Computer Science Logic, LNCS, vol. 5771, 86–101."},"doi":"10.1007/978-3-642-04027-6_9","status":"public","year":"2009","alternative_title":["LNCS"]},{"intvolume":"      5643","extern":1,"publication_status":"published","publisher":"Springer","quality_controlled":0,"main_file_link":[{"url":"http://pub.ist.ac.at/%7Etah/Publications/sliding-window_abstraction_for_infinite_markov_chains.pdf","open_access":"0"}],"title":"Sliding-window abstraction for infinite Markov chains","volume":5643,"file":[{"content_type":"application/pdf","file_name":"IST-2012-40-v1+1_Sliding-window_abstraction_for_infinite_markov_chains.pdf","date_created":"2018-12-12T10:12:20Z","access_level":"open_access","date_updated":"2020-07-14T12:46:30Z","relation":"main_file","file_size":804295,"creator":"system","checksum":"36b974111521ea534aae294166e93a63","file_id":"4938"}],"date_updated":"2021-01-12T07:57:04Z","oa":1,"file_date_updated":"2020-07-14T12:46:30Z","conference":{"name":"CAV: Computer Aided Verification"},"author":[{"full_name":"Thomas Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger"},{"full_name":"Maria Mateescu","first_name":"Maria","id":"3B43276C-F248-11E8-B48F-1D18A9856A87","last_name":"Mateescu"},{"first_name":"Verena","full_name":"Wolf, Verena","last_name":"Wolf"}],"date_published":"2009-01-01T00:00:00Z","abstract":[{"text":"We present an on-the-fly abstraction technique for infinite-state continuous -time Markov chains. We consider Markov chains that are specified by a finite set of transition classes. Such models naturally represent biochemical reactions and therefore play an important role in the stochastic modeling of biological systems. We approximate the transient probability distributions at various time instances by solving a sequence of dynamically constructed abstract models, each depending on the previous one. Each abstract model is a finite Markov chain that represents the behavior of the original, infinite chain during a specific time interval. Our approach provides complete information about probability distributions, not just about individual parameters like the mean. The error of each abstraction can be computed, and the precision of the abstraction refined when desired. We implemented the algorithm and demonstrate its usefulness and efficiency on several case studies from systems biology.","lang":"eng"}],"acknowledgement":"The research has been partially funded by the Swiss National Science Foundation under grant 205321-111840.","publist_id":"278","_id":"4453","type":"conference","day":"01","page":"337 - 352","pubrep_id":"40","date_created":"2018-12-11T12:08:55Z","month":"01","doi":"10.1007/978-3-642-02658-4_27","citation":{"ista":"Henzinger TA, Mateescu M, Wolf V. 2009. Sliding-window abstraction for infinite Markov chains. CAV: Computer Aided Verification, LNCS, vol. 5643, 337–352.","apa":"Henzinger, T. A., Mateescu, M., &#38; Wolf, V. (2009). Sliding-window abstraction for infinite Markov chains (Vol. 5643, pp. 337–352). Presented at the CAV: Computer Aided Verification, Springer. <a href=\"https://doi.org/10.1007/978-3-642-02658-4_27\">https://doi.org/10.1007/978-3-642-02658-4_27</a>","ama":"Henzinger TA, Mateescu M, Wolf V. Sliding-window abstraction for infinite Markov chains. In: Vol 5643. Springer; 2009:337-352. doi:<a href=\"https://doi.org/10.1007/978-3-642-02658-4_27\">10.1007/978-3-642-02658-4_27</a>","chicago":"Henzinger, Thomas A, Maria Mateescu, and Verena Wolf. “Sliding-Window Abstraction for Infinite Markov Chains,” 5643:337–52. Springer, 2009. <a href=\"https://doi.org/10.1007/978-3-642-02658-4_27\">https://doi.org/10.1007/978-3-642-02658-4_27</a>.","mla":"Henzinger, Thomas A., et al. <i>Sliding-Window Abstraction for Infinite Markov Chains</i>. Vol. 5643, Springer, 2009, pp. 337–52, doi:<a href=\"https://doi.org/10.1007/978-3-642-02658-4_27\">10.1007/978-3-642-02658-4_27</a>.","ieee":"T. A. Henzinger, M. Mateescu, and V. Wolf, “Sliding-window abstraction for infinite Markov chains,” presented at the CAV: Computer Aided Verification, 2009, vol. 5643, pp. 337–352.","short":"T.A. Henzinger, M. Mateescu, V. Wolf, in:, Springer, 2009, pp. 337–352."},"status":"public","alternative_title":["LNCS"],"year":"2009"},{"extern":1,"intvolume":"      5688","publication_status":"published","publisher":"Springer","quality_controlled":0,"title":"Approximation of event probabilities in noisy cellular processes","related_material":{"record":[{"relation":"later_version","id":"3364","status":"public"}]},"volume":5688,"date_updated":"2023-02-23T11:24:03Z","conference":{"name":"CMSB: Computational Methods in Systems Biology"},"author":[{"first_name":"Frédéric","full_name":"Didier, Frédéric","last_name":"Didier"},{"orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Thomas Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Mateescu","full_name":"Maria Mateescu","first_name":"Maria","id":"3B43276C-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Wolf","first_name":"Verena","full_name":"Wolf, Verena"}],"date_published":"2009-08-17T00:00:00Z","abstract":[{"lang":"eng","text":"Molecular noise, which arises from the randomness of the discrete events in the cell, significantly influences fundamental biological processes. Discrete -state continuous-time stochastic models (CTMC) can be used to describe such effects, but the calculation of the probabilities of certain events is computationally expensive.\nWe present a comparison of two analysis approaches for CTMC. On one hand, we estimate the probabilities of interest using repeated Gillespie simulation and determine the statistical accuracy that we obtain. On the other hand, we apply a numerical reachability analysis that approximates the probability distributions of the system at several time instances. We use examples of cellular processes to demonstrate the superiority of the reachability analysis if accurate results are required."}],"acknowledgement":"This research was supported in part by the Swiss National Science Foundation under grant 205321-111840 and by the Excellence Cluster on Multimodal Computing and Interaction.","publist_id":"189","_id":"4535","type":"conference","day":"17","page":"173 - 188","date_created":"2018-12-11T12:09:21Z","month":"08","doi":"10.1007/978-3-642-03845-7_12","citation":{"apa":"Didier, F., Henzinger, T. A., Mateescu, M., &#38; Wolf, V. (2009). Approximation of event probabilities in noisy cellular processes (Vol. 5688, pp. 173–188). Presented at the CMSB: Computational Methods in Systems Biology, Springer. <a href=\"https://doi.org/10.1007/978-3-642-03845-7_12\">https://doi.org/10.1007/978-3-642-03845-7_12</a>","ama":"Didier F, Henzinger TA, Mateescu M, Wolf V. Approximation of event probabilities in noisy cellular processes. In: Vol 5688. Springer; 2009:173-188. doi:<a href=\"https://doi.org/10.1007/978-3-642-03845-7_12\">10.1007/978-3-642-03845-7_12</a>","ista":"Didier F, Henzinger TA, Mateescu M, Wolf V. 2009. Approximation of event probabilities in noisy cellular processes. CMSB: Computational Methods in Systems Biology, LNCS, vol. 5688, 173–188.","ieee":"F. Didier, T. A. Henzinger, M. Mateescu, and V. Wolf, “Approximation of event probabilities in noisy cellular processes,” presented at the CMSB: Computational Methods in Systems Biology, 2009, vol. 5688, pp. 173–188.","short":"F. Didier, T.A. Henzinger, M. Mateescu, V. Wolf, in:, Springer, 2009, pp. 173–188.","mla":"Didier, Frédéric, et al. <i>Approximation of Event Probabilities in Noisy Cellular Processes</i>. Vol. 5688, Springer, 2009, pp. 173–88, doi:<a href=\"https://doi.org/10.1007/978-3-642-03845-7_12\">10.1007/978-3-642-03845-7_12</a>.","chicago":"Didier, Frédéric, Thomas A Henzinger, Maria Mateescu, and Verena Wolf. “Approximation of Event Probabilities in Noisy Cellular Processes,” 5688:173–88. Springer, 2009. <a href=\"https://doi.org/10.1007/978-3-642-03845-7_12\">https://doi.org/10.1007/978-3-642-03845-7_12</a>."},"status":"public","alternative_title":["LNCS"],"year":"2009"},{"conference":{"name":"LICS: Logic in Computer Science"},"language":[{"iso":"eng"}],"date_updated":"2023-02-23T11:46:11Z","article_processing_charge":"No","related_material":{"record":[{"relation":"later_version","id":"3867","status":"public"}]},"quality_controlled":"1","scopus_import":"1","title":"Expressiveness and closure properties for quantitative languages","publication_status":"published","publisher":"IEEE","extern":"1","status":"public","year":"2009","doi":"10.1109/LICS.2009.16","citation":{"mla":"Chatterjee, Krishnendu, et al. <i>Expressiveness and Closure Properties for Quantitative Languages</i>. IEEE, 2009, pp. 199–208, doi:<a href=\"https://doi.org/10.1109/LICS.2009.16\">10.1109/LICS.2009.16</a>.","chicago":"Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Expressiveness and Closure Properties for Quantitative Languages,” 199–208. IEEE, 2009. <a href=\"https://doi.org/10.1109/LICS.2009.16\">https://doi.org/10.1109/LICS.2009.16</a>.","short":"K. Chatterjee, L. Doyen, T.A. Henzinger, in:, IEEE, 2009, pp. 199–208.","ieee":"K. Chatterjee, L. Doyen, and T. A. Henzinger, “Expressiveness and closure properties for quantitative languages,” presented at the LICS: Logic in Computer Science, 2009, pp. 199–208.","ista":"Chatterjee K, Doyen L, Henzinger TA. 2009. Expressiveness and closure properties for quantitative languages. LICS: Logic in Computer Science, 199–208.","apa":"Chatterjee, K., Doyen, L., &#38; Henzinger, T. A. (2009). Expressiveness and closure properties for quantitative languages (pp. 199–208). Presented at the LICS: Logic in Computer Science, IEEE. <a href=\"https://doi.org/10.1109/LICS.2009.16\">https://doi.org/10.1109/LICS.2009.16</a>","ama":"Chatterjee K, Doyen L, Henzinger TA. Expressiveness and closure properties for quantitative languages. In: IEEE; 2009:199-208. doi:<a href=\"https://doi.org/10.1109/LICS.2009.16\">10.1109/LICS.2009.16</a>"},"month":"01","date_created":"2018-12-11T12:09:23Z","page":"199 - 208","pubrep_id":"55","_id":"4540","type":"conference","publist_id":"181","day":"01","abstract":[{"lang":"eng","text":"Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages L that assign to each word w a real number L(w). In the case of infinite words, the value of a run is naturally computed as the maximum, limsup, liminf, limit average, or discounted sum of the transition weights. We study expressiveness and closure questions about these quantitative languages. We first show that the set of words with value greater than a threshold can be non-w-regular for deterministic limit-average and discounted-sum automata, while this set is always w-regular when the threshold is isolated (i.e., some neighborhood around the threshold contains no word). In the latter case, we prove that the w-regular language is robust against small perturbations of the transition weights. We next consider automata with transition weights 0 or 1 and show that they are as expressive as general weighted automata in the limit-average case, but not in the discounted-sum case. Third, for quantitative languages L-1 and L-2, we consider the operations max(L-1, L-2), min(L-1, L-2), and 1-L-1, which generalize the boolean operations on languages, as well as the sum L-1 + L-2. We establish the closure properties of all classes of quantitative languages with respect to these four operations."}],"oa_version":"None","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"last_name":"Doyen","first_name":"Laurent","full_name":"Doyen, Laurent"},{"orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"date_published":"2009-01-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"day":"10","publist_id":"180","_id":"4542","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"last_name":"Doyen","first_name":"Laurent","full_name":"Doyen, Laurent"},{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A"}],"date_published":"2009-09-10T00:00:00Z","acknowledgement":"This research was supported in part by the Swiss National Science Foundation under the Indo-Swiss Joint Research Programme, by the European Network of Excellence on Embedded Systems Design (ArtistDesign), by the European Combest, Quasimodo, and Gasics projects, by the PAI program Moves funded by the Belgian Federal Government, and by the CFV (Federated Center in Verification) funded by the F.R.S.-FNRS.","abstract":[{"lang":"eng","text":"Weighted automata are finite automata with numerical weights on transitions. Nondeterministic weighted automata define quantitative languages L that assign to each word w a real number L(w) computed as the maximal value of all runs over w, and the value of a run r is a function of the sequence of weights that appear along r. There are several natural functions to consider such as Sup, LimSup, LimInf, limit average, and discounted sum of transition weights.\r\nWe introduce alternating weighted automata in which the transitions of the runs are chosen by two players in a turn-based fashion. Each word is assigned the maximal value of a run that the first player can enforce regardless of the choices made by the second player. We survey the results about closure properties, expressiveness, and decision problems for nondeterministic weighted automata, and we extend these results to alternating weighted automata.\r\nFor quantitative languages L 1 and L 2, we consider the pointwise operations max(L 1,L 2), min(L 1,L 2), 1 − L 1, and the sum L 1 + L 2. We establish the closure properties of all classes of alternating weighted automata with respect to these four operations.\r\nWe next compare the expressive power of the various classes of alternating and nondeterministic weighted automata over infinite words. In particular, for limit average and discounted sum, we show that alternation brings more expressive power than nondeterminism.\r\nFinally, we present decidability results and open questions for the quantitative extension of the classical decision problems in automata theory: emptiness, universality, language inclusion, and language equivalence."}],"alternative_title":["LNCS"],"status":"public","date_created":"2018-12-11T12:09:23Z","month":"09","doi":"10.1007/978-3-642-03409-1_2","citation":{"ieee":"K. Chatterjee, L. Doyen, and T. A. Henzinger, “Alternating weighted automata,” presented at the FCT: Fundamentals of Computation Theory, Wroclaw, Poland, 2009, vol. 5699, pp. 3–13.","short":"K. Chatterjee, L. Doyen, T.A. Henzinger, in:, Springer, 2009, pp. 3–13.","chicago":"Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Alternating Weighted Automata,” 5699:3–13. Springer, 2009. <a href=\"https://doi.org/10.1007/978-3-642-03409-1_2\">https://doi.org/10.1007/978-3-642-03409-1_2</a>.","mla":"Chatterjee, Krishnendu, et al. <i>Alternating Weighted Automata</i>. Vol. 5699, Springer, 2009, pp. 3–13, doi:<a href=\"https://doi.org/10.1007/978-3-642-03409-1_2\">10.1007/978-3-642-03409-1_2</a>.","apa":"Chatterjee, K., Doyen, L., &#38; Henzinger, T. A. (2009). Alternating weighted automata (Vol. 5699, pp. 3–13). Presented at the FCT: Fundamentals of Computation Theory, Wroclaw, Poland: Springer. <a href=\"https://doi.org/10.1007/978-3-642-03409-1_2\">https://doi.org/10.1007/978-3-642-03409-1_2</a>","ama":"Chatterjee K, Doyen L, Henzinger TA. Alternating weighted automata. In: Vol 5699. Springer; 2009:3-13. doi:<a href=\"https://doi.org/10.1007/978-3-642-03409-1_2\">10.1007/978-3-642-03409-1_2</a>","ista":"Chatterjee K, Doyen L, Henzinger TA. 2009. Alternating weighted automata. FCT: Fundamentals of Computation Theory, LNCS, vol. 5699, 3–13."},"quality_controlled":"1","scopus_import":1,"ec_funded":1,"intvolume":"      5699","publisher":"Springer","publication_status":"published","has_accepted_license":"1","file_date_updated":"2020-07-14T12:46:31Z","project":[{"_id":"25F1337C-B435-11E9-9278-68D0E5697425","grant_number":"214373","name":"Design for Embedded Systems","call_identifier":"FP7"},{"name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543","call_identifier":"FP7","_id":"25EFB36C-B435-11E9-9278-68D0E5697425"}],"oa":1,"volume":5699,"file":[{"file_size":164428,"creator":"system","checksum":"e8f53abb63579de3f2bff58b2a1188e2","file_id":"5126","content_type":"application/pdf","file_name":"IST-2012-39-v1+1_Alternating_Weighted_Automata.pdf","date_created":"2018-12-12T10:15:09Z","access_level":"open_access","date_updated":"2020-07-14T12:46:31Z","relation":"main_file"}],"type":"conference","pubrep_id":"39","page":"3 - 13","oa_version":"Submitted Version","ddc":["004"],"year":"2009","title":"Alternating weighted automata","department":[{"_id":"KrCh"}],"conference":{"location":"Wroclaw, Poland","end_date":"2009-09-04","name":"FCT: Fundamentals of Computation Theory","start_date":"2009-09-02"},"date_updated":"2021-01-12T07:59:34Z","language":[{"iso":"eng"}]},{"intvolume":"      5734","publication_status":"published","publisher":"Springer","scopus_import":1,"quality_controlled":"1","ec_funded":1,"volume":5734,"project":[{"call_identifier":"FP7","grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques","_id":"25EFB36C-B435-11E9-9278-68D0E5697425"},{"grant_number":"214373","name":"Design for Embedded Systems","call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425"}],"date_published":"2009-08-01T00:00:00Z","author":[{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger"},{"full_name":"Horn, Florian","first_name":"Florian","id":"37327ACE-F248-11E8-B48F-1D18A9856A87","last_name":"Horn"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"This research was supported in part by the Swiss National Science Foundation under the Indo-Swiss Joint Research Programme, by the European Network of Excellence on Embedded Systems Design (ArtistDesign), and by the European project Combest.","abstract":[{"text":"The synthesis of a reactive system with respect to all omega-regular specification requires the solution of a graph game. Such games have been extended in two natural ways. First, a game graph can be equipped with probabilistic choices between alternative transitions, thus allowing the, modeling of uncertain behaviour. These are called stochastic games. Second, a liveness specification can he strengthened to require satisfaction within all unknown but bounded amount of time. These are called finitary objectives. We study. for the first time, the, combination of Stochastic games and finitary objectives. We characterize the requirements on optimal strategies and provide algorithms for Computing the maximal achievable probability of winning stochastic games with finitary parity or Street, objectives. Most notably the set of state's from which a player can win with probability . for a finitary parity objective can he computed in polynomial time even though no polynomial-time algorithm is known in the nonfinitary case.","lang":"eng"}],"publist_id":"178","_id":"4543","day":"01","date_created":"2018-12-11T12:09:24Z","month":"08","doi":"10.1007/978-3-642-03816-7_4","citation":{"chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Florian Horn. “Stochastic Games with Finitary Objectives,” 5734:34–54. Springer, 2009. <a href=\"https://doi.org/10.1007/978-3-642-03816-7_4\">https://doi.org/10.1007/978-3-642-03816-7_4</a>.","mla":"Chatterjee, Krishnendu, et al. <i>Stochastic Games with Finitary Objectives</i>. Vol. 5734, Springer, 2009, pp. 34–54, doi:<a href=\"https://doi.org/10.1007/978-3-642-03816-7_4\">10.1007/978-3-642-03816-7_4</a>.","short":"K. Chatterjee, T.A. Henzinger, F. Horn, in:, Springer, 2009, pp. 34–54.","ieee":"K. Chatterjee, T. A. Henzinger, and F. Horn, “Stochastic games with finitary objectives,” presented at the MFCS: Mathematical Foundations of Computer Science, High Tatras, Slovakia, 2009, vol. 5734, pp. 34–54.","ista":"Chatterjee K, Henzinger TA, Horn F. 2009. Stochastic games with finitary objectives. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 5734, 34–54.","apa":"Chatterjee, K., Henzinger, T. A., &#38; Horn, F. (2009). Stochastic games with finitary objectives (Vol. 5734, pp. 34–54). Presented at the MFCS: Mathematical Foundations of Computer Science, High Tatras, Slovakia: Springer. <a href=\"https://doi.org/10.1007/978-3-642-03816-7_4\">https://doi.org/10.1007/978-3-642-03816-7_4</a>","ama":"Chatterjee K, Henzinger TA, Horn F. Stochastic games with finitary objectives. In: Vol 5734. Springer; 2009:34-54. doi:<a href=\"https://doi.org/10.1007/978-3-642-03816-7_4\">10.1007/978-3-642-03816-7_4</a>"},"status":"public","alternative_title":["LNCS"],"title":"Stochastic games with finitary objectives","department":[{"_id":"KrCh"}],"language":[{"iso":"eng"}],"date_updated":"2021-01-12T07:59:35Z","conference":{"end_date":"2009-08-28","location":"High Tatras, Slovakia","start_date":"2009-08-24","name":"MFCS: Mathematical Foundations of Computer Science"},"oa_version":"None","type":"conference","page":"34 - 54","year":"2009"},{"date_updated":"2021-01-12T07:59:35Z","file":[{"file_id":"4662","checksum":"ce7dc1667502e26b23c07a767ac41ae6","creator":"system","file_size":212369,"file_name":"IST-2012-37-v1+1_Termination_criteria_for_solving_concurrent_safety_and_reachability_games.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:46:31Z","relation":"main_file","access_level":"open_access","date_created":"2018-12-12T10:08:03Z"}],"conference":{"name":"SODA: Symposium on Discrete Algorithms"},"oa":1,"file_date_updated":"2020-07-14T12:46:31Z","publication_status":"published","publisher":"SIAM","extern":1,"title":"Termination criteria for solving concurrent safety and reachability games","quality_controlled":0,"main_file_link":[{"open_access":"1","url":"https://repository.ist.ac.at/id/eprint/37"}],"citation":{"chicago":"Chatterjee, Krishnendu, Luca De Alfaro, and Thomas A Henzinger. “Termination Criteria for Solving Concurrent Safety and Reachability Games,” 197–206. SIAM, 2009. <a href=\"https://doi.org/10.1137/1.9781611973068.23\">https://doi.org/10.1137/1.9781611973068.23</a>.","mla":"Chatterjee, Krishnendu, et al. <i>Termination Criteria for Solving Concurrent Safety and Reachability Games</i>. SIAM, 2009, pp. 197–206, doi:<a href=\"https://doi.org/10.1137/1.9781611973068.23\">10.1137/1.9781611973068.23</a>.","ieee":"K. Chatterjee, L. De Alfaro, and T. A. Henzinger, “Termination criteria for solving concurrent safety and reachability games,” presented at the SODA: Symposium on Discrete Algorithms, 2009, pp. 197–206.","short":"K. Chatterjee, L. De Alfaro, T.A. Henzinger, in:, SIAM, 2009, pp. 197–206.","ista":"Chatterjee K, De Alfaro L, Henzinger TA. 2009. Termination criteria for solving concurrent safety and reachability games. SODA: Symposium on Discrete Algorithms, 197–206.","ama":"Chatterjee K, De Alfaro L, Henzinger TA. Termination criteria for solving concurrent safety and reachability games. In: SIAM; 2009:197-206. doi:<a href=\"https://doi.org/10.1137/1.9781611973068.23\">10.1137/1.9781611973068.23</a>","apa":"Chatterjee, K., De Alfaro, L., &#38; Henzinger, T. A. (2009). Termination criteria for solving concurrent safety and reachability games (pp. 197–206). Presented at the SODA: Symposium on Discrete Algorithms, SIAM. <a href=\"https://doi.org/10.1137/1.9781611973068.23\">https://doi.org/10.1137/1.9781611973068.23</a>"},"doi":"10.1137/1.9781611973068.23","month":"01","date_created":"2018-12-11T12:09:24Z","year":"2009","status":"public","abstract":[{"text":"We consider concurrent games played on graphs. At every round of a game, each player simultaneously and independently selects a move; the moves jointly determine the transition to a successor state. Two basic objectives are the safety objective to stay forever in a given set of states, and its dual, the reachability objective to reach a given set of states. We present in this paper a strategy improvement algorithm for computing the value of a concurrent safety game, that is, the maximal probability with which player 1 can enforce the safety objective. The algorithm yields a sequence of player-1 strategies which ensure probabilities of winning that converge monotonically to the value of the safety game. Our result is significant because the strategy improvement algorithm provides, for the first time, a way to approximate the value of a concurrent safety game from below. Since a value iteration algorithm, or a strategy improvement algorithm for reachability games, can be used to approximate the same value from above, the combination of both algorithms yields a method for computing a converging sequence of upper and lower bounds for the values of concurrent reachability and safety games. Previous methods could approximate the values of these games only from one direction, and as no rates of convergence are known, they did not provide a practical way to solve these games.","lang":"eng"}],"date_published":"2009-01-01T00:00:00Z","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Krishnendu Chatterjee","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"last_name":"De Alfaro","full_name":"de Alfaro, Luca","first_name":"Luca"},{"full_name":"Thomas Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger"}],"pubrep_id":"37","page":"197 - 206","day":"01","_id":"4544","type":"conference","publist_id":"176"},{"year":"2009","type":"conference","page":"1 - 15","pubrep_id":"38","oa_version":"Submitted Version","ddc":["000","005"],"conference":{"name":"ICALP: Automata, Languages and Programming","start_date":"2009-07-05","location":"Rhodos, Greece","end_date":"2009-07-12"},"language":[{"iso":"eng"}],"date_updated":"2021-01-12T07:59:35Z","title":"A survey of stochastic games with limsup and liminf objectives","department":[{"_id":"KrCh"}],"status":"public","alternative_title":["LNCS"],"month":"06","date_created":"2018-12-11T12:09:24Z","doi":"10.1007/978-3-642-02930-1_1","citation":{"ama":"Chatterjee K, Doyen L, Henzinger TA. A survey of stochastic games with limsup and liminf objectives. In: Vol 5556. Springer; 2009:1-15. doi:<a href=\"https://doi.org/10.1007/978-3-642-02930-1_1\">10.1007/978-3-642-02930-1_1</a>","apa":"Chatterjee, K., Doyen, L., &#38; Henzinger, T. A. (2009). A survey of stochastic games with limsup and liminf objectives (Vol. 5556, pp. 1–15). Presented at the ICALP: Automata, Languages and Programming, Rhodos, Greece: Springer. <a href=\"https://doi.org/10.1007/978-3-642-02930-1_1\">https://doi.org/10.1007/978-3-642-02930-1_1</a>","ista":"Chatterjee K, Doyen L, Henzinger TA. 2009. A survey of stochastic games with limsup and liminf objectives. ICALP: Automata, Languages and Programming, LNCS, vol. 5556, 1–15.","ieee":"K. Chatterjee, L. Doyen, and T. A. Henzinger, “A survey of stochastic games with limsup and liminf objectives,” presented at the ICALP: Automata, Languages and Programming, Rhodos, Greece, 2009, vol. 5556, pp. 1–15.","short":"K. Chatterjee, L. Doyen, T.A. Henzinger, in:, Springer, 2009, pp. 1–15.","mla":"Chatterjee, Krishnendu, et al. <i>A Survey of Stochastic Games with Limsup and Liminf Objectives</i>. Vol. 5556, Springer, 2009, pp. 1–15, doi:<a href=\"https://doi.org/10.1007/978-3-642-02930-1_1\">10.1007/978-3-642-02930-1_1</a>.","chicago":"Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “A Survey of Stochastic Games with Limsup and Liminf Objectives,” 5556:1–15. Springer, 2009. <a href=\"https://doi.org/10.1007/978-3-642-02930-1_1\">https://doi.org/10.1007/978-3-642-02930-1_1</a>."},"_id":"4545","publist_id":"177","day":"24","author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"last_name":"Doyen","full_name":"Doyen, Laurent","first_name":"Laurent"},{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"}],"date_published":"2009-06-24T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"This research was supported in part by the Swiss National Science Foundation under the Indo-Swiss Joint Research Programme, by the European Network of Excellence on Embedded Systems Design (ArtistDesign), by the European projects COMBEST, Quasimodo, Gasics, by the PAI program Moves funded by the Belgian Federal Government, and by the CFV (Federated Center in Verification) funded by the F.R.S.-FNRS.","abstract":[{"lang":"eng","text":"A stochastic game is a two-player game played oil a graph, where in each state the successor is chosen either by One of the players, or according to a probability distribution. We Survey Stochastic games with limsup and liminf objectives. A real-valued re-ward is assigned to each state, and the value of all infinite path is the limsup (resp. liminf) of all rewards along the path. The value of a stochastic game is the maximal expected value of an infinite path that call he achieved by resolving the decisions of the first player. We present the complexity of computing values of Stochastic games and their subclasses, and the complexity, of optimal strategies in such games. "}],"oa":1,"file_date_updated":"2020-07-14T12:46:31Z","project":[{"call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543","_id":"25EFB36C-B435-11E9-9278-68D0E5697425"}],"volume":5556,"file":[{"file_size":187419,"creator":"system","checksum":"dabb6d24428a000254c95493d9c492e6","file_id":"4992","content_type":"application/pdf","file_name":"IST-2012-38-v1+1_A_survey_of_stochastic_games_with_limsup_and_liminf_objectives.pdf","date_created":"2018-12-12T10:13:11Z","access_level":"open_access","relation":"main_file","date_updated":"2020-07-14T12:46:31Z"}],"quality_controlled":"1","scopus_import":1,"ec_funded":1,"intvolume":"      5556","publication_status":"published","has_accepted_license":"1","publisher":"Springer"},{"author":[{"full_name":"Sano, Hiromi","first_name":"Hiromi","last_name":"Sano"},{"last_name":"Nagai","full_name":"Nagai, Yumiko","first_name":"Yumiko"},{"full_name":"Miyakawa, Tsuyoshi","first_name":"Tsuyoshi","last_name":"Miyakawa"},{"first_name":"Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","full_name":"Ryuichi Shigemoto","last_name":"Shigemoto","orcid":"0000-0001-8761-9444"},{"full_name":"Yokoi, Mineto","first_name":"Mineto","last_name":"Yokoi"}],"date_published":"2008-04-01T00:00:00Z","issue":"2","publication":"Journal of Neurochemistry","abstract":[{"text":"Cyclic nucleotide phosphodiesterase 10A (PDE10A) is a member of phosphodiesterase families that degrade cAMP and/or cGMP in distinct intracellular sites. PDE10A has a dual activity on hydrolysis of both cAMP and cGMP, and is prominently expressed in the striatum and the testis. Previous studies suggested that PDE10A is involved in regulation of locomotor activity and potentially related to psychosis, but concrete physiological roles of PDE10A remains elusive yet. In this study, we genetically inactivated PDE10A2, a prominent isoform of PDE10A in the brain, in mice, and demonstrate that PDE10A2 deficiency results in increased social interaction without any major influence on different other behaviors, along with increased levels of striatal cAMP. We also demonstrate that PDE10A2 is selectively distributed in medium spiny neurons, but not interneurons, of the striatal complex. Thus, our results establish a physiological role for PDE10A2 in regulating cAMP pathway and social interaction, and suggest that cAMP signaling cascade in striatal medium spiny neurons might be involved in regulating social interaction behavior in mice.","lang":"eng"}],"_id":"2497","type":"journal_article","publist_id":"4404","day":"01","page":"546 - 556","month":"04","date_created":"2018-12-11T11:58:01Z","citation":{"ama":"Sano H, Nagai Y, Miyakawa T, Shigemoto R, Yokoi M. Increased social interaction in mice deficient of the striatal medium spiny neuron-specific phosphodiesterase 10A2. <i>Journal of Neurochemistry</i>. 2008;105(2):546-556. doi:<a href=\"https://doi.org/10.1111/j.1471-4159.2007.05152.x\">10.1111/j.1471-4159.2007.05152.x</a>","apa":"Sano, H., Nagai, Y., Miyakawa, T., Shigemoto, R., &#38; Yokoi, M. (2008). Increased social interaction in mice deficient of the striatal medium spiny neuron-specific phosphodiesterase 10A2. <i>Journal of Neurochemistry</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/j.1471-4159.2007.05152.x\">https://doi.org/10.1111/j.1471-4159.2007.05152.x</a>","ista":"Sano H, Nagai Y, Miyakawa T, Shigemoto R, Yokoi M. 2008. Increased social interaction in mice deficient of the striatal medium spiny neuron-specific phosphodiesterase 10A2. Journal of Neurochemistry. 105(2), 546–556.","short":"H. Sano, Y. Nagai, T. Miyakawa, R. Shigemoto, M. Yokoi, Journal of Neurochemistry 105 (2008) 546–556.","ieee":"H. Sano, Y. Nagai, T. Miyakawa, R. Shigemoto, and M. Yokoi, “Increased social interaction in mice deficient of the striatal medium spiny neuron-specific phosphodiesterase 10A2,” <i>Journal of Neurochemistry</i>, vol. 105, no. 2. Wiley-Blackwell, pp. 546–556, 2008.","mla":"Sano, Hiromi, et al. “Increased Social Interaction in Mice Deficient of the Striatal Medium Spiny Neuron-Specific Phosphodiesterase 10A2.” <i>Journal of Neurochemistry</i>, vol. 105, no. 2, Wiley-Blackwell, 2008, pp. 546–56, doi:<a href=\"https://doi.org/10.1111/j.1471-4159.2007.05152.x\">10.1111/j.1471-4159.2007.05152.x</a>.","chicago":"Sano, Hiromi, Yumiko Nagai, Tsuyoshi Miyakawa, Ryuichi Shigemoto, and Mineto Yokoi. “Increased Social Interaction in Mice Deficient of the Striatal Medium Spiny Neuron-Specific Phosphodiesterase 10A2.” <i>Journal of Neurochemistry</i>. Wiley-Blackwell, 2008. <a href=\"https://doi.org/10.1111/j.1471-4159.2007.05152.x\">https://doi.org/10.1111/j.1471-4159.2007.05152.x</a>."},"doi":"10.1111/j.1471-4159.2007.05152.x","status":"public","year":"2008","intvolume":"       105","extern":1,"publication_status":"published","publisher":"Wiley-Blackwell","quality_controlled":0,"title":"Increased social interaction in mice deficient of the striatal medium spiny neuron-specific phosphodiesterase 10A2","volume":105,"date_updated":"2021-01-12T06:57:50Z"},{"month":"03","date_created":"2018-12-11T11:59:00Z","citation":{"ista":"Fukazawa Y, Tarusawa E, Matsui K, Shigemoto R. 2008.  Ultrastructural insights of postsynaptic glutamate receptor organization . Tanpakushitsu kakusan koso Protein nucleic acid enzyme. 53(4 Suppl), 436–441.","apa":"Fukazawa, Y., Tarusawa, E., Matsui, K., &#38; Shigemoto, R. (2008).  Ultrastructural insights of postsynaptic glutamate receptor organization . <i>Tanpakushitsu Kakusan Koso Protein Nucleic Acid Enzyme</i>. Kyoritsu Shuppan.","ama":"Fukazawa Y, Tarusawa E, Matsui K, Shigemoto R.  Ultrastructural insights of postsynaptic glutamate receptor organization . <i>Tanpakushitsu kakusan koso Protein nucleic acid enzyme</i>. 2008;53(4 Suppl):436-441.","mla":"Fukazawa, Yugo, et al. “ Ultrastructural Insights of Postsynaptic Glutamate Receptor Organization .” <i>Tanpakushitsu Kakusan Koso Protein Nucleic Acid Enzyme</i>, vol. 53, no. 4 Suppl, Kyoritsu Shuppan, 2008, pp. 436–41.","chicago":"Fukazawa, Yugo, Etsuko Tarusawa, Ko Matsui, and Ryuichi Shigemoto. “ Ultrastructural Insights of Postsynaptic Glutamate Receptor Organization .” <i>Tanpakushitsu Kakusan Koso Protein Nucleic Acid Enzyme</i>. Kyoritsu Shuppan, 2008.","ieee":"Y. Fukazawa, E. Tarusawa, K. Matsui, and R. Shigemoto, “ Ultrastructural insights of postsynaptic glutamate receptor organization ,” <i>Tanpakushitsu kakusan koso Protein nucleic acid enzyme</i>, vol. 53, no. 4 Suppl. Kyoritsu Shuppan, pp. 436–441, 2008.","short":"Y. Fukazawa, E. Tarusawa, K. Matsui, R. Shigemoto, Tanpakushitsu Kakusan Koso Protein Nucleic Acid Enzyme 53 (2008) 436–441."},"status":"public","year":"2008","date_published":"2008-03-01T00:00:00Z","author":[{"last_name":"Fukazawa","full_name":"Fukazawa, Yugo","first_name":"Yugo"},{"last_name":"Tarusawa","first_name":"Etsuko","full_name":"Tarusawa, Etsuko"},{"last_name":"Matsui","full_name":"Matsui, Ko","first_name":"Ko"},{"id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","first_name":"Ryuichi","full_name":"Ryuichi Shigemoto","last_name":"Shigemoto","orcid":"0000-0001-8761-9444"}],"issue":"4 Suppl","publication":"Tanpakushitsu kakusan koso Protein nucleic acid enzyme","_id":"2674","type":"review","publist_id":"4223","day":"01","page":"436 - 441","volume":53,"date_updated":"2020-07-14T12:45:44Z","extern":1,"intvolume":"        53","publisher":"Kyoritsu Shuppan","publication_status":"published","quality_controlled":0,"title":" Ultrastructural insights of postsynaptic glutamate receptor organization "},{"status":"public","year":"2008","date_created":"2018-12-11T11:59:00Z","month":"05","citation":{"chicago":"Endo, Toshiaki, Etsuko Tarusawa, Takuya Notomi, Katsuyuki Kaneda, Masumi Hirabayashi, Ryuichi Shigemoto, and Tadashi Isa. “Dendritic Ih Ensures High-Fidelity Dendritic Spike Responses of Motion-Sensitive Neurons in Rat Superior Colliculus.” <i>Journal of Neurophysiology</i>. American Physiological Society, 2008. <a href=\"https://doi.org/10.1152/jn.00556.2007\">https://doi.org/10.1152/jn.00556.2007</a>.","mla":"Endo, Toshiaki, et al. “Dendritic Ih Ensures High-Fidelity Dendritic Spike Responses of Motion-Sensitive Neurons in Rat Superior Colliculus.” <i>Journal of Neurophysiology</i>, vol. 99, no. 5, American Physiological Society, 2008, pp. 2066–76, doi:<a href=\"https://doi.org/10.1152/jn.00556.2007\">10.1152/jn.00556.2007</a>.","ieee":"T. Endo <i>et al.</i>, “Dendritic Ih ensures high-fidelity dendritic spike responses of motion-sensitive neurons in rat superior colliculus,” <i>Journal of Neurophysiology</i>, vol. 99, no. 5. American Physiological Society, pp. 2066–2076, 2008.","short":"T. Endo, E. Tarusawa, T. Notomi, K. Kaneda, M. Hirabayashi, R. Shigemoto, T. Isa, Journal of Neurophysiology 99 (2008) 2066–2076.","ista":"Endo T, Tarusawa E, Notomi T, Kaneda K, Hirabayashi M, Shigemoto R, Isa T. 2008. Dendritic Ih ensures high-fidelity dendritic spike responses of motion-sensitive neurons in rat superior colliculus. Journal of Neurophysiology. 99(5), 2066–2076.","ama":"Endo T, Tarusawa E, Notomi T, et al. Dendritic Ih ensures high-fidelity dendritic spike responses of motion-sensitive neurons in rat superior colliculus. <i>Journal of Neurophysiology</i>. 2008;99(5):2066-2076. doi:<a href=\"https://doi.org/10.1152/jn.00556.2007\">10.1152/jn.00556.2007</a>","apa":"Endo, T., Tarusawa, E., Notomi, T., Kaneda, K., Hirabayashi, M., Shigemoto, R., &#38; Isa, T. (2008). Dendritic Ih ensures high-fidelity dendritic spike responses of motion-sensitive neurons in rat superior colliculus. <i>Journal of Neurophysiology</i>. American Physiological Society. <a href=\"https://doi.org/10.1152/jn.00556.2007\">https://doi.org/10.1152/jn.00556.2007</a>"},"doi":"10.1152/jn.00556.2007","_id":"2675","type":"journal_article","publist_id":"4221","day":"01","page":"2066 - 2076","issue":"5","date_published":"2008-05-01T00:00:00Z","author":[{"first_name":"Toshiaki","full_name":"Endo, Toshiaki","last_name":"Endo"},{"last_name":"Tarusawa","full_name":"Tarusawa, Etsuko","first_name":"Etsuko"},{"last_name":"Notomi","first_name":"Takuya","full_name":"Notomi, Takuya"},{"last_name":"Kaneda","full_name":"Kaneda, Katsuyuki","first_name":"Katsuyuki"},{"last_name":"Hirabayashi","full_name":"Hirabayashi, Masumi","first_name":"Masumi"},{"orcid":"0000-0001-8761-9444","last_name":"Shigemoto","full_name":"Ryuichi Shigemoto","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","first_name":"Ryuichi"},{"last_name":"Isa","full_name":"Isa, Tadashi","first_name":"Tadashi"}],"publication":"Journal of Neurophysiology","abstract":[{"lang":"eng","text":"Hyperpolarization-activated cyclic nucleotide-gated (HCN) channels that generate Ih currents are widely distributed in the brain and have been shown to contribute to various neuronal functions. In the present study, we investigated the functions of Ih in the motion-sensitive projection neurons [wide field vertical (WFV) cells] of the superior colliculus, a pivotal visual center for detection of and orientating to salient objects. Combination of whole cell recordings and immunohistochemical investigations suggested that HCN1 channels dominantly contribute to the Ih in WFV cells among HCN isoforms expressed in the superficial superior colliculus and mainly located on their expansive dendritic trees. We found that blocking Ih suppressed the initiation of short- and fixed-latency dendritic spike responses and led instead to long- and fluctuating-latency somatic spike responses to optic fiber stimulations. These results suggest that the dendritic Ih facilitates the dendritic initiation and/or propagation of action potentials and ensures that WFV cells generate spike responses to distal synaptic inputs in a sensitive and robustly time-locked manner, probably by acting as continuous depolarizing drive and fixing dendritic membrane potentials close to the spike threshold. These functions are different from known functions of dendritic Ih revealed in hippocampal and neocortical pyramidal cells, where they spatiotemporally limit the propagations of synaptic inputs along the apical dendrites by reducing dendritic membrane resistance. Thus we have revealed new functional aspects of Ih, and these dendritic properties are likely critical for visual motion processing in these neurons."}],"volume":99,"date_updated":"2021-01-12T06:58:59Z","quality_controlled":0,"title":"Dendritic Ih ensures high-fidelity dendritic spike responses of motion-sensitive neurons in rat superior colliculus","intvolume":"        99","extern":1,"publication_status":"published","publisher":"American Physiological Society"},{"volume":3,"date_updated":"2021-01-12T06:58:59Z","extern":1,"intvolume":"         3","publication_status":"published","publisher":"Public Library of Science","quality_controlled":0,"title":"Right isomerism of the brain in inversus viscerum mutant mice","month":"04","date_created":"2018-12-11T11:59:00Z","citation":{"ama":"Kawakami R, Dobi A, Shigemoto R, Ito I. Right isomerism of the brain in inversus viscerum mutant mice. <i>PLoS One</i>. 2008;3(4). doi:<a href=\"https://doi.org/10.1371/journal.pone.0001945\">10.1371/journal.pone.0001945</a>","apa":"Kawakami, R., Dobi, A., Shigemoto, R., &#38; Ito, I. (2008). Right isomerism of the brain in inversus viscerum mutant mice. <i>PLoS One</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pone.0001945\">https://doi.org/10.1371/journal.pone.0001945</a>","ista":"Kawakami R, Dobi A, Shigemoto R, Ito I. 2008. Right isomerism of the brain in inversus viscerum mutant mice. PLoS One. 3(4).","short":"R. Kawakami, A. Dobi, R. Shigemoto, I. Ito, PLoS One 3 (2008).","ieee":"R. Kawakami, A. Dobi, R. Shigemoto, and I. Ito, “Right isomerism of the brain in inversus viscerum mutant mice,” <i>PLoS One</i>, vol. 3, no. 4. Public Library of Science, 2008.","mla":"Kawakami, Ryosuke, et al. “Right Isomerism of the Brain in Inversus Viscerum Mutant Mice.” <i>PLoS One</i>, vol. 3, no. 4, Public Library of Science, 2008, doi:<a href=\"https://doi.org/10.1371/journal.pone.0001945\">10.1371/journal.pone.0001945</a>.","chicago":"Kawakami, Ryosuke, Alice Dobi, Ryuichi Shigemoto, and Isao Ito. “Right Isomerism of the Brain in Inversus Viscerum Mutant Mice.” <i>PLoS One</i>. Public Library of Science, 2008. <a href=\"https://doi.org/10.1371/journal.pone.0001945\">https://doi.org/10.1371/journal.pone.0001945</a>."},"doi":"10.1371/journal.pone.0001945","status":"public","year":"2008","date_published":"2008-04-16T00:00:00Z","author":[{"last_name":"Kawakami","full_name":"Kawakami, Ryosuke","first_name":"Ryosuke"},{"last_name":"Dobi","full_name":"Dobi, Alice","first_name":"Alice"},{"last_name":"Shigemoto","orcid":"0000-0001-8761-9444","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","first_name":"Ryuichi","full_name":"Ryuichi Shigemoto"},{"first_name":"Isao","full_name":"Ito, Isao","last_name":"Ito"}],"issue":"4","abstract":[{"text":"Left-right (L-R) asymmetry is a fundamental feature of higher-order neural function. However, the molecular basis of brain asymmetry remains unclear. We recently reported L-R asymmetry of hippocampal circuitry caused by differential allocation of N-methyl-O-aspartate receptor (NMDAR) subunit GluRε2 (NR2B) in hippocambal synapses. Using electrophysiology and immunocytochemistry, here we analyzed the hippocampal circuitry of the inversus viscerum (iv) mouse that has a randomized laterality of internal organs. The iv mouse hippocampus lacks L-R asymmetry, it exhibits right isomerism in the synaptic distribution of the ε2 subunit, irrespective of the laterality of visceral organs. This independent right isomerism of the hippocampus is the first evidence that a distinct mechanism downstream of the iv mutation generates brain asymmetry.","lang":"eng"}],"publication":"PLoS One","type":"journal_article","_id":"2676","publist_id":"4222","day":"16","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"}},{"date_updated":"2021-01-12T06:58:59Z","volume":586,"title":"The presence of pacemaker HCN channels identifies theta rhythmic GABAergic neurons in the medial septum","quality_controlled":0,"publisher":"Wiley-Blackwell","publication_status":"published","extern":1,"intvolume":"       586","year":"2008","status":"public","doi":"10.1113/jphysiol.2008.155242","citation":{"short":"V. Varga, B. Hangya, K. Kránitz, A. Ludányi, R. Zemankovics, I. Katona, R. Shigemoto, T. Freund, Z. Borhegyi, Journal of Physiology 586 (2008) 3893–3915.","ieee":"V. Varga <i>et al.</i>, “The presence of pacemaker HCN channels identifies theta rhythmic GABAergic neurons in the medial septum,” <i>Journal of Physiology</i>, vol. 586, no. 16. Wiley-Blackwell, pp. 3893–3915, 2008.","chicago":"Varga, Viktor, Balázs Hangya, Kinga Kránitz, Anikó Ludányi, Rita Zemankovics, István Katona, Ryuichi Shigemoto, Tamás Freund, and Zsolt Borhegyi. “The Presence of Pacemaker HCN Channels Identifies Theta Rhythmic GABAergic Neurons in the Medial Septum.” <i>Journal of Physiology</i>. Wiley-Blackwell, 2008. <a href=\"https://doi.org/10.1113/jphysiol.2008.155242\">https://doi.org/10.1113/jphysiol.2008.155242</a>.","mla":"Varga, Viktor, et al. “The Presence of Pacemaker HCN Channels Identifies Theta Rhythmic GABAergic Neurons in the Medial Septum.” <i>Journal of Physiology</i>, vol. 586, no. 16, Wiley-Blackwell, 2008, pp. 3893–915, doi:<a href=\"https://doi.org/10.1113/jphysiol.2008.155242\">10.1113/jphysiol.2008.155242</a>.","apa":"Varga, V., Hangya, B., Kránitz, K., Ludányi, A., Zemankovics, R., Katona, I., … Borhegyi, Z. (2008). The presence of pacemaker HCN channels identifies theta rhythmic GABAergic neurons in the medial septum. <i>Journal of Physiology</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1113/jphysiol.2008.155242\">https://doi.org/10.1113/jphysiol.2008.155242</a>","ama":"Varga V, Hangya B, Kránitz K, et al. The presence of pacemaker HCN channels identifies theta rhythmic GABAergic neurons in the medial septum. <i>Journal of Physiology</i>. 2008;586(16):3893-3915. doi:<a href=\"https://doi.org/10.1113/jphysiol.2008.155242\">10.1113/jphysiol.2008.155242</a>","ista":"Varga V, Hangya B, Kránitz K, Ludányi A, Zemankovics R, Katona I, Shigemoto R, Freund T, Borhegyi Z. 2008. The presence of pacemaker HCN channels identifies theta rhythmic GABAergic neurons in the medial septum. Journal of Physiology. 586(16), 3893–3915."},"month":"08","date_created":"2018-12-11T11:59:01Z","page":"3893 - 3915","day":"15","_id":"2677","type":"journal_article","publist_id":"4220","publication":"Journal of Physiology","abstract":[{"lang":"eng","text":"The medial septum (MS) is an indispensable component of the subcortical network which synchronizes the hippocampus at theta frequency during specific stages of information processing. GABAergic neurons exhibiting highly regular firing coupled to the hippocampal theta rhythm are thought to form the core of the MS rhythm-generating network. In recent studies the hyperpolarization-activated, cyclic nucleotide-gated non-selective cation (HCN) channel was shown to participate in theta synchronization of the medial septum. Here, we tested the hypothesis that HCN channel expression correlates with theta modulated firing behaviour of MS neurons by a combined anatomical and electrophysiological approach. HCN-expressing neurons represented a subpopulation of GABAergic cells in the MS partly overlapping with parvalbumin (PV)-containing neurons. Rhythmic firing in the theta frequency range was characteristic of all HCN-expressing neurons. In contrast, only a minority of HCN-negative cells displayed theta related activity. All HCN cells had tight phase coupling to hippocampal theta waves. As a group, PV-expressing HCN neurons had a marked bimodal phase distribution, whereas PV-immunonegative HCN neurons did not show group-level phase preference despite significant individual phase coupling. Microiontophoretic blockade of HCN channels resulted in the reduction of discharge frequency, but theta rhythmic firing was perturbed only in a few cases. Our data imply that HCN-expressing GABAergic neurons provide rhythmic drive in all phases of the hippocampal theta activity. In most MS theta cells rhythm genesis is apparently determined by interactions at the level of the network rather than by the pacemaking property of HCN channels alone."}],"date_published":"2008-08-15T00:00:00Z","issue":"16","author":[{"last_name":"Varga","full_name":"Varga, Viktor","first_name":"Viktor"},{"first_name":"Balázs","full_name":"Hangya, Balázs","last_name":"Hangya"},{"last_name":"Kránitz","full_name":"Kránitz, Kinga","first_name":"Kinga"},{"full_name":"Ludányi, Anikó","first_name":"Anikó","last_name":"Ludányi"},{"first_name":"Rita","full_name":"Zemankovics, Rita","last_name":"Zemankovics"},{"last_name":"Katona","first_name":"István","full_name":"Katona, István"},{"full_name":"Ryuichi Shigemoto","first_name":"Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8761-9444","last_name":"Shigemoto"},{"last_name":"Freund","full_name":"Freund, Tamás F","first_name":"Tamás"},{"last_name":"Borhegyi","first_name":"Zsolt","full_name":"Borhegyi, Zsolt"}]},{"extern":1,"intvolume":"        28","publisher":"Society for Neuroscience","publication_status":"published","title":"Connexin45-containing neuronal gap junctions in rodent retina also contain connexin36 in both apposing hemiplaques, forming bihomotypic gap junctions, with scaffolding contributed by zonula occludens-1","quality_controlled":0,"volume":28,"date_updated":"2021-01-12T06:59:00Z","author":[{"first_name":"Xinbo","full_name":"Li, Xinbo","last_name":"Li"},{"first_name":"Naomi","full_name":"Kamasawa, Naomi","last_name":"Kamasawa"},{"first_name":"Cristina","full_name":"Ciolofan, Cristina","last_name":"Ciolofan"},{"first_name":"Carl","full_name":"Olson, Carl O","last_name":"Olson"},{"first_name":"Shijun","full_name":"Lu, Shijun","last_name":"Lu"},{"last_name":"Davidson","full_name":"Davidson, Kimberly G","first_name":"Kimberly"},{"last_name":"Yasumura","first_name":"Thomas","full_name":"Yasumura, Thomas"},{"full_name":"Ryuichi Shigemoto","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","first_name":"Ryuichi","orcid":"0000-0001-8761-9444","last_name":"Shigemoto"},{"last_name":"Rash","full_name":"Rash, John E","first_name":"John"},{"full_name":"Nagy, James I","first_name":"James","last_name":"Nagy"}],"date_published":"2008-09-24T00:00:00Z","issue":"39","abstract":[{"lang":"eng","text":"Mammalian retinas contain abundant neuronal gap junctions, particularly in the inner plexiform layer (IPL), where the two principal neuronal connexin proteins are Cx36 and Cx45. Currently undetermined are coupling relationships between these connexins and whether both are expressed together or separately in a neuronal subtype-specific manner. Although Cx45-expressing neurons strongly couple with Cx36-expressing neurons, possibly via heterotypic gap junctions, Cx45 and Cx36 failed to form functional heterotypic channels in vitro. We now show that Cx36 and Cx45 coexpressed in HeLa cells were colocalized in immunofluorescent puncta between contacting cells, demonstrating targeting/scaffolding competence for both connexins in vitro. However, Cx36 and Cx45 expressed separately did not form immunofluorescent puncta containing both connexins, supporting lack of heterotypic coupling competence. In IPL, 87% of Cx45-immunofluorescent puncta were colocalized with Cx36, supporting either widespread heterotypic coupling or bihomotypic coupling. Ultrastructurally, Cx45 was detected in 9% of IPL gap junction hemiplaques, 90-100% of which also contained Cx36, demonstrating connexin coexpression and cotargeting in virtually all IPL neurons that express Cx45. Moreover, double replicas revealed both connexins in separate domains mirrored on both sides of matched hemiplaques. With previous evidence that Cx36 interacts with PDZ1 domain of zonula occludens-1 (ZO-1), we show that Cx45 interacts with PDZ2 domain of ZO-1, and that Cx36, Cx45, and ZO-1 coimmunoprecipitate, suggesting that ZO-1 provides for coscaffolding of Cx45 with Cx36. These data document that in Cx45-expressing neurons of IPL, Cx45 is almost always accompanied by Cx36, forming &quot;bihomotypic&quot; gap junctions, with Cx45 structurally coupling to Cx45 and Cx36 coupling to Cx36."}],"publication":"Journal of Neuroscience","day":"24","_id":"2678","type":"journal_article","publist_id":"4218","page":"9769 - 9789","date_created":"2018-12-11T11:59:01Z","month":"09","doi":"10.1523/JNEUROSCI.2137-08.2008","citation":{"ieee":"X. Li <i>et al.</i>, “Connexin45-containing neuronal gap junctions in rodent retina also contain connexin36 in both apposing hemiplaques, forming bihomotypic gap junctions, with scaffolding contributed by zonula occludens-1,” <i>Journal of Neuroscience</i>, vol. 28, no. 39. Society for Neuroscience, pp. 9769–9789, 2008.","short":"X. Li, N. Kamasawa, C. Ciolofan, C. Olson, S. Lu, K. Davidson, T. Yasumura, R. Shigemoto, J. Rash, J. Nagy, Journal of Neuroscience 28 (2008) 9769–9789.","mla":"Li, Xinbo, et al. “Connexin45-Containing Neuronal Gap Junctions in Rodent Retina Also Contain Connexin36 in Both Apposing Hemiplaques, Forming Bihomotypic Gap Junctions, with Scaffolding Contributed by Zonula Occludens-1.” <i>Journal of Neuroscience</i>, vol. 28, no. 39, Society for Neuroscience, 2008, pp. 9769–89, doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.2137-08.2008\">10.1523/JNEUROSCI.2137-08.2008</a>.","chicago":"Li, Xinbo, Naomi Kamasawa, Cristina Ciolofan, Carl Olson, Shijun Lu, Kimberly Davidson, Thomas Yasumura, Ryuichi Shigemoto, John Rash, and James Nagy. “Connexin45-Containing Neuronal Gap Junctions in Rodent Retina Also Contain Connexin36 in Both Apposing Hemiplaques, Forming Bihomotypic Gap Junctions, with Scaffolding Contributed by Zonula Occludens-1.” <i>Journal of Neuroscience</i>. Society for Neuroscience, 2008. <a href=\"https://doi.org/10.1523/JNEUROSCI.2137-08.2008\">https://doi.org/10.1523/JNEUROSCI.2137-08.2008</a>.","apa":"Li, X., Kamasawa, N., Ciolofan, C., Olson, C., Lu, S., Davidson, K., … Nagy, J. (2008). Connexin45-containing neuronal gap junctions in rodent retina also contain connexin36 in both apposing hemiplaques, forming bihomotypic gap junctions, with scaffolding contributed by zonula occludens-1. <i>Journal of Neuroscience</i>. Society for Neuroscience. <a href=\"https://doi.org/10.1523/JNEUROSCI.2137-08.2008\">https://doi.org/10.1523/JNEUROSCI.2137-08.2008</a>","ama":"Li X, Kamasawa N, Ciolofan C, et al. Connexin45-containing neuronal gap junctions in rodent retina also contain connexin36 in both apposing hemiplaques, forming bihomotypic gap junctions, with scaffolding contributed by zonula occludens-1. <i>Journal of Neuroscience</i>. 2008;28(39):9769-9789. doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.2137-08.2008\">10.1523/JNEUROSCI.2137-08.2008</a>","ista":"Li X, Kamasawa N, Ciolofan C, Olson C, Lu S, Davidson K, Yasumura T, Shigemoto R, Rash J, Nagy J. 2008. Connexin45-containing neuronal gap junctions in rodent retina also contain connexin36 in both apposing hemiplaques, forming bihomotypic gap junctions, with scaffolding contributed by zonula occludens-1. Journal of Neuroscience. 28(39), 9769–9789."},"year":"2008","status":"public"},{"citation":{"ama":"Antal M, Fukazawa Y, Eördögh M, et al. Numbers, densities, and colocalization of AMPA- and NMDA-type glutamate receptors at individual synapses in the superficial spinal dorsal horn of rats. <i>Journal of Neuroscience</i>. 2008;28(39):9692-9701. doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.1551-08.2008\">10.1523/JNEUROSCI.1551-08.2008</a>","apa":"Antal, M., Fukazawa, Y., Eördögh, M., Muszil, D., Molnár, E., Itakura, M., … Shigemoto, R. (2008). Numbers, densities, and colocalization of AMPA- and NMDA-type glutamate receptors at individual synapses in the superficial spinal dorsal horn of rats. <i>Journal of Neuroscience</i>. Society for Neuroscience. <a href=\"https://doi.org/10.1523/JNEUROSCI.1551-08.2008\">https://doi.org/10.1523/JNEUROSCI.1551-08.2008</a>","ista":"Antal M, Fukazawa Y, Eördögh M, Muszil D, Molnár E, Itakura M, Takahashi M, Shigemoto R. 2008. Numbers, densities, and colocalization of AMPA- and NMDA-type glutamate receptors at individual synapses in the superficial spinal dorsal horn of rats. Journal of Neuroscience. 28(39), 9692–9701.","ieee":"M. Antal <i>et al.</i>, “Numbers, densities, and colocalization of AMPA- and NMDA-type glutamate receptors at individual synapses in the superficial spinal dorsal horn of rats,” <i>Journal of Neuroscience</i>, vol. 28, no. 39. Society for Neuroscience, pp. 9692–9701, 2008.","short":"M. Antal, Y. Fukazawa, M. Eördögh, D. Muszil, E. Molnár, M. Itakura, M. Takahashi, R. Shigemoto, Journal of Neuroscience 28 (2008) 9692–9701.","chicago":"Antal, Miklós, Yugo Fukazawa, Mária Eördögh, Dóra Muszil, Elek Molnár, Makoto Itakura, Masami Takahashi, and Ryuichi Shigemoto. “Numbers, Densities, and Colocalization of AMPA- and NMDA-Type Glutamate Receptors at Individual Synapses in the Superficial Spinal Dorsal Horn of Rats.” <i>Journal of Neuroscience</i>. Society for Neuroscience, 2008. <a href=\"https://doi.org/10.1523/JNEUROSCI.1551-08.2008\">https://doi.org/10.1523/JNEUROSCI.1551-08.2008</a>.","mla":"Antal, Miklós, et al. “Numbers, Densities, and Colocalization of AMPA- and NMDA-Type Glutamate Receptors at Individual Synapses in the Superficial Spinal Dorsal Horn of Rats.” <i>Journal of Neuroscience</i>, vol. 28, no. 39, Society for Neuroscience, 2008, pp. 9692–701, doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.1551-08.2008\">10.1523/JNEUROSCI.1551-08.2008</a>."},"doi":"10.1523/JNEUROSCI.1551-08.2008","date_created":"2018-12-11T11:59:01Z","month":"09","year":"2008","status":"public","abstract":[{"lang":"eng","text":"Ionotropic glutamate receptors play important roles in spinal processing of nociceptive sensory signals and induction of central sensitization in chronic pain. Here we applied highly sensitive freeze-fracture replica labeling to laminae I-II of the spinal dorsal horn of rats and investigated the numbers, densities, and colocalization of AMPA- and NMDA-type glutamate receptors at individual postsynaptic membrane specializations with a high resolution. All glutamatergic postsynaptic membranes in laminae I-II expressed AMPA receptors, and most of them (96%) were also immunoreactive for the NR1 subunit of NMDA receptors. The numbers of gold particles for AMPA and NMDA receptors at individual postsynaptic membranes showed a linear correlation with the size of postsynaptic membrane specializations and varied in the range of 8-214 and 5-232 with median values of 37 and 28, whereas their densities varied in the range of 325-3365/μm 2 and 102-2263/μm 2 with median values of 1115/μm 2 and 777/μm 2, respectively. Virtually all (99%) glutamatergic postsynaptic membranes expressed GluR2, and most of them (87%) were also immunoreactive for GluR1. The numbers of gold particles for pan-AMPA, NR1, and GluR2 subunits showed a linear correlation with the size of postsynaptic surface areas. Concerning GluR1, there may be two populations of synapses with high and low GluR1 densities. In synapses larger than 0.1 μm 2, GluR1 subunits were recovered in very low numbers. Differential expression of GluR1 and GluR2 subunits suggests regulation of AMPA receptor subunit composition by presynaptic mechanism."}],"publication":"Journal of Neuroscience","author":[{"last_name":"Antal","full_name":"Antal, Miklós","first_name":"Miklós"},{"first_name":"Yugo","full_name":"Fukazawa, Yugo","last_name":"Fukazawa"},{"last_name":"Eördögh","full_name":"Eördögh, Mária","first_name":"Mária"},{"full_name":"Muszil, Dóra","first_name":"Dóra","last_name":"Muszil"},{"last_name":"Molnár","first_name":"Elek","full_name":"Molnár, Elek"},{"last_name":"Itakura","full_name":"Itakura, Makoto","first_name":"Makoto"},{"last_name":"Takahashi","full_name":"Takahashi, Masami","first_name":"Masami"},{"full_name":"Ryuichi Shigemoto","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","first_name":"Ryuichi","orcid":"0000-0001-8761-9444","last_name":"Shigemoto"}],"date_published":"2008-09-24T00:00:00Z","issue":"39","page":"9692 - 9701","day":"24","type":"journal_article","_id":"2679","publist_id":"4219","date_updated":"2021-01-12T06:59:00Z","volume":28,"publication_status":"published","publisher":"Society for Neuroscience","extern":1,"intvolume":"        28","title":"Numbers, densities, and colocalization of AMPA- and NMDA-type glutamate receptors at individual synapses in the superficial spinal dorsal horn of rats","quality_controlled":0},{"quality_controlled":0,"title":"Left-right asymmetry of the hippocampal synapses with differential subunit allocation of glutamate receptors","publication_status":"published","publisher":"National Academy of Sciences","extern":1,"intvolume":"       105","date_updated":"2021-01-12T06:59:01Z","volume":105,"page":"19498 - 19503","_id":"2681","type":"journal_article","publist_id":"4217","day":"09","publication":"PNAS","abstract":[{"lang":"eng","text":"Left-right asymmetry of the brain has been studied mostly through psychological examination and functional imaging in primates, leaving its molecular and synaptic aspects largely unaddressed. Here, we show that hippocampal CA1 pyramidal cell synapses differ in size, shape, and glutamate receptor expression depending on the laterality of presynaptic origin. CA1 synapses receiving neuronal input from the right CA3 pyramidal cells are larger and have more perforated PSD and a GluR1 expression level twice as high as those receiving input from the left CA3. The synaptic density of GluR1 increases as the size of a synapse increases, whereas that of NR2B decreases because of the relatively constant NR2B expression in CA1 regardless of synapse size. Densities of other major glutamate receptor subunits show no correlation with synapse size, thus resulting in higher net expression in synapses having right input. Our study demonstrates universal left-right asymmetry of hippocampal synapses with a fundamental relationship between synaptic area and the expression of glutamate receptor subunits."}],"author":[{"full_name":"Shinohara, Yoshiaki","first_name":"Yoshiaki","last_name":"Shinohara"},{"last_name":"Hirase","full_name":"Hirase, Hajime","first_name":"Hajime"},{"last_name":"Watanabe","first_name":"Masahiko","full_name":"Watanabe, Masahiko"},{"last_name":"Itakura","full_name":"Itakura, Makoto","first_name":"Makoto"},{"last_name":"Takahashi","full_name":"Takahashi, Masami","first_name":"Masami"},{"orcid":"0000-0001-8761-9444","last_name":"Shigemoto","full_name":"Ryuichi Shigemoto","first_name":"Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87"}],"date_published":"2008-12-09T00:00:00Z","issue":"49","status":"public","year":"2008","citation":{"chicago":"Shinohara, Yoshiaki, Hajime Hirase, Masahiko Watanabe, Makoto Itakura, Masami Takahashi, and Ryuichi Shigemoto. “Left-Right Asymmetry of the Hippocampal Synapses with Differential Subunit Allocation of Glutamate Receptors.” <i>PNAS</i>. National Academy of Sciences, 2008. <a href=\"https://doi.org/10.1073/pnas.0807461105\">https://doi.org/10.1073/pnas.0807461105</a>.","mla":"Shinohara, Yoshiaki, et al. “Left-Right Asymmetry of the Hippocampal Synapses with Differential Subunit Allocation of Glutamate Receptors.” <i>PNAS</i>, vol. 105, no. 49, National Academy of Sciences, 2008, pp. 19498–503, doi:<a href=\"https://doi.org/10.1073/pnas.0807461105\">10.1073/pnas.0807461105</a>.","ieee":"Y. Shinohara, H. Hirase, M. Watanabe, M. Itakura, M. Takahashi, and R. Shigemoto, “Left-right asymmetry of the hippocampal synapses with differential subunit allocation of glutamate receptors,” <i>PNAS</i>, vol. 105, no. 49. National Academy of Sciences, pp. 19498–19503, 2008.","short":"Y. Shinohara, H. Hirase, M. Watanabe, M. Itakura, M. Takahashi, R. Shigemoto, PNAS 105 (2008) 19498–19503.","ista":"Shinohara Y, Hirase H, Watanabe M, Itakura M, Takahashi M, Shigemoto R. 2008. Left-right asymmetry of the hippocampal synapses with differential subunit allocation of glutamate receptors. PNAS. 105(49), 19498–19503.","ama":"Shinohara Y, Hirase H, Watanabe M, Itakura M, Takahashi M, Shigemoto R. Left-right asymmetry of the hippocampal synapses with differential subunit allocation of glutamate receptors. <i>PNAS</i>. 2008;105(49):19498-19503. doi:<a href=\"https://doi.org/10.1073/pnas.0807461105\">10.1073/pnas.0807461105</a>","apa":"Shinohara, Y., Hirase, H., Watanabe, M., Itakura, M., Takahashi, M., &#38; Shigemoto, R. (2008). Left-right asymmetry of the hippocampal synapses with differential subunit allocation of glutamate receptors. <i>PNAS</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.0807461105\">https://doi.org/10.1073/pnas.0807461105</a>"},"doi":"10.1073/pnas.0807461105","date_created":"2018-12-11T11:59:02Z","month":"12"}]