[{"author":[{"id":"418901AA-F248-11E8-B48F-1D18A9856A87","full_name":"Vyleta, Meghan","first_name":"Meghan","last_name":"Vyleta"},{"full_name":"Wong, John","last_name":"Wong","first_name":"John"},{"full_name":"Magun, Bruce","last_name":"Magun","first_name":"Bruce"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","volume":7,"oa":1,"intvolume":"         7","department":[{"_id":"SyCr"}],"date_updated":"2021-01-12T07:41:29Z","publication":"PLoS One","scopus_import":1,"doi":"10.1371/journal.pone.0036044","acknowledgement":"Supported by National Institutes of Health grants GM071338 (ML) and AI059355 (BM).\r\nWe acknowledge the expertise of Dr. Martina Ralle in Department of Biochemistry and Molecular Biology at OHSU for measurements of potassium using inductively coupled plasma mass spectrometry.","publication_status":"published","title":"Suppression of ribosomal function triggers innate immune signaling through activation of the NLRP3 inflammasome","oa_version":"Published Version","file_date_updated":"2020-07-14T12:46:01Z","citation":{"mla":"Vyleta, Meghan, et al. “Suppression of Ribosomal Function Triggers Innate Immune Signaling through Activation of the NLRP3 Inflammasome.” <i>PLoS One</i>, vol. 7, no. 5, e36044, Public Library of Science, 2012, doi:<a href=\"https://doi.org/10.1371/journal.pone.0036044\">10.1371/journal.pone.0036044</a>.","apa":"Vyleta, M., Wong, J., &#38; Magun, B. (2012). Suppression of ribosomal function triggers innate immune signaling through activation of the NLRP3 inflammasome. <i>PLoS One</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pone.0036044\">https://doi.org/10.1371/journal.pone.0036044</a>","short":"M. Vyleta, J. Wong, B. Magun, PLoS One 7 (2012).","chicago":"Vyleta, Meghan, John Wong, and Bruce Magun. “Suppression of Ribosomal Function Triggers Innate Immune Signaling through Activation of the NLRP3 Inflammasome.” <i>PLoS One</i>. Public Library of Science, 2012. <a href=\"https://doi.org/10.1371/journal.pone.0036044\">https://doi.org/10.1371/journal.pone.0036044</a>.","ama":"Vyleta M, Wong J, Magun B. Suppression of ribosomal function triggers innate immune signaling through activation of the NLRP3 inflammasome. <i>PLoS One</i>. 2012;7(5). doi:<a href=\"https://doi.org/10.1371/journal.pone.0036044\">10.1371/journal.pone.0036044</a>","ieee":"M. Vyleta, J. Wong, and B. Magun, “Suppression of ribosomal function triggers innate immune signaling through activation of the NLRP3 inflammasome,” <i>PLoS One</i>, vol. 7, no. 5. Public Library of Science, 2012.","ista":"Vyleta M, Wong J, Magun B. 2012. Suppression of ribosomal function triggers innate immune signaling through activation of the NLRP3 inflammasome. PLoS One. 7(5), e36044."},"year":"2012","article_number":"e36044","abstract":[{"text":"Some inflammatory stimuli trigger activation of the NLRP3 inflammasome by inducing efflux of cellular potassium. Loss of cellular potassium is known to potently suppress protein synthesis, leading us to test whether the inhibition of protein synthesis itself serves as an activating signal for the NLRP3 inflammasome. Murine bone marrow-derived macrophages, either primed by LPS or unprimed, were exposed to a panel of inhibitors of ribosomal function: ricin, cycloheximide, puromycin, pactamycin, and anisomycin. Macrophages were also exposed to nigericin, ATP, monosodium urate (MSU), and poly I:C. Synthesis of pro-IL-ß and release of IL-1ß from cells in response to these agents was detected by immunoblotting and ELISA. Release of intracellular potassium was measured by mass spectrometry. Inhibition of translation by each of the tested translation inhibitors led to processing of IL-1ß, which was released from cells. Processing and release of IL-1ß was reduced or absent from cells deficient in NLRP3, ASC, or caspase-1, demonstrating the role of the NLRP3 inflammasome. Despite the inability of these inhibitors to trigger efflux of intracellular potassium, the addition of high extracellular potassium suppressed activation of the NLRP3 inflammasome. MSU and double-stranded RNA, which are known to activate the NLRP3 inflammasome, also substantially inhibited protein translation, supporting a close association between inhibition of translation and inflammasome activation. These data demonstrate that translational inhibition itself constitutes a heretofore-unrecognized mechanism underlying IL-1ß dependent inflammatory signaling and that other physical, chemical, or pathogen-associated agents that impair translation may lead to IL-1ß-dependent inflammation through activation of the NLRP3 inflammasome. For agents that inhibit translation through decreased cellular potassium, the application of high extracellular potassium restores protein translation and suppresses activation of the NLRP inflammasome. For agents that inhibit translation through mechanisms that do not involve loss of potassium, high extracellular potassium suppresses IL-1ß processing through a mechanism that remains undefined.","lang":"eng"}],"file":[{"file_size":2984012,"relation":"main_file","date_updated":"2020-07-14T12:46:01Z","date_created":"2018-12-12T10:14:30Z","file_name":"IST-2012-97-v1+1_journal.pone.0036044.pdf","access_level":"open_access","checksum":"30cef37e27eaa467f6571b3640282010","content_type":"application/pdf","creator":"system","file_id":"5082"}],"date_created":"2018-12-11T12:01:45Z","_id":"3161","publisher":"Public Library of Science","type":"journal_article","date_published":"2012-05-14T00:00:00Z","ddc":["610"],"language":[{"iso":"eng"}],"month":"05","publist_id":"3526","status":"public","day":"14","quality_controlled":"1","pubrep_id":"97","issue":"5","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"has_accepted_license":"1"},{"doi":"10.1007/978-3-642-29860-8_12","scopus_import":1,"file_date_updated":"2020-07-14T12:46:01Z","oa_version":"Submitted Version","article_processing_charge":"No","publication_status":"published","title":"Parametric identification of temporal properties","abstract":[{"text":"Given a dense-time real-valued signal and a parameterized temporal logic formula with both magnitude and timing parameters, we compute the subset of the parameter space that renders the formula satisfied by the trace. We provide two preliminary implementations, one which follows the exact semantics and attempts to compute the validity domain by quantifier elimination in linear arithmetics and one which conducts adaptive search in the parameter space.","lang":"eng"}],"year":"2012","citation":{"short":"E. Asarin, A. Donzé, O. Maler, D. Nickovic, in:, Springer, 2012, pp. 147–160.","apa":"Asarin, E., Donzé, A., Maler, O., &#38; Nickovic, D. (2012). Parametric identification of temporal properties (Vol. 7186, pp. 147–160). Presented at the RV: Runtime Verification, San Francisco, CA, United States: Springer. <a href=\"https://doi.org/10.1007/978-3-642-29860-8_12\">https://doi.org/10.1007/978-3-642-29860-8_12</a>","chicago":"Asarin, Eugene, Alexandre Donzé, Oded Maler, and Dejan Nickovic. “Parametric Identification of Temporal Properties,” 7186:147–60. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-29860-8_12\">https://doi.org/10.1007/978-3-642-29860-8_12</a>.","mla":"Asarin, Eugene, et al. <i>Parametric Identification of Temporal Properties</i>. Vol. 7186, Springer, 2012, pp. 147–60, doi:<a href=\"https://doi.org/10.1007/978-3-642-29860-8_12\">10.1007/978-3-642-29860-8_12</a>.","ista":"Asarin E, Donzé A, Maler O, Nickovic D. 2012. Parametric identification of temporal properties. RV: Runtime Verification, LNCS, vol. 7186, 147–160.","ieee":"E. Asarin, A. Donzé, O. Maler, and D. Nickovic, “Parametric identification of temporal properties,” presented at the RV: Runtime Verification, San Francisco, CA, United States, 2012, vol. 7186, pp. 147–160.","ama":"Asarin E, Donzé A, Maler O, Nickovic D. Parametric identification of temporal properties. In: Vol 7186. Springer; 2012:147-160. doi:<a href=\"https://doi.org/10.1007/978-3-642-29860-8_12\">10.1007/978-3-642-29860-8_12</a>"},"_id":"3162","file":[{"checksum":"ba4a75287008fc64b8fbf78a7476ec32","file_id":"7862","creator":"dernst","content_type":"application/pdf","date_created":"2020-05-15T12:50:15Z","relation":"main_file","date_updated":"2020-07-14T12:46:01Z","file_size":374726,"access_level":"open_access","file_name":"2012_RV_Asarin.pdf"}],"date_created":"2018-12-11T12:01:45Z","conference":{"start_date":"2011-09-27","end_date":"2011-09-30","location":"San Francisco, CA, United States","name":"RV: Runtime Verification"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Asarin, Eugene","last_name":"Asarin","first_name":"Eugene"},{"first_name":"Alexandre","last_name":"Donzé","full_name":"Donzé, Alexandre"},{"last_name":"Maler","first_name":"Oded","full_name":"Maler, Oded"},{"first_name":"Dejan","last_name":"Nickovic","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","full_name":"Nickovic, Dejan"}],"oa":1,"volume":7186,"intvolume":"      7186","date_updated":"2021-01-12T07:41:29Z","department":[{"_id":"ToHe"}],"day":"01","page":"147 - 160","quality_controlled":"1","has_accepted_license":"1","publisher":"Springer","date_published":"2012-01-01T00:00:00Z","type":"conference","alternative_title":["LNCS"],"language":[{"iso":"eng"}],"ddc":["000"],"status":"public","publist_id":"3525","month":"01"},{"publication_status":"published","quality_controlled":"1","title":"Guest editorial: Special issue on structured prediction and inference","oa_version":"None","page":"257 - 258","doi":"10.1007/s11263-012-0530-y","scopus_import":1,"day":"01","issue":"3","_id":"3164","date_created":"2018-12-11T12:01:46Z","year":"2012","citation":{"mla":"Blaschko, Matthew, and Christoph Lampert. “Guest Editorial: Special Issue on Structured Prediction and Inference.” <i>International Journal of Computer Vision</i>, vol. 99, no. 3, Springer, 2012, pp. 257–58, doi:<a href=\"https://doi.org/10.1007/s11263-012-0530-y\">10.1007/s11263-012-0530-y</a>.","short":"M. Blaschko, C. Lampert, International Journal of Computer Vision 99 (2012) 257–258.","apa":"Blaschko, M., &#38; Lampert, C. (2012). Guest editorial: Special issue on structured prediction and inference. <i>International Journal of Computer Vision</i>. Springer. <a href=\"https://doi.org/10.1007/s11263-012-0530-y\">https://doi.org/10.1007/s11263-012-0530-y</a>","chicago":"Blaschko, Matthew, and Christoph Lampert. “Guest Editorial: Special Issue on Structured Prediction and Inference.” <i>International Journal of Computer Vision</i>. Springer, 2012. <a href=\"https://doi.org/10.1007/s11263-012-0530-y\">https://doi.org/10.1007/s11263-012-0530-y</a>.","ama":"Blaschko M, Lampert C. Guest editorial: Special issue on structured prediction and inference. <i>International Journal of Computer Vision</i>. 2012;99(3):257-258. doi:<a href=\"https://doi.org/10.1007/s11263-012-0530-y\">10.1007/s11263-012-0530-y</a>","ista":"Blaschko M, Lampert C. 2012. Guest editorial: Special issue on structured prediction and inference. International Journal of Computer Vision. 99(3), 257–258.","ieee":"M. Blaschko and C. Lampert, “Guest editorial: Special issue on structured prediction and inference,” <i>International Journal of Computer Vision</i>, vol. 99, no. 3. Springer, pp. 257–258, 2012."},"abstract":[{"text":"Overview of the Special Issue on structured prediction and inference.","lang":"eng"}],"date_published":"2012-09-01T00:00:00Z","type":"journal_article","volume":99,"publisher":"Springer","author":[{"first_name":"Matthew","last_name":"Blaschko","full_name":"Blaschko, Matthew"},{"first_name":"Christoph","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","month":"09","department":[{"_id":"ChLa"}],"publication":"International Journal of Computer Vision","status":"public","date_updated":"2021-01-12T07:41:30Z","publist_id":"3521","language":[{"iso":"eng"}],"intvolume":"        99"},{"oa_version":"None","article_processing_charge":"No","title":"An O(n2) time algorithm for alternating Büchi games","publication_status":"published","acknowledgement":"The research was supported by Austrian Science Fund (FWF) Grant No P 23499-N23 on Modern Graph Algorithmic Techniques in Formal Verification, Vienna Science and Technology Fund (WWTF) Grant ICT10-002, FWF NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft faculty fellows award.","main_file_link":[{"url":"https://arxiv.org/abs/1109.5018","open_access":"1"}],"doi":"10.1137/1.9781611973099.109","date_created":"2018-12-11T12:01:46Z","_id":"3165","conference":{"name":"SODA: Symposium on Discrete Algorithms","location":"Kyoto, Japan","end_date":"2012-01-19","start_date":"2012-01-17"},"abstract":[{"lang":"eng","text":"Computing the winning set for Büchi objectives in alternating games on graphs is a central problem in computer aided verification with a large number of applications. The long standing best known upper bound for solving the problem is Õ(n·m), where n is the number of vertices and m is the number of edges in the graph. We are the first to break the Õ(n·m) boundary by presenting a new technique that reduces the running time to O(n 2). This bound also leads to O(n 2) time algorithms for computing the set of almost-sure winning vertices for Büchi objectives (1) in alternating games with probabilistic transitions (improving an earlier bound of Õ(n·m)), (2) in concurrent graph games with constant actions (improving an earlier bound of O(n 3)), and (3) in Markov decision processes (improving for m &gt; n 4/3 an earlier bound of O(min(m 1.5, m·n 2/3)). We also show that the same technique can be used to compute the maximal end-component decomposition of a graph in time O(n 2), which is an improvement over earlier bounds for m &gt; n 4/3. Finally, we show how to maintain the winning set for Büchi objectives in alternating games under a sequence of edge insertions or a sequence of edge deletions in O(n) amortized time per operation. This is the first dynamic algorithm for this problem."}],"citation":{"mla":"Chatterjee, Krishnendu, and Monika H. Henzinger. “An O(N2) Time Algorithm for Alternating Büchi Games.” <i>Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms</i>, SIAM, 2012, pp. 1386–99, doi:<a href=\"https://doi.org/10.1137/1.9781611973099.109\">10.1137/1.9781611973099.109</a>.","apa":"Chatterjee, K., &#38; Henzinger, M. H. (2012). An O(n2) time algorithm for alternating Büchi games. In <i>Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms</i> (pp. 1386–1399). Kyoto, Japan: SIAM. <a href=\"https://doi.org/10.1137/1.9781611973099.109\">https://doi.org/10.1137/1.9781611973099.109</a>","chicago":"Chatterjee, Krishnendu, and Monika H Henzinger. “An O(N2) Time Algorithm for Alternating Büchi Games.” In <i>Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 1386–99. SIAM, 2012. <a href=\"https://doi.org/10.1137/1.9781611973099.109\">https://doi.org/10.1137/1.9781611973099.109</a>.","short":"K. Chatterjee, M.H. Henzinger, in:, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2012, pp. 1386–1399.","ama":"Chatterjee K, Henzinger MH. An O(n2) time algorithm for alternating Büchi games. In: <i>Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms</i>. SIAM; 2012:1386-1399. doi:<a href=\"https://doi.org/10.1137/1.9781611973099.109\">10.1137/1.9781611973099.109</a>","ista":"Chatterjee K, Henzinger MH. 2012. An O(n2) time algorithm for alternating Büchi games. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 1386–1399.","ieee":"K. Chatterjee and M. H. Henzinger, “An O(n2) time algorithm for alternating Büchi games,” in <i>Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Kyoto, Japan, 2012, pp. 1386–1399."},"year":"2012","oa":1,"related_material":{"record":[{"id":"5379","status":"public","relation":"earlier_version"},{"id":"2141","relation":"later_version","status":"public"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"last_name":"Henzinger","first_name":"Monika H","full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530"}],"ec_funded":1,"date_updated":"2025-06-02T08:53:48Z","publication":"Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms","department":[{"_id":"KrCh"}],"arxiv":1,"quality_controlled":"1","day":"01","page":"1386 - 1399","project":[{"call_identifier":"FWF","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"pubrep_id":"15","type":"conference","date_published":"2012-01-01T00:00:00Z","external_id":{"arxiv":["1109.5018"]},"publisher":"SIAM","publist_id":"3519","status":"public","month":"01","language":[{"iso":"eng"}]},{"oa":1,"volume":7,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Vladar","first_name":"Harold","full_name":"Vladar, Harold","id":"2A181218-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5985-7653"}],"publication":"Biology Direct","ec_funded":1,"date_updated":"2021-01-12T07:41:31Z","department":[{"_id":"NiBa"}],"intvolume":"         7","file_date_updated":"2020-07-14T12:46:02Z","oa_version":"Published Version","publication_status":"published","title":"Amino acid fermentation at the origin of the genetic code","acknowledgement":"The author was supported by the ERC-2009-AdG Grant for project 250152 SELECTIONINFORMATION. ","doi":"10.1186/1745-6150-7-6","_id":"3166","date_created":"2018-12-11T12:01:46Z","file":[{"checksum":"e511e401e239ef608a7fd79b21a06d78","file_id":"5166","creator":"system","content_type":"application/pdf","relation":"main_file","date_updated":"2020-07-14T12:46:02Z","date_created":"2018-12-12T10:15:44Z","file_size":4099536,"file_name":"IST-2012-99-v1+1_1745-6150-7-6.pdf","access_level":"open_access"}],"abstract":[{"lang":"eng","text":"There is evidence that the genetic code was established prior to the existence of proteins, when metabolism was powered by ribozymes. Also, early proto-organisms had to rely on simple anaerobic bioenergetic processes. In this work I propose that amino acid fermentation powered metabolism in the RNA world, and that this was facilitated by proto-adapters, the precursors of the tRNAs. Amino acids were used as carbon sources rather than as catalytic or structural elements. In modern bacteria, amino acid fermentation is known as the Stickland reaction. This pathway involves two amino acids: the first undergoes oxidative deamination, and the second acts as an electron acceptor through reductive deamination. This redox reaction results in two keto acids that are employed to synthesise ATP via substrate-level phosphorylation. The Stickland reaction is the basic bioenergetic pathway of some bacteria of the genus Clostridium. Two other facts support Stickland fermentation in the RNA world. First, several Stickland amino acid pairs are synthesised in abiotic amino acid synthesis. This suggests that amino acids that could be used as an energy substrate were freely available. Second, anticodons that have complementary sequences often correspond to amino acids that form Stickland pairs. The main hypothesis of this paper is that pairs of complementary proto-adapters were assigned to Stickland amino acids pairs. There are signatures of this hypothesis in the genetic code. Furthermore, it is argued that the proto-adapters formed double strands that brought amino acid pairs into proximity to facilitate their mutual redox reaction, structurally constraining the anticodon pairs that are assigned to these amino acid pairs. Significance tests which randomise the code are performed to study the extent of the variability of the energetic (ATP) yield. Random assignments can lead to a substantial yield of ATP and maintain enough variability, thus selection can act and refine the assignments into a proto-code that optimises the energetic yield. Monte Carlo simulations are performed to evaluate the establishment of these simple proto-codes, based on amino acid substitutions and codon swapping. In all cases, donor amino acids are assigned to anticodons composed of U+G, and have low redundancy (1-2 codons), whereas acceptor amino acids are assigned to the the remaining codons. These bioenergetic and structural constraints allow for a metabolic role for amino acids before their co-option as catalyst cofactors. Reviewers: this article was reviewed by Prof. William Martin, Prof. Eors Szathmary (nominated by Dr. Gaspar Jekely) and Dr. Adam Kun (nominated by Dr. Sandor Pongor)"}],"year":"2012","article_number":"6","citation":{"ama":"de Vladar H. Amino acid fermentation at the origin of the genetic code. <i>Biology Direct</i>. 2012;7. doi:<a href=\"https://doi.org/10.1186/1745-6150-7-6\">10.1186/1745-6150-7-6</a>","ista":"de Vladar H. 2012. Amino acid fermentation at the origin of the genetic code. Biology Direct. 7, 6.","ieee":"H. de Vladar, “Amino acid fermentation at the origin of the genetic code,” <i>Biology Direct</i>, vol. 7. BioMed Central, 2012.","mla":"de Vladar, Harold. “Amino Acid Fermentation at the Origin of the Genetic Code.” <i>Biology Direct</i>, vol. 7, 6, BioMed Central, 2012, doi:<a href=\"https://doi.org/10.1186/1745-6150-7-6\">10.1186/1745-6150-7-6</a>.","short":"H. de Vladar, Biology Direct 7 (2012).","apa":"de Vladar, H. (2012). Amino acid fermentation at the origin of the genetic code. <i>Biology Direct</i>. BioMed Central. <a href=\"https://doi.org/10.1186/1745-6150-7-6\">https://doi.org/10.1186/1745-6150-7-6</a>","chicago":"Vladar, Harold de. “Amino Acid Fermentation at the Origin of the Genetic Code.” <i>Biology Direct</i>. BioMed Central, 2012. <a href=\"https://doi.org/10.1186/1745-6150-7-6\">https://doi.org/10.1186/1745-6150-7-6</a>."},"date_published":"2012-02-10T00:00:00Z","type":"journal_article","publisher":"BioMed Central","status":"public","publist_id":"3518","month":"02","language":[{"iso":"eng"}],"ddc":["570","576"],"quality_controlled":"1","day":"10","project":[{"_id":"25B07788-B435-11E9-9278-68D0E5697425","name":"Limits to selection in biology and in evolutionary computation","grant_number":"250152","call_identifier":"FP7"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"has_accepted_license":"1","pubrep_id":"99"},{"publication_status":"published","title":"NextGen speaks 13 ","oa_version":"None","page":"32-34","doi":"10.1126/science.336.6077.32","day":"06","article_type":"letter_note","issue":"6077","date_created":"2018-12-11T12:01:47Z","popular_science":"1","_id":"3167","citation":{"ama":"Weber M. NextGen speaks 13 . <i>Science</i>. 2012;336(6077):32-34. doi:<a href=\"https://doi.org/10.1126/science.336.6077.32\">10.1126/science.336.6077.32</a>","ieee":"M. Weber, “NextGen speaks 13 ,” <i>Science</i>, vol. 336, no. 6077. American Association for the Advancement of Science, pp. 32–34, 2012.","ista":"Weber M. 2012. NextGen speaks 13 . Science. 336(6077), 32–34.","mla":"Weber, Michele. “NextGen Speaks 13 .” <i>Science</i>, vol. 336, no. 6077, American Association for the Advancement of Science, 2012, pp. 32–34, doi:<a href=\"https://doi.org/10.1126/science.336.6077.32\">10.1126/science.336.6077.32</a>.","short":"M. Weber, Science 336 (2012) 32–34.","chicago":"Weber, Michele. “NextGen Speaks 13 .” <i>Science</i>. American Association for the Advancement of Science, 2012. <a href=\"https://doi.org/10.1126/science.336.6077.32\">https://doi.org/10.1126/science.336.6077.32</a>.","apa":"Weber, M. (2012). NextGen speaks 13 . <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.336.6077.32\">https://doi.org/10.1126/science.336.6077.32</a>"},"year":"2012","type":"journal_article","date_published":"2012-04-06T00:00:00Z","external_id":{"pmid":["22491839"]},"volume":336,"pmid":1,"author":[{"id":"3A3FC708-F248-11E8-B48F-1D18A9856A87","full_name":"Weber, Michele","first_name":"Michele","last_name":"Weber"}],"publisher":"American Association for the Advancement of Science","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"MiSi"}],"month":"04","date_updated":"2021-01-12T07:41:32Z","publist_id":"3516","status":"public","publication":"Science","language":[{"iso":"eng"}],"intvolume":"       336"},{"date_updated":"2023-02-23T11:39:40Z","publist_id":"3515","status":"public","publication":"Theoretical Computer Science","department":[{"_id":"ToHe"}],"month":"05","intvolume":"       431","language":[{"iso":"eng"}],"volume":431,"related_material":{"record":[{"id":"3719","status":"public","relation":"earlier_version"}]},"type":"journal_article","date_published":"2012-05-04T00:00:00Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Jérôme","last_name":"Feret","full_name":"Feret, Jérôme"},{"last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Koeppl","first_name":"Heinz","full_name":"Koeppl, Heinz"},{"orcid":"0000-0002-9041-0905","id":"3D5811FC-F248-11E8-B48F-1D18A9856A87","full_name":"Petrov, Tatjana","first_name":"Tatjana","last_name":"Petrov"}],"publisher":"Elsevier","date_created":"2018-12-11T12:01:47Z","_id":"3168","pubrep_id":"73","abstract":[{"text":"The induction of a signaling pathway is characterized by transient complex formation and mutual posttranslational modification of proteins. To faithfully capture this combinatorial process in a mathematical model is an important challenge in systems biology. Exploiting the limited context on which most binding and modification events are conditioned, attempts have been made to reduce the combinatorial complexity by quotienting the reachable set of molecular species into species aggregates while preserving the deterministic semantics of the thermodynamic limit. Recently, we proposed a quotienting that also preserves the stochastic semantics and that is complete in the sense that the semantics of individual species can be recovered from the aggregate semantics. In this paper, we prove that this quotienting yields a sufficient condition for weak lumpability (that is to say that the quotient system is still Markovian for a given set of initial distributions) and that it gives rise to a backward Markov bisimulation between the original and aggregated transition system (which means that the conditional probability of being in a given state in the original system knowing that we are in its equivalence class is an invariant of the system). We illustrate the framework on a case study of the epidermal growth factor (EGF)/insulin receptor crosstalk.","lang":"eng"}],"citation":{"chicago":"Feret, Jérôme, Thomas A Henzinger, Heinz Koeppl, and Tatjana Petrov. “Lumpability Abstractions of Rule Based Systems.” <i>Theoretical Computer Science</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.tcs.2011.12.059\">https://doi.org/10.1016/j.tcs.2011.12.059</a>.","short":"J. Feret, T.A. Henzinger, H. Koeppl, T. Petrov, Theoretical Computer Science 431 (2012) 137–164.","apa":"Feret, J., Henzinger, T. A., Koeppl, H., &#38; Petrov, T. (2012). Lumpability abstractions of rule based systems. <i>Theoretical Computer Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.tcs.2011.12.059\">https://doi.org/10.1016/j.tcs.2011.12.059</a>","mla":"Feret, Jérôme, et al. “Lumpability Abstractions of Rule Based Systems.” <i>Theoretical Computer Science</i>, vol. 431, Elsevier, 2012, pp. 137–64, doi:<a href=\"https://doi.org/10.1016/j.tcs.2011.12.059\">10.1016/j.tcs.2011.12.059</a>.","ieee":"J. Feret, T. A. Henzinger, H. Koeppl, and T. Petrov, “Lumpability abstractions of rule based systems,” <i>Theoretical Computer Science</i>, vol. 431. Elsevier, pp. 137–164, 2012.","ista":"Feret J, Henzinger TA, Koeppl H, Petrov T. 2012. Lumpability abstractions of rule based systems. Theoretical Computer Science. 431, 137–164.","ama":"Feret J, Henzinger TA, Koeppl H, Petrov T. Lumpability abstractions of rule based systems. <i>Theoretical Computer Science</i>. 2012;431:137-164. doi:<a href=\"https://doi.org/10.1016/j.tcs.2011.12.059\">10.1016/j.tcs.2011.12.059</a>"},"year":"2012","oa_version":"None","quality_controlled":"1","title":"Lumpability abstractions of rule based systems","publication_status":"published","acknowledgement":"We would like to thank the anonymous reviewers for their comments on the different versions of the paper. We would also like to thank Ferdinanda Camporesi for her careful reading and the useful insights that she gave us about the paper.\r\nJérôme Feret’s contribution was partially supported by the AbstractCell ANR-Chair of Excellence. Heinz Koeppl’s research is supported by the Swiss National Science Foundation, grant no. 200020-117975/1. Tatjana Petrov’s research is supported by SystemsX.ch (the Swiss Initiative in Systems Biology).","day":"04","scopus_import":1,"page":"137 - 164","doi":"10.1016/j.tcs.2011.12.059"},{"citation":{"short":"M. Konrad, M. Vyleta, F. Theis, M. Stock, S. Tragust, M. Klatt, V. Drescher, C. Marr, L.V. Ugelvig, S. Cremer, PLoS Biology 10 (2012).","apa":"Konrad, M., Vyleta, M., Theis, F., Stock, M., Tragust, S., Klatt, M., … Cremer, S. (2012). Social transfer of pathogenic fungus promotes active immunisation in ant colonies. <i>PLoS Biology</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pbio.1001300\">https://doi.org/10.1371/journal.pbio.1001300</a>","chicago":"Konrad, Matthias, Meghan Vyleta, Fabian Theis, Miriam Stock, Simon Tragust, Martina Klatt, Verena Drescher, Carsten Marr, Line V Ugelvig, and Sylvia Cremer. “Social Transfer of Pathogenic Fungus Promotes Active Immunisation in Ant Colonies.” <i>PLoS Biology</i>. Public Library of Science, 2012. <a href=\"https://doi.org/10.1371/journal.pbio.1001300\">https://doi.org/10.1371/journal.pbio.1001300</a>.","mla":"Konrad, Matthias, et al. “Social Transfer of Pathogenic Fungus Promotes Active Immunisation in Ant Colonies.” <i>PLoS Biology</i>, vol. 10, no. 4, e1001300, Public Library of Science, 2012, doi:<a href=\"https://doi.org/10.1371/journal.pbio.1001300\">10.1371/journal.pbio.1001300</a>.","ista":"Konrad M, Vyleta M, Theis F, Stock M, Tragust S, Klatt M, Drescher V, Marr C, Ugelvig LV, Cremer S. 2012. Social transfer of pathogenic fungus promotes active immunisation in ant colonies. PLoS Biology. 10(4), e1001300.","ieee":"M. Konrad <i>et al.</i>, “Social transfer of pathogenic fungus promotes active immunisation in ant colonies,” <i>PLoS Biology</i>, vol. 10, no. 4. Public Library of Science, 2012.","ama":"Konrad M, Vyleta M, Theis F, et al. Social transfer of pathogenic fungus promotes active immunisation in ant colonies. <i>PLoS Biology</i>. 2012;10(4). doi:<a href=\"https://doi.org/10.1371/journal.pbio.1001300\">10.1371/journal.pbio.1001300</a>"},"article_number":"e1001300","year":"2012","abstract":[{"text":"Due to the omnipresent risk of epidemics, insect societies have evolved sophisticated disease defences at the individual and colony level. An intriguing yet little understood phenomenon is that social contact to pathogen-exposed individuals reduces susceptibility of previously naive nestmates to this pathogen. We tested whether such social immunisation in Lasius ants against the entomopathogenic fungus Metarhizium anisopliae is based on active upregulation of the immune system of nestmates following contact to an infectious individual or passive protection via transfer of immune effectors among group members—that is, active versus passive immunisation. We found no evidence for involvement of passive immunisation via transfer of antimicrobials among colony members. Instead, intensive allogrooming behaviour between naive and pathogen-exposed ants before fungal conidia firmly attached to their cuticle suggested passage of the pathogen from the exposed individuals to their nestmates. By tracing fluorescence-labelled conidia we indeed detected frequent pathogen transfer to the nestmates, where they caused low-level infections as revealed by growth of small numbers of fungal colony forming units from their dissected body content. These infections rarely led to death, but instead promoted an enhanced ability to inhibit fungal growth and an active upregulation of immune genes involved in antifungal defences (defensin and prophenoloxidase, PPO). Contrarily, there was no upregulation of the gene cathepsin L, which is associated with antibacterial and antiviral defences, and we found no increased antibacterial activity of nestmates of fungus-exposed ants. This indicates that social immunisation after fungal exposure is specific, similar to recent findings for individual-level immune priming in invertebrates. Epidemiological modeling further suggests that active social immunisation is adaptive, as it leads to faster elimination of the disease and lower death rates than passive immunisation. Interestingly, humans have also utilised the protective effect of low-level infections to fight smallpox by intentional transfer of low pathogen doses (“variolation” or “inoculation”).","lang":"eng"}],"file":[{"relation":"main_file","file_size":674228,"date_updated":"2020-07-14T12:46:04Z","date_created":"2018-12-12T10:08:28Z","access_level":"open_access","file_name":"IST-2012-96-v1+1_journal.pbio.1001300.pdf","checksum":"4ebacefd9fbab5c68adf829124115fd1","creator":"system","file_id":"4689","content_type":"application/pdf"}],"date_created":"2018-12-11T12:02:13Z","_id":"3242","scopus_import":1,"doi":"10.1371/journal.pbio.1001300","acknowledgement":"Funding for this project was obtained by the German Research Foundation DFG (http://www.dfg.de/en/index.jsp) as an Individual Research Grant (CR118/2-1 to SC) and the European Research Council (http://erc.europa.eu/) in form of two ERC Starting Grants (ERC-2009-StG240371-SocialVaccines to SC and ERC-2010-StG259294-LatentCauses to FJT). In addition, the Junge Akademie (Young Academy of the Berlin-Brandenburg Academy of Sciences and Humanities and the National Academy of Sciences Leopoldina (http://www.diejungeakademie.de/english/i​ndex.html) funded this joint Antnet project of SC and FJT. The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.","publication_status":"published","title":"Social transfer of pathogenic fungus promotes active immunisation in ant colonies","oa_version":"Published Version","file_date_updated":"2020-07-14T12:46:04Z","intvolume":"        10","department":[{"_id":"SyCr"}],"ec_funded":1,"date_updated":"2023-02-23T14:07:11Z","publication":"PLoS Biology","author":[{"first_name":"Matthias","last_name":"Konrad","id":"46528076-F248-11E8-B48F-1D18A9856A87","full_name":"Konrad, Matthias"},{"last_name":"Vyleta","first_name":"Meghan","full_name":"Vyleta, Meghan","id":"418901AA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Theis, Fabian","last_name":"Theis","first_name":"Fabian"},{"first_name":"Miriam","last_name":"Stock","id":"42462816-F248-11E8-B48F-1D18A9856A87","full_name":"Stock, Miriam"},{"full_name":"Tragust, Simon","id":"35A7A418-F248-11E8-B48F-1D18A9856A87","last_name":"Tragust","first_name":"Simon"},{"first_name":"Martina","last_name":"Klatt","id":"E60F29C6-E9AE-11E9-AF6E-D190C7302F38","full_name":"Klatt, Martina"},{"last_name":"Drescher","first_name":"Verena","full_name":"Drescher, Verena"},{"last_name":"Marr","first_name":"Carsten","full_name":"Marr, Carsten"},{"first_name":"Line V","last_name":"Ugelvig","orcid":"0000-0003-1832-8883","id":"3DC97C8E-F248-11E8-B48F-1D18A9856A87","full_name":"Ugelvig, Line V"},{"full_name":"Cremer, Sylvia","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2193-3868","last_name":"Cremer","first_name":"Sylvia"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":10,"oa":1,"related_material":{"record":[{"id":"9755","relation":"research_data","status":"public"}]},"pubrep_id":"96","issue":"4","project":[{"_id":"25DAF0B2-B435-11E9-9278-68D0E5697425","name":"Host-Parasite Coevolution","grant_number":"CR-118/3-1"},{"name":"Social Vaccination in Ant Colonies: from Individual Mechanisms to Society Effects","_id":"25DC711C-B435-11E9-9278-68D0E5697425","grant_number":"243071","call_identifier":"FP7"},{"name":"Antnet","_id":"25E0E184-B435-11E9-9278-68D0E5697425"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"has_accepted_license":"1","day":"03","quality_controlled":"1","ddc":["570","579"],"language":[{"iso":"eng"}],"month":"04","publist_id":"3434","status":"public","publisher":"Public Library of Science","type":"journal_article","date_published":"2012-04-03T00:00:00Z"},{"page":"11","day":"01","issue":"1","date_published":"2012-03-01T00:00:00Z","type":"journal_article","publisher":"Büchereiverband Österreichs","month":"03","status":"public","publist_id":"3433","language":[{"iso":"ger"}],"publication_status":"published","title":"Zwischen Technologie und Information","article_processing_charge":"No","oa_version":"Published Version","main_file_link":[{"open_access":"1","url":"https://www.bvoe.at/sites/default/files/2022-07/BP_1_12.pdf"}],"article_type":"letter_note","publication_identifier":{"issn":["1607-7172"]},"_id":"3243","popular_science":"1","date_created":"2018-12-11T12:02:13Z","year":"2012","citation":{"ista":"Danowski P. 2012. Zwischen Technologie und Information. Büchereiperspektiven. 2012(1), 11.","ieee":"P. Danowski, “Zwischen Technologie und Information,” <i>Büchereiperspektiven</i>, vol. 2012, no. 1. Büchereiverband Österreichs, p. 11, 2012.","ama":"Danowski P. Zwischen Technologie und Information. <i>Büchereiperspektiven</i>. 2012;2012(1):11.","short":"P. Danowski, Büchereiperspektiven 2012 (2012) 11.","chicago":"Danowski, Patrick. “Zwischen Technologie und Information.” <i>Büchereiperspektiven</i>. Büchereiverband Österreichs, 2012.","apa":"Danowski, P. (2012). Zwischen Technologie und Information. <i>Büchereiperspektiven</i>. Büchereiverband Österreichs.","mla":"Danowski, Patrick. “Zwischen Technologie und Information.” <i>Büchereiperspektiven</i>, vol. 2012, no. 1, Büchereiverband Österreichs, 2012, p. 11."},"abstract":[{"text":"Wie wandelt sich das Berufsbild in Wissenschaftlichen Bibliotheken? Patrick Danowski gibt seine Einschätzung ab. ","lang":"eng"}],"oa":1,"volume":2012,"author":[{"id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6026-4409","full_name":"Danowski, Patrick","first_name":"Patrick","last_name":"Danowski"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"E-Lib"}],"publication":"Büchereiperspektiven","date_updated":"2023-10-16T10:40:18Z","intvolume":"      2012"},{"date_updated":"2023-10-16T10:19:14Z","publication":"BuB - Forum Bibliothek und Information","department":[{"_id":"E-Lib"}],"intvolume":"        64","volume":64,"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Danowski, Patrick","orcid":"0000-0002-6026-4409","id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","last_name":"Danowski","first_name":"Patrick"}],"date_created":"2018-12-11T12:02:13Z","popular_science":"1","_id":"3244","abstract":[{"lang":"eng","text":"Bibliothekare haben die Aufgabe, sich mit neuen Medienformen auseinanderzusetzen.\r\n"}],"citation":{"ieee":"P. Danowski, “Die Zeit des Abwartens ist vorbei!,” <i>BuB - Forum Bibliothek und Information</i>, vol. 64, no. 4. Fachzeitschrift des BIB – Berufsverband Information Bibliothek, p. 284, 2012.","ista":"Danowski P. 2012. Die Zeit des Abwartens ist vorbei! BuB - Forum Bibliothek und Information. 64(4), 284.","ama":"Danowski P. Die Zeit des Abwartens ist vorbei! <i>BuB - Forum Bibliothek und Information</i>. 2012;64(4):284.","mla":"Danowski, Patrick. “Die Zeit des Abwartens ist vorbei!” <i>BuB - Forum Bibliothek und Information</i>, vol. 64, no. 4, Fachzeitschrift des BIB – Berufsverband Information Bibliothek, 2012, p. 284.","chicago":"Danowski, Patrick. “Die Zeit des Abwartens ist vorbei!” <i>BuB - Forum Bibliothek und Information</i>. Fachzeitschrift des BIB – Berufsverband Information Bibliothek, 2012.","short":"P. Danowski, BuB - Forum Bibliothek und Information 64 (2012) 284.","apa":"Danowski, P. (2012). Die Zeit des Abwartens ist vorbei! <i>BuB - Forum Bibliothek und Information</i>. Fachzeitschrift des BIB – Berufsverband Information Bibliothek."},"year":"2012","oa_version":"Published Version","article_processing_charge":"No","title":"Die Zeit des Abwartens ist vorbei!","publication_status":"published","publication_identifier":{"issn":["1869 -1137"]},"article_type":"letter_note","main_file_link":[{"open_access":"1","url":"https://www.b-u-b.de/fileadmin/archiv/imports/pdf_files/2012/bub_2012_04_284.pdf"}],"publist_id":"3432","status":"public","month":"04","language":[{"iso":"ger"}],"type":"journal_article","date_published":"2012-04-15T00:00:00Z","publisher":"Fachzeitschrift des BIB – Berufsverband Information Bibliothek","issue":"4","day":"15","page":"284"},{"quality_controlled":"1","publication_status":"published","title":"Spurred by resistance mechanosensation in collective migration","oa_version":"None","page":"3 - 4","doi":"10.1016/j.devcel.2011.12.018","scopus_import":1,"day":"17","issue":"1","_id":"3245","date_created":"2018-12-11T12:02:14Z","year":"2012","citation":{"mla":"Behrndt, Martin, and Carl-Philipp J. Heisenberg. “Spurred by Resistance Mechanosensation in Collective Migration.” <i>Developmental Cell</i>, vol. 22, no. 1, Cell Press, 2012, pp. 3–4, doi:<a href=\"https://doi.org/10.1016/j.devcel.2011.12.018\">10.1016/j.devcel.2011.12.018</a>.","short":"M. Behrndt, C.-P.J. Heisenberg, Developmental Cell 22 (2012) 3–4.","chicago":"Behrndt, Martin, and Carl-Philipp J Heisenberg. “Spurred by Resistance Mechanosensation in Collective Migration.” <i>Developmental Cell</i>. Cell Press, 2012. <a href=\"https://doi.org/10.1016/j.devcel.2011.12.018\">https://doi.org/10.1016/j.devcel.2011.12.018</a>.","apa":"Behrndt, M., &#38; Heisenberg, C.-P. J. (2012). Spurred by resistance mechanosensation in collective migration. <i>Developmental Cell</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.devcel.2011.12.018\">https://doi.org/10.1016/j.devcel.2011.12.018</a>","ieee":"M. Behrndt and C.-P. J. Heisenberg, “Spurred by resistance mechanosensation in collective migration,” <i>Developmental Cell</i>, vol. 22, no. 1. Cell Press, pp. 3–4, 2012.","ista":"Behrndt M, Heisenberg C-PJ. 2012. Spurred by resistance mechanosensation in collective migration. Developmental Cell. 22(1), 3–4.","ama":"Behrndt M, Heisenberg C-PJ. Spurred by resistance mechanosensation in collective migration. <i>Developmental Cell</i>. 2012;22(1):3-4. doi:<a href=\"https://doi.org/10.1016/j.devcel.2011.12.018\">10.1016/j.devcel.2011.12.018</a>"},"abstract":[{"lang":"eng","text":"How cells orchestrate their behavior during collective migration is a long-standing question. Using magnetic tweezers to apply mechanical stimuli to Xenopus mesendoderm cells, Weber etal. (2012) now reveal, in this issue of Developmental Cell, a cadherin-mediated mechanosensitive response that promotes cell polarization and movement persistence during the collective mesendoderm migration in gastrulation."}],"date_published":"2012-01-17T00:00:00Z","type":"journal_article","volume":22,"publisher":"Cell Press","author":[{"id":"3ECECA3A-F248-11E8-B48F-1D18A9856A87","full_name":"Behrndt, Martin","first_name":"Martin","last_name":"Behrndt"},{"first_name":"Carl-Philipp J","last_name":"Heisenberg","id":"39427864-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0912-4566","full_name":"Heisenberg, Carl-Philipp J"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","month":"01","department":[{"_id":"CaHe"}],"publication":"Developmental Cell","status":"public","date_updated":"2021-01-12T07:42:05Z","publist_id":"3426","language":[{"iso":"eng"}],"intvolume":"        22"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Barone, Vanessa","orcid":"0000-0003-2676-3367","id":"419EECCC-F248-11E8-B48F-1D18A9856A87","last_name":"Barone","first_name":"Vanessa"},{"orcid":"0000-0002-0912-4566","id":"39427864-F248-11E8-B48F-1D18A9856A87","full_name":"Heisenberg, Carl-Philipp J","first_name":"Carl-Philipp J","last_name":"Heisenberg"}],"publisher":"Elsevier","volume":24,"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"961"}]},"type":"journal_article","date_published":"2012-02-01T00:00:00Z","intvolume":"        24","language":[{"iso":"eng"}],"publist_id":"3423","date_updated":"2023-09-07T12:05:08Z","status":"public","publication":"Current Opinion in Cell Biology","department":[{"_id":"CaHe"}],"month":"02","day":"01","acknowledgement":"This review comes from a themed issue on Cell structure and dynamics Edited by Jason Swedlow and Gaudenz Danuser","scopus_import":1,"doi":"10.1016/j.ceb.2011.11.006","page":"148 - 153","oa_version":"None","quality_controlled":"1","publication_status":"published","title":"Cell adhesion in embryo morphogenesis","abstract":[{"text":"Visualizing and analyzing shape changes at various scales, ranging from single molecules to whole organisms, are essential for understanding complex morphogenetic processes, such as early embryonic development. Embryo morphogenesis relies on the interplay between different tissues, the properties of which are again determined by the interaction between their constituent cells. Cell interactions, on the other hand, are controlled by various molecules, such as signaling and adhesion molecules, which in order to exert their functions need to be spatiotemporally organized within and between the interacting cells. In this review, we will focus on the role of cell adhesion functioning at different scales to organize cell, tissue and embryo morphogenesis. We will specifically ask how the subcellular distribution of adhesion molecules controls the formation of cell-cell contacts, how cell-cell contacts determine tissue shape, and how tissue interactions regulate embryo morphogenesis.","lang":"eng"}],"citation":{"mla":"Barone, Vanessa, and Carl-Philipp J. Heisenberg. “Cell Adhesion in Embryo Morphogenesis.” <i>Current Opinion in Cell Biology</i>, vol. 24, no. 1, Elsevier, 2012, pp. 148–53, doi:<a href=\"https://doi.org/10.1016/j.ceb.2011.11.006\">10.1016/j.ceb.2011.11.006</a>.","short":"V. Barone, C.-P.J. Heisenberg, Current Opinion in Cell Biology 24 (2012) 148–153.","apa":"Barone, V., &#38; Heisenberg, C.-P. J. (2012). Cell adhesion in embryo morphogenesis. <i>Current Opinion in Cell Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ceb.2011.11.006\">https://doi.org/10.1016/j.ceb.2011.11.006</a>","chicago":"Barone, Vanessa, and Carl-Philipp J Heisenberg. “Cell Adhesion in Embryo Morphogenesis.” <i>Current Opinion in Cell Biology</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.ceb.2011.11.006\">https://doi.org/10.1016/j.ceb.2011.11.006</a>.","ama":"Barone V, Heisenberg C-PJ. Cell adhesion in embryo morphogenesis. <i>Current Opinion in Cell Biology</i>. 2012;24(1):148-153. doi:<a href=\"https://doi.org/10.1016/j.ceb.2011.11.006\">10.1016/j.ceb.2011.11.006</a>","ista":"Barone V, Heisenberg C-PJ. 2012. Cell adhesion in embryo morphogenesis. Current Opinion in Cell Biology. 24(1), 148–153.","ieee":"V. Barone and C.-P. J. Heisenberg, “Cell adhesion in embryo morphogenesis,” <i>Current Opinion in Cell Biology</i>, vol. 24, no. 1. Elsevier, pp. 148–153, 2012."},"year":"2012","date_created":"2018-12-11T12:02:14Z","_id":"3246","issue":"1"},{"department":[{"_id":"JoBo"}],"month":"02","publist_id":"3420","date_updated":"2021-01-12T07:42:05Z","status":"public","publication":"Conservation Genetics","language":[{"iso":"eng"}],"intvolume":"        13","type":"journal_article","date_published":"2012-02-01T00:00:00Z","volume":13,"author":[{"full_name":"Vilaça, Sibelle","first_name":"Sibelle","last_name":"Vilaça"},{"first_name":"Rodrigo A","last_name":"Fernandes Redondo","id":"409D5C96-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5837-2793","full_name":"Fernandes Redondo, Rodrigo A"},{"first_name":"Lívia","last_name":"Lins","full_name":"Lins, Lívia"},{"last_name":"Santos","first_name":"Fabrício","full_name":"Santos, Fabrício"}],"publisher":"Springer","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"1","date_created":"2018-12-11T12:02:15Z","_id":"3247","citation":{"ama":"Vilaça S, Fernandes Redondo RA, Lins L, Santos F. Remaining genetic diversity in Brazilian Merganser (Mergus octosetaceus). <i>Conservation Genetics</i>. 2012;13(1):293-298. doi:<a href=\"https://doi.org/10.1007/s10592-011-0262-5\">10.1007/s10592-011-0262-5</a>","ieee":"S. Vilaça, R. A. Fernandes Redondo, L. Lins, and F. Santos, “Remaining genetic diversity in Brazilian Merganser (Mergus octosetaceus),” <i>Conservation Genetics</i>, vol. 13, no. 1. Springer, pp. 293–298, 2012.","ista":"Vilaça S, Fernandes Redondo RA, Lins L, Santos F. 2012. Remaining genetic diversity in Brazilian Merganser (Mergus octosetaceus). Conservation Genetics. 13(1), 293–298.","chicago":"Vilaça, Sibelle, Rodrigo A Fernandes Redondo, Lívia Lins, and Fabrício Santos. “Remaining Genetic Diversity in Brazilian Merganser (Mergus Octosetaceus).” <i>Conservation Genetics</i>. Springer, 2012. <a href=\"https://doi.org/10.1007/s10592-011-0262-5\">https://doi.org/10.1007/s10592-011-0262-5</a>.","apa":"Vilaça, S., Fernandes Redondo, R. A., Lins, L., &#38; Santos, F. (2012). Remaining genetic diversity in Brazilian Merganser (Mergus octosetaceus). <i>Conservation Genetics</i>. Springer. <a href=\"https://doi.org/10.1007/s10592-011-0262-5\">https://doi.org/10.1007/s10592-011-0262-5</a>","short":"S. Vilaça, R.A. Fernandes Redondo, L. Lins, F. Santos, Conservation Genetics 13 (2012) 293–298.","mla":"Vilaça, Sibelle, et al. “Remaining Genetic Diversity in Brazilian Merganser (Mergus Octosetaceus).” <i>Conservation Genetics</i>, vol. 13, no. 1, Springer, 2012, pp. 293–98, doi:<a href=\"https://doi.org/10.1007/s10592-011-0262-5\">10.1007/s10592-011-0262-5</a>."},"year":"2012","abstract":[{"lang":"eng","text":"The Brazilian Merganser is a very rare and threatened species that nowadays inhabits only a few protected areas and their surroundings in the Brazilian territory. In order to estimate the remaining genetic diversity and population structure in this species, two mitochondrial genes were sequenced in 39 individuals belonging to two populations and in one individual collected in Argentina in 1950. We found a highly significant divergence between two major remaining populations of Mergus octosetaceus, which suggests a historical population structure in this species. Furthermore, two deeply divergent lineages were found in a single location, which could due to current or historical secondary contact. Based on the available genetic data, we point out future directions which would contribute to design strategies for conservation and management of this threatened species."}],"title":"Remaining genetic diversity in Brazilian Merganser (Mergus octosetaceus)","quality_controlled":"1","publication_status":"published","oa_version":"None","scopus_import":1,"doi":"10.1007/s10592-011-0262-5","page":"293 - 298","acknowledgement":"The present study received grants from FAPEMIG, CNPq, Petrobras Ambiental and Fundação O Boticário de Conservação da Natureza, and followed all ethical guidelines and legal requirements of Brazil for sampling and studying an endangered species.\r\nWe thank the Specialist Work Group for the Conservation of Brazilian Merganser for valuable discussions and opinions on this manuscript. We also thank all the staff from Instituto Terra Brasilis and Funatura (Vivian S. Braz and Gislaine Disconzi) for collecting the samples at Serra da Canastra and Chapada dos Veadeiros, respectively; Dario A. Lijtmaerand and Pablo Tubaro for providing the samples from Argentina, Bradley C. Livezey for sending copies of his papers, and Geoff M. Hilton and Paulo de Tarso Z. Antas for useful suggestions that greatly improved this manuscript.","day":"01"},{"publisher":"Springer","type":"journal_article","date_published":"2012-03-01T00:00:00Z","ddc":["000"],"language":[{"iso":"eng"}],"publist_id":"3417","status":"public","month":"03","day":"01","page":"31 - 41","quality_controlled":"1","has_accepted_license":"1","issue":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert","first_name":"Christoph"},{"last_name":"Peters","first_name":"Jan","full_name":"Peters, Jan"}],"volume":7,"oa":1,"intvolume":"         7","date_updated":"2022-05-24T08:05:40Z","publication":"Journal of Real-Time Image Processing","department":[{"_id":"ChLa"}],"publication_identifier":{"eissn":["1861-8219"],"issn":["1861-8200"]},"article_type":"original","scopus_import":"1","doi":"10.1007/s11554-010-0168-3","article_processing_charge":"No","oa_version":"Submitted Version","file_date_updated":"2020-07-14T12:46:04Z","title":"Real-time detection of colored objects in multiple camera streams with off-the-shelf hardware components","publication_status":"published","abstract":[{"lang":"eng","text":"We describe RTblob, a high speed vision system that detects objects in cluttered scenes based on their color and shape at a speed of over 800 frames/s. Because the system is available as open-source software and relies only on off-the-shelf PC hardware components, it can provide the basis for multiple application scenarios. As an illustrative example, we show how RTblob can be used in a robotic table tennis scenario to estimate ball trajectories through 3D space simultaneously from four cameras images at a speed of 200 Hz."}],"citation":{"ama":"Lampert C, Peters J. Real-time detection of colored objects in multiple camera streams with off-the-shelf hardware components. <i>Journal of Real-Time Image Processing</i>. 2012;7(1):31-41. doi:<a href=\"https://doi.org/10.1007/s11554-010-0168-3\">10.1007/s11554-010-0168-3</a>","ieee":"C. Lampert and J. Peters, “Real-time detection of colored objects in multiple camera streams with off-the-shelf hardware components,” <i>Journal of Real-Time Image Processing</i>, vol. 7, no. 1. Springer, pp. 31–41, 2012.","ista":"Lampert C, Peters J. 2012. Real-time detection of colored objects in multiple camera streams with off-the-shelf hardware components. Journal of Real-Time Image Processing. 7(1), 31–41.","mla":"Lampert, Christoph, and Jan Peters. “Real-Time Detection of Colored Objects in Multiple Camera Streams with off-the-Shelf Hardware Components.” <i>Journal of Real-Time Image Processing</i>, vol. 7, no. 1, Springer, 2012, pp. 31–41, doi:<a href=\"https://doi.org/10.1007/s11554-010-0168-3\">10.1007/s11554-010-0168-3</a>.","chicago":"Lampert, Christoph, and Jan Peters. “Real-Time Detection of Colored Objects in Multiple Camera Streams with off-the-Shelf Hardware Components.” <i>Journal of Real-Time Image Processing</i>. Springer, 2012. <a href=\"https://doi.org/10.1007/s11554-010-0168-3\">https://doi.org/10.1007/s11554-010-0168-3</a>.","short":"C. Lampert, J. Peters, Journal of Real-Time Image Processing 7 (2012) 31–41.","apa":"Lampert, C., &#38; Peters, J. (2012). Real-time detection of colored objects in multiple camera streams with off-the-shelf hardware components. <i>Journal of Real-Time Image Processing</i>. Springer. <a href=\"https://doi.org/10.1007/s11554-010-0168-3\">https://doi.org/10.1007/s11554-010-0168-3</a>"},"year":"2012","date_created":"2018-12-11T12:02:15Z","file":[{"file_id":"5958","creator":"kschuh","content_type":"application/pdf","checksum":"241be47ea50e81a283bcf4c45b07e8cc","access_level":"open_access","file_name":"2012_Springer_Lampert.pdf","file_size":2933187,"date_created":"2019-02-12T10:52:25Z","date_updated":"2020-07-14T12:46:04Z","relation":"main_file"}],"_id":"3248"},{"pubrep_id":"42","issue":"1","project":[{"grant_number":"267989","call_identifier":"FP7","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543","call_identifier":"FP7"},{"_id":"25F1337C-B435-11E9-9278-68D0E5697425","name":"Design for Embedded Systems","call_identifier":"FP7","grant_number":"214373"}],"page":"21 - 35","day":"06","quality_controlled":"1","language":[{"iso":"eng"}],"month":"01","status":"public","publist_id":"3408","publisher":"Elsevier","date_published":"2012-01-06T00:00:00Z","type":"journal_article","year":"2012","citation":{"ama":"Cerny P, Henzinger TA, Radhakrishna A. Simulation distances. <i>Theoretical Computer Science</i>. 2012;413(1):21-35. doi:<a href=\"https://doi.org/10.1016/j.tcs.2011.08.002\">10.1016/j.tcs.2011.08.002</a>","ieee":"P. Cerny, T. A. Henzinger, and A. Radhakrishna, “Simulation distances,” <i>Theoretical Computer Science</i>, vol. 413, no. 1. Elsevier, pp. 21–35, 2012.","ista":"Cerny P, Henzinger TA, Radhakrishna A. 2012. Simulation distances. Theoretical Computer Science. 413(1), 21–35.","mla":"Cerny, Pavol, et al. “Simulation Distances.” <i>Theoretical Computer Science</i>, vol. 413, no. 1, Elsevier, 2012, pp. 21–35, doi:<a href=\"https://doi.org/10.1016/j.tcs.2011.08.002\">10.1016/j.tcs.2011.08.002</a>.","chicago":"Cerny, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. “Simulation Distances.” <i>Theoretical Computer Science</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.tcs.2011.08.002\">https://doi.org/10.1016/j.tcs.2011.08.002</a>.","short":"P. Cerny, T.A. Henzinger, A. Radhakrishna, Theoretical Computer Science 413 (2012) 21–35.","apa":"Cerny, P., Henzinger, T. A., &#38; Radhakrishna, A. (2012). Simulation distances. <i>Theoretical Computer Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.tcs.2011.08.002\">https://doi.org/10.1016/j.tcs.2011.08.002</a>"},"abstract":[{"lang":"eng","text":"Boolean notions of correctness are formalized by preorders on systems. Quantitative measures of correctness can be formalized by real-valued distance functions between systems, where the distance between implementation and specification provides a measure of &quot;fit&quot; or &quot;desirability&quot;. We extend the simulation preorder to the quantitative setting by making each player of a simulation game pay a certain price for her choices. We use the resulting games with quantitative objectives to define three different simulation distances. The correctness distance measures how much the specification must be changed in order to be satisfied by the implementation. The coverage distance measures how much the implementation restricts the degrees of freedom offered by the specification. The robustness distance measures how much a system can deviate from the implementation description without violating the specification. We consider these distances for safety as well as liveness specifications. The distances can be computed in polynomial time for safety specifications, and for liveness specifications given by weak fairness constraints. We show that the distance functions satisfy the triangle inequality, that the distance between two systems does not increase under parallel composition with a third system, and that the distance between two systems can be bounded from above and below by distances between abstractions of the two systems. These properties suggest that our simulation distances provide an appropriate basis for a quantitative theory of discrete systems. We also demonstrate how the robustness distance can be used to measure how many transmission errors are tolerated by error correcting codes."}],"_id":"3249","date_created":"2018-12-11T12:02:15Z","doi":"10.1016/j.tcs.2011.08.002","scopus_import":1,"acknowledgement":"This work was partially supported by the ERC Advanced Grant QUAREM, the FWF NFN Grant S11402-N23 (RiSE), the European Union project COMBEST and the European Network of Excellence Artist Design.","publication_status":"published","title":"Simulation distances","oa_version":"None","intvolume":"       413","department":[{"_id":"ToHe"}],"publication":"Theoretical Computer Science","date_updated":"2023-02-23T12:24:04Z","ec_funded":1,"author":[{"id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","full_name":"Cerny, Pavol","first_name":"Pavol","last_name":"Cerny"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A"},{"full_name":"Radhakrishna, Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","last_name":"Radhakrishna","first_name":"Arjun"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"4393"},{"id":"5389","status":"public","relation":"earlier_version"}]},"volume":413},{"page":"99 - 114","doi":"10.1007/978-3-642-27660-6_9","scopus_import":1,"day":"19","publication_status":"published","quality_controlled":"1","title":"Cryptography from learning parity with noise","oa_version":"None","year":"2012","citation":{"ieee":"K. Z. Pietrzak, “Cryptography from learning parity with noise,” presented at the SOFSEM: Current Trends in Theory and Practice of Computer Science, Špindlerův Mlýn, Czech Republic, 2012, vol. 7147, pp. 99–114.","ista":"Pietrzak KZ. 2012. Cryptography from learning parity with noise. SOFSEM: Current Trends in Theory and Practice of Computer Science, LNCS, vol. 7147, 99–114.","ama":"Pietrzak KZ. Cryptography from learning parity with noise. In: Vol 7147. Springer; 2012:99-114. doi:<a href=\"https://doi.org/10.1007/978-3-642-27660-6_9\">10.1007/978-3-642-27660-6_9</a>","mla":"Pietrzak, Krzysztof Z. <i>Cryptography from Learning Parity with Noise</i>. Vol. 7147, Springer, 2012, pp. 99–114, doi:<a href=\"https://doi.org/10.1007/978-3-642-27660-6_9\">10.1007/978-3-642-27660-6_9</a>.","apa":"Pietrzak, K. Z. (2012). Cryptography from learning parity with noise (Vol. 7147, pp. 99–114). Presented at the SOFSEM: Current Trends in Theory and Practice of Computer Science, Špindlerův Mlýn, Czech Republic: Springer. <a href=\"https://doi.org/10.1007/978-3-642-27660-6_9\">https://doi.org/10.1007/978-3-642-27660-6_9</a>","chicago":"Pietrzak, Krzysztof Z. “Cryptography from Learning Parity with Noise,” 7147:99–114. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-27660-6_9\">https://doi.org/10.1007/978-3-642-27660-6_9</a>.","short":"K.Z. Pietrzak, in:, Springer, 2012, pp. 99–114."},"abstract":[{"lang":"eng","text":"The Learning Parity with Noise (LPN) problem has recently found many applications in cryptography as the hardness assumption underlying the constructions of &quot;provably secure&quot; cryptographic schemes like encryption or authentication protocols. Being provably secure means that the scheme comes with a proof showing that the existence of an efficient adversary against the scheme implies that the underlying hardness assumption is wrong. LPN based schemes are appealing for theoretical and practical reasons. On the theoretical side, LPN based schemes offer a very strong security guarantee. The LPN problem is equivalent to the problem of decoding random linear codes, a problem that has been extensively studied in the last half century. The fastest known algorithms run in exponential time and unlike most number-theoretic problems used in cryptography, the LPN problem does not succumb to known quantum algorithms. On the practical side, LPN based schemes are often extremely simple and efficient in terms of code-size as well as time and space requirements. This makes them prime candidates for light-weight devices like RFID tags, which are too weak to implement standard cryptographic primitives like the AES block-cipher. This talk will be a gentle introduction to provable security using simple LPN based schemes as examples. Starting from pseudorandom generators and symmetric key encryption, over secret-key authentication protocols, and, if time admits, touching on recent constructions of public-key identification, commitments and zero-knowledge proofs."}],"conference":{"name":"SOFSEM: Current Trends in Theory and Practice of Computer Science","location":"Špindlerův Mlýn, Czech Republic","end_date":"2012-01-27","start_date":"2012-01-21"},"_id":"3250","date_created":"2018-12-11T12:02:15Z","publisher":"Springer","author":[{"last_name":"Pietrzak","first_name":"Krzysztof Z","full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_published":"2012-02-19T00:00:00Z","type":"conference","volume":7147,"language":[{"iso":"eng"}],"intvolume":"      7147","alternative_title":["LNCS"],"month":"02","department":[{"_id":"KrPi"}],"status":"public","publist_id":"3407","date_updated":"2021-01-12T07:42:07Z"},{"day":"01","page":"445 - 460","quality_controlled":"1","pubrep_id":"100","project":[{"grant_number":"267989","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23"}],"has_accepted_license":"1","publisher":"Springer","type":"conference","date_published":"2012-01-01T00:00:00Z","alternative_title":["LNCS"],"ddc":["000","005"],"language":[{"iso":"eng"}],"publist_id":"3406","status":"public","month":"01","acknowledgement":"This research was supported in part by the European Research Council (ERC) Advanced Investigator Grant QUAREM and by the Austrian Science Fund (FWF) project S11402-N23.","doi":"10.1007/978-3-642-27940-9_29","oa_version":"Submitted Version","file_date_updated":"2020-07-14T12:46:05Z","publication_status":"published","title":"Ideal abstractions for well structured transition systems","abstract":[{"lang":"eng","text":"Many infinite state systems can be seen as well-structured transition systems (WSTS), i.e., systems equipped with a well-quasi-ordering on states that is also a simulation relation. WSTS are an attractive target for formal analysis because there exist generic algorithms that decide interesting verification problems for this class. Among the most popular algorithms are acceleration-based forward analyses for computing the covering set. Termination of these algorithms can only be guaranteed for flattable WSTS. Yet, many WSTS of practical interest are not flattable and the question whether any given WSTS is flattable is itself undecidable. We therefore propose an analysis that computes the covering set and captures the essence of acceleration-based algorithms, but sacrifices precision for guaranteed termination. Our analysis is an abstract interpretation whose abstract domain builds on the ideal completion of the well-quasi-ordered state space, and a widening operator that mimics acceleration and controls the loss of precision of the analysis. We present instances of our framework for various classes of WSTS. Our experience with a prototype implementation indicates that, despite the inherent precision loss, our analysis often computes the precise covering set of the analyzed system."}],"citation":{"mla":"Zufferey, Damien, et al. <i>Ideal Abstractions for Well Structured Transition Systems</i>. Vol. 7148, Springer, 2012, pp. 445–60, doi:<a href=\"https://doi.org/10.1007/978-3-642-27940-9_29\">10.1007/978-3-642-27940-9_29</a>.","short":"D. Zufferey, T. Wies, T.A. Henzinger, in:, Springer, 2012, pp. 445–460.","apa":"Zufferey, D., Wies, T., &#38; Henzinger, T. A. (2012). Ideal abstractions for well structured transition systems (Vol. 7148, pp. 445–460). Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia, PA, USA: Springer. <a href=\"https://doi.org/10.1007/978-3-642-27940-9_29\">https://doi.org/10.1007/978-3-642-27940-9_29</a>","chicago":"Zufferey, Damien, Thomas Wies, and Thomas A Henzinger. “Ideal Abstractions for Well Structured Transition Systems,” 7148:445–60. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-27940-9_29\">https://doi.org/10.1007/978-3-642-27940-9_29</a>.","ieee":"D. Zufferey, T. Wies, and T. A. Henzinger, “Ideal abstractions for well structured transition systems,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia, PA, USA, 2012, vol. 7148, pp. 445–460.","ista":"Zufferey D, Wies T, Henzinger TA. 2012. Ideal abstractions for well structured transition systems. VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS, vol. 7148, 445–460.","ama":"Zufferey D, Wies T, Henzinger TA. Ideal abstractions for well structured transition systems. In: Vol 7148. Springer; 2012:445-460. doi:<a href=\"https://doi.org/10.1007/978-3-642-27940-9_29\">10.1007/978-3-642-27940-9_29</a>"},"year":"2012","file":[{"creator":"system","file_id":"4759","content_type":"application/pdf","checksum":"f2f0d55efa32309ad1fe65a5fcaad90c","access_level":"open_access","file_name":"IST-2012-100-v1+1_Ideal_abstractions_for_well-structured_transition_systems.pdf","relation":"main_file","date_created":"2018-12-12T10:09:35Z","date_updated":"2020-07-14T12:46:05Z","file_size":217104}],"date_created":"2018-12-11T12:02:16Z","_id":"3251","conference":{"location":"Philadelphia, PA, USA","name":"VMCAI: Verification, Model Checking and Abstract Interpretation","end_date":"2012-01-24","start_date":"2012-01-22"},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Zufferey, Damien","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3197-8736","last_name":"Zufferey","first_name":"Damien"},{"full_name":"Wies, Thomas","id":"447BFB88-F248-11E8-B48F-1D18A9856A87","last_name":"Wies","first_name":"Thomas"},{"first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"}],"volume":7148,"oa":1,"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"1405"}]},"intvolume":"      7148","date_updated":"2023-09-07T11:36:36Z","ec_funded":1,"department":[{"_id":"ToHe"}]},{"title":"Synthesizing protocols for digital contract signing","publication_status":"published","oa_version":"Preprint","scopus_import":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1004.2697"}],"doi":"10.1007/978-3-642-27940-9_11","acknowledgement":"The research was supported by Austrian Science Fund (FWF) Grant No P 23499-N23 (Modern Graph Algorithmic Techniques in Formal Verification), FWF NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft faculty fellows award.\r\nThe authors would like to thank Avik Chaudhuri for his invaluable help and feedback.","conference":{"location":"Philadelphia, PA, USA","name":"VMCAI: Verification, Model Checking and Abstract Interpretation","end_date":"2012-01-24","start_date":"2012-01-22"},"date_created":"2018-12-11T12:02:16Z","_id":"3252","citation":{"mla":"Chatterjee, Krishnendu, and Vishwanath Raman. <i>Synthesizing Protocols for Digital Contract Signing</i>. Vol. 7148, Springer, 2012, pp. 152–68, doi:<a href=\"https://doi.org/10.1007/978-3-642-27940-9_11\">10.1007/978-3-642-27940-9_11</a>.","short":"K. Chatterjee, V. Raman, in:, Springer, 2012, pp. 152–168.","chicago":"Chatterjee, Krishnendu, and Vishwanath Raman. “Synthesizing Protocols for Digital Contract Signing,” 7148:152–68. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-27940-9_11\">https://doi.org/10.1007/978-3-642-27940-9_11</a>.","apa":"Chatterjee, K., &#38; Raman, V. (2012). Synthesizing protocols for digital contract signing (Vol. 7148, pp. 152–168). Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia, PA, USA: Springer. <a href=\"https://doi.org/10.1007/978-3-642-27940-9_11\">https://doi.org/10.1007/978-3-642-27940-9_11</a>","ista":"Chatterjee K, Raman V. 2012. Synthesizing protocols for digital contract signing. VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS, vol. 7148, 152–168.","ieee":"K. Chatterjee and V. Raman, “Synthesizing protocols for digital contract signing,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia, PA, USA, 2012, vol. 7148, pp. 152–168.","ama":"Chatterjee K, Raman V. Synthesizing protocols for digital contract signing. In: Vol 7148. Springer; 2012:152-168. doi:<a href=\"https://doi.org/10.1007/978-3-642-27940-9_11\">10.1007/978-3-642-27940-9_11</a>"},"year":"2012","abstract":[{"text":"We study the automatic synthesis of fair non-repudiation protocols, a class of fair exchange protocols, used for digital contract signing. First, we show how to specify the objectives of the participating agents, the trusted third party (TTP) and the protocols as path formulas in Linear Temporal Logic (LTL) and prove that the satisfaction of the objectives of the agents and the TTP imply satisfaction of the protocol objectives. We then show that weak (co-operative) co-synthesis and classical (strictly competitive) co-synthesis fail in synthesizing these protocols, whereas assume-guarantee synthesis (AGS) succeeds. We demonstrate the success of assume-guarantee synthesis as follows: (a) any solution of assume-guarantee synthesis is attack-free; no subset of participants can violate the objectives of the other participants without violating their own objectives; (b) the Asokan-Shoup-Waidner (ASW) certified mail protocol that has known vulnerabilities is not a solution of AGS; and (c) the Kremer-Markowitch (KM) non-repudiation protocol is a solution of AGS. To our knowledge this is the first application of synthesis to fair non-repudiation protocols, and our results show how synthesis can generate correct protocols and automatically discover vulnerabilities. The solution to assume-guarantee synthesis can be computed efficiently as the secure equilibrium solution of three-player graph games. © 2012 Springer-Verlag.","lang":"eng"}],"volume":7148,"oa":1,"author":[{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"full_name":"Raman, Vishwanath","last_name":"Raman","first_name":"Vishwanath"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"KrCh"}],"ec_funded":1,"date_updated":"2021-01-12T07:42:08Z","intvolume":"      7148","quality_controlled":"1","page":"152 - 168","day":"20","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","grant_number":"P 23499-N23"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23"},{"call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"type":"conference","date_published":"2012-01-20T00:00:00Z","publisher":"Springer","month":"01","publist_id":"3405","status":"public","language":[{"iso":"eng"}],"alternative_title":["LNCS"]},{"year":"2012","citation":{"ama":"Bouajjani A, Dragoi C, Enea C, Sighireanu M. Abstract domains for automated reasoning about list manipulating programs with infinite data. In: Vol 7148. Springer; 2012:1-22. doi:<a href=\"https://doi.org/10.1007/978-3-642-27940-9_1\">10.1007/978-3-642-27940-9_1</a>","ieee":"A. Bouajjani, C. Dragoi, C. Enea, and M. Sighireanu, “Abstract domains for automated reasoning about list manipulating programs with infinite data,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia, PA, USA, 2012, vol. 7148, pp. 1–22.","ista":"Bouajjani A, Dragoi C, Enea C, Sighireanu M. 2012. Abstract domains for automated reasoning about list manipulating programs with infinite data. VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS, vol. 7148, 1–22.","apa":"Bouajjani, A., Dragoi, C., Enea, C., &#38; Sighireanu, M. (2012). Abstract domains for automated reasoning about list manipulating programs with infinite data (Vol. 7148, pp. 1–22). Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia, PA, USA: Springer. <a href=\"https://doi.org/10.1007/978-3-642-27940-9_1\">https://doi.org/10.1007/978-3-642-27940-9_1</a>","short":"A. Bouajjani, C. Dragoi, C. Enea, M. Sighireanu, in:, Springer, 2012, pp. 1–22.","chicago":"Bouajjani, Ahmed, Cezara Dragoi, Constantin Enea, and Mihaela Sighireanu. “Abstract Domains for Automated Reasoning about List Manipulating Programs with Infinite Data,” 7148:1–22. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-27940-9_1\">https://doi.org/10.1007/978-3-642-27940-9_1</a>.","mla":"Bouajjani, Ahmed, et al. <i>Abstract Domains for Automated Reasoning about List Manipulating Programs with Infinite Data</i>. Vol. 7148, Springer, 2012, pp. 1–22, doi:<a href=\"https://doi.org/10.1007/978-3-642-27940-9_1\">10.1007/978-3-642-27940-9_1</a>."},"abstract":[{"text":"We describe a framework for reasoning about programs with lists carrying integer numerical data. We use abstract domains to describe and manipulate complex constraints on configurations of these programs mixing constraints on the shape of the heap, sizes of the lists, on the multisets of data stored in these lists, and on the data at their different positions. Moreover, we provide powerful techniques for automatic validation of Hoare-triples and invariant checking, as well as for automatic synthesis of invariants and procedure summaries using modular inter-procedural analysis. The approach has been implemented in a tool called Celia and experimented successfully on a large benchmark of programs.","lang":"eng"}],"conference":{"start_date":"2012-01-22","end_date":"2012-01-24","name":"VMCAI: Verification, Model Checking and Abstract Interpretation","location":"Philadelphia, PA, USA"},"_id":"3253","date_created":"2018-12-11T12:02:17Z","doi":"10.1007/978-3-642-27940-9_1","page":"1 - 22","acknowledgement":"This work was partly supported by the French National Research Agency (ANR) project Veridyc (ANR-09-SEGI-016).","day":"26","title":"Abstract domains for automated reasoning about list manipulating programs with infinite data","publication_status":"published","quality_controlled":"1","oa_version":"None","language":[{"iso":"eng"}],"alternative_title":["LNCS"],"intvolume":"      7148","month":"02","department":[{"_id":"ToHe"}],"status":"public","date_updated":"2021-01-12T07:42:09Z","publist_id":"3404","publisher":"Springer","author":[{"first_name":"Ahmed","last_name":"Bouajjani","full_name":"Bouajjani, Ahmed"},{"full_name":"Dragoi, Cezara","id":"2B2B5ED0-F248-11E8-B48F-1D18A9856A87","last_name":"Dragoi","first_name":"Cezara"},{"first_name":"Constantin","last_name":"Enea","full_name":"Enea, Constantin"},{"last_name":"Sighireanu","first_name":"Mihaela","full_name":"Sighireanu, Mihaela"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_published":"2012-02-26T00:00:00Z","type":"conference","volume":7148},{"year":"2012","citation":{"ama":"Chatterjee K. The complexity of stochastic Müller games. <i>Information and Computation</i>. 2012;211:29-48. doi:<a href=\"https://doi.org/10.1016/j.ic.2011.11.004\">10.1016/j.ic.2011.11.004</a>","ieee":"K. Chatterjee, “The complexity of stochastic Müller games,” <i>Information and Computation</i>, vol. 211. Elsevier, pp. 29–48, 2012.","ista":"Chatterjee K. 2012. The complexity of stochastic Müller games. Information and Computation. 211, 29–48.","apa":"Chatterjee, K. (2012). The complexity of stochastic Müller games. <i>Information and Computation</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ic.2011.11.004\">https://doi.org/10.1016/j.ic.2011.11.004</a>","short":"K. Chatterjee, Information and Computation 211 (2012) 29–48.","chicago":"Chatterjee, Krishnendu. “The Complexity of Stochastic Müller Games.” <i>Information and Computation</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.ic.2011.11.004\">https://doi.org/10.1016/j.ic.2011.11.004</a>.","mla":"Chatterjee, Krishnendu. “The Complexity of Stochastic Müller Games.” <i>Information and Computation</i>, vol. 211, Elsevier, 2012, pp. 29–48, doi:<a href=\"https://doi.org/10.1016/j.ic.2011.11.004\">10.1016/j.ic.2011.11.004</a>."},"abstract":[{"lang":"eng","text":"The theory of graph games with ω-regular winning conditions is the foundation for modeling and synthesizing reactive processes. In the case of stochastic reactive processes, the corresponding stochastic graph games have three players, two of them (System and Environment) behaving adversarially, and the third (Uncertainty) behaving probabilistically. We consider two problems for stochastic graph games: the qualitative problem asks for the set of states from which a player can win with probability 1 (almost-sure winning); and the quantitative problem asks for the maximal probability of winning (optimal winning) from each state. We consider ω-regular winning conditions formalized as Müller winning conditions. We present optimal memory bounds for pure (deterministic) almost-sure winning and optimal winning strategies in stochastic graph games with Müller winning conditions. We also study the complexity of stochastic Müller games and show that both the qualitative and quantitative analysis problems are PSPACE-complete. Our results are relevant in synthesis of stochastic reactive processes."}],"_id":"3254","date_created":"2018-12-11T12:02:17Z","main_file_link":[{"url":"http://arise.or.at/pubpdf/The_complexity_of_stochastic_M___u_ller_games.pdf"}],"doi":"10.1016/j.ic.2011.11.004","scopus_import":1,"acknowledgement":"The research was supported by Austrian Science Fund (FWF) Grant No. P 23499-N23, FWF NFN Grant No. S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft faculty fellows award.","title":"The complexity of stochastic Müller games","publication_status":"published","oa_version":"None","intvolume":"       211","department":[{"_id":"KrCh"}],"publication":"Information and Computation","ec_funded":1,"date_updated":"2021-01-12T07:42:09Z","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","volume":211,"project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P 23499-N23"},{"call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"page":"29 - 48","day":"01","quality_controlled":"1","language":[{"iso":"eng"}],"month":"02","status":"public","publist_id":"3403","publisher":"Elsevier","date_published":"2012-02-01T00:00:00Z","type":"journal_article"}]