--- _id: '6157' abstract: - lang: eng text: In many animal species individuals aggregate to live in groups. A range of experimental approaches in different animals, including studies of social feeding in nematodes, maternal behavior in rats and sheep, and pair-bonding in voles, are providing insights into the neural bases for these behaviors. These studies are delineating multiple neural circuits and gene networks in the brain that interact in ways that are as yet poorly understood to coordinate social behavior. author: - first_name: Mario full_name: de Bono, Mario id: 4E3FF80E-F248-11E8-B48F-1D18A9856A87 last_name: de Bono orcid: 0000-0001-8347-0443 citation: ama: de Bono M. Molecular approaches to aggregation behavior and social attachment. Journal of Neurobiology. 2003;54(1):78-92. doi:10.1002/neu.10162 apa: de Bono, M. (2003). Molecular approaches to aggregation behavior and social attachment. Journal of Neurobiology. Wiley. https://doi.org/10.1002/neu.10162 chicago: Bono, Mario de. “Molecular Approaches to Aggregation Behavior and Social Attachment.” Journal of Neurobiology. Wiley, 2003. https://doi.org/10.1002/neu.10162. ieee: M. de Bono, “Molecular approaches to aggregation behavior and social attachment,” Journal of Neurobiology, vol. 54, no. 1. Wiley, pp. 78–92, 2003. ista: de Bono M. 2003. Molecular approaches to aggregation behavior and social attachment. Journal of Neurobiology. 54(1), 78–92. mla: de Bono, Mario. “Molecular Approaches to Aggregation Behavior and Social Attachment.” Journal of Neurobiology, vol. 54, no. 1, Wiley, 2003, pp. 78–92, doi:10.1002/neu.10162. short: M. de Bono, Journal of Neurobiology 54 (2003) 78–92. date_created: 2019-03-21T09:52:31Z date_published: 2003-01-01T00:00:00Z date_updated: 2021-01-12T08:06:26Z day: '01' doi: 10.1002/neu.10162 extern: '1' external_id: pmid: - '12486699' intvolume: ' 54' issue: '1' language: - iso: eng month: '01' oa_version: None page: 78-92 pmid: 1 publication: Journal of Neurobiology publication_identifier: issn: - 0022-3034 - 1097-4695 publication_status: published publisher: Wiley quality_controlled: '1' status: public title: Molecular approaches to aggregation behavior and social attachment type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 54 year: '2003' ... --- _id: '847' abstract: - lang: eng text: The accumulation of genome-wide information on single nucleotide polymorphisms in humans provides an unprecedented opportunity to detect the evolutionary forces responsible for heterogeneity of the level of genetic variability across loci. Previous studies have shown that history of recombination events has produced long haplotype blocks in the human genome, which contribute to this heterogeneity. Other factors, however, such as natural selection or the heterogeneity of mutation rates across loci, may also lead to heterogeneity of genetic variability. We compared synonymous and non-synonymous variability within human genes with their divergence from murine orthologs. We separately analyzed the non-synonymous variants predicted to damage protein structure or function and the variants predicted to be functionally benign. The predictions were based on comparative sequence analysis and, in some cases, on the analysis of protein structure. A strong correlation between non-synonymous, benign variability and non-synonymous human-mouse divergence suggests that selection played an important role in shaping the pattern of variability in coding regions of human genes. However, the lack of correlation between deleterious variability and evolutionary divergence shows that a substantial proportion of the observed non-synonymous single-nucleotide polymorphisms reduces fitness and never reaches fixation. Evolutionary and medical implications of the impact of selection on human polymorphisms are discussed. acknowledgement: We are grateful to Alexey Kondrashov and Alison Wellman for the careful reading of the manuscript and providing us with their valuable comments. author: - first_name: Shamil full_name: Sunyaev, Shamil R last_name: Sunyaev - first_name: Fyodor full_name: Fyodor Kondrashov id: 44FDEF62-F248-11E8-B48F-1D18A9856A87 last_name: Kondrashov orcid: 0000-0001-8243-4694 - first_name: Peer full_name: Bork, Peer last_name: Bork - first_name: Vasily full_name: Ramensky, Vasily last_name: Ramensky citation: ama: Sunyaev S, Kondrashov F, Bork P, Ramensky V. Impact of selection, mutation rate and genetic drift on human genetic variation. Human Molecular Genetics. 2003;12(24):3325-3330. doi:10.1093/hmg/ddg359 apa: Sunyaev, S., Kondrashov, F., Bork, P., & Ramensky, V. (2003). Impact of selection, mutation rate and genetic drift on human genetic variation. Human Molecular Genetics. Oxford University Press. https://doi.org/10.1093/hmg/ddg359 chicago: Sunyaev, Shamil, Fyodor Kondrashov, Peer Bork, and Vasily Ramensky. “Impact of Selection, Mutation Rate and Genetic Drift on Human Genetic Variation.” Human Molecular Genetics. Oxford University Press, 2003. https://doi.org/10.1093/hmg/ddg359. ieee: S. Sunyaev, F. Kondrashov, P. Bork, and V. Ramensky, “Impact of selection, mutation rate and genetic drift on human genetic variation,” Human Molecular Genetics, vol. 12, no. 24. Oxford University Press, pp. 3325–3330, 2003. ista: Sunyaev S, Kondrashov F, Bork P, Ramensky V. 2003. Impact of selection, mutation rate and genetic drift on human genetic variation. Human Molecular Genetics. 12(24), 3325–3330. mla: Sunyaev, Shamil, et al. “Impact of Selection, Mutation Rate and Genetic Drift on Human Genetic Variation.” Human Molecular Genetics, vol. 12, no. 24, Oxford University Press, 2003, pp. 3325–30, doi:10.1093/hmg/ddg359. short: S. Sunyaev, F. Kondrashov, P. Bork, V. Ramensky, Human Molecular Genetics 12 (2003) 3325–3330. date_created: 2018-12-11T11:48:49Z date_published: 2003-12-15T00:00:00Z date_updated: 2021-01-12T08:19:29Z day: '15' doi: 10.1093/hmg/ddg359 extern: 1 intvolume: ' 12' issue: '24' month: '12' page: 3325 - 3330 publication: Human Molecular Genetics publication_status: published publisher: Oxford University Press publist_id: '6803' quality_controlled: 0 status: public title: Impact of selection, mutation rate and genetic drift on human genetic variation type: journal_article volume: 12 year: '2003' ... --- _id: '876' abstract: - lang: eng text: Alternative splicing is thought to be a major source of functional diversity in animal proteins. We analyzed the evolutionary conservation of proteins encoded by alternatively spliced genes and predicted the ancestral state for 73 cases of alternative splicing (25 insertions and 48 deletions). The amino acid sequences of most of the inserts in proteins produced by alternative splicing are as conserved as the surrounding sequences. Thus, alternative splicing often creates novel isoforms by the insertion of new, functional protein sequences that probably originated from noncoding sequences of introns. acknowledgement: We thank Peer Bork, Mikhail Gelfand, Alexey Kondrashov, David Lipman and Shamil Sunyaev for critical reading of the manuscript and useful suggestions and the Koonin group members for helpful discussions. author: - first_name: Fyodor full_name: Fyodor Kondrashov id: 44FDEF62-F248-11E8-B48F-1D18A9856A87 last_name: Kondrashov orcid: 0000-0001-8243-4694 - first_name: Eugene full_name: Koonin, Eugene V last_name: Koonin citation: ama: 'Kondrashov F, Koonin E. Evolution of alternative splicing: Deletions, insertions and origin of functional parts of proteins from intron sequences. Trends in Genetics. 2003;19(3):115-119. doi:10.1016/S0168-9525(02)00029-X' apa: 'Kondrashov, F., & Koonin, E. (2003). Evolution of alternative splicing: Deletions, insertions and origin of functional parts of proteins from intron sequences. Trends in Genetics. Elsevier. https://doi.org/10.1016/S0168-9525(02)00029-X' chicago: 'Kondrashov, Fyodor, and Eugene Koonin. “Evolution of Alternative Splicing: Deletions, Insertions and Origin of Functional Parts of Proteins from Intron Sequences.” Trends in Genetics. Elsevier, 2003. https://doi.org/10.1016/S0168-9525(02)00029-X.' ieee: 'F. Kondrashov and E. Koonin, “Evolution of alternative splicing: Deletions, insertions and origin of functional parts of proteins from intron sequences,” Trends in Genetics, vol. 19, no. 3. Elsevier, pp. 115–119, 2003.' ista: 'Kondrashov F, Koonin E. 2003. Evolution of alternative splicing: Deletions, insertions and origin of functional parts of proteins from intron sequences. Trends in Genetics. 19(3), 115–119.' mla: 'Kondrashov, Fyodor, and Eugene Koonin. “Evolution of Alternative Splicing: Deletions, Insertions and Origin of Functional Parts of Proteins from Intron Sequences.” Trends in Genetics, vol. 19, no. 3, Elsevier, 2003, pp. 115–19, doi:10.1016/S0168-9525(02)00029-X.' short: F. Kondrashov, E. Koonin, Trends in Genetics 19 (2003) 115–119. date_created: 2018-12-11T11:48:58Z date_published: 2003-01-01T00:00:00Z date_updated: 2021-01-12T08:20:58Z day: '01' doi: 10.1016/S0168-9525(02)00029-X extern: 1 intvolume: ' 19' issue: '3' month: '01' page: 115 - 119 publication: Trends in Genetics publication_status: published publisher: Elsevier publist_id: '6776' quality_controlled: 0 status: public title: 'Evolution of alternative splicing: Deletions, insertions and origin of functional parts of proteins from intron sequences' type: journal_article volume: 19 year: '2003' ... --- _id: '9495' abstract: - lang: eng text: RNA interference is a conserved process in which double-stranded RNA is processed into 21–25 nucleotide siRNAs that trigger posttranscriptional gene silencing. In addition, plants display a phenomenon termed RNA-directed DNA methylation (RdDM) in which DNA with sequence identity to silenced RNA is de novo methylated at its cytosine residues. This methylation is not only at canonical CpG sites but also at cytosines in CpNpG and asymmetric sequence contexts. In this report, we study the role of the DRM and CMT3 DNA methyltransferase genes in the initiation and maintenance of RdDM. Neither drm nor cmt3 mutants affected the maintenance of preestablished RNA-directed CpG methylation. However, drm mutants showed a nearly complete loss of asymmetric methylation and a partial loss of CpNpG methylation. The remaining asymmetric and CpNpG methylation was dependent on the activity of CMT3, showing that DRM and CMT3 act redundantly to maintain non-CpG methylation. These DNA methyltransferases appear to act downstream of siRNAs, since drm1 drm2 cmt3 triple mutants show a lack of non-CpG methylation but elevated levels of siRNAs. Finally, we demonstrate that DRM activity is required for the initial establishment of RdDM in all sequence contexts including CpG, CpNpG, and asymmetric sites. article_processing_charge: No article_type: original author: - first_name: Xiaofeng full_name: Cao, Xiaofeng last_name: Cao - first_name: Werner full_name: Aufsatz, Werner last_name: Aufsatz - first_name: Daniel full_name: Zilberman, Daniel id: 6973db13-dd5f-11ea-814e-b3e5455e9ed1 last_name: Zilberman orcid: 0000-0002-0123-8649 - first_name: M.Florian full_name: Mette, M.Florian last_name: Mette - first_name: Michael S. full_name: Huang, Michael S. last_name: Huang - first_name: Marjori full_name: Matzke, Marjori last_name: Matzke - first_name: Steven E. full_name: Jacobsen, Steven E. last_name: Jacobsen citation: ama: Cao X, Aufsatz W, Zilberman D, et al. Role of the DRM and CMT3 methyltransferases in RNA-directed DNA methylation. Current Biology. 2003;13(24):2212-2217. doi:10.1016/j.cub.2003.11.052 apa: Cao, X., Aufsatz, W., Zilberman, D., Mette, M. F., Huang, M. S., Matzke, M., & Jacobsen, S. E. (2003). Role of the DRM and CMT3 methyltransferases in RNA-directed DNA methylation. Current Biology. Elsevier. https://doi.org/10.1016/j.cub.2003.11.052 chicago: Cao, Xiaofeng, Werner Aufsatz, Daniel Zilberman, M.Florian Mette, Michael S. Huang, Marjori Matzke, and Steven E. Jacobsen. “Role of the DRM and CMT3 Methyltransferases in RNA-Directed DNA Methylation.” Current Biology. Elsevier, 2003. https://doi.org/10.1016/j.cub.2003.11.052. ieee: X. Cao et al., “Role of the DRM and CMT3 methyltransferases in RNA-directed DNA methylation,” Current Biology, vol. 13, no. 24. Elsevier, pp. 2212–2217, 2003. ista: Cao X, Aufsatz W, Zilberman D, Mette MF, Huang MS, Matzke M, Jacobsen SE. 2003. Role of the DRM and CMT3 methyltransferases in RNA-directed DNA methylation. Current Biology. 13(24), 2212–2217. mla: Cao, Xiaofeng, et al. “Role of the DRM and CMT3 Methyltransferases in RNA-Directed DNA Methylation.” Current Biology, vol. 13, no. 24, Elsevier, 2003, pp. 2212–17, doi:10.1016/j.cub.2003.11.052. short: X. Cao, W. Aufsatz, D. Zilberman, M.F. Mette, M.S. Huang, M. Matzke, S.E. Jacobsen, Current Biology 13 (2003) 2212–2217. date_created: 2021-06-07T10:43:02Z date_published: 2003-12-16T00:00:00Z date_updated: 2021-12-14T08:41:38Z day: '16' department: - _id: DaZi doi: 10.1016/j.cub.2003.11.052 extern: '1' external_id: pmid: - '14680640' intvolume: ' 13' issue: '24' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1016/j.cub.2003.11.052 month: '12' oa: 1 oa_version: Published Version page: 2212-2217 pmid: 1 publication: Current Biology publication_identifier: eissn: - 1879-0445 issn: - 0960-9822 publication_status: published publisher: Elsevier quality_controlled: '1' scopus_import: '1' status: public title: Role of the DRM and CMT3 methyltransferases in RNA-directed DNA methylation type: journal_article user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 volume: 13 year: '2003' ... --- _id: '8519' article_processing_charge: No article_type: original author: - first_name: Vadim full_name: Kaloshin, Vadim id: FE553552-CDE8-11E9-B324-C0EBE5697425 last_name: Kaloshin orcid: 0000-0002-6051-2628 citation: ama: Kaloshin V. The existential Hilbert 16-th problem and an estimate for cyclicity of elementary polycycles. Inventiones mathematicae. 2003;151(3):451-512. doi:10.1007/s00222-002-0244-9 apa: Kaloshin, V. (2003). The existential Hilbert 16-th problem and an estimate for cyclicity of elementary polycycles. Inventiones Mathematicae. Springer Nature. https://doi.org/10.1007/s00222-002-0244-9 chicago: Kaloshin, Vadim. “The Existential Hilbert 16-Th Problem and an Estimate for Cyclicity of Elementary Polycycles.” Inventiones Mathematicae. Springer Nature, 2003. https://doi.org/10.1007/s00222-002-0244-9. ieee: V. Kaloshin, “The existential Hilbert 16-th problem and an estimate for cyclicity of elementary polycycles,” Inventiones mathematicae, vol. 151, no. 3. Springer Nature, pp. 451–512, 2003. ista: Kaloshin V. 2003. The existential Hilbert 16-th problem and an estimate for cyclicity of elementary polycycles. Inventiones mathematicae. 151(3), 451–512. mla: Kaloshin, Vadim. “The Existential Hilbert 16-Th Problem and an Estimate for Cyclicity of Elementary Polycycles.” Inventiones Mathematicae, vol. 151, no. 3, Springer Nature, 2003, pp. 451–512, doi:10.1007/s00222-002-0244-9. short: V. Kaloshin, Inventiones Mathematicae 151 (2003) 451–512. date_created: 2020-09-18T10:49:26Z date_published: 2003-03-01T00:00:00Z date_updated: 2021-01-12T08:19:50Z day: '01' doi: 10.1007/s00222-002-0244-9 extern: '1' intvolume: ' 151' issue: '3' keyword: - General Mathematics language: - iso: eng month: '03' oa_version: None page: 451-512 publication: Inventiones mathematicae publication_identifier: issn: - 0020-9910 - 1432-1297 publication_status: published publisher: Springer Nature quality_controlled: '1' status: public title: The existential Hilbert 16-th problem and an estimate for cyclicity of elementary polycycles type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 151 year: '2003' ... --- _id: '9455' abstract: - lang: eng text: Proteins of the ARGONAUTE family are important in diverse posttranscriptional RNA-mediated gene-silencing systems as well as in transcriptional gene silencing in Drosophila and fission yeast and in programmed DNA elimination in Tetrahymena. We cloned ARGONAUTE4 (AGO4) from a screen for mutants that suppress silencing of the Arabidopsis SUPERMAN(SUP) gene. The ago4-1 mutant reactivated silentSUP alleles and decreased CpNpG and asymmetric DNA methylation as well as histone H3 lysine-9 methylation. In addition,ago4-1 blocked histone and DNA methylation and the accumulation of 25-nucleotide small interfering RNAs (siRNAs) that correspond to the retroelement AtSN1. These results suggest that AGO4 and long siRNAs direct chromatin modifications, including histone methylation and non-CpG DNA methylation. article_processing_charge: No article_type: original author: - first_name: Daniel full_name: Zilberman, Daniel id: 6973db13-dd5f-11ea-814e-b3e5455e9ed1 last_name: Zilberman orcid: 0000-0002-0123-8649 - first_name: ' Xiaofeng' full_name: Cao, Xiaofeng last_name: Cao - first_name: Steven E. full_name: Jacobsen, Steven E. last_name: Jacobsen citation: ama: Zilberman D, Cao Xiaofeng, Jacobsen SE. ARGONAUTE4 control of locus-specific siRNA accumulation and DNA and histone methylation. Science. 2003;299(5607):716-719. doi:10.1126/science.1079695 apa: Zilberman, D., Cao, Xiaofeng, & Jacobsen, S. E. (2003). ARGONAUTE4 control of locus-specific siRNA accumulation and DNA and histone methylation. Science. American Association for the Advancement of Science. https://doi.org/10.1126/science.1079695 chicago: Zilberman, Daniel, Xiaofeng Cao, and Steven E. Jacobsen. “ARGONAUTE4 Control of Locus-Specific SiRNA Accumulation and DNA and Histone Methylation.” Science. American Association for the Advancement of Science, 2003. https://doi.org/10.1126/science.1079695. ieee: D. Zilberman, Xiaofeng Cao, and S. E. Jacobsen, “ARGONAUTE4 control of locus-specific siRNA accumulation and DNA and histone methylation,” Science, vol. 299, no. 5607. American Association for the Advancement of Science, pp. 716–719, 2003. ista: Zilberman D, Cao Xiaofeng, Jacobsen SE. 2003. ARGONAUTE4 control of locus-specific siRNA accumulation and DNA and histone methylation. Science. 299(5607), 716–719. mla: Zilberman, Daniel, et al. “ARGONAUTE4 Control of Locus-Specific SiRNA Accumulation and DNA and Histone Methylation.” Science, vol. 299, no. 5607, American Association for the Advancement of Science, 2003, pp. 716–19, doi:10.1126/science.1079695. short: D. Zilberman, Xiaofeng Cao, S.E. Jacobsen, Science 299 (2003) 716–719. date_created: 2021-06-04T11:26:26Z date_published: 2003-01-31T00:00:00Z date_updated: 2021-12-14T08:43:30Z day: '31' department: - _id: DaZi doi: 10.1126/science.1079695 extern: '1' external_id: pmid: - '12522258' intvolume: ' 299' issue: '5607' keyword: - Multidisciplinary language: - iso: eng month: '01' oa_version: None page: 716-719 pmid: 1 publication: Science publication_identifier: eissn: - 1095-9203 issn: - 0036-8075 publication_status: published publisher: American Association for the Advancement of Science quality_controlled: '1' scopus_import: '1' status: public title: ARGONAUTE4 control of locus-specific siRNA accumulation and DNA and histone methylation type: journal_article user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 volume: 299 year: '2003' ... --- _id: '4628' abstract: - lang: eng text: 'Discounting the future means that the value, today, of a unit payoffis 1 if the payoffo ccurs today, a if it occurs tomorrow, a 2 if it occurs the day after tomorrow, and so on, for some real-valued discount factor 0 < a < 1. Discounting (or inflation) is a key paradigm in economics and has been studied in Markov decision processes as well as game theory. We submit that discounting also has a natural place in systems engineering: for nonterminating systems, a potential bug in the far-away future is less troubling than a potential bug today. We therefore develop a systems theory with discounting. Our theory includes several basic elements: discounted versions of system properties that correspond to the ω-regular properties, fixpoint-based algorithms for checking discounted properties, and a quantitative notion of bisimilarity for capturing the difference between two states with respect to discounted properties. We present the theory in a general form that applies to probabilistic systems as well as multicomponent systems (games), but it readily specializes to classical transition systems. We show that discounting, besides its natural practical appeal, has also several mathematical benefits. First, the resulting theory is robust, in that small perturbations of a system can cause only small changes in the properties of the system. Second, the theory is computational, in that the values of discounted properties, as well as the discounted bisimilarity distance between states, can be computed to any desired degree of precision.' acknowledgement: This research was supported in part by the NSF CAREER award CCR-0132780, the DARPA grant F33615-C-98-3614, the NSF grants CCR-9988172, CCR-0234690 and CCR-0225610, and the ONR grant N00014-02-1-0671. alternative_title: - LNCS article_processing_charge: No author: - first_name: Luca full_name: De Alfaro, Luca last_name: De Alfaro - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 - first_name: Ritankar full_name: Majumdar, Ritankar last_name: Majumdar citation: ama: 'De Alfaro L, Henzinger TA, Majumdar R. Discounting the future in systems theory. In: Proceedings of the 30th International Colloquium on Automata, Languages and Programming. Vol 2719. Springer; 2003:1022-1037. doi:10.1007/3-540-45061-0_79' apa: 'De Alfaro, L., Henzinger, T. A., & Majumdar, R. (2003). Discounting the future in systems theory. In Proceedings of the 30th International Colloquium on Automata, Languages and Programming (Vol. 2719, pp. 1022–1037). Eindhoven, The Netherlands: Springer. https://doi.org/10.1007/3-540-45061-0_79' chicago: De Alfaro, Luca, Thomas A Henzinger, and Ritankar Majumdar. “Discounting the Future in Systems Theory.” In Proceedings of the 30th International Colloquium on Automata, Languages and Programming, 2719:1022–37. Springer, 2003. https://doi.org/10.1007/3-540-45061-0_79. ieee: L. De Alfaro, T. A. Henzinger, and R. Majumdar, “Discounting the future in systems theory,” in Proceedings of the 30th International Colloquium on Automata, Languages and Programming, Eindhoven, The Netherlands, 2003, vol. 2719, pp. 1022–1037. ista: 'De Alfaro L, Henzinger TA, Majumdar R. 2003. Discounting the future in systems theory. Proceedings of the 30th International Colloquium on Automata, Languages and Programming. ICALP: Automata, Languages and Programming, LNCS, vol. 2719, 1022–1037.' mla: De Alfaro, Luca, et al. “Discounting the Future in Systems Theory.” Proceedings of the 30th International Colloquium on Automata, Languages and Programming, vol. 2719, Springer, 2003, pp. 1022–37, doi:10.1007/3-540-45061-0_79. short: L. De Alfaro, T.A. Henzinger, R. Majumdar, in:, Proceedings of the 30th International Colloquium on Automata, Languages and Programming, Springer, 2003, pp. 1022–1037. conference: end_date: 2003-07-04 location: Eindhoven, The Netherlands name: 'ICALP: Automata, Languages and Programming' start_date: 2003-06-30 date_created: 2018-12-11T12:09:50Z date_published: 2003-06-25T00:00:00Z date_updated: 2023-07-26T13:07:31Z day: '25' doi: 10.1007/3-540-45061-0_79 extern: '1' intvolume: ' 2719' language: - iso: eng month: '06' oa_version: None page: 1022 - 1037 publication: Proceedings of the 30th International Colloquium on Automata, Languages and Programming publication_identifier: isbn: - '9783540404934' publication_status: published publisher: Springer publist_id: '77' quality_controlled: '1' scopus_import: '1' status: public title: Discounting the future in systems theory type: conference user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17 volume: 2719 year: '2003' ... --- _id: '13436' abstract: - lang: eng text: Cross-metathesis reactions of α,β-unsaturated sulfones and sulfoxides in the presence of molybdenum and ruthenium pre-catalysts were tested. A selective metahesis reaction was achieved between functionalized terminal olefins and vinyl sulfones by using the ‘second generation’ ruthenium catalysts 1c–h while the highly active Schrock catalyst 1b was found to be functional group incompatible with vinyl sulfones. The cross-metathesis products were isolated in good yields with an excellent (E)-selectivity. Both the molybdenum and ruthenium-based complexes were, however, incompatible with α,β- and β,γ-unsaturated sulfoxides. article_processing_charge: No article_type: original author: - first_name: Anna full_name: Michrowska, Anna last_name: Michrowska - first_name: Michał full_name: Bieniek, Michał last_name: Bieniek - first_name: Mikhail full_name: Kim, Mikhail last_name: Kim - first_name: Rafal full_name: Klajn, Rafal id: 8e84690e-1e48-11ed-a02b-a1e6fb8bb53b last_name: Klajn - first_name: Karol full_name: Grela, Karol last_name: Grela citation: ama: Michrowska A, Bieniek M, Kim M, Klajn R, Grela K. Cross-metathesis reaction of vinyl sulfones and sulfoxides. Tetrahedron. 2003;59(25):4525-4531. doi:10.1016/s0040-4020(03)00682-3 apa: Michrowska, A., Bieniek, M., Kim, M., Klajn, R., & Grela, K. (2003). Cross-metathesis reaction of vinyl sulfones and sulfoxides. Tetrahedron. Elsevier. https://doi.org/10.1016/s0040-4020(03)00682-3 chicago: Michrowska, Anna, Michał Bieniek, Mikhail Kim, Rafal Klajn, and Karol Grela. “Cross-Metathesis Reaction of Vinyl Sulfones and Sulfoxides.” Tetrahedron. Elsevier, 2003. https://doi.org/10.1016/s0040-4020(03)00682-3. ieee: A. Michrowska, M. Bieniek, M. Kim, R. Klajn, and K. Grela, “Cross-metathesis reaction of vinyl sulfones and sulfoxides,” Tetrahedron, vol. 59, no. 25. Elsevier, pp. 4525–4531, 2003. ista: Michrowska A, Bieniek M, Kim M, Klajn R, Grela K. 2003. Cross-metathesis reaction of vinyl sulfones and sulfoxides. Tetrahedron. 59(25), 4525–4531. mla: Michrowska, Anna, et al. “Cross-Metathesis Reaction of Vinyl Sulfones and Sulfoxides.” Tetrahedron, vol. 59, no. 25, Elsevier, 2003, pp. 4525–31, doi:10.1016/s0040-4020(03)00682-3. short: A. Michrowska, M. Bieniek, M. Kim, R. Klajn, K. Grela, Tetrahedron 59 (2003) 4525–4531. date_created: 2023-08-01T10:39:34Z date_published: 2003-06-16T00:00:00Z date_updated: 2023-08-08T12:44:17Z day: '16' doi: 10.1016/s0040-4020(03)00682-3 extern: '1' intvolume: ' 59' issue: '25' keyword: - Organic Chemistry - Drug Discovery - Biochemistry language: - iso: eng month: '06' oa_version: None page: 4525-4531 publication: Tetrahedron publication_identifier: eissn: - 1464-5416 issn: - 0040-4020 publication_status: published publisher: Elsevier quality_controlled: '1' scopus_import: '1' status: public title: Cross-metathesis reaction of vinyl sulfones and sulfoxides type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 59 year: '2003' ... --- _id: '4561' abstract: - lang: eng text: 'We present a formalism for specifying component interfaces that expose component requirements on limited resources. The formalism permits an algorithmic check if two or more components, when put together, exceed the available resources. Moreover, the formalism can be used to compute the quantity of resources necessary for satisfying the requirements of a collection of components. The formalism can be instantiated in several ways. For example, several components may draw power from the same source. Then, the formalism supports compatibility checks such as: can two components, when put together, achieve their tasks without ever exceeding the available amount of peak power? or, can they achieve their tasks by using no more than the initially available amount of energy (i.e., power accumulated over time)? The corresponding quantitative questions that our algorithms answer are the following: what is the amount of peak power needed for two components to be put together? what is the corresponding amount of initial energy? To solve these questions, we model interfaces with resource requirements as games with quantitative objectives. The games are played on state spaces where each state is labeled by a number (representing, e.g., power consumption), and a play produces an infinite path of labels. The objective may be, for example, to minimize the largest label that occurs during a play. We illustrate our approach by modeling compatibility questions for the components of robot control software, and of wireless sensor networks.' acknowledgement: This research was supported in part by the DARPA grant F33615-00-C-1693, the MARCO grant 98-DT-660, the ONR grant N00014-02-1-0671, and the NSF grants CCR-0085949, CCR-0132780, CCR-0234690, and CCR-9988172. alternative_title: - LNCS article_processing_charge: No author: - first_name: Arindam full_name: Chakrabarti, Arindam last_name: Chakrabarti - first_name: Luca full_name: De Alfaro, Luca last_name: De Alfaro - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 - first_name: Mariëlle full_name: Stoelinga, Mariëlle last_name: Stoelinga citation: ama: 'Chakrabarti A, De Alfaro L, Henzinger TA, Stoelinga M. Resource interfaces. In: Third International Conference on Embedded Software. Vol 2855. ACM; 2003:117-133. doi:10.1007/978-3-540-45212-6_9' apa: 'Chakrabarti, A., De Alfaro, L., Henzinger, T. A., & Stoelinga, M. (2003). Resource interfaces. In Third International Conference on Embedded Software (Vol. 2855, pp. 117–133). Philadelphia, PA, USA: ACM. https://doi.org/10.1007/978-3-540-45212-6_9' chicago: Chakrabarti, Arindam, Luca De Alfaro, Thomas A Henzinger, and Mariëlle Stoelinga. “Resource Interfaces.” In Third International Conference on Embedded Software, 2855:117–33. ACM, 2003. https://doi.org/10.1007/978-3-540-45212-6_9. ieee: A. Chakrabarti, L. De Alfaro, T. A. Henzinger, and M. Stoelinga, “Resource interfaces,” in Third International Conference on Embedded Software, Philadelphia, PA, USA, 2003, vol. 2855, pp. 117–133. ista: 'Chakrabarti A, De Alfaro L, Henzinger TA, Stoelinga M. 2003. Resource interfaces. Third International Conference on Embedded Software. EMSOFT: Embedded Software , LNCS, vol. 2855, 117–133.' mla: Chakrabarti, Arindam, et al. “Resource Interfaces.” Third International Conference on Embedded Software, vol. 2855, ACM, 2003, pp. 117–33, doi:10.1007/978-3-540-45212-6_9. short: A. Chakrabarti, L. De Alfaro, T.A. Henzinger, M. Stoelinga, in:, Third International Conference on Embedded Software, ACM, 2003, pp. 117–133. conference: end_date: 2003-10-15 location: Philadelphia, PA, USA name: 'EMSOFT: Embedded Software ' start_date: 2003-10-13 date_created: 2018-12-11T12:09:29Z date_published: 2003-09-29T00:00:00Z date_updated: 2024-01-08T10:48:11Z day: '29' doi: 10.1007/978-3-540-45212-6_9 extern: '1' intvolume: ' 2855' language: - iso: eng month: '09' oa_version: None page: 117 - 133 publication: Third International Conference on Embedded Software publication_identifier: isbn: - '9783540202233' publication_status: published publisher: ACM publist_id: '148' quality_controlled: '1' scopus_import: '1' status: public title: Resource interfaces type: conference user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17 volume: 2855 year: '2003' ... --- _id: '4630' abstract: - lang: eng text: We consider concurrent two-person games played in real time, in which the players decide both which action to play, and when to play it. Such timed games differ from untimed games in two essential ways. First, players can take each other by surprise, because actions are played with delays that cannot be anticipated by the opponent. Second, a player should not be able to win the game by preventing time from diverging. We present a model of timed games that preserves the element of surprise and accounts for time divergence in a way that treats both players symmetrically and applies to all ω-regular winning conditions. We prove that the ability to take each other by surprise adds extra power to the players. For the case that the games are specified in the style of timed automata, we provide symbolic algorithms for their solution with respect to all ω-regular winning conditions. We also show that for these timed games, memory strategies are more powerful than memoryless strategies already in the case of reachability objectives. acknowledgement: Supported in part by the AFOSR MURI grant F49620-00-1-0327, the DARPA grant F33615-C-98-3614, the MARCO grant 98-DT-660, -the ONR grant N00014-02-1-0671, the NSF grants CCR-9988172, CCR-0225610, and CCR-0234690, the NSF CAREER award CCR-0132780, and the MIUR grant MEFISTO. alternative_title: - LNCS article_processing_charge: No author: - first_name: Luca full_name: De Alfaro, Luca last_name: De Alfaro - first_name: Marco full_name: Faella, Marco last_name: Faella - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 - first_name: Ritankar full_name: Majumdar, Ritankar last_name: Majumdar - first_name: Mariëlle full_name: Stoelinga, Mariëlle last_name: Stoelinga citation: ama: 'De Alfaro L, Faella M, Henzinger TA, Majumdar R, Stoelinga M. The element of surprise in timed games. In: Proceedings of the 14th International Conference on Concurrency Theory. Vol 2761. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2003:144-158. doi:10.1007/978-3-540-45187-7_9' apa: 'De Alfaro, L., Faella, M., Henzinger, T. A., Majumdar, R., & Stoelinga, M. (2003). The element of surprise in timed games. In Proceedings of the 14th International Conference on Concurrency Theory (Vol. 2761, pp. 144–158). Marseille, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-540-45187-7_9' chicago: De Alfaro, Luca, Marco Faella, Thomas A Henzinger, Ritankar Majumdar, and Mariëlle Stoelinga. “The Element of Surprise in Timed Games.” In Proceedings of the 14th International Conference on Concurrency Theory, 2761:144–58. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2003. https://doi.org/10.1007/978-3-540-45187-7_9. ieee: L. De Alfaro, M. Faella, T. A. Henzinger, R. Majumdar, and M. Stoelinga, “The element of surprise in timed games,” in Proceedings of the 14th International Conference on Concurrency Theory, Marseille, France, 2003, vol. 2761, pp. 144–158. ista: 'De Alfaro L, Faella M, Henzinger TA, Majumdar R, Stoelinga M. 2003. The element of surprise in timed games. Proceedings of the 14th International Conference on Concurrency Theory. CONCUR: Concurrency Theory, LNCS, vol. 2761, 144–158.' mla: De Alfaro, Luca, et al. “The Element of Surprise in Timed Games.” Proceedings of the 14th International Conference on Concurrency Theory, vol. 2761, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2003, pp. 144–58, doi:10.1007/978-3-540-45187-7_9. short: L. De Alfaro, M. Faella, T.A. Henzinger, R. Majumdar, M. Stoelinga, in:, Proceedings of the 14th International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2003, pp. 144–158. conference: end_date: 2003-09-05 location: Marseille, France name: 'CONCUR: Concurrency Theory' start_date: 2003-09-03 date_created: 2018-12-11T12:09:51Z date_published: 2003-08-21T00:00:00Z date_updated: 2024-01-08T10:05:30Z day: '21' doi: 10.1007/978-3-540-45187-7_9 extern: '1' intvolume: ' 2761' language: - iso: eng month: '08' oa_version: None page: 144 - 158 publication: Proceedings of the 14th International Conference on Concurrency Theory publication_identifier: isbn: - '9783540407539' publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik publist_id: '78' quality_controlled: '1' scopus_import: '1' status: public title: The element of surprise in timed games type: conference user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17 volume: 2761 year: '2003' ... --- _id: '4468' abstract: - lang: eng text: Giotto is a high-level programming language for time-triggered control applications. The authors begin with a conceptual overview of its methodology, discuss the Giotto helicopter project, and summarize available Giotto implementations. acknowledgement: We thank Niklaus Wirth and Walter Schaufelberger for their advice and support of the reengineering effort of the ETH Zurich helicopter control system using Giotto. This research was supported in part by DARPA SEC grant F33615-C-98–3614, MARCO GSRC grant 98-DT-660, and AFOSR MURI grant F49620–00-1–0327. A preliminary version of this article appeared as [1]. article_processing_charge: No article_type: original author: - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 - first_name: Christoph full_name: Kirsch, Christoph last_name: Kirsch - first_name: Marco full_name: Sanvido, Marco last_name: Sanvido - first_name: Wolfgang full_name: Pree, Wolfgang last_name: Pree citation: ama: Henzinger TA, Kirsch C, Sanvido M, Pree W. From control models to real-time code using Giotto. IEEE Control Systems Magazine. 2003;23(1):50-64. doi:10.1109/MCS.2003.1172829 apa: Henzinger, T. A., Kirsch, C., Sanvido, M., & Pree, W. (2003). From control models to real-time code using Giotto. IEEE Control Systems Magazine. IEEE. https://doi.org/10.1109/MCS.2003.1172829 chicago: Henzinger, Thomas A, Christoph Kirsch, Marco Sanvido, and Wolfgang Pree. “From Control Models to Real-Time Code Using Giotto.” IEEE Control Systems Magazine. IEEE, 2003. https://doi.org/10.1109/MCS.2003.1172829. ieee: T. A. Henzinger, C. Kirsch, M. Sanvido, and W. Pree, “From control models to real-time code using Giotto,” IEEE Control Systems Magazine, vol. 23, no. 1. IEEE, pp. 50–64, 2003. ista: Henzinger TA, Kirsch C, Sanvido M, Pree W. 2003. From control models to real-time code using Giotto. IEEE Control Systems Magazine. 23(1), 50–64. mla: Henzinger, Thomas A., et al. “From Control Models to Real-Time Code Using Giotto.” IEEE Control Systems Magazine, vol. 23, no. 1, IEEE, 2003, pp. 50–64, doi:10.1109/MCS.2003.1172829. short: T.A. Henzinger, C. Kirsch, M. Sanvido, W. Pree, IEEE Control Systems Magazine 23 (2003) 50–64. date_created: 2018-12-11T12:09:00Z date_published: 2003-01-29T00:00:00Z date_updated: 2024-01-08T10:54:53Z day: '29' doi: 10.1109/MCS.2003.1172829 extern: '1' intvolume: ' 23' issue: '1' language: - iso: eng month: '01' oa_version: None page: 50 - 64 publication: IEEE Control Systems Magazine publication_identifier: issn: - '1066-033X ' publication_status: published publisher: IEEE publist_id: '260' quality_controlled: '1' scopus_import: '1' status: public title: From control models to real-time code using Giotto type: journal_article user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17 volume: 23 year: '2003' ... --- _id: '4465' abstract: - lang: eng text: Giotto is a principled, tool-supported design methodology for implementing embedded control systems on platforms of possibly distributed sensors, actuators, CPUs, and networks. Giotto is based on the principle that time-triggered task invocations plus time-triggered mode switches can form the abstract essence of programming real-time control systems. Giotto consists of a programming language with a formal semantics, and a retargetable compiler and runtime library. Giotto supports the automation of control system design by strictly separating platform-independent functionality and timing concerns from platform-dependent scheduling and communication issues. The time-triggered predictability of Giotto makes it particularly suitable for safety-critical applications with hard real-time constraints. We illustrate the platform independence and time-triggered execution of Giotto by coordinating a heterogeneous flock of Intel x86 robots and Lego Mindstorms robots. article_processing_charge: No author: - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 - first_name: Benjamin full_name: Horowitz, Benjamin last_name: Horowitz - first_name: Christoph full_name: Kirsch, Christoph last_name: Kirsch citation: ama: 'Henzinger TA, Horowitz B, Kirsch C. Embedded control systems development with Giotto. In: Software-Enabled Control: Information Technology for Dynamical Systems. Wiley-Blackwell; 2003:123-146. doi:10.1002/047172288X.ch8' apa: 'Henzinger, T. A., Horowitz, B., & Kirsch, C. (2003). Embedded control systems development with Giotto. In Software-Enabled Control: Information Technology for Dynamical Systems (pp. 123–146). Wiley-Blackwell. https://doi.org/10.1002/047172288X.ch8' chicago: 'Henzinger, Thomas A, Benjamin Horowitz, and Christoph Kirsch. “Embedded Control Systems Development with Giotto.” In Software-Enabled Control: Information Technology for Dynamical Systems, 123–46. Wiley-Blackwell, 2003. https://doi.org/10.1002/047172288X.ch8.' ieee: 'T. A. Henzinger, B. Horowitz, and C. Kirsch, “Embedded control systems development with Giotto,” in Software-Enabled Control: Information Technology for Dynamical Systems, Wiley-Blackwell, 2003, pp. 123–146.' ista: 'Henzinger TA, Horowitz B, Kirsch C. 2003.Embedded control systems development with Giotto. In: Software-Enabled Control: Information Technology for Dynamical Systems. , 123–146.' mla: 'Henzinger, Thomas A., et al. “Embedded Control Systems Development with Giotto.” Software-Enabled Control: Information Technology for Dynamical Systems, Wiley-Blackwell, 2003, pp. 123–46, doi:10.1002/047172288X.ch8.' short: 'T.A. Henzinger, B. Horowitz, C. Kirsch, in:, Software-Enabled Control: Information Technology for Dynamical Systems, Wiley-Blackwell, 2003, pp. 123–146.' date_created: 2018-12-11T12:08:59Z date_published: 2003-05-20T00:00:00Z date_updated: 2024-01-08T12:24:01Z day: '20' doi: 10.1002/047172288X.ch8 extern: '1' language: - iso: eng month: '05' oa_version: None page: 123 - 146 publication: 'Software-Enabled Control: Information Technology for Dynamical Systems' publication_identifier: isbn: - '9780471234364 ' publication_status: published publisher: Wiley-Blackwell publist_id: '262' quality_controlled: '1' status: public title: Embedded control systems development with Giotto type: book_chapter user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17 year: '2003' ... --- _id: '4466' abstract: - lang: eng text: One source of complexity in the μ-calculus is its ability to specify an unbounded number of switches between universal (AX) and existential (EX) branching modes. We therefore study the problems of satisfiability, validity, model checking, and implication for the universal and existential fragments of the μ-calculus, in which only one branching mode is allowed. The universal fragment is rich enough to express most specifications of interest, and therefore improved algorithms are of practical importance. We show that while the satisfiability and validity problems become indeed simpler for the existential and universal fragments, this is, unfortunately, not the case for model checking and implication. We also show the corresponding results for the alternationfree fragment of the μ-calculus, where no alternations between least and greatest fixed points are allowed. Our results imply that efforts to find a polynomial-time model-checking algorithm for the μ-calculus can be replaced by efforts to find such an algorithm for the universal or existential fragment. acknowledgement: This work was supported in part by NSF grant CCR-9988172, the AFOSR MURI grant F49620-00-1-0327, and a Microsoft Research Fellowship. alternative_title: - LNCS article_processing_charge: No author: - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 - first_name: Orna full_name: Kupferman, Orna last_name: Kupferman - first_name: Ritankar full_name: Majumdar, Ritankar last_name: Majumdar citation: ama: 'Henzinger TA, Kupferman O, Majumdar R. On the universal and existential fragments of the mu-calculus. In: Proceedings of the 9th International Conference on Tools and Algorithms for the Construction and Analysis of Systems . Vol 2619. Springer; 2003:49-64. doi:10.1007/3-540-36577-X_5' apa: 'Henzinger, T. A., Kupferman, O., & Majumdar, R. (2003). On the universal and existential fragments of the mu-calculus. In Proceedings of the 9th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (Vol. 2619, pp. 49–64). Warsaw, Poland: Springer. https://doi.org/10.1007/3-540-36577-X_5' chicago: Henzinger, Thomas A, Orna Kupferman, and Ritankar Majumdar. “On the Universal and Existential Fragments of the Mu-Calculus.” In Proceedings of the 9th International Conference on Tools and Algorithms for the Construction and Analysis of Systems , 2619:49–64. Springer, 2003. https://doi.org/10.1007/3-540-36577-X_5. ieee: T. A. Henzinger, O. Kupferman, and R. Majumdar, “On the universal and existential fragments of the mu-calculus,” in Proceedings of the 9th International Conference on Tools and Algorithms for the Construction and Analysis of Systems , Warsaw, Poland, 2003, vol. 2619, pp. 49–64. ista: 'Henzinger TA, Kupferman O, Majumdar R. 2003. On the universal and existential fragments of the mu-calculus. Proceedings of the 9th International Conference on Tools and Algorithms for the Construction and Analysis of Systems . TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 2619, 49–64.' mla: Henzinger, Thomas A., et al. “On the Universal and Existential Fragments of the Mu-Calculus.” Proceedings of the 9th International Conference on Tools and Algorithms for the Construction and Analysis of Systems , vol. 2619, Springer, 2003, pp. 49–64, doi:10.1007/3-540-36577-X_5. short: T.A. Henzinger, O. Kupferman, R. Majumdar, in:, Proceedings of the 9th International Conference on Tools and Algorithms for the Construction and Analysis of Systems , Springer, 2003, pp. 49–64. conference: end_date: 2003-04-11 location: Warsaw, Poland name: 'TACAS: Tools and Algorithms for the Construction and Analysis of Systems' start_date: 2003-04-07 date_created: 2018-12-11T12:08:59Z date_published: 2003-03-14T00:00:00Z date_updated: 2024-01-08T13:17:35Z day: '14' doi: 10.1007/3-540-36577-X_5 extern: '1' intvolume: ' 2619' language: - iso: eng month: '03' oa_version: None page: 49 - 64 publication: 'Proceedings of the 9th International Conference on Tools and Algorithms for the Construction and Analysis of Systems ' publication_identifier: isbn: - '9783540008989' publication_status: published publisher: Springer publist_id: '263' quality_controlled: '1' status: public title: On the universal and existential fragments of the mu-calculus type: conference user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17 volume: 2619 year: '2003' ... --- _id: '4467' abstract: - lang: eng text: 'BLAST (the Berkeley Lazy Abstraction Software verification Tool) is a verification system for checking safety properties of C programs using automatic property-driven construction and model checking of software abstractions. Blast implements an abstract-model check-refine loop to check for reachability of a specified label in the program. The abstract model is built on the fly using predicate abstraction. This model is then checked for reachability. If there is no (abstract) path to the specified error label, Blast reports that the system is safe and produces a succinct proof. Otherwise, it checks if the path is feasible using symbolic execution of the program. If the path is feasible, Blast outputs the path as an error trace, otherwise, it uses the infeasibility of the path to refine the abstract model. Blast short-circuits the loop from abstraction to verification to refinement, integrating the three steps tightly through “lazy abstraction” [5]. This integration can offer significant advantages in performance by avoiding the repetition of work from one iteration of the loop to the next. ' acknowledgement: This work was supported in part by the NSF grants CCR-0085949 and CCR-9988172, the DARPA PCES grant F33615-00-C-1693, the MARCO GSRC grant 98-DT-660, and a Microsoft Research Fellowship. alternative_title: - LNCS article_processing_charge: No author: - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 - first_name: Ranjit full_name: Jhala, Ranjit last_name: Jhala - first_name: Ritankar full_name: Majumdar, Ritankar last_name: Majumdar - first_name: Grégoire full_name: Sutre, Grégoire last_name: Sutre citation: ama: 'Henzinger TA, Jhala R, Majumdar R, Sutre G. Software verification with BLAST. In: Proceedings of the 10th International SPIN Workshop . Vol 2648. Springer; 2003:235-239. doi:10.1007/3-540-44829-2_17' apa: 'Henzinger, T. A., Jhala, R., Majumdar, R., & Sutre, G. (2003). Software verification with BLAST. In Proceedings of the 10th International SPIN Workshop (Vol. 2648, pp. 235–239). Portland, OR, USA: Springer. https://doi.org/10.1007/3-540-44829-2_17' chicago: Henzinger, Thomas A, Ranjit Jhala, Ritankar Majumdar, and Grégoire Sutre. “Software Verification with BLAST.” In Proceedings of the 10th International SPIN Workshop , 2648:235–39. Springer, 2003. https://doi.org/10.1007/3-540-44829-2_17. ieee: T. A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre, “Software verification with BLAST,” in Proceedings of the 10th International SPIN Workshop , Portland, OR, USA, 2003, vol. 2648, pp. 235–239. ista: 'Henzinger TA, Jhala R, Majumdar R, Sutre G. 2003. Software verification with BLAST. Proceedings of the 10th International SPIN Workshop . SPIN: Model Checking Software, LNCS, vol. 2648, 235–239.' mla: Henzinger, Thomas A., et al. “Software Verification with BLAST.” Proceedings of the 10th International SPIN Workshop , vol. 2648, Springer, 2003, pp. 235–39, doi:10.1007/3-540-44829-2_17. short: T.A. Henzinger, R. Jhala, R. Majumdar, G. Sutre, in:, Proceedings of the 10th International SPIN Workshop , Springer, 2003, pp. 235–239. conference: end_date: 2003-05-10 location: Portland, OR, USA name: 'SPIN: Model Checking Software' start_date: 2003-05-09 date_created: 2018-12-11T12:09:00Z date_published: 2003-04-28T00:00:00Z date_updated: 2024-01-08T14:05:29Z day: '28' doi: 10.1007/3-540-44829-2_17 extern: '1' intvolume: ' 2648' language: - iso: eng month: '04' oa_version: None page: 235 - 239 publication: 'Proceedings of the 10th International SPIN Workshop ' publication_identifier: isbn: - '9783540401179' publication_status: published publisher: Springer publist_id: '264' quality_controlled: '1' scopus_import: '1' status: public title: Software verification with BLAST type: conference user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17 volume: 2648 year: '2003' ... --- _id: '4463' abstract: - lang: eng text: We present an algorithm called TAR (“Thread-modular Abstraction Refinement”) for model checking safety properties of concurrent software. The TAR algorithm uses thread-modular assume-guarantee reasoning to overcome the exponential complexity in the control state of multithreaded programs. Thread modularity means that TAR explores the state space of one thread at a time, making assumptions about how the environment can interfere. The TAR algorithm uses counterexample-guided predicate-abstraction refinement to overcome the usually infinite complexity in the data state of C programs. A successive approximation scheme automatically infers the necessary precision on data variables as well as suitable environment assumptions. The scheme is novel in that transition relations are approximated from above, while at the same time environment assumptions are approximated from below. In our software verification tool BLAST we have implemented a fully automatic race checker for multithreaded C programs which is based on the TAR algorithm. This tool has verified a wide variety of commonly used locking idioms, including locking schemes that are not amenable to existing dynamic and static race checkers such as ERASER or WARLOCK. acknowledgement: This work was supported in part by the NSF grants CCR-0085949 and CCR-0234690, the DARPA grant F33615-00-C-1693, and the MARCO grant 98-DT-660. alternative_title: - LNCS article_processing_charge: No author: - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 - first_name: Ranjit full_name: Jhala, Ranjit last_name: Jhala - first_name: Ritankar full_name: Majumdar, Ritankar last_name: Majumdar - first_name: Shaz full_name: Qadeer, Shaz last_name: Qadeer citation: ama: 'Henzinger TA, Jhala R, Majumdar R, Qadeer S. Thread-modular abstraction refinement. In: Proceedings of the 15th International Conference on Computer Aided Verification. Vol 2725. Springer; 2003:262-274. doi:10.1007/978-3-540-45069-6_27' apa: 'Henzinger, T. A., Jhala, R., Majumdar, R., & Qadeer, S. (2003). Thread-modular abstraction refinement. In Proceedings of the 15th International Conference on Computer Aided Verification (Vol. 2725, pp. 262–274). Boulder, CO, USA: Springer. https://doi.org/10.1007/978-3-540-45069-6_27' chicago: Henzinger, Thomas A, Ranjit Jhala, Ritankar Majumdar, and Shaz Qadeer. “Thread-Modular Abstraction Refinement.” In Proceedings of the 15th International Conference on Computer Aided Verification, 2725:262–74. Springer, 2003. https://doi.org/10.1007/978-3-540-45069-6_27. ieee: T. A. Henzinger, R. Jhala, R. Majumdar, and S. Qadeer, “Thread-modular abstraction refinement,” in Proceedings of the 15th International Conference on Computer Aided Verification, Boulder, CO, USA, 2003, vol. 2725, pp. 262–274. ista: 'Henzinger TA, Jhala R, Majumdar R, Qadeer S. 2003. Thread-modular abstraction refinement. Proceedings of the 15th International Conference on Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 2725, 262–274.' mla: Henzinger, Thomas A., et al. “Thread-Modular Abstraction Refinement.” Proceedings of the 15th International Conference on Computer Aided Verification, vol. 2725, Springer, 2003, pp. 262–74, doi:10.1007/978-3-540-45069-6_27. short: T.A. Henzinger, R. Jhala, R. Majumdar, S. Qadeer, in:, Proceedings of the 15th International Conference on Computer Aided Verification, Springer, 2003, pp. 262–274. conference: end_date: 2003-07-12 location: Boulder, CO, USA name: 'CAV: Computer Aided Verification' start_date: 2003-07-08 date_created: 2018-12-11T12:08:59Z date_published: 2003-06-27T00:00:00Z date_updated: 2024-01-10T11:05:53Z day: '27' doi: 10.1007/978-3-540-45069-6_27 extern: '1' intvolume: ' 2725' language: - iso: eng month: '06' oa_version: None page: 262 - 274 publication: Proceedings of the 15th International Conference on Computer Aided Verification publication_identifier: isbn: - '9783540405245' publication_status: published publisher: Springer publist_id: '266' quality_controlled: '1' status: public title: Thread-modular abstraction refinement type: conference user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17 volume: 2725 year: '2003' ... --- _id: '4462' abstract: - lang: eng text: 'A major hurdle in the algorithmic verification and control of systems is the need to find suitable abstract models, which omit enough details to overcome the state-explosion problem, but retain enough details to exhibit satisfaction or controllability with respect to the specification. The paradigm of counterexample-guided abstraction refinement suggests a fully automatic way of finding suitable abstract models: one starts with a coarse abstraction, attempts to verify or control the abstract model, and if this attempt fails and the abstract counterexample does not correspond to a concrete counterexample, then one uses the spurious counterexample to guide the refinement of the abstract model. We present a counterexample-guided refinement algorithm for solving ω-regular control objectives. The main difficulty is that in control, unlike in verification, counterexamples are strategies in a game between system and controller. In the case that the controller has no choices, our scheme subsumes known counterexample-guided refinement algorithms for the verification of ω-regular specifications. Our algorithm is useful in all situations where ω-regular games need to be solved, such as supervisory control, sequential and program synthesis, and modular verification. The algorithm is fully symbolic, and therefore applicable also to infinite-state systems.' acknowledgement: This research was supported in part by the DARPA SEC grant F33615-C-98-3614, the ONR grant N00014-02-1-0671, and the NSF grants CCR-9988172, CCR-0085949, and CCR-0225610. alternative_title: - LNCS article_processing_charge: No author: - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 - first_name: Ranjit full_name: Jhala, Ranjit last_name: Jhala - first_name: Ritankar full_name: Majumdar, Ritankar last_name: Majumdar citation: ama: 'Henzinger TA, Jhala R, Majumdar R. Counterexample-guided control. In: Proceedings of the 30th International Colloquium on Automata, Languages and Programming. Vol 2719. Springer; 2003:886-902. doi:10.1007/3-540-45061-0_69' apa: 'Henzinger, T. A., Jhala, R., & Majumdar, R. (2003). Counterexample-guided control. In Proceedings of the 30th International Colloquium on Automata, Languages and Programming (Vol. 2719, pp. 886–902). Eindhoven, The Netherlands: Springer. https://doi.org/10.1007/3-540-45061-0_69' chicago: Henzinger, Thomas A, Ranjit Jhala, and Ritankar Majumdar. “Counterexample-Guided Control.” In Proceedings of the 30th International Colloquium on Automata, Languages and Programming, 2719:886–902. Springer, 2003. https://doi.org/10.1007/3-540-45061-0_69. ieee: T. A. Henzinger, R. Jhala, and R. Majumdar, “Counterexample-guided control,” in Proceedings of the 30th International Colloquium on Automata, Languages and Programming, Eindhoven, The Netherlands, 2003, vol. 2719, pp. 886–902. ista: 'Henzinger TA, Jhala R, Majumdar R. 2003. Counterexample-guided control. Proceedings of the 30th International Colloquium on Automata, Languages and Programming. ICALP: Automata, Languages and Programming, LNCS, vol. 2719, 886–902.' mla: Henzinger, Thomas A., et al. “Counterexample-Guided Control.” Proceedings of the 30th International Colloquium on Automata, Languages and Programming, vol. 2719, Springer, 2003, pp. 886–902, doi:10.1007/3-540-45061-0_69. short: T.A. Henzinger, R. Jhala, R. Majumdar, in:, Proceedings of the 30th International Colloquium on Automata, Languages and Programming, Springer, 2003, pp. 886–902. conference: end_date: 2003-07-04 location: Eindhoven, The Netherlands name: 'ICALP: Automata, Languages and Programming' start_date: 2003-06-30 date_created: 2018-12-11T12:08:58Z date_published: 2003-06-25T00:00:00Z date_updated: 2024-01-10T11:19:41Z day: '25' doi: 10.1007/3-540-45061-0_69 extern: '1' intvolume: ' 2719' language: - iso: eng month: '06' oa_version: None page: 886 - 902 publication: Proceedings of the 30th International Colloquium on Automata, Languages and Programming publication_identifier: isbn: - '9783540404934' publication_status: published publisher: Springer publist_id: '265' quality_controlled: '1' scopus_import: '1' status: public title: Counterexample-guided control type: conference user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17 volume: 2719 year: '2003' ... --- _id: '4464' abstract: - lang: eng text: We introduce the paradigm of schedule-carrying code (SCC). A hard real-time program can be executed on a given platform only if there exists a feasible schedule for the real-time tasks of the program. Traditionally, a scheduler determines the existence of a feasible schedule according to some scheduling strategy. With SCC, a compiler proves the existence of a feasible schedule by generating executable code that is attached to the program and represents its schedule. An SCC executable is a real-time program that carries its schedule as code, which is produced once and can be revalidated and executed with each use. We evaluate SCC both in theory and practice. In theory, we give two scenarios, of nonpreemptive and distributed scheduling for Giotto programs, where the generation of a feasible schedule is hard, while the validation of scheduling instructions that are attached to the programs is easy. In practice, we implement SCC and show that explicit scheduling instructions can reduce the scheduling overhead up to 35% and can provide an efficient, flexible, and verifiable means for compiling Giotto programs on complex architectures, such as the TTA. acknowledgement: This work was supported by the AFOSR MURI grant F49620-00-1-0327, the California MICRO grant 01-037, the DARPA grant F33615-C-98-3614, the MARCO grant 98-DT-660, and the NSF grants CCR-0208875, CCR-0085949, and CCR-0225610. alternative_title: - LNCS article_processing_charge: No author: - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 - first_name: Christoph full_name: Kirsch, Christoph last_name: Kirsch - first_name: Slobodan full_name: Matic, Slobodan last_name: Matic citation: ama: 'Henzinger TA, Kirsch C, Matic S. Schedule-carrying code. In: Proceedings of the 3rd International Conference on Embedded Software. Vol 2855. ACM; 2003:241-256. doi:10.1007/978-3-540-45212-6_16' apa: 'Henzinger, T. A., Kirsch, C., & Matic, S. (2003). Schedule-carrying code. In Proceedings of the 3rd International Conference on Embedded Software (Vol. 2855, pp. 241–256). Philadelphia, PA, USA: ACM. https://doi.org/10.1007/978-3-540-45212-6_16' chicago: Henzinger, Thomas A, Christoph Kirsch, and Slobodan Matic. “Schedule-Carrying Code.” In Proceedings of the 3rd International Conference on Embedded Software, 2855:241–56. ACM, 2003. https://doi.org/10.1007/978-3-540-45212-6_16. ieee: T. A. Henzinger, C. Kirsch, and S. Matic, “Schedule-carrying code,” in Proceedings of the 3rd International Conference on Embedded Software, Philadelphia, PA, USA, 2003, vol. 2855, pp. 241–256. ista: 'Henzinger TA, Kirsch C, Matic S. 2003. Schedule-carrying code. Proceedings of the 3rd International Conference on Embedded Software. EMSOFT: Embedded Software , LNCS, vol. 2855, 241–256.' mla: Henzinger, Thomas A., et al. “Schedule-Carrying Code.” Proceedings of the 3rd International Conference on Embedded Software, vol. 2855, ACM, 2003, pp. 241–56, doi:10.1007/978-3-540-45212-6_16. short: T.A. Henzinger, C. Kirsch, S. Matic, in:, Proceedings of the 3rd International Conference on Embedded Software, ACM, 2003, pp. 241–256. conference: end_date: 2003-10-15 location: Philadelphia, PA, USA name: 'EMSOFT: Embedded Software ' start_date: 2003-10-13 date_created: 2018-12-11T12:08:59Z date_published: 2003-09-29T00:00:00Z date_updated: 2024-01-10T11:33:57Z day: '29' doi: 10.1007/978-3-540-45212-6_16 extern: '1' intvolume: ' 2855' language: - iso: eng month: '09' oa_version: None page: 241 - 256 publication: Proceedings of the 3rd International Conference on Embedded Software publication_identifier: isbn: - '9783540202233' publication_status: published publisher: ACM publist_id: '267' quality_controlled: '1' scopus_import: '1' status: public title: Schedule-carrying code type: conference user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17 volume: 2855 year: '2003' ... --- _id: '4460' abstract: - lang: eng text: "Symbolic model checking, which enables the automatic verification of large systems, proceeds by calculating expressions that represent state sets. Traditionally, symbolic model-checking tools are based on back- ward state traversal; their basic operation is the function pre, which, given a set of states, returns the set of all predecessor states. This is because specifiers usually employ formalisms with future-time modalities, which are naturally evaluated by iterating applications of pre. It has been shown experimentally that symbolic model checking can perform significantly better if it is based, instead, on forward state traversal; in this case, the basic operation is the function post, which, given a set of states, returns the set of all successor states. This is because forward state traversal can ensure that only parts of the state space that are reachable from an initial state and relevant for the satisfaction or violation of the specification are explored; that is, errors can be detected as soon as possible.\r\nIn this paper, we investigate which specifications can be checked by symbolic forward state traversal. We formulate the problems of symbolic backward and forward model checking by means of two μ-calculi. The pre-μ calculus is based on the pre operation, and the post-μ calculus is based on the post operation. These two μ-calculi induce query logics, which augment fixpoint expressions with a boolean emptiness query. Using query logics, we are able to relate and compare the symbolic backward and forward approaches. In particular, we prove that all ω-regular (linear-time) specifications can be expressed as post-μ queries, and therefore checked using symbolic forward state traversal. On the other hand, we show that there are simple branching-time specifications that cannot be checked in this way." acknowledgement: This research was supported in part by the SRC contract 99-TJ-683.003 and the NSF grant CCR-9988172. article_processing_charge: No article_type: original author: - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 - first_name: Orna full_name: Kupferman, Orna last_name: Kupferman - first_name: Shaz full_name: Qadeer, Shaz last_name: Qadeer citation: ama: Henzinger TA, Kupferman O, Qadeer S. From pre-historic to post-modern symbolic model checking. Formal Methods in System Design. 2003;23(3):303-327. doi:10.1023/A:1026228213080 apa: Henzinger, T. A., Kupferman, O., & Qadeer, S. (2003). From pre-historic to post-modern symbolic model checking. Formal Methods in System Design. Springer. https://doi.org/10.1023/A:1026228213080 chicago: Henzinger, Thomas A, Orna Kupferman, and Shaz Qadeer. “From Pre-Historic to Post-Modern Symbolic Model Checking.” Formal Methods in System Design. Springer, 2003. https://doi.org/10.1023/A:1026228213080. ieee: T. A. Henzinger, O. Kupferman, and S. Qadeer, “From pre-historic to post-modern symbolic model checking,” Formal Methods in System Design, vol. 23, no. 3. Springer, pp. 303–327, 2003. ista: Henzinger TA, Kupferman O, Qadeer S. 2003. From pre-historic to post-modern symbolic model checking. Formal Methods in System Design. 23(3), 303–327. mla: Henzinger, Thomas A., et al. “From Pre-Historic to Post-Modern Symbolic Model Checking.” Formal Methods in System Design, vol. 23, no. 3, Springer, 2003, pp. 303–27, doi:10.1023/A:1026228213080. short: T.A. Henzinger, O. Kupferman, S. Qadeer, Formal Methods in System Design 23 (2003) 303–327. date_created: 2018-12-11T12:08:58Z date_published: 2003-06-20T00:00:00Z date_updated: 2024-01-10T11:50:31Z day: '20' doi: 10.1023/A:1026228213080 extern: '1' intvolume: ' 23' issue: '3' language: - iso: eng month: '06' oa_version: None page: 303 - 327 publication: Formal Methods in System Design publication_identifier: issn: - 0925-9856 publication_status: published publisher: Springer publist_id: '268' quality_controlled: '1' scopus_import: '1' status: public title: From pre-historic to post-modern symbolic model checking type: journal_article user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17 volume: 23 year: '2003' ... --- _id: '4469' abstract: - lang: eng text: Giotto provides an abstract programmer's model for the implementation of embedded control systems with hard real-time constraints. A typical control application consists of periodic software tasks together with a mode-switching logic for enabling and disabling tasks. Giotto specifies time-triggered sensor readings, task invocations, actuator updates, and mode switches independent of any implementation platform. Giotto can be annotated with platform constraints such as task-to-host mappings, and task and communication schedules. The annotations are directives for the Giotto compiler, but they do not alter the functionality and timing of a Giotto program. By separating the platform-independent from the platform-dependent concerns, Giotto enables a great deal of flexibility in choosing control platforms as well as a great deal of automation in the validation and synthesis of control software. The time-triggered nature of Giotto achieves timing predictability, which makes Giotto particularly suitable for safety-critical applications. acknowledgement: The authors would like to thank R. Majumdar for implementing a prototype Giotto compiler for Lego Mindstorms robots. They would like to thank D. Derevyanko and W. Williams for building the Intel x86 robots; and E. Lee and X. Liu for help with implementing Giotto as a “model of computation” in Ptolemy II [26]. Finally, they would also like to thank M. Sanvido for his suggestions on the design of the Giotto drivers; and P. Griffiths for implementing the functionality code of the electronic throttle controller. article_processing_charge: No article_type: original author: - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 - first_name: Benjamin full_name: Horowitz, Benjamin last_name: Horowitz - first_name: Christoph full_name: Kirsch, Christoph last_name: Kirsch citation: ama: 'Henzinger TA, Horowitz B, Kirsch C. Giotto: A time-triggered language for embedded programming. Proceedings of the IEEE. 2003;91(1):84-99. doi:10.1109/JPROC.2002.805825' apa: 'Henzinger, T. A., Horowitz, B., & Kirsch, C. (2003). Giotto: A time-triggered language for embedded programming. Proceedings of the IEEE. IEEE. https://doi.org/10.1109/JPROC.2002.805825' chicago: 'Henzinger, Thomas A, Benjamin Horowitz, and Christoph Kirsch. “Giotto: A Time-Triggered Language for Embedded Programming.” Proceedings of the IEEE. IEEE, 2003. https://doi.org/10.1109/JPROC.2002.805825.' ieee: 'T. A. Henzinger, B. Horowitz, and C. Kirsch, “Giotto: A time-triggered language for embedded programming,” Proceedings of the IEEE, vol. 91, no. 1. IEEE, pp. 84–99, 2003.' ista: 'Henzinger TA, Horowitz B, Kirsch C. 2003. Giotto: A time-triggered language for embedded programming. Proceedings of the IEEE. 91(1), 84–99.' mla: 'Henzinger, Thomas A., et al. “Giotto: A Time-Triggered Language for Embedded Programming.” Proceedings of the IEEE, vol. 91, no. 1, IEEE, 2003, pp. 84–99, doi:10.1109/JPROC.2002.805825.' short: T.A. Henzinger, B. Horowitz, C. Kirsch, Proceedings of the IEEE 91 (2003) 84–99. date_created: 2018-12-11T12:09:00Z date_published: 2003-01-29T00:00:00Z date_updated: 2024-01-10T11:55:18Z day: '29' doi: 10.1109/JPROC.2002.805825 extern: '1' intvolume: ' 91' issue: '1' language: - iso: eng month: '01' oa_version: None page: 84 - 99 publication: Proceedings of the IEEE publication_identifier: issn: - '0018-9219 ' publication_status: published publisher: IEEE publist_id: '261' quality_controlled: '1' scopus_import: '1' status: public title: 'Giotto: A time-triggered language for embedded programming' type: journal_article user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17 volume: 91 year: '2003' ... --- _id: '4338' abstract: - lang: eng text: 'Mosaic hybrid zones arise when ecologically differentiated taxa hybridize across a network of habitat patches. Frequent interbreeding across a small-scale patchwork can erode species differences that might have been preserved in a clinal hybrid zone. In particular, the rapid breakdown of neutral divergence sets an upper limit to the time for which differences at marker loci can persist. We present here a case study of a mosaic hybrid zone between the fire-bellied toads Bombina bombina and B. variegata (Anura: Discoglossidae) near Apahida in Romania. In our 20 × 20 km study area, we detected no evidence of a clinal transition but found a strong association between aquatic habitat and mean allele frequencies at four molecular markers. In particular, pure populations of B. bombina in ponds appear to cause massive introgression into the surrounding B. variegata gene pool found in temporary aquatic sites. Nevertheless, the genetic structure of these hybrid populations was remarkably similar to those of a previously studied transect near Pescenica (Croatia), which had both clinal and mosaic features: estimates of heterozygote deficit and linkage disequilibrium in each country are similar. In Apahida, the observed strong linkage disequilibria should stem from an imperfect habitat preference that guides most (but not all) adults into the habitats to which they are adapted. In the absence of a clinal structure, the inferred migration rate between habitats implies that associations between selected loci and neutral markers should break down rapidly. Although plausible selection strengths can maintain differentiation at those loci adapting the toads to either permanent or temporary breeding sites, the divergence at neutral markers must be transient. The hybrid zone may be approaching a state in which the gene pools are homogenized at all but the selected loci, not dissimilar from an early stage of sympatric divergence.' acknowledgement: "We thank G. Mara and T. Galbena for enthusiastic field\r\nassistance, A. Hofmann and R. Sieglstetter for access to their\r\nunpublished data, B. Fo¨rg-Brey and G. Praetzel for help in\r\nthe lab. Helpful comments on a previous version of the man-\r\nuscript were provided by R. Ennos, J. Szymura, F. Balloux,\r\nJ. Bridle, L. Kruuk, F. Bonhomme, M. Arnold, and two anon-\r\nymous reviewers. We also thank A. Pinggera for providing\r\nthe cover illustration. This work was supported by Natural\r\nEnvironment Research Council studentships to THV and TRS\r\nand Deutsche Forschungsgemeinschaft grant Nu 51/2-1 to BN." article_processing_charge: No article_type: original author: - first_name: Timothy full_name: Vines, Timothy last_name: Vines - first_name: S C full_name: Kohler, S C last_name: Kohler - first_name: M full_name: Thiel, M last_name: Thiel - first_name: Ioan full_name: Ghira, Ioan last_name: Ghira - first_name: T R full_name: Sands, T R last_name: Sands - first_name: Catriona full_name: Maccallum, Catriona last_name: Maccallum - first_name: Nicholas H full_name: Barton, Nicholas H id: 4880FE40-F248-11E8-B48F-1D18A9856A87 last_name: Barton orcid: 0000-0002-8548-5240 - first_name: Beate full_name: Nürnberger, Beate last_name: Nürnberger citation: ama: Vines T, Kohler SC, Thiel M, et al. On the maintenance of reproductive isolation in a mosaic hybrid zone between the toads Bombina bombina and B. variegata. Evolution. 2003;57(8):1876-1888. doi:10.1111/j.0014-3820.2003.tb00595.x apa: Vines, T., Kohler, S. C., Thiel, M., Ghira, I., Sands, T. R., Maccallum, C., … Nürnberger, B. (2003). On the maintenance of reproductive isolation in a mosaic hybrid zone between the toads Bombina bombina and B. variegata. Evolution. Wiley-Blackwell. https://doi.org/10.1111/j.0014-3820.2003.tb00595.x chicago: Vines, Timothy, S C Kohler, M Thiel, Ioan Ghira, T R Sands, Catriona Maccallum, Nicholas H Barton, and Beate Nürnberger. “On the Maintenance of Reproductive Isolation in a Mosaic Hybrid Zone between the Toads Bombina Bombina and B. Variegata.” Evolution. Wiley-Blackwell, 2003. https://doi.org/10.1111/j.0014-3820.2003.tb00595.x. ieee: T. Vines et al., “On the maintenance of reproductive isolation in a mosaic hybrid zone between the toads Bombina bombina and B. variegata,” Evolution, vol. 57, no. 8. Wiley-Blackwell, pp. 1876–1888, 2003. ista: Vines T, Kohler SC, Thiel M, Ghira I, Sands TR, Maccallum C, Barton NH, Nürnberger B. 2003. On the maintenance of reproductive isolation in a mosaic hybrid zone between the toads Bombina bombina and B. variegata. Evolution. 57(8), 1876–1888. mla: Vines, Timothy, et al. “On the Maintenance of Reproductive Isolation in a Mosaic Hybrid Zone between the Toads Bombina Bombina and B. Variegata.” Evolution, vol. 57, no. 8, Wiley-Blackwell, 2003, pp. 1876–88, doi:10.1111/j.0014-3820.2003.tb00595.x. short: T. Vines, S.C. Kohler, M. Thiel, I. Ghira, T.R. Sands, C. Maccallum, N.H. Barton, B. Nürnberger, Evolution 57 (2003) 1876–1888. date_created: 2018-12-11T12:08:20Z date_published: 2003-08-01T00:00:00Z date_updated: 2024-01-23T09:16:43Z day: '01' doi: 10.1111/j.0014-3820.2003.tb00595.x extern: '1' intvolume: ' 57' issue: '8' language: - iso: eng month: '08' oa_version: None page: 1876 - 1888 publication: Evolution publication_identifier: issn: - 0014-3820 publication_status: published publisher: Wiley-Blackwell publist_id: '1692' quality_controlled: '1' scopus_import: '1' status: public title: On the maintenance of reproductive isolation in a mosaic hybrid zone between the toads Bombina bombina and B. variegata type: journal_article user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17 volume: 57 year: '2003' ...