--- _id: '11125' abstract: - lang: eng text: Although nuclear envelope (NE) assembly is known to require the GTPase Ran, the membrane fusion machinery involved is uncharacterized. NE assembly involves formation of a reticular network on chromatin, fusion of this network into a closed NE and subsequent expansion. Here we show that p97, an AAA-ATPase previously implicated in fusion of Golgi and transitional endoplasmic reticulum (ER) membranes together with the adaptor p47, has two discrete functions in NE assembly. Formation of a closed NE requires the p97–Ufd1–Npl4 complex, not previously implicated in membrane fusion. Subsequent NE growth involves a p97–p47 complex. This study provides the first insights into the molecular mechanisms and specificity of fusion events involved in NE formation. article_processing_charge: No article_type: original author: - first_name: Martin W full_name: HETZER, Martin W id: 86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed last_name: HETZER orcid: 0000-0002-2111-992X - first_name: Hemmo H. full_name: Meyer, Hemmo H. last_name: Meyer - first_name: Tobias C. full_name: Walther, Tobias C. last_name: Walther - first_name: Daniel full_name: Bilbao-Cortes, Daniel last_name: Bilbao-Cortes - first_name: Graham full_name: Warren, Graham last_name: Warren - first_name: Iain W. full_name: Mattaj, Iain W. last_name: Mattaj citation: ama: Hetzer M, Meyer HH, Walther TC, Bilbao-Cortes D, Warren G, Mattaj IW. Distinct AAA-ATPase p97 complexes function in discrete steps of nuclear assembly. Nature Cell Biology. 2001;3(12):1086-1091. doi:10.1038/ncb1201-1086 apa: Hetzer, M., Meyer, H. H., Walther, T. C., Bilbao-Cortes, D., Warren, G., & Mattaj, I. W. (2001). Distinct AAA-ATPase p97 complexes function in discrete steps of nuclear assembly. Nature Cell Biology. Springer Nature. https://doi.org/10.1038/ncb1201-1086 chicago: Hetzer, Martin, Hemmo H. Meyer, Tobias C. Walther, Daniel Bilbao-Cortes, Graham Warren, and Iain W. Mattaj. “Distinct AAA-ATPase P97 Complexes Function in Discrete Steps of Nuclear Assembly.” Nature Cell Biology. Springer Nature, 2001. https://doi.org/10.1038/ncb1201-1086. ieee: M. Hetzer, H. H. Meyer, T. C. Walther, D. Bilbao-Cortes, G. Warren, and I. W. Mattaj, “Distinct AAA-ATPase p97 complexes function in discrete steps of nuclear assembly,” Nature Cell Biology, vol. 3, no. 12. Springer Nature, pp. 1086–1091, 2001. ista: Hetzer M, Meyer HH, Walther TC, Bilbao-Cortes D, Warren G, Mattaj IW. 2001. Distinct AAA-ATPase p97 complexes function in discrete steps of nuclear assembly. Nature Cell Biology. 3(12), 1086–1091. mla: Hetzer, Martin, et al. “Distinct AAA-ATPase P97 Complexes Function in Discrete Steps of Nuclear Assembly.” Nature Cell Biology, vol. 3, no. 12, Springer Nature, 2001, pp. 1086–91, doi:10.1038/ncb1201-1086. short: M. Hetzer, H.H. Meyer, T.C. Walther, D. Bilbao-Cortes, G. Warren, I.W. Mattaj, Nature Cell Biology 3 (2001) 1086–1091. date_created: 2022-04-07T07:57:42Z date_published: 2001-11-02T00:00:00Z date_updated: 2022-07-18T08:58:07Z day: '02' doi: 10.1038/ncb1201-1086 extern: '1' external_id: pmid: - '11781570' intvolume: ' 3' issue: '12' keyword: - Cell Biology language: - iso: eng month: '11' oa_version: None page: 1086-1091 pmid: 1 publication: Nature Cell Biology publication_identifier: eissn: - 1476-4679 issn: - 1465-7392 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Distinct AAA-ATPase p97 complexes function in discrete steps of nuclear assembly type: journal_article user_id: 72615eeb-f1f3-11ec-aa25-d4573ddc34fd volume: 3 year: '2001' ... --- _id: '11892' abstract: - lang: eng text: "We present the first fully dynamic algorithm for maintaining a minimum spanning forest in time \U0001D45C(\U0001D45B√) per operation. To be precise, the algorithm uses O(n1/3 log n) amortized time per update operation. The algorithm is fairly simple and deterministic. An immediate consequence is the first fully dynamic deterministic algorithm for maintaining connectivity and bipartiteness in amortized time O(n1/3 log n) per update, with O(1) worst case time per query." article_processing_charge: No article_type: original author: - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Valerie full_name: King, Valerie last_name: King citation: ama: Henzinger MH, King V. Maintaining minimum spanning forests in dynamic graphs. SIAM Journal on Computing. 2001;31(2):364-374. doi:10.1137/s0097539797327209 apa: Henzinger, M. H., & King, V. (2001). Maintaining minimum spanning forests in dynamic graphs. SIAM Journal on Computing. Society for Industrial & Applied Mathematics. https://doi.org/10.1137/s0097539797327209 chicago: Henzinger, Monika H, and Valerie King. “Maintaining Minimum Spanning Forests in Dynamic Graphs.” SIAM Journal on Computing. Society for Industrial & Applied Mathematics, 2001. https://doi.org/10.1137/s0097539797327209. ieee: M. H. Henzinger and V. King, “Maintaining minimum spanning forests in dynamic graphs,” SIAM Journal on Computing, vol. 31, no. 2. Society for Industrial & Applied Mathematics, pp. 364–374, 2001. ista: Henzinger MH, King V. 2001. Maintaining minimum spanning forests in dynamic graphs. SIAM Journal on Computing. 31(2), 364–374. mla: Henzinger, Monika H., and Valerie King. “Maintaining Minimum Spanning Forests in Dynamic Graphs.” SIAM Journal on Computing, vol. 31, no. 2, Society for Industrial & Applied Mathematics, 2001, pp. 364–74, doi:10.1137/s0097539797327209. short: M.H. Henzinger, V. King, SIAM Journal on Computing 31 (2001) 364–374. date_created: 2022-08-17T08:43:43Z date_published: 2001-03-01T00:00:00Z date_updated: 2023-02-17T14:24:55Z day: '01' doi: 10.1137/s0097539797327209 extern: '1' intvolume: ' 31' issue: '2' language: - iso: eng month: '03' oa_version: None page: 364-374 publication: SIAM Journal on Computing publication_identifier: eissn: - 1095-7111 issn: - 0097-5397 publication_status: published publisher: Society for Industrial & Applied Mathematics quality_controlled: '1' scopus_import: '1' status: public title: Maintaining minimum spanning forests in dynamic graphs type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 31 year: '2001' ... --- _id: '11914' abstract: - lang: eng text: 'Previous studies of the Web graph structure have focused on the graph structure at the level of individual pages. In actuality the Web is a hierarchically nested graph, with domains, hosts and Web sites introducing intermediate levels of affiliation and administrative control. To better understand the growth of the Web we need to understand its macro-structure, in terms of the linkage between Web sites. We approximate this by studying the graph of the linkage between hosts on the Web. This was done based on snapshots of the Web taken by Google in Oct 1999, Aug 2000 and Jun 2001. The connectivity between hosts is represented by a directed graph, with hosts as nodes and weighted edges representing the count of hyperlinks between pages on the corresponding hosts. We demonstrate how such a "hostgraph" can be used to study connectivity properties of hosts and domains over time, and discuss a modified "copy model" to explain observed link weight distributions as a function of subgraph size. We discuss changes in the Web over time in the size and connectivity of Web sites and country domains. We also describe a data mining application of the hostgraph: a related host finding algorithm which achieves a precision of 0.65 at rank 3.' article_processing_charge: No author: - first_name: K. full_name: Bharat, K. last_name: Bharat - first_name: Bay-Wei full_name: Chang, Bay-Wei last_name: Chang - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: M. full_name: Ruhl, M. last_name: Ruhl citation: ama: 'Bharat K, Chang B-W, Henzinger MH, Ruhl M. Who links to whom: Mining linkage between Web sites. In: 1st IEEE International Conference on Data Mining. Institute of Electrical and Electronics Engineers; 2001:51-58. doi:10.1109/ICDM.2001.989500' apa: 'Bharat, K., Chang, B.-W., Henzinger, M. H., & Ruhl, M. (2001). Who links to whom: Mining linkage between Web sites. In 1st IEEE International Conference on Data Mining (pp. 51–58). San Jose, CA, United States: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/ICDM.2001.989500' chicago: 'Bharat, K., Bay-Wei Chang, Monika H Henzinger, and M. Ruhl. “Who Links to Whom: Mining Linkage between Web Sites.” In 1st IEEE International Conference on Data Mining, 51–58. Institute of Electrical and Electronics Engineers, 2001. https://doi.org/10.1109/ICDM.2001.989500.' ieee: 'K. Bharat, B.-W. Chang, M. H. Henzinger, and M. Ruhl, “Who links to whom: Mining linkage between Web sites,” in 1st IEEE International Conference on Data Mining, San Jose, CA, United States, 2001, pp. 51–58.' ista: 'Bharat K, Chang B-W, Henzinger MH, Ruhl M. 2001. Who links to whom: Mining linkage between Web sites. 1st IEEE International Conference on Data Mining. ICMD: International Conference on Data Mining, 51–58.' mla: 'Bharat, K., et al. “Who Links to Whom: Mining Linkage between Web Sites.” 1st IEEE International Conference on Data Mining, Institute of Electrical and Electronics Engineers, 2001, pp. 51–58, doi:10.1109/ICDM.2001.989500.' short: K. Bharat, B.-W. Chang, M.H. Henzinger, M. Ruhl, in:, 1st IEEE International Conference on Data Mining, Institute of Electrical and Electronics Engineers, 2001, pp. 51–58. conference: end_date: 2001-12-02 location: San Jose, CA, United States name: 'ICMD: International Conference on Data Mining' start_date: 2001-11-29 date_created: 2022-08-18T07:12:46Z date_published: 2001-12-01T00:00:00Z date_updated: 2023-02-17T09:59:47Z day: '01' doi: 10.1109/ICDM.2001.989500 extern: '1' language: - iso: eng month: '12' oa_version: None page: 51-58 publication: 1st IEEE International Conference on Data Mining publication_identifier: isbn: - 0-7695-1119-8 issn: - '15504786' publication_status: published publisher: Institute of Electrical and Electronics Engineers quality_controlled: '1' scopus_import: '1' status: public title: 'Who links to whom: Mining linkage between Web sites' type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2001' ... --- _id: '3507' abstract: - lang: eng text: A molecular classification method is based on a space filling description of a molecule. The three dimensional body corresponding to the space filling molecular structure is divided into Voronoi regions to provide a basis for efficiently processing local structural information. A Delaunay triangulation provides a basis for systematically processing information relating to the Voronoi regions into shape descriptors in the form of topological elements. Preferably, additional shape and/or property descriptors are included in the classification method. The classification methods generally are used to identify similarities between molecules that can be used as property predictors for a variety of applications. Generally, the property predictions are the basis for selection of compounds for incorporation into efficacy evaluations. applicant: - Jie Liang, Herbert Edelsbrunner article_processing_charge: No author: - first_name: Jie full_name: Liang, Jie last_name: Liang - first_name: Herbert full_name: Edelsbrunner, Herbert id: 3FB178DA-F248-11E8-B48F-1D18A9856A87 last_name: Edelsbrunner orcid: 0000-0002-9823-6833 citation: ama: Liang J, Edelsbrunner H. Molecular classification for property prediction. 2001. apa: Liang, J., & Edelsbrunner, H. (2001). Molecular classification for property prediction. chicago: Liang, Jie, and Herbert Edelsbrunner. “Molecular Classification for Property Prediction,” 2001. ieee: J. Liang and H. Edelsbrunner, “Molecular classification for property prediction.” 2001. ista: Liang J, Edelsbrunner H. 2001. Molecular classification for property prediction. mla: Liang, Jie, and Herbert Edelsbrunner. Molecular Classification for Property Prediction. 2001. short: J. Liang, H. Edelsbrunner, (2001). date_created: 2018-12-11T12:03:41Z date_published: 2001-01-30T00:00:00Z date_updated: 2022-01-05T15:12:42Z day: '30' extern: '1' ipc: G16C20/70 ; G16B15/00 ipn: US6182016B1 main_file_link: - open_access: '1' url: https://patents.google.com/patent/US6182016B1 month: '01' oa: 1 oa_version: Published Version publication_date: 2001-01-30 publist_id: '2880' status: public title: Molecular classification for property prediction type: patent user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2001' ... --- _id: '3586' abstract: - lang: eng text: The book combines topics in mathematics (geometry and topology), computer science (algorithms), and engineering (mesh generation). The original motivation for these topics was the difficulty faced (both conceptually and in the technical execution) in any attempt to combine elements of combinatorial and of numerical algorithms. Mesh generation is a topic where a meaningful combination of these different approaches to problem solving is inevitable. The book develops methods from both areas that are amenable to combination, and explains recent breakthrough solutions to meshing that fit into this category.The book should be an ideal graduate text for courses on mesh generation. The specific material is selected giving preference to topics that are elementary, attractive, lend themselves to teaching, useful, and interesting. article_processing_charge: No author: - first_name: Herbert full_name: Edelsbrunner, Herbert id: 3FB178DA-F248-11E8-B48F-1D18A9856A87 last_name: Edelsbrunner orcid: 0000-0002-9823-6833 citation: ama: Edelsbrunner H. Geometry and Topology for Mesh Generation. Vol 7. Cambridge University Press; 2001. doi:10.1017/CBO9780511530067 apa: Edelsbrunner, H. (2001). Geometry and Topology for Mesh Generation (Vol. 7). Cambridge University Press. https://doi.org/10.1017/CBO9780511530067 chicago: Edelsbrunner, Herbert. Geometry and Topology for Mesh Generation. Vol. 7. Cambridge Monographs on Applied and Computational Mathematics. Cambridge University Press, 2001. https://doi.org/10.1017/CBO9780511530067. ieee: H. Edelsbrunner, Geometry and Topology for Mesh Generation, vol. 7. Cambridge University Press, 2001. ista: Edelsbrunner H. 2001. Geometry and Topology for Mesh Generation, Cambridge University Press, 190p. mla: Edelsbrunner, Herbert. Geometry and Topology for Mesh Generation. Vol. 7, Cambridge University Press, 2001, doi:10.1017/CBO9780511530067. short: H. Edelsbrunner, Geometry and Topology for Mesh Generation, Cambridge University Press, 2001. date_created: 2018-12-11T12:04:06Z date_published: 2001-05-28T00:00:00Z date_updated: 2021-12-22T08:46:46Z day: '28' doi: 10.1017/CBO9780511530067 extern: '1' intvolume: ' 7' language: - iso: eng month: '05' oa_version: None page: '190' publication_identifier: eisbn: - ' 978-0-5115-3006-7' isbn: - 0-521-79309-2 publication_status: published publisher: Cambridge University Press publist_id: '2798' quality_controlled: '1' related_material: link: - description: available via catalog IST BookList relation: other url: https://koha.app.ist.ac.at/cgi-bin/koha/opac-detail.pl?biblionumber=3508 series_title: Cambridge Monographs on Applied and Computational Mathematics status: public title: Geometry and Topology for Mesh Generation type: book user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 volume: 7 year: '2001' ... --- _id: '3447' author: - first_name: Krishnendu full_name: Krishnendu Chatterjee id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Pallab full_name: Dasgupta, Pallab last_name: Dasgupta - first_name: Partha full_name: Chakrabarti, Partha P last_name: Chakrabarti citation: ama: 'Chatterjee K, Dasgupta P, Chakrabarti P. Weighted quantified computation tree logic. In: Elsevier; 2001.' apa: 'Chatterjee, K., Dasgupta, P., & Chakrabarti, P. (2001). Weighted quantified computation tree logic. Presented at the CIT: Conference on Information Technology, Elsevier.' chicago: Chatterjee, Krishnendu, Pallab Dasgupta, and Partha Chakrabarti. “Weighted Quantified Computation Tree Logic.” Elsevier, 2001. ieee: 'K. Chatterjee, P. Dasgupta, and P. Chakrabarti, “Weighted quantified computation tree logic,” presented at the CIT: Conference on Information Technology, 2001.' ista: 'Chatterjee K, Dasgupta P, Chakrabarti P. 2001. Weighted quantified computation tree logic. CIT: Conference on Information Technology.' mla: Chatterjee, Krishnendu, et al. Weighted Quantified Computation Tree Logic. Elsevier, 2001. short: K. Chatterjee, P. Dasgupta, P. Chakrabarti, in:, Elsevier, 2001. conference: name: 'CIT: Conference on Information Technology' date_created: 2018-12-11T12:03:23Z date_published: 2001-11-14T00:00:00Z date_updated: 2021-01-12T07:43:31Z day: '14' extern: 1 month: '11' publication_status: published publisher: Elsevier publist_id: '2940' quality_controlled: 0 status: public title: Weighted quantified computation tree logic type: conference year: '2001' ... --- _id: '8522' abstract: - lang: eng text: For diffeomorphisms of smooth compact manifolds, we consider the problem of how fast the number of periodic points with period $n$grows as a function of $n$. In many familiar cases (e.g., Anosov systems) the growth is exponential, but arbitrarily fast growth is possible; in fact, the first author has shown that arbitrarily fast growth is topologically (Baire) generic for $C^2$ or smoother diffeomorphisms. In the present work we show that, by contrast, for a measure-theoretic notion of genericity we call ``prevalence'', the growth is not much faster than exponential. Specifically, we show that for each $\delta > 0$, there is a prevalent set of ( $C^{1+\rho}$ or smoother) diffeomorphisms for which the number of period $n$ points is bounded above by $\operatorname{exp}(C n^{1+\delta})$ for some $C$ independent of $n$. We also obtain a related bound on the decay of the hyperbolicity of the periodic points as a function of $n$. The contrast between topologically generic and measure-theoretically generic behavior for the growth of the number of periodic points and the decay of their hyperbolicity shows this to be a subtle and complex phenomenon, reminiscent of KAM theory. 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 - first_name: Brian R. full_name: Hunt, Brian R. last_name: Hunt citation: ama: Kaloshin V, Hunt BR. A stretched exponential bound on the rate of growth of the number of periodic points for prevalent diffeomorphisms I. Electronic Research Announcements of the American Mathematical Society. 2001;7(4):17-27. doi:10.1090/s1079-6762-01-00090-7 apa: Kaloshin, V., & Hunt, B. R. (2001). A stretched exponential bound on the rate of growth of the number of periodic points for prevalent diffeomorphisms I. Electronic Research Announcements of the American Mathematical Society. American Mathematical Society. https://doi.org/10.1090/s1079-6762-01-00090-7 chicago: Kaloshin, Vadim, and Brian R. Hunt. “A Stretched Exponential Bound on the Rate of Growth of the Number of Periodic Points for Prevalent Diffeomorphisms I.” Electronic Research Announcements of the American Mathematical Society. American Mathematical Society, 2001. https://doi.org/10.1090/s1079-6762-01-00090-7. ieee: V. Kaloshin and B. R. Hunt, “A stretched exponential bound on the rate of growth of the number of periodic points for prevalent diffeomorphisms I,” Electronic Research Announcements of the American Mathematical Society, vol. 7, no. 4. American Mathematical Society, pp. 17–27, 2001. ista: Kaloshin V, Hunt BR. 2001. A stretched exponential bound on the rate of growth of the number of periodic points for prevalent diffeomorphisms I. Electronic Research Announcements of the American Mathematical Society. 7(4), 17–27. mla: Kaloshin, Vadim, and Brian R. Hunt. “A Stretched Exponential Bound on the Rate of Growth of the Number of Periodic Points for Prevalent Diffeomorphisms I.” Electronic Research Announcements of the American Mathematical Society, vol. 7, no. 4, American Mathematical Society, 2001, pp. 17–27, doi:10.1090/s1079-6762-01-00090-7. short: V. Kaloshin, B.R. Hunt, Electronic Research Announcements of the American Mathematical Society 7 (2001) 17–27. date_created: 2020-09-18T10:49:56Z date_published: 2001-04-18T00:00:00Z date_updated: 2021-01-12T08:19:51Z day: '18' doi: 10.1090/s1079-6762-01-00090-7 extern: '1' intvolume: ' 7' issue: '4' keyword: - General Mathematics language: - iso: eng month: '04' oa_version: None page: 17-27 publication: Electronic Research Announcements of the American Mathematical Society publication_identifier: issn: - 1079-6762 publication_status: published publisher: American Mathematical Society quality_controlled: '1' status: public title: A stretched exponential bound on the rate of growth of the number of periodic points for prevalent diffeomorphisms I type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 7 year: '2001' ... --- _id: '8521' abstract: - lang: eng text: We continue the previous article's discussion of bounds, for prevalent diffeomorphisms of smooth compact manifolds, on the growth of the number of periodic points and the decay of their hyperbolicity as a function of their period $n$. In that article we reduced the main results to a problem, for certain families of diffeomorphisms, of bounding the measure of parameter values for which the diffeomorphism has (for a given period $n$) an almost periodic point that is almost nonhyperbolic. We also formulated our results for $1$-dimensional endomorphisms on a compact interval. In this article we describe some of the main techniques involved and outline the rest of the proof. To simplify notation, we concentrate primarily on the $1$-dimensional case. 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 - first_name: Brian R. full_name: Hunt, Brian R. last_name: Hunt citation: ama: Kaloshin V, Hunt BR. A stretched exponential bound on the rate of growth of the number of periodic points for prevalent diffeomorphisms II. Electronic Research Announcements of the American Mathematical Society. 2001;7(5):28-36. doi:10.1090/s1079-6762-01-00091-9 apa: Kaloshin, V., & Hunt, B. R. (2001). A stretched exponential bound on the rate of growth of the number of periodic points for prevalent diffeomorphisms II. Electronic Research Announcements of the American Mathematical Society. American Mathematical Society. https://doi.org/10.1090/s1079-6762-01-00091-9 chicago: Kaloshin, Vadim, and Brian R. Hunt. “A Stretched Exponential Bound on the Rate of Growth of the Number of Periodic Points for Prevalent Diffeomorphisms II.” Electronic Research Announcements of the American Mathematical Society. American Mathematical Society, 2001. https://doi.org/10.1090/s1079-6762-01-00091-9. ieee: V. Kaloshin and B. R. Hunt, “A stretched exponential bound on the rate of growth of the number of periodic points for prevalent diffeomorphisms II,” Electronic Research Announcements of the American Mathematical Society, vol. 7, no. 5. American Mathematical Society, pp. 28–36, 2001. ista: Kaloshin V, Hunt BR. 2001. A stretched exponential bound on the rate of growth of the number of periodic points for prevalent diffeomorphisms II. Electronic Research Announcements of the American Mathematical Society. 7(5), 28–36. mla: Kaloshin, Vadim, and Brian R. Hunt. “A Stretched Exponential Bound on the Rate of Growth of the Number of Periodic Points for Prevalent Diffeomorphisms II.” Electronic Research Announcements of the American Mathematical Society, vol. 7, no. 5, American Mathematical Society, 2001, pp. 28–36, doi:10.1090/s1079-6762-01-00091-9. short: V. Kaloshin, B.R. Hunt, Electronic Research Announcements of the American Mathematical Society 7 (2001) 28–36. date_created: 2020-09-18T10:49:43Z date_published: 2001-04-24T00:00:00Z date_updated: 2021-01-12T08:19:51Z day: '24' doi: 10.1090/s1079-6762-01-00091-9 extern: '1' intvolume: ' 7' issue: '5' keyword: - General Mathematics language: - iso: eng month: '04' oa_version: None page: 28-36 publication: Electronic Research Announcements of the American Mathematical Society publication_identifier: issn: - 1079-6762 publication_status: published publisher: American Mathematical Society quality_controlled: '1' status: public title: A stretched exponential bound on the rate of growth of the number of periodic points for prevalent diffeomorphisms II type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 7 year: '2001' ... --- _id: '8524' abstract: - lang: eng text: 'A number α∈R is diophantine if it is not well approximable by rationals, i.e. for some C,ε>0 and any relatively prime p,q∈Z we have |αq−p|>Cq−1−ε. It is well-known and is easy to prove that almost every α in R is diophantine. In this paper we address a noncommutative version of the diophantine properties. Consider a pair A,B∈SO(3) and for each n∈Z+ take all possible words in A, A -1, B, and B - 1 of length n, i.e. for a multiindex I=(i1,i1,…,im,jm) define |I|=∑mk=1(|ik|+|jk|)=n and \( W_n(A,B ) = \{W_{\cal I}(A,B) = A^{i_1} B^{j_1} \dots A^{i_m} B^{j_m}\}_{|{\cal I|}=n \).¶Gamburd—Jakobson—Sarnak [GJS] raised the problem: prove that for Haar almost every pair A,B∈SO(3) the closest distance of words of length n to the identity, i.e. sA,B(n)=min|I|=n∥WI(A,B)−E∥, is bounded from below by an exponential function in n. This is the analog of the diophantine property for elements of SO(3). In this paper we prove that s A,B (n) is bounded from below by an exponential function in n 2. We also exhibit obstructions to a “simple” proof of the exponential estimate in n.' 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 - first_name: I. full_name: Rodnianski, I. last_name: Rodnianski citation: ama: Kaloshin V, Rodnianski I. Diophantine properties of elements of SO(3). Geometric And Functional Analysis. 2001;11(5):953-970. doi:10.1007/s00039-001-8222-8 apa: Kaloshin, V., & Rodnianski, I. (2001). Diophantine properties of elements of SO(3). Geometric And Functional Analysis. Springer Nature. https://doi.org/10.1007/s00039-001-8222-8 chicago: Kaloshin, Vadim, and I. Rodnianski. “Diophantine Properties of Elements of SO(3).” Geometric And Functional Analysis. Springer Nature, 2001. https://doi.org/10.1007/s00039-001-8222-8. ieee: V. Kaloshin and I. Rodnianski, “Diophantine properties of elements of SO(3),” Geometric And Functional Analysis, vol. 11, no. 5. Springer Nature, pp. 953–970, 2001. ista: Kaloshin V, Rodnianski I. 2001. Diophantine properties of elements of SO(3). Geometric And Functional Analysis. 11(5), 953–970. mla: Kaloshin, Vadim, and I. Rodnianski. “Diophantine Properties of Elements of SO(3).” Geometric And Functional Analysis, vol. 11, no. 5, Springer Nature, 2001, pp. 953–70, doi:10.1007/s00039-001-8222-8. short: V. Kaloshin, I. Rodnianski, Geometric And Functional Analysis 11 (2001) 953–970. date_created: 2020-09-18T10:50:11Z date_published: 2001-12-01T00:00:00Z date_updated: 2021-01-12T08:19:52Z day: '01' doi: 10.1007/s00039-001-8222-8 extern: '1' intvolume: ' 11' issue: '5' language: - iso: eng month: '12' oa_version: None page: 953-970 publication: Geometric And Functional Analysis publication_identifier: issn: - 1016-443X - 1420-8970 publication_status: published publisher: Springer Nature quality_controlled: '1' status: public title: Diophantine properties of elements of SO(3) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 11 year: '2001' ... --- _id: '9444' abstract: - lang: eng text: Epigenetic silenced alleles of the Arabidopsis SUPERMANlocus (the clark kent alleles) are associated with dense hypermethylation at noncanonical cytosines (CpXpG and asymmetric sites, where X = A, T, C, or G). A genetic screen for suppressors of a hypermethylated clark kent mutant identified nine loss-of-function alleles of CHROMOMETHYLASE3(CMT3), a novel cytosine methyltransferase homolog. These cmt3 mutants display a wild-type morphology but exhibit decreased CpXpG methylation of the SUP gene and of other sequences throughout the genome. They also show reactivated expression of endogenous retrotransposon sequences. These results show that a non-CpG DNA methyltransferase is responsible for maintaining epigenetic gene silencing. article_processing_charge: No article_type: original author: - first_name: A. M. full_name: Lindroth, A. M. last_name: Lindroth - first_name: Xiaofeng full_name: Cao, Xiaofeng last_name: Cao - first_name: James P. full_name: Jackson, James P. last_name: Jackson - first_name: Daniel full_name: Zilberman, Daniel id: 6973db13-dd5f-11ea-814e-b3e5455e9ed1 last_name: Zilberman orcid: 0000-0002-0123-8649 - first_name: Claire M. full_name: McCallum, Claire M. last_name: McCallum - first_name: Steven full_name: Henikoff, Steven last_name: Henikoff - first_name: Steven E. full_name: Jacobsen, Steven E. last_name: Jacobsen citation: ama: Lindroth AM, Cao X, Jackson JP, et al. Requirement of CHROMOMETHYLASE3 for maintenance of CpXpG methylation. Science. 2001;292(5524):2077-2080. doi:10.1126/science.1059745 apa: Lindroth, A. M., Cao, X., Jackson, J. P., Zilberman, D., McCallum, C. M., Henikoff, S., & Jacobsen, S. E. (2001). Requirement of CHROMOMETHYLASE3 for maintenance of CpXpG methylation. Science. American Association for the Advancement of Science. https://doi.org/10.1126/science.1059745 chicago: Lindroth, A. M., Xiaofeng Cao, James P. Jackson, Daniel Zilberman, Claire M. McCallum, Steven Henikoff, and Steven E. Jacobsen. “Requirement of CHROMOMETHYLASE3 for Maintenance of CpXpG Methylation.” Science. American Association for the Advancement of Science, 2001. https://doi.org/10.1126/science.1059745. ieee: A. M. Lindroth et al., “Requirement of CHROMOMETHYLASE3 for maintenance of CpXpG methylation,” Science, vol. 292, no. 5524. American Association for the Advancement of Science, pp. 2077–2080, 2001. ista: Lindroth AM, Cao X, Jackson JP, Zilberman D, McCallum CM, Henikoff S, Jacobsen SE. 2001. Requirement of CHROMOMETHYLASE3 for maintenance of CpXpG methylation. Science. 292(5524), 2077–2080. mla: Lindroth, A. M., et al. “Requirement of CHROMOMETHYLASE3 for Maintenance of CpXpG Methylation.” Science, vol. 292, no. 5524, American Association for the Advancement of Science, 2001, pp. 2077–80, doi:10.1126/science.1059745. short: A.M. Lindroth, X. Cao, J.P. Jackson, D. Zilberman, C.M. McCallum, S. Henikoff, S.E. Jacobsen, Science 292 (2001) 2077–2080. date_created: 2021-06-02T13:35:16Z date_published: 2001-06-15T00:00:00Z date_updated: 2021-12-14T08:40:32Z day: '15' department: - _id: DaZi doi: 10.1126/science.1059745 extern: '1' external_id: pmid: - '11349138' intvolume: ' 292' issue: '5524' keyword: - Multidisciplinary language: - iso: eng month: '06' oa_version: None page: 2077-2080 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: Requirement of CHROMOMETHYLASE3 for maintenance of CpXpG methylation type: journal_article user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 volume: 292 year: '2001' ... --- _id: '4634' abstract: - lang: eng text: "A controller is an environment for a system that achieves a particular control objective by providing inputs to the system without constraining the choices of the system. For synchronous systems, where system and controller make simultaneous and interdependent choices, the notion that a controller must not constrain the choices of the system can be formalized by type systems for composability. In a previous paper, we solved the control problem for static and dynamic types: a static type is a dependency relation between inputs and outputs, and composition is well-typed if it does not introduce cyclic dependencies; a dynamic type is a set of static types, one for each state. Static and dynamic types, however, cannot capture many important digital circuits, such as gated clocks, bidirectional buses, and random-access memory. We therefore introduce more general type systems, so-called dependent and bidirectional types, for modeling these situations, and we solve the corresponding control problems.\r\nIn a system with a dependent type, the dependencies between inputs and outputs are determined gradually through a game of the system against the controller. In a system with a bidirectional type, also the distinction between inputs and outputs is resolved dynamically by such a game. The game proceeds in several rounds. In each round the system and the controller choose to update some variables dependent on variables that have already been updated. The solution of the control problem for dependent and bidirectional types is based on algorithms for solving these games." acknowledgement: This research was supported in part by the SRC contract 99-TJ-683.003, the DARPA SEC grant F33615-C-98-3614, the MARCO GSRC grant 98-DT-660, the AFOSR MURI grant F49620-00-1-0327, and the NSF Theory grant CCR-9988172. 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: Freddy full_name: Mang, Freddy last_name: Mang citation: ama: 'De Alfaro L, Henzinger TA, Mang F. The control of synchronous systems, Part II. In: Proceedings of the 12th International Conference on on Concurrency Theory. Vol 2154. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2001:566-581. doi:10.1007/3-540-44685-0_38' apa: 'De Alfaro, L., Henzinger, T. A., & Mang, F. (2001). The control of synchronous systems, Part II. In Proceedings of the 12th International Conference on on Concurrency Theory (Vol. 2154, pp. 566–581). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/3-540-44685-0_38' chicago: De Alfaro, Luca, Thomas A Henzinger, and Freddy Mang. “The Control of Synchronous Systems, Part II.” In Proceedings of the 12th International Conference on on Concurrency Theory, 2154:566–81. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2001. https://doi.org/10.1007/3-540-44685-0_38. ieee: L. De Alfaro, T. A. Henzinger, and F. Mang, “The control of synchronous systems, Part II,” in Proceedings of the 12th International Conference on on Concurrency Theory, Aalborg, Denmark, 2001, vol. 2154, pp. 566–581. ista: 'De Alfaro L, Henzinger TA, Mang F. 2001. The control of synchronous systems, Part II. Proceedings of the 12th International Conference on on Concurrency Theory. CONCUR: Concurrency Theory, LNCS, vol. 2154, 566–581.' mla: De Alfaro, Luca, et al. “The Control of Synchronous Systems, Part II.” Proceedings of the 12th International Conference on on Concurrency Theory, vol. 2154, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2001, pp. 566–81, doi:10.1007/3-540-44685-0_38. short: L. De Alfaro, T.A. Henzinger, F. Mang, in:, Proceedings of the 12th International Conference on on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2001, pp. 566–581. conference: end_date: 2001-08-25 location: Aalborg, Denmark name: 'CONCUR: Concurrency Theory' start_date: 2001-08-20 date_created: 2018-12-11T12:09:52Z date_published: 2001-08-13T00:00:00Z date_updated: 2023-05-08T10:20:19Z day: '13' doi: 10.1007/3-540-44685-0_38 extern: '1' intvolume: ' 2154' language: - iso: eng month: '08' oa_version: None page: 566 - 581 publication: Proceedings of the 12th International Conference on on Concurrency Theory publication_identifier: isbn: - '9783540424970' publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik publist_id: '74' quality_controlled: '1' scopus_import: '1' status: public title: The control of synchronous systems, Part II type: conference user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17 volume: 2154 year: '2001' ... --- _id: '4633' abstract: - lang: eng text: "A procedure for the analysis of state spaces is called symbolic if it manipulates not individual states, but sets of states that are represented by constraints. Such a procedure can be used for the analysis of infinite state spaces, provided termination is guaranteed. We present symbolic procedures, and corresponding termination criteria, for the solution of infinite-state games, which occur in the control and modular verification of infinite-state systems. To characterize the termination of symbolic procedures for solving infinite-state games, we classify these game structures into four increasingly restrictive categories:\r\n1 \tClass 1 consists of infinite-state structures for which all safety and reachability games can be solved.\r\n2 \tClass 2 consists of infinite-state structures for which all ω-regular games can be solved.\r\n3 \tClass 3 consists of infinite-state structures for which all nested positive boolean combinations of ω-regular games can be solved.\r\n4 \ \tClass 4 consists of infinite-state structures for which all nested boolean combinations of ω-regular games can be solved.\r\nWe give a structural characterization for each class, using equivalence relations on the state spaces of games which range from game versions of trace equivalence to a game version of bisimilarity. We provide infinite-state examples for all four classes of games from control problems for hybrid systems. We conclude by presenting symbolic algorithms for the synthesis of winning strategies (“controller synthesis”) for infinitestate games with arbitrary ω-regular objectives, and prove termination over all class-2 structures. This settles, in particular, the symbolic controller synthesis problem for rectangular hybrid systems." acknowledgement: This research was supported in part by the AFOSR MURI grant F49620-00-1-0327, the DARPA SEC grant F33615-C-98-3614, the MARCO GSRC grant 98-DT-660, the NSF Theory grant CCR-9988172, and the NSF ITR grant CCR-0085949. 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. Symbolic algorithms for infinite-state games. In: Proceedings of the 12th International Conference on on Concurrency Theory. Vol 2154. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2001:536-550. doi:10.1007/3-540-44685-0_36' apa: 'De Alfaro, L., Henzinger, T. A., & Majumdar, R. (2001). Symbolic algorithms for infinite-state games. In Proceedings of the 12th International Conference on on Concurrency Theory (Vol. 2154, pp. 536–550). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/3-540-44685-0_36' chicago: De Alfaro, Luca, Thomas A Henzinger, and Ritankar Majumdar. “Symbolic Algorithms for Infinite-State Games.” In Proceedings of the 12th International Conference on on Concurrency Theory, 2154:536–50. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2001. https://doi.org/10.1007/3-540-44685-0_36. ieee: L. De Alfaro, T. A. Henzinger, and R. Majumdar, “Symbolic algorithms for infinite-state games,” in Proceedings of the 12th International Conference on on Concurrency Theory, Aalborg, Denmark, 2001, vol. 2154, pp. 536–550. ista: 'De Alfaro L, Henzinger TA, Majumdar R. 2001. Symbolic algorithms for infinite-state games. Proceedings of the 12th International Conference on on Concurrency Theory. CONCUR: Concurrency Theory, LNCS, vol. 2154, 536–550.' mla: De Alfaro, Luca, et al. “Symbolic Algorithms for Infinite-State Games.” Proceedings of the 12th International Conference on on Concurrency Theory, vol. 2154, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2001, pp. 536–50, doi:10.1007/3-540-44685-0_36. short: L. De Alfaro, T.A. Henzinger, R. Majumdar, in:, Proceedings of the 12th International Conference on on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2001, pp. 536–550. conference: end_date: 2001-08-25 location: Aalborg, Denmark name: 'CONCUR: Concurrency Theory' start_date: 2001-08-20 date_created: 2018-12-11T12:09:52Z date_published: 2001-08-13T00:00:00Z date_updated: 2023-05-08T09:57:31Z day: '13' doi: 10.1007/3-540-44685-0_36 extern: '1' intvolume: ' 2154' language: - iso: eng month: '08' oa_version: None page: 536 - 550 publication: Proceedings of the 12th International Conference on on Concurrency Theory publication_identifier: isbn: - '9783540424970' publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik publist_id: '73' quality_controlled: '1' scopus_import: '1' status: public title: Symbolic algorithms for infinite-state games type: conference user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17 volume: 2154 year: '2001' ... --- _id: '4636' abstract: - lang: eng text: 'Abstract. Dynamic programs, or fixpoint iteration schemes, are useful for solving many problems on state spaces, including model checking on Kripke structures (“verification”), computing shortest paths on weighted graphs (“optimization”), computing the value of games played on game graphs (“control”). For Kripke structures, a rich fixpoint theory is available in the form of the µ-calculus. Yet few connections have been made between different interpretations of fixpoint algorithms. We study the question of when a particular fixpoint iteration scheme ϕ for verifying an ω-regular property Ψ on a Kripke structure can be used also for solving a two-player game on a game graph with winning objective Ψ. We provide a sufficient and necessary criterion for the answer to be affirmative in the form of an extremal-model theorem for games: under a game interpretation, the dynamic program ϕ solves the game with objective Ψ if and only if both (1) under an existential interpretation on Kripke structures, ϕ is equivalent to ∃Ψ, and (2) under a universal interpretation on Kripke structures, ϕ is equivalent to ∀Ψ. In other words, ϕ is correct on all two-player game graphs iff it is correct on all extremal game graphs, where one or the other player has no choice of moves. The theorem generalizes to quantitative interpretations, where it connects two-player games with costs to weighted graphs. While the standard translations from ω-regular properties to the µ-calculus violate (1) or (2), we give a translation that satisfies both conditions. Our construction, therefore, yields fixpoint iteration schemes that can be uniformly applied on Kripke structures, weighted graphs, game graphs, and game graphs with costs, in order to meet or optimize a given ω-regular objective.' 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. From verification to control: dynamic programs for omega-regular objectives. In: Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science. IEEE; 2001:279-290. doi:10.1109/LICS.2001.932504' apa: 'De Alfaro, L., Henzinger, T. A., & Majumdar, R. (2001). From verification to control: dynamic programs for omega-regular objectives. In Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science (pp. 279–290). Boston, MA, USA: IEEE. https://doi.org/10.1109/LICS.2001.932504' chicago: 'De Alfaro, Luca, Thomas A Henzinger, and Ritankar Majumdar. “From Verification to Control: Dynamic Programs for Omega-Regular Objectives.” In Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, 279–90. IEEE, 2001. https://doi.org/10.1109/LICS.2001.932504.' ieee: 'L. De Alfaro, T. A. Henzinger, and R. Majumdar, “From verification to control: dynamic programs for omega-regular objectives,” in Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, Boston, MA, USA, 2001, pp. 279–290.' ista: 'De Alfaro L, Henzinger TA, Majumdar R. 2001. From verification to control: dynamic programs for omega-regular objectives. Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 279–290.' mla: 'De Alfaro, Luca, et al. “From Verification to Control: Dynamic Programs for Omega-Regular Objectives.” Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, IEEE, 2001, pp. 279–90, doi:10.1109/LICS.2001.932504.' short: L. De Alfaro, T.A. Henzinger, R. Majumdar, in:, Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, IEEE, 2001, pp. 279–290. conference: end_date: 2001-06-19 location: Boston, MA, USA name: 'LICS: Logic in Computer Science' start_date: 2001-06-16 date_created: 2018-12-11T12:09:52Z date_published: 2001-08-07T00:00:00Z date_updated: 2023-05-08T09:48:06Z day: '07' doi: 10.1109/LICS.2001.932504 extern: '1' language: - iso: eng month: '08' oa_version: None page: 279 - 290 publication: Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science publication_identifier: isbn: - 076951281X publication_status: published publisher: IEEE publist_id: '72' quality_controlled: '1' status: public title: 'From verification to control: dynamic programs for omega-regular objectives' type: conference user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17 year: '2001' ... --- _id: '4635' abstract: - lang: eng text: We show how model checking techniques can be applied to the analysis of connectivity and cost-of-traversal properties of Web sites. 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: Freddy full_name: Mang, Freddy last_name: Mang citation: ama: 'De Alfaro L, Henzinger TA, Mang F. MCWEB: A model-checking tool for web-site debugging. In: Proceedings of the 10th International Conference on World Wide Web. ACM; 2001:86-87.' apa: 'De Alfaro, L., Henzinger, T. A., & Mang, F. (2001). MCWEB: A model-checking tool for web-site debugging. In Proceedings of the 10th international conference on World Wide Web (pp. 86–87). Hong Kong, Hong Kong: ACM.' chicago: 'De Alfaro, Luca, Thomas A Henzinger, and Freddy Mang. “MCWEB: A Model-Checking Tool for Web-Site Debugging.” In Proceedings of the 10th International Conference on World Wide Web, 86–87. ACM, 2001.' ieee: 'L. De Alfaro, T. A. Henzinger, and F. Mang, “MCWEB: A model-checking tool for web-site debugging,” in Proceedings of the 10th international conference on World Wide Web, Hong Kong, Hong Kong, 2001, pp. 86–87.' ista: 'De Alfaro L, Henzinger TA, Mang F. 2001. MCWEB: A model-checking tool for web-site debugging. Proceedings of the 10th international conference on World Wide Web. WWW: World Wide Web Conference, 86–87.' mla: 'De Alfaro, Luca, et al. “MCWEB: A Model-Checking Tool for Web-Site Debugging.” Proceedings of the 10th International Conference on World Wide Web, ACM, 2001, pp. 86–87.' short: L. De Alfaro, T.A. Henzinger, F. Mang, in:, Proceedings of the 10th International Conference on World Wide Web, ACM, 2001, pp. 86–87. conference: end_date: 2000-05-05 location: Hong Kong, Hong Kong name: 'WWW: World Wide Web Conference' start_date: 2001-05-01 date_created: 2018-12-11T12:09:52Z date_published: 2001-05-01T00:00:00Z date_updated: 2023-05-08T09:39:02Z day: '01' extern: '1' language: - iso: eng main_file_link: - url: https://ir.webis.de/anthology/2001.wwwconf_conference-2001p.57/ month: '05' oa_version: None page: 86 - 87 publication: Proceedings of the 10th international conference on World Wide Web publication_identifier: isbn: - '9781581133486' publication_status: published publisher: ACM publist_id: '71' quality_controlled: '1' status: public title: 'MCWEB: A model-checking tool for web-site debugging' type: conference user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17 year: '2001' ... --- _id: '4632' abstract: - lang: eng text: We present a compositional trace-based model for probabilistic systems. The behavior of a system with probabilistic choice is a stochastic process, namely, a probability distribution on traces, or “bundle.” Consequently, the semantics of a system with both nondeterministic and probabilistic choice is a set of bundles. The bundles of a composite system can be obtained by combining the bundles of the components in a simple mathematical way. Refinement between systems is bundle containment. We achieve assume-guarantee compositionality for bundle semantics by introducing two scoping mechanisms. The first mechanism, which is standard in compositional modeling, distinguishes inputs from outputs and hidden state. The second mechanism, which arises in probabilistic systems, partitions the state into probabilistically independent regions. acknowledgement: This research was supported in part by the SRC contract 99-TJ-683.003, the AFOSR MURI grant F49620-00-1-0327, the MARCO GSRC grant 98-DT-660, the NSF Theory grant CCR-9988172, and the DARPA SEC grant F33615-C-98-3614. 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: Ranjit full_name: Jhala, Ranjit last_name: Jhala citation: ama: 'De Alfaro L, Henzinger TA, Jhala R. Compositional methods for probabilistic systems. In: Proceedings of the 12th International Conference on on Concurrency Theory. Vol 2154. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2001:351-365. doi:10.1007/3-540-44685-0_24' apa: 'De Alfaro, L., Henzinger, T. A., & Jhala, R. (2001). Compositional methods for probabilistic systems. In Proceedings of the 12th International Conference on on Concurrency Theory (Vol. 2154, pp. 351–365). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/3-540-44685-0_24' chicago: De Alfaro, Luca, Thomas A Henzinger, and Ranjit Jhala. “Compositional Methods for Probabilistic Systems.” In Proceedings of the 12th International Conference on on Concurrency Theory, 2154:351–65. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2001. https://doi.org/10.1007/3-540-44685-0_24. ieee: L. De Alfaro, T. A. Henzinger, and R. Jhala, “Compositional methods for probabilistic systems,” in Proceedings of the 12th International Conference on on Concurrency Theory, Aalborg, Denmark, 2001, vol. 2154, pp. 351–365. ista: 'De Alfaro L, Henzinger TA, Jhala R. 2001. Compositional methods for probabilistic systems. Proceedings of the 12th International Conference on on Concurrency Theory. CONCUR: Concurrency Theory, LNCS, vol. 2154, 351–365.' mla: De Alfaro, Luca, et al. “Compositional Methods for Probabilistic Systems.” Proceedings of the 12th International Conference on on Concurrency Theory, vol. 2154, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2001, pp. 351–65, doi:10.1007/3-540-44685-0_24. short: L. De Alfaro, T.A. Henzinger, R. Jhala, in:, Proceedings of the 12th International Conference on on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2001, pp. 351–365. conference: end_date: 2001-08-25 location: Aalborg, Denmark name: 'CONCUR: Concurrency Theory' start_date: 2001-08-20 date_created: 2018-12-11T12:09:51Z date_published: 2001-08-13T00:00:00Z date_updated: 2023-05-08T10:24:59Z day: '13' doi: 10.1007/3-540-44685-0_24 extern: '1' intvolume: ' 2154' language: - iso: eng month: '08' oa_version: None page: 351 - 365 publication: Proceedings of the 12th International Conference on on Concurrency Theory publication_identifier: isbn: - '9783540424970' publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik publist_id: '75' quality_controlled: '1' scopus_import: '1' status: public title: Compositional methods for probabilistic systems type: conference user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17 volume: 2154 year: '2001' ... --- _id: '4600' abstract: - lang: eng text: 'Model checking is a practical tool for automated debugging of embedded software. In model checking, a high-level description of a system is compared against a logical correctness requirement to discover inconsistencies. Since model checking is based on exhaustive state-space exploration and the size of the state space of a design grows exponentially with the size of the description, scalability remains a challenge. We have thus developed techniques for exploiting modular design structure during model checking, and the model checker jMocha (Java MOdel-CHecking Algorithm) is based on this theme. Instead of manipulating unstructured state-transition graphs, it supports the hierarchical modeling framework of reactive modules. jMocha is a growing interactive software environment for specification, simulation and verification, and is intended as a vehicle for the development of new verification algorithms and approaches. It is written in Java and uses native C-code BDD libraries from VIS. jMocha offers: (1) a GUI that looks familiar to Windows/Java users; (2) a simulator that displays traces in a message sequence chart fashion; (3) requirements verification both by symbolic and enumerative model checking; (4) implementation verification by checking trace containment; (5) a proof manager that aids compositional and assume-guarantee reasoning; and (6) SLANG (Scripting LANGuage) for the rapid and structured development of new verification algorithms. jMocha is available publicly at ; it is a successor and extension of the original Mocha tool that was entirely written in C.' acknowledgement: 'We thank Himyanshu Anand, Ben Horowitz, Franjo Ivancic, Michael McDougall, Marius Minea, Oliver Moeller. Shaz Qadeer, Sriram Rajamani, and Jean-Francois Raskin for their assistance in the development of JMOCHA. The MOCHA project is funded in part by the DARPA grant NAG2-1214, the NSF CAREER awards CCR95-01708 and CCR97-34115, the NSF grant CCR99-70925, the NSF ITR grant CCR0085949, the MARC0 grant 98-DT-660, and the SRC contracts 99-TJ-683.003 and 99-TJ-688. ' article_processing_charge: No author: - first_name: Rajeev full_name: Alur, Rajeev last_name: Alur - first_name: Luca full_name: De Alfaro, Luca last_name: De Alfaro - first_name: Radu full_name: Grosu, Radu last_name: Grosu - 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: Myong full_name: Kang, Myong last_name: Kang - first_name: Christoph full_name: Kirsch, Christoph last_name: Kirsch - first_name: Ritankar full_name: Majumdar, Ritankar last_name: Majumdar - first_name: Freddy full_name: Mang, Freddy last_name: Mang - first_name: Bow full_name: Wang, Bow last_name: Wang citation: ama: 'Alur R, De Alfaro L, Grosu R, et al. jMocha: A model-checking tool that exploits design structure. In: Proceedings of the 23rd International Conference on Software Engineering. IEEE; 2001:835-836. doi:10.1109/ICSE.2001.919196' apa: 'Alur, R., De Alfaro, L., Grosu, R., Henzinger, T. A., Kang, M., Kirsch, C., … Wang, B. (2001). jMocha: A model-checking tool that exploits design structure. In Proceedings of the 23rd International Conference on Software Engineering (pp. 835–836). IEEE. https://doi.org/10.1109/ICSE.2001.919196' chicago: 'Alur, Rajeev, Luca De Alfaro, Radu Grosu, Thomas A Henzinger, Myong Kang, Christoph Kirsch, Ritankar Majumdar, Freddy Mang, and Bow Wang. “JMocha: A Model-Checking Tool That Exploits Design Structure.” In Proceedings of the 23rd International Conference on Software Engineering, 835–36. IEEE, 2001. https://doi.org/10.1109/ICSE.2001.919196.' ieee: 'R. Alur et al., “jMocha: A model-checking tool that exploits design structure,” in Proceedings of the 23rd International Conference on Software Engineering, 2001, pp. 835–836.' ista: 'Alur R, De Alfaro L, Grosu R, Henzinger TA, Kang M, Kirsch C, Majumdar R, Mang F, Wang B. 2001. jMocha: A model-checking tool that exploits design structure. Proceedings of the 23rd International Conference on Software Engineering. ICSE: Software Engineering, 835–836.' mla: 'Alur, Rajeev, et al. “JMocha: A Model-Checking Tool That Exploits Design Structure.” Proceedings of the 23rd International Conference on Software Engineering, IEEE, 2001, pp. 835–36, doi:10.1109/ICSE.2001.919196.' short: R. Alur, L. De Alfaro, R. Grosu, T.A. Henzinger, M. Kang, C. Kirsch, R. Majumdar, F. Mang, B. Wang, in:, Proceedings of the 23rd International Conference on Software Engineering, IEEE, 2001, pp. 835–836. conference: name: 'ICSE: Software Engineering' date_created: 2018-12-11T12:09:41Z date_published: 2001-08-07T00:00:00Z date_updated: 2023-05-08T14:06:55Z day: '07' doi: 10.1109/ICSE.2001.919196 extern: '1' language: - iso: eng month: '08' oa_version: None page: 835 - 836 publication: Proceedings of the 23rd International Conference on Software Engineering publication_identifier: isbn: - '0769510507' publication_status: published publisher: IEEE publist_id: '109' quality_controlled: '1' status: public title: 'jMocha: A model-checking tool that exploits design structure' type: conference user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17 year: '2001' ... --- _id: '4599' abstract: - lang: eng text: 'State-space explosion is a fundamental obstacle in the formal verification of designs and protocols. Several techniques for combating this problem have emerged in the past few years, among which two are significant: partial-order reduction and symbolic state-space search. In asynchronous systems, interleavings of independent concurrent events are equivalent, and only a representative interleaving needs to be explored to verify local properties. Partial-order methods exploit this redundancy and visit only a subset of the reachable states. Symbolic techniques, on the other hand, capture the transition relation of a system and the set of reachable states as boolean functions. In many cases, these functions can be represented compactly using binary decision diagrams (BDDs). Traditionally, the two techniques have been practiced by two different schools—partial-order methods with enumerative depth-first search for the analysis of asynchronous network protocols, and symbolic breadth-first search for the analysis of synchronous hardware designs. We combine both approaches and develop a method for using partial-order reduction techniques in symbolic BDD-based invariant checking. We present theoretical results to prove the correctness of the method, and experimental results to demonstrate its efficacy.' acknowledgement: Gerard Holzmann provided us with information on SPIN. Ken McMillan and Doron Peled contributed through discussions. The VIS group at UC Berkeley and Rajeev Ranjan in particular helped with the experiments. article_processing_charge: No article_type: original author: - first_name: Rajeev full_name: Alur, Rajeev last_name: Alur - first_name: Robert full_name: Brayton, Robert last_name: Brayton - 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: Shaz full_name: Qadeer, Shaz last_name: Qadeer - first_name: Sriram full_name: Rajamani, Sriram last_name: Rajamani citation: ama: Alur R, Brayton R, Henzinger TA, Qadeer S, Rajamani S. Partial-order reduction in symbolic state-space exploration. Formal Methods in System Design. 2001;18(2):97-116. doi:10.1023/A:1008767206905 apa: Alur, R., Brayton, R., Henzinger, T. A., Qadeer, S., & Rajamani, S. (2001). Partial-order reduction in symbolic state-space exploration. Formal Methods in System Design. Springer. https://doi.org/10.1023/A:1008767206905 chicago: Alur, Rajeev, Robert Brayton, Thomas A Henzinger, Shaz Qadeer, and Sriram Rajamani. “Partial-Order Reduction in Symbolic State-Space Exploration.” Formal Methods in System Design. Springer, 2001. https://doi.org/10.1023/A:1008767206905. ieee: R. Alur, R. Brayton, T. A. Henzinger, S. Qadeer, and S. Rajamani, “Partial-order reduction in symbolic state-space exploration,” Formal Methods in System Design, vol. 18, no. 2. Springer, pp. 97–116, 2001. ista: Alur R, Brayton R, Henzinger TA, Qadeer S, Rajamani S. 2001. Partial-order reduction in symbolic state-space exploration. Formal Methods in System Design. 18(2), 97–116. mla: Alur, Rajeev, et al. “Partial-Order Reduction in Symbolic State-Space Exploration.” Formal Methods in System Design, vol. 18, no. 2, Springer, 2001, pp. 97–116, doi:10.1023/A:1008767206905. short: R. Alur, R. Brayton, T.A. Henzinger, S. Qadeer, S. Rajamani, Formal Methods in System Design 18 (2001) 97–116. date_created: 2018-12-11T12:09:41Z date_published: 2001-03-01T00:00:00Z date_updated: 2023-05-08T12:22:38Z day: '01' doi: 10.1023/A:1008767206905 extern: '1' intvolume: ' 18' issue: '2' language: - iso: eng month: '03' oa_version: None page: 97 - 116 publication: Formal Methods in System Design publication_identifier: issn: - 0925-9856 publication_status: published publisher: Springer publist_id: '108' quality_controlled: '1' scopus_import: '1' status: public title: Partial-order reduction in symbolic state-space exploration type: journal_article user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17 volume: 18 year: '2001' ... --- _id: '4622' abstract: - lang: eng text: Conventional type systems specify interfaces in terms of values and domains. We present a light-weight formalism that captures the temporal aspects of software component interfaces. Specifically, we use an automata-based language to capture both input assumptions about the order in which the methods of a component are called, and output guarantees about the order in which the component calls external methods. The formalism supports automatic compatability checks between interface models, and thus constitutes a type system for component interaction. Unlike traditional uses of automata, our formalism is based on an optimistic approach to composition, and on an alternating approach to design refinement. According to the optimistic approach, two components are compatible if there is some environment that can make them work together. According to the alternating approach, one interface refines another if it has weaker input assumptions, and stronger output guarantees. We show that these notions have game-theoretic foundations that lead to efficient algorithms for checking compatibility and refinement. acknowledgement: We thank Edward A. Lee, Xiaojun Liu, Freddy Mang, and Yuhong Xiong for fruitful discussions. This research was supported in part by the AFOSR MURI grant F49620-00-1-0327, the DARPA MoBIES grant F33615-00-C-1703, the MARCO GSRC grant 98-DT-660, the NSF Theory grant CCR-9988172, and the NSF ITR grant CCR-0085949. 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 citation: ama: 'De Alfaro L, Henzinger TA. Interface automata. In: Proceedings of the 8th European Software Engineering Conference. ACM; 2001:109-120. doi:10.1145/503209.503226' apa: 'De Alfaro, L., & Henzinger, T. A. (2001). Interface automata. In Proceedings of the 8th European software engineering conference (pp. 109–120). Vienna, Austria: ACM. https://doi.org/10.1145/503209.503226' chicago: De Alfaro, Luca, and Thomas A Henzinger. “Interface Automata.” In Proceedings of the 8th European Software Engineering Conference, 109–20. ACM, 2001. https://doi.org/10.1145/503209.503226. ieee: L. De Alfaro and T. A. Henzinger, “Interface automata,” in Proceedings of the 8th European software engineering conference, Vienna, Austria, 2001, pp. 109–120. ista: 'De Alfaro L, Henzinger TA. 2001. Interface automata. Proceedings of the 8th European software engineering conference. FSE: Foundations of Software Engineering, 109–120.' mla: De Alfaro, Luca, and Thomas A. Henzinger. “Interface Automata.” Proceedings of the 8th European Software Engineering Conference, ACM, 2001, pp. 109–20, doi:10.1145/503209.503226. short: L. De Alfaro, T.A. Henzinger, in:, Proceedings of the 8th European Software Engineering Conference, ACM, 2001, pp. 109–120. conference: end_date: 2001-09-14 location: Vienna, Austria name: 'FSE: Foundations of Software Engineering' start_date: 2001-09-10 date_created: 2018-12-11T12:09:48Z date_published: 2001-06-01T00:00:00Z date_updated: 2023-05-08T12:01:02Z day: '01' doi: 10.1145/503209.503226 extern: '1' language: - iso: eng month: '06' oa_version: None page: 109 - 120 publication: Proceedings of the 8th European software engineering conference publication_identifier: isbn: - '9781581133905' publication_status: published publisher: ACM publist_id: '83' quality_controlled: '1' scopus_import: '1' status: public title: Interface automata type: conference user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17 year: '2001' ... --- _id: '4623' abstract: - lang: eng text: We classify component-based models of computation into component models and interface models. A component model specifies for each component howthe component behaves in an arbitrary environment; an interface model specifies for each component what the component expects from the environment. Component models support compositional abstraction, and therefore component-based verification. Interface models support compositional refinement, and therefore componentbased design. Many aspects of interface models, such as compatibility and refinement checking between interfaces, are properly viewed in a gametheoretic setting, where the input and output values of an interface are chosen by different players. acknowledgement: This research was supported in part by the AFOSR MURI grant F49620-00-1-0327, the DARPA ITO grant F33615-00-C-1693, the MARCO grant 98-DT-660, and the NSF ITR grant CCR-0085949. 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 citation: ama: 'De Alfaro L, Henzinger TA. Interface theories for component-based design. In: Proceedings of the 1st International Workshop on Embedded Software. Vol 2211. ACM; 2001:148-165. doi:10.1007/3-540-45449-7_11' apa: 'De Alfaro, L., & Henzinger, T. A. (2001). Interface theories for component-based design. In Proceedings of the 1st International Workshop on Embedded Software (Vol. 2211, pp. 148–165). Tahoe City, CA, USA: ACM. https://doi.org/10.1007/3-540-45449-7_11' chicago: De Alfaro, Luca, and Thomas A Henzinger. “Interface Theories for Component-Based Design.” In Proceedings of the 1st International Workshop on Embedded Software, 2211:148–65. ACM, 2001. https://doi.org/10.1007/3-540-45449-7_11. ieee: L. De Alfaro and T. A. Henzinger, “Interface theories for component-based design,” in Proceedings of the 1st International Workshop on Embedded Software, Tahoe City, CA, USA, 2001, vol. 2211, pp. 148–165. ista: 'De Alfaro L, Henzinger TA. 2001. Interface theories for component-based design. Proceedings of the 1st International Workshop on Embedded Software. EMSOFT: Embedded Software , LNCS, vol. 2211, 148–165.' mla: De Alfaro, Luca, and Thomas A. Henzinger. “Interface Theories for Component-Based Design.” Proceedings of the 1st International Workshop on Embedded Software, vol. 2211, ACM, 2001, pp. 148–65, doi:10.1007/3-540-45449-7_11. short: L. De Alfaro, T.A. Henzinger, in:, Proceedings of the 1st International Workshop on Embedded Software, ACM, 2001, pp. 148–165. conference: end_date: 2001-10-10 location: Tahoe City, CA, USA name: 'EMSOFT: Embedded Software ' start_date: 2001-10-08 date_created: 2018-12-11T12:09:48Z date_published: 2001-09-26T00:00:00Z date_updated: 2023-05-08T12:11:20Z day: '26' doi: 10.1007/3-540-45449-7_11 extern: '1' intvolume: ' 2211' language: - iso: eng month: '09' oa_version: None page: 148 - 165 publication: Proceedings of the 1st International Workshop on Embedded Software publication_identifier: isbn: - '9783540426738' publication_status: published publisher: ACM publist_id: '84' quality_controlled: '1' scopus_import: '1' status: public title: Interface theories for component-based design type: conference user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17 volume: 2211 year: '2001' ... --- _id: '4564' abstract: - lang: eng text: This paper presents a concept for integrating the embedded programming methodology Giotto and the object-oriented AOCS Framework to create an environment for the rapid development of distributed software for safety-critical embedded control systems with hard real-time requirements of the kind typically found in aerospace applications. acknowledgement: 'This research was supported in part by DARPA under grants F336 15-C-98-36 14, F33615-00-(2-1693, and F33615-00-C-1703, and by MARC0 under grant 98-DT-660. ' article_processing_charge: No author: - first_name: Timothy full_name: Brown, Timothy last_name: Brown - first_name: Alessandro full_name: Pasetti, Alessandro last_name: Pasetti - first_name: Wolfgang full_name: Pree, Wolfgang last_name: Pree - 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 citation: ama: 'Brown T, Pasetti A, Pree W, Henzinger TA, Kirsch C. A reusable and platform-independent framework for distributed control systems. In: Proceedings of the 20th Digital Avionics Systems Conference. IEEE; 2001:1-11. doi:10.1109/DASC.2001.964169' apa: 'Brown, T., Pasetti, A., Pree, W., Henzinger, T. A., & Kirsch, C. (2001). A reusable and platform-independent framework for distributed control systems. In Proceedings of the 20th Digital Avionics Systems Conference (pp. 1–11). Daytona Beach, FL, USA: IEEE. https://doi.org/10.1109/DASC.2001.964169' chicago: Brown, Timothy, Alessandro Pasetti, Wolfgang Pree, Thomas A Henzinger, and Christoph Kirsch. “A Reusable and Platform-Independent Framework for Distributed Control Systems.” In Proceedings of the 20th Digital Avionics Systems Conference, 1–11. IEEE, 2001. https://doi.org/10.1109/DASC.2001.964169. ieee: T. Brown, A. Pasetti, W. Pree, T. A. Henzinger, and C. Kirsch, “A reusable and platform-independent framework for distributed control systems,” in Proceedings of the 20th Digital Avionics Systems Conference, Daytona Beach, FL, USA, 2001, pp. 1–11. ista: 'Brown T, Pasetti A, Pree W, Henzinger TA, Kirsch C. 2001. A reusable and platform-independent framework for distributed control systems. Proceedings of the 20th Digital Avionics Systems Conference. DASC: Digital Avionics Systems Conference, 1–11.' mla: Brown, Timothy, et al. “A Reusable and Platform-Independent Framework for Distributed Control Systems.” Proceedings of the 20th Digital Avionics Systems Conference, IEEE, 2001, pp. 1–11, doi:10.1109/DASC.2001.964169. short: T. Brown, A. Pasetti, W. Pree, T.A. Henzinger, C. Kirsch, in:, Proceedings of the 20th Digital Avionics Systems Conference, IEEE, 2001, pp. 1–11. conference: end_date: 2001-10-18 location: Daytona Beach, FL, USA name: 'DASC: Digital Avionics Systems Conference' start_date: 2001-10-14 date_created: 2018-12-11T12:09:30Z date_published: 2001-08-06T00:00:00Z date_updated: 2023-05-09T12:23:16Z day: '06' doi: 10.1109/DASC.2001.964169 extern: '1' language: - iso: eng month: '08' oa_version: None page: 1 - 11 publication: Proceedings of the 20th Digital Avionics Systems Conference publication_identifier: isbn: - '0780370341' publication_status: published publisher: IEEE publist_id: '143' quality_controlled: '1' scopus_import: '1' status: public title: A reusable and platform-independent framework for distributed control systems type: conference user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17 year: '2001' ...