[{"alternative_title":["LNCS"],"day":"01","publist_id":"4599","title":"From model checking to model measuring","oa":1,"date_published":"2013-08-01T00:00:00Z","fulldoi":"https://doi.org/10.1007/978-3-642-40184-8_20","related_material":{"record":[{"id":"5417","relation":"earlier_version","status":"public"}]},"corr_author":"1","page":"273 - 287","scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2013","_id":"2327","oa_version":"Submitted Version","pubrep_id":"129","language":[{"iso":"eng"}],"file":[{"relation":"main_file","file_name":"IST-2013-129-v1+1_concur.pdf","file_id":"5301","date_updated":"2020-07-14T12:45:38Z","content_type":"application/pdf","checksum":"4c04695c4bfdf2119cd4f5d1babc3e8a","access_level":"open_access","creator":"system","file_size":378587,"date_created":"2018-12-12T10:17:45Z"}],"type":"conference","volume":8052,"series_title":"Lecture Notes in Computer Science","quality_controlled":"1","conference":{"end_date":"2013-08-30","start_date":"2013-08-27","name":"CONCUR: Concurrency Theory","location":"Buenos Aires, Argentina"},"date_created":"2018-12-11T11:57:00Z","status":"public","publication_status":"published","date_updated":"2024-10-21T06:02:58Z","month":"08","publisher":"Springer","has_accepted_license":"1","abstract":[{"text":"We define the model-measuring problem: given a model M and specification φ, what is the maximal distance ρ such that all models M′ within distance ρ from M satisfy (or violate) φ. The model measuring problem presupposes a distance function on models. We concentrate on automatic distance functions, which are defined by weighted automata. The model-measuring problem subsumes several generalizations of the classical model-checking problem, in particular, quantitative model-checking problems that measure the degree of satisfaction of a specification, and robustness problems that measure how much a model can be perturbed without violating the specification. We show that for automatic distance functions, and ω-regular linear-time and branching-time specifications, the model-measuring problem can be solved. We use automata-theoretic model-checking methods for model measuring, replacing the emptiness question for standard word and tree automata by the optimal-weight question for the weighted versions of these automata. We consider weighted automata that accumulate weights by maximizing, summing, discounting, and limit averaging. We give several examples of using the model-measuring problem to compute various notions of robustness and quantitative satisfaction for temporal specifications.","lang":"eng"}],"file_date_updated":"2020-07-14T12:45:38Z","department":[{"_id":"ToHe"}],"citation":{"ieee":"T. A. Henzinger and J. Otop, “From model checking to model measuring,” vol. 8052. Springer, pp. 273–287, 2013.","apa":"Henzinger, T. A., &#38; Otop, J. (2013). From model checking to model measuring. Presented at the CONCUR: Concurrency Theory, Buenos Aires, Argentina: Springer. <a href=\"https://doi.org/10.1007/978-3-642-40184-8_20\">https://doi.org/10.1007/978-3-642-40184-8_20</a>","ama":"Henzinger TA, Otop J. From model checking to model measuring. 2013;8052:273-287. doi:<a href=\"https://doi.org/10.1007/978-3-642-40184-8_20\">10.1007/978-3-642-40184-8_20</a>","chicago":"Henzinger, Thomas A, and Jan Otop. “From Model Checking to Model Measuring.” Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-40184-8_20\">https://doi.org/10.1007/978-3-642-40184-8_20</a>.","mla":"Henzinger, Thomas A., and Jan Otop. <i>From Model Checking to Model Measuring</i>. Vol. 8052, Springer, 2013, pp. 273–87, doi:<a href=\"https://doi.org/10.1007/978-3-642-40184-8_20\">10.1007/978-3-642-40184-8_20</a>.","short":"T.A. Henzinger, J. Otop, 8052 (2013) 273–287.","ista":"Henzinger TA, Otop J. 2013. From model checking to model measuring. 8052, 273–287."},"ddc":["005","000"],"author":[{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A"},{"first_name":"Jan","full_name":"Otop, Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","last_name":"Otop"}],"doi":"10.1007/978-3-642-40184-8_20","intvolume":"      8052"},{"type":"conference","series_title":"Lecture Notes in Computer Science","volume":8052,"language":[{"iso":"eng"}],"oa_version":"Preprint","_id":"2329","arxiv":1,"year":"2013","page":"500 - 515","related_material":{"record":[{"status":"public","relation":"later_version","id":"717"}]},"scopus_import":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"fulldoi":"https://doi.org/10.1007/978-3-642-40184-8_35","date_published":"2013-08-01T00:00:00Z","day":"01","alternative_title":["LNCS"],"publist_id":"4597","title":"Hyperplane separation technique for multidimensional mean-payoff games","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"full_name":"Velner, Yaron","first_name":"Yaron","last_name":"Velner"}],"intvolume":"      8052","doi":"10.1007/978-3-642-40184-8_35","citation":{"mla":"Chatterjee, Krishnendu, and Yaron Velner. <i>Hyperplane Separation Technique for Multidimensional Mean-Payoff Games</i>. Vol. 8052, Springer, 2013, pp. 500–15, doi:<a href=\"https://doi.org/10.1007/978-3-642-40184-8_35\">10.1007/978-3-642-40184-8_35</a>.","chicago":"Chatterjee, Krishnendu, and Yaron Velner. “Hyperplane Separation Technique for Multidimensional Mean-Payoff Games.” Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-40184-8_35\">https://doi.org/10.1007/978-3-642-40184-8_35</a>.","ieee":"K. Chatterjee and Y. Velner, “Hyperplane separation technique for multidimensional mean-payoff games,” vol. 8052. Springer, pp. 500–515, 2013.","ama":"Chatterjee K, Velner Y. Hyperplane separation technique for multidimensional mean-payoff games. 2013;8052:500-515. doi:<a href=\"https://doi.org/10.1007/978-3-642-40184-8_35\">10.1007/978-3-642-40184-8_35</a>","apa":"Chatterjee, K., &#38; Velner, Y. (2013). Hyperplane separation technique for multidimensional mean-payoff games. Presented at the CONCUR: Concurrency Theory, Buenos Aires, Argentinia: Springer. <a href=\"https://doi.org/10.1007/978-3-642-40184-8_35\">https://doi.org/10.1007/978-3-642-40184-8_35</a>","short":"K. Chatterjee, Y. Velner, 8052 (2013) 500–515.","ista":"Chatterjee K, Velner Y. 2013. Hyperplane separation technique for multidimensional mean-payoff games. 8052, 500–515."},"abstract":[{"text":"Two-player games on graphs are central in many problems in formal verification and program analysis such as synthesis and verification of open systems. In this work, we consider both finite-state game graphs, and recursive game graphs (or pushdown game graphs) that model the control flow of sequential programs with recursion. The objectives we study are multidimensional mean-payoff objectives, where the goal of player 1 is to ensure that the mean-payoff is non-negative in all dimensions. In pushdown games two types of strategies are relevant: (1) global strategies, that depend on the entire global history; and (2) modular strategies, that have only local memory and thus do not depend on the context of invocation. Our main contributions are as follows: (1) We show that finite-state multidimensional mean-payoff games can be solved in polynomial time if the number of dimensions and the maximal absolute value of the weights are fixed; whereas if the number of dimensions is arbitrary, then the problem is known to be coNP-complete. (2) We show that pushdown graphs with multidimensional mean-payoff objectives can be solved in polynomial time. For both (1) and (2) our algorithms are based on hyperplane separation technique. (3) For pushdown games under global strategies both one and multidimensional mean-payoff objectives problems are known to be undecidable, and we show that under modular strategies the multidimensional problem is also undecidable; under modular strategies the one-dimensional problem is NP-complete. We show that if the number of modules, the number of exits, and the maximal absolute value of the weights are fixed, then pushdown games under modular strategies with one-dimensional mean-payoff objectives can be solved in polynomial time, and if either the number of exits or the number of modules is unbounded, then the problem is NP-hard. (4) Finally we show that a fixed parameter tractable algorithm for finite-state multidimensional mean-payoff games or pushdown games under modular strategies with one-dimensional mean-payoff objectives would imply the fixed parameter tractability of parity games.","lang":"eng"}],"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1210.3141"}],"department":[{"_id":"KrCh"}],"publisher":"Springer","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","call_identifier":"FWF"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","grant_number":"S11407","call_identifier":"FWF"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"month":"08","ec_funded":1,"publication_status":"published","date_updated":"2025-09-10T11:00:30Z","date_created":"2018-12-11T11:57:01Z","status":"public","quality_controlled":"1","conference":{"location":"Buenos Aires, Argentinia","end_date":"2013-08-30","name":"CONCUR: Concurrency Theory","start_date":"2013-08-27"},"external_id":{"arxiv":["1210.3141"]}},{"volume":162,"doi":"10.1215/00127094-2019477","intvolume":"       162","type":"journal_article","author":[{"full_name":"Frank, Rupert L","first_name":"Rupert","last_name":"Frank"},{"last_name":"Lewin","full_name":"Lewin, Mathieu","first_name":"Mathieu"},{"full_name":"Lieb, Élliott H","first_name":"Élliott","last_name":"Lieb"},{"orcid":"0000-0002-6781-0521","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","last_name":"Seiringer","first_name":"Robert","full_name":"Robert Seiringer"}],"citation":{"mla":"Frank, Rupert, et al. “A Positive Density Analogue of the Lieb-Thirring Inequality.” <i>Duke Mathematical Journal</i>, vol. 162, no. 3, Duke University Press, 2013, pp. 435–95, doi:<a href=\"https://doi.org/10.1215/00127094-2019477\">10.1215/00127094-2019477</a>.","chicago":"Frank, Rupert, Mathieu Lewin, Élliott Lieb, and Robert Seiringer. “A Positive Density Analogue of the Lieb-Thirring Inequality.” <i>Duke Mathematical Journal</i>. Duke University Press, 2013. <a href=\"https://doi.org/10.1215/00127094-2019477\">https://doi.org/10.1215/00127094-2019477</a>.","ama":"Frank R, Lewin M, Lieb É, Seiringer R. A positive density analogue of the Lieb-Thirring inequality. <i>Duke Mathematical Journal</i>. 2013;162(3):435-495. doi:<a href=\"https://doi.org/10.1215/00127094-2019477\">10.1215/00127094-2019477</a>","apa":"Frank, R., Lewin, M., Lieb, É., &#38; Seiringer, R. (2013). A positive density analogue of the Lieb-Thirring inequality. <i>Duke Mathematical Journal</i>. Duke University Press. <a href=\"https://doi.org/10.1215/00127094-2019477\">https://doi.org/10.1215/00127094-2019477</a>","ieee":"R. Frank, M. Lewin, É. Lieb, and R. Seiringer, “A positive density analogue of the Lieb-Thirring inequality,” <i>Duke Mathematical Journal</i>, vol. 162, no. 3. Duke University Press, pp. 435–495, 2013.","short":"R. Frank, M. Lewin, É. Lieb, R. Seiringer, Duke Mathematical Journal 162 (2013) 435–495.","ista":"Frank R, Lewin M, Lieb É, Seiringer R. 2013. A positive density analogue of the Lieb-Thirring inequality. Duke Mathematical Journal. 162(3), 435–495."},"extern":1,"year":"2013","_id":"2404","abstract":[{"text":"The Lieb-Thirring inequalities give a bound on the negative eigenvalues of a Schrödinger operator in terms of an Lp-norm of the potential. These are dual to bounds on the H1-norms of a system of orthonormal functions. Here we extend these bounds to analogous inequalities for perturbations of the Fermi sea of noninteracting particles (i.e., for perturbations of the continuous spectrum of the Laplacian by local potentials).","lang":"eng"}],"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1108.4246"}],"publisher":"Duke University Press","month":"02","page":"435 - 495","date_updated":"2021-01-12T06:57:17Z","date_published":"2013-02-01T00:00:00Z","issue":"3","fulldoi":"https://doi.org/10.1215/00127094-2019477","publication_status":"published","oa":1,"title":"A positive density analogue of the Lieb-Thirring inequality","status":"public","publist_id":"4521","day":"01","date_created":"2018-12-11T11:57:28Z","quality_controlled":0,"publication":"Duke Mathematical Journal"},{"page":"557 - 573","month":"04","publication_status":"published","oa":1,"date_updated":"2021-01-12T06:57:17Z","date_published":"2013-04-01T00:00:00Z","fulldoi":"https://doi.org/10.1007/s00220-012-1604-y","issue":"2","publist_id":"4522","day":"01","date_created":"2018-12-11T11:57:28Z","title":"Symmetry of bipolaron bound states for small Coulomb repulsion","status":"public","quality_controlled":0,"publication":"Communications in Mathematical Physics","type":"journal_article","author":[{"first_name":"Rupert","full_name":"Frank, Rupert L","last_name":"Frank"},{"last_name":"Lieb","full_name":"Lieb, Élliott H","first_name":"Élliott"},{"last_name":"Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6781-0521","full_name":"Robert Seiringer","first_name":"Robert"}],"doi":"10.1007/s00220-012-1604-y","volume":319,"intvolume":"       319","citation":{"mla":"Frank, Rupert, et al. “Symmetry of Bipolaron Bound States for Small Coulomb Repulsion.” <i>Communications in Mathematical Physics</i>, vol. 319, no. 2, Springer, 2013, pp. 557–73, doi:<a href=\"https://doi.org/10.1007/s00220-012-1604-y\">10.1007/s00220-012-1604-y</a>.","chicago":"Frank, Rupert, Élliott Lieb, and Robert Seiringer. “Symmetry of Bipolaron Bound States for Small Coulomb Repulsion.” <i>Communications in Mathematical Physics</i>. Springer, 2013. <a href=\"https://doi.org/10.1007/s00220-012-1604-y\">https://doi.org/10.1007/s00220-012-1604-y</a>.","apa":"Frank, R., Lieb, É., &#38; Seiringer, R. (2013). Symmetry of bipolaron bound states for small Coulomb repulsion. <i>Communications in Mathematical Physics</i>. Springer. <a href=\"https://doi.org/10.1007/s00220-012-1604-y\">https://doi.org/10.1007/s00220-012-1604-y</a>","ieee":"R. Frank, É. Lieb, and R. Seiringer, “Symmetry of bipolaron bound states for small Coulomb repulsion,” <i>Communications in Mathematical Physics</i>, vol. 319, no. 2. Springer, pp. 557–573, 2013.","ama":"Frank R, Lieb É, Seiringer R. Symmetry of bipolaron bound states for small Coulomb repulsion. <i>Communications in Mathematical Physics</i>. 2013;319(2):557-573. doi:<a href=\"https://doi.org/10.1007/s00220-012-1604-y\">10.1007/s00220-012-1604-y</a>","short":"R. Frank, É. Lieb, R. Seiringer, Communications in Mathematical Physics 319 (2013) 557–573.","ista":"Frank R, Lieb É, Seiringer R. 2013. Symmetry of bipolaron bound states for small Coulomb repulsion. Communications in Mathematical Physics. 319(2), 557–573."},"year":"2013","_id":"2405","abstract":[{"lang":"eng","text":"We consider the bipolaron in the Pekar-Tomasevich approximation and address the question whether the ground state is spherically symmetric or not. Numerical analysis has, so far, not completely settled the question. Our contribution is to prove rigorously that the ground state remains spherical for small values of the electron-electron Coulomb repulsion."}],"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1201.3954"}],"extern":1,"publisher":"Springer"},{"page":"103 - 107","month":"02","publication_status":"published","date_updated":"2021-01-12T06:57:17Z","date_published":"2013-02-01T00:00:00Z","issue":"1","fulldoi":"https://doi.org/10.1140/epjst/e2013-01759-5","publist_id":"4520","day":"01","date_created":"2018-12-11T11:57:29Z","title":"Condensation of interacting bosons in a random potential","status":"public","quality_controlled":0,"publication":"European Physical Journal: Special Topics","type":"journal_article","author":[{"orcid":"0000-0002-6781-0521","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","last_name":"Seiringer","first_name":"Robert","full_name":"Robert Seiringer"},{"first_name":"Jakob","full_name":"Yngvason, Jakob","last_name":"Yngvason"},{"full_name":"Zagrebnov, Valentin A","first_name":"Valentin","last_name":"Zagrebnov"}],"volume":217,"doi":"10.1140/epjst/e2013-01759-5","intvolume":"       217","citation":{"mla":"Seiringer, Robert, et al. “Condensation of Interacting Bosons in a Random Potential.” <i>European Physical Journal: Special Topics</i>, vol. 217, no. 1, Springer, 2013, pp. 103–07, doi:<a href=\"https://doi.org/10.1140/epjst/e2013-01759-5\">10.1140/epjst/e2013-01759-5</a>.","ieee":"R. Seiringer, J. Yngvason, and V. Zagrebnov, “Condensation of interacting bosons in a random potential,” <i>European Physical Journal: Special Topics</i>, vol. 217, no. 1. Springer, pp. 103–107, 2013.","ama":"Seiringer R, Yngvason J, Zagrebnov V. Condensation of interacting bosons in a random potential. <i>European Physical Journal: Special Topics</i>. 2013;217(1):103-107. doi:<a href=\"https://doi.org/10.1140/epjst/e2013-01759-5\">10.1140/epjst/e2013-01759-5</a>","apa":"Seiringer, R., Yngvason, J., &#38; Zagrebnov, V. (2013). Condensation of interacting bosons in a random potential. <i>European Physical Journal: Special Topics</i>. Springer. <a href=\"https://doi.org/10.1140/epjst/e2013-01759-5\">https://doi.org/10.1140/epjst/e2013-01759-5</a>","chicago":"Seiringer, Robert, Jakob Yngvason, and Valentin Zagrebnov. “Condensation of Interacting Bosons in a Random Potential.” <i>European Physical Journal: Special Topics</i>. Springer, 2013. <a href=\"https://doi.org/10.1140/epjst/e2013-01759-5\">https://doi.org/10.1140/epjst/e2013-01759-5</a>.","ista":"Seiringer R, Yngvason J, Zagrebnov V. 2013. Condensation of interacting bosons in a random potential. European Physical Journal: Special Topics. 217(1), 103–107.","short":"R. Seiringer, J. Yngvason, V. Zagrebnov, European Physical Journal: Special Topics 217 (2013) 103–107."},"year":"2013","abstract":[{"lang":"eng","text":"We study the effects of random scatterers on the ground state of the one-dimensional Lieb-Liniger model of interacting bosons on the unit interval. We prove that, in the Gross-Pitaevskii limit, Bose Einstein condensation takes place in the whole parameter range considered. The character of the wave function of the condensate, however, depends in an essential way on the interplay between randomness and the strength of the two-body interaction. For low density of scatterers or strong interactions the wave function extends over the whole interval. High density of scatterers and weak interaction, on the other hand, leads to localization of the wave function in a fragmented subset of the unit interval."}],"_id":"2406","extern":1,"publisher":"Springer"},{"page":"559 - 591","month":"09","oa":1,"publication_status":"published","issue":"2","fulldoi":"https://doi.org/10.1007/s00220-013-1736-8","date_published":"2013-09-01T00:00:00Z","date_updated":"2021-01-12T06:57:18Z","date_created":"2018-12-11T11:57:29Z","publist_id":"4518","day":"01","status":"public","title":"The excitation spectrum for weakly interacting Bosons in a trap","publication":"Communications in Mathematical Physics","quality_controlled":0,"author":[{"last_name":"Grech","full_name":"Grech, Philip","first_name":"Philip"},{"first_name":"Robert","full_name":"Robert Seiringer","last_name":"Seiringer","orcid":"0000-0002-6781-0521","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87"}],"type":"journal_article","intvolume":"       322","doi":"10.1007/s00220-013-1736-8","volume":322,"citation":{"chicago":"Grech, Philip, and Robert Seiringer. “The Excitation Spectrum for Weakly Interacting Bosons in a Trap.” <i>Communications in Mathematical Physics</i>. Springer, 2013. <a href=\"https://doi.org/10.1007/s00220-013-1736-8\">https://doi.org/10.1007/s00220-013-1736-8</a>.","ama":"Grech P, Seiringer R. The excitation spectrum for weakly interacting Bosons in a trap. <i>Communications in Mathematical Physics</i>. 2013;322(2):559-591. doi:<a href=\"https://doi.org/10.1007/s00220-013-1736-8\">10.1007/s00220-013-1736-8</a>","ieee":"P. Grech and R. Seiringer, “The excitation spectrum for weakly interacting Bosons in a trap,” <i>Communications in Mathematical Physics</i>, vol. 322, no. 2. Springer, pp. 559–591, 2013.","apa":"Grech, P., &#38; Seiringer, R. (2013). The excitation spectrum for weakly interacting Bosons in a trap. <i>Communications in Mathematical Physics</i>. Springer. <a href=\"https://doi.org/10.1007/s00220-013-1736-8\">https://doi.org/10.1007/s00220-013-1736-8</a>","mla":"Grech, Philip, and Robert Seiringer. “The Excitation Spectrum for Weakly Interacting Bosons in a Trap.” <i>Communications in Mathematical Physics</i>, vol. 322, no. 2, Springer, 2013, pp. 559–91, doi:<a href=\"https://doi.org/10.1007/s00220-013-1736-8\">10.1007/s00220-013-1736-8</a>.","ista":"Grech P, Seiringer R. 2013. The excitation spectrum for weakly interacting Bosons in a trap. Communications in Mathematical Physics. 322(2), 559–591.","short":"P. Grech, R. Seiringer, Communications in Mathematical Physics 322 (2013) 559–591."},"_id":"2408","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1205.5259"}],"abstract":[{"text":"We investigate the low-energy excitation spectrum of a Bose gas confined in a trap, with weak long-range repulsive interactions. In particular, we prove that the spectrum can be described in terms of the eigenvalues of an effective one-particle operator, as predicted by the Bogoliubov approximation.","lang":"eng"}],"year":"2013","extern":1,"publisher":"Springer"},{"has_accepted_license":"1","publisher":"American Society for Microbiology","abstract":[{"text":"Here, we describe a novel virulent bacteriophage that infects Bacillus weihenstephanensis, isolated from soil in Austria. It is the first phage to be discovered that infects this species. Here, we present the complete genome sequence of this podovirus. ","lang":"eng"}],"department":[{"_id":"JoBo"},{"_id":"LifeSc"}],"file_date_updated":"2020-07-14T12:45:40Z","citation":{"short":"R.A. Fernandes Redondo, A. Kupczok, G. Stift, J.P. Bollback, Genome Announcements 1 (2013).","ista":"Fernandes Redondo RA, Kupczok A, Stift G, Bollback JP. 2013. Complete genome sequence of the novel phage MG-B1 infecting bacillus weihenstephanensis. Genome Announcements. 1(3).","chicago":"Fernandes Redondo, Rodrigo A, Anne Kupczok, Gertraud Stift, and Jonathan P Bollback. “Complete Genome Sequence of the Novel Phage MG-B1 Infecting Bacillus Weihenstephanensis.” <i>Genome Announcements</i>. American Society for Microbiology, 2013. <a href=\"https://doi.org/10.1128/genomeA.00216-13\">https://doi.org/10.1128/genomeA.00216-13</a>.","apa":"Fernandes Redondo, R. A., Kupczok, A., Stift, G., &#38; Bollback, J. P. (2013). Complete genome sequence of the novel phage MG-B1 infecting bacillus weihenstephanensis. <i>Genome Announcements</i>. American Society for Microbiology. <a href=\"https://doi.org/10.1128/genomeA.00216-13\">https://doi.org/10.1128/genomeA.00216-13</a>","ieee":"R. A. Fernandes Redondo, A. Kupczok, G. Stift, and J. P. Bollback, “Complete genome sequence of the novel phage MG-B1 infecting bacillus weihenstephanensis,” <i>Genome Announcements</i>, vol. 1, no. 3. American Society for Microbiology, 2013.","ama":"Fernandes Redondo RA, Kupczok A, Stift G, Bollback JP. Complete genome sequence of the novel phage MG-B1 infecting bacillus weihenstephanensis. <i>Genome Announcements</i>. 2013;1(3). doi:<a href=\"https://doi.org/10.1128/genomeA.00216-13\">10.1128/genomeA.00216-13</a>","mla":"Fernandes Redondo, Rodrigo A., et al. “Complete Genome Sequence of the Novel Phage MG-B1 Infecting Bacillus Weihenstephanensis.” <i>Genome Announcements</i>, vol. 1, no. 3, American Society for Microbiology, 2013, doi:<a href=\"https://doi.org/10.1128/genomeA.00216-13\">10.1128/genomeA.00216-13</a>."},"ddc":["576"],"author":[{"id":"409D5C96-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5837-2793","last_name":"Fernandes Redondo","full_name":"Fernandes Redondo, Rodrigo A","first_name":"Rodrigo A"},{"full_name":"Kupczok, Anne","first_name":"Anne","id":"2BB22BC2-F248-11E8-B48F-1D18A9856A87","last_name":"Kupczok"},{"first_name":"Gertraud","full_name":"Stift, Gertraud","id":"2DB195CA-F248-11E8-B48F-1D18A9856A87","last_name":"Stift"},{"first_name":"Jonathan P","full_name":"Bollback, Jonathan P","orcid":"0000-0002-4624-4612","id":"2C6FA9CC-F248-11E8-B48F-1D18A9856A87","last_name":"Bollback"}],"doi":"10.1128/genomeA.00216-13","intvolume":"         1","quality_controlled":"1","date_created":"2018-12-11T11:57:30Z","status":"public","publication_status":"published","date_updated":"2024-10-09T20:55:15Z","issue":"3","month":"06","year":"2013","oa_version":"Published Version","_id":"2410","pubrep_id":"398","language":[{"iso":"eng"}],"file":[{"date_created":"2018-12-12T10:17:36Z","access_level":"open_access","checksum":"0751ec74b695567e0cdf02aaf9c26829","content_type":"application/pdf","file_size":130026,"creator":"system","relation":"main_file","file_name":"IST-2015-398-v1+1_Genome_Announc.-2013-Redondo-.pdf","date_updated":"2020-07-14T12:45:40Z","file_id":"5291"}],"type":"journal_article","volume":1,"publication":"Genome Announcements","publist_id":"4516","day":"13","title":"Complete genome sequence of the novel phage MG-B1 infecting bacillus weihenstephanensis","oa":1,"date_published":"2013-06-13T00:00:00Z","fulldoi":"https://doi.org/10.1128/genomeA.00216-13","corr_author":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":1},{"title":"Probabilistic models for CRISPR spacer content evolution ","publist_id":"4514","day":"26","publication":"BMC Evolutionary Biology","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","scopus_import":"1","corr_author":"1","page":"54 - 54","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"date_published":"2013-02-26T00:00:00Z","fulldoi":"https://doi.org/10.1186/1471-2148-13-54","isi":1,"oa":1,"year":"2013","oa_version":"Published Version","_id":"2412","volume":13,"type":"journal_article","file":[{"date_created":"2018-12-12T10:17:15Z","relation":"main_file","file_name":"IST-2015-397-v1+1_1471-2148-13-54.pdf","date_updated":"2020-07-14T12:45:40Z","file_id":"5268","access_level":"open_access","checksum":"029c7e0b198c19312b66ecce3cabb22f","content_type":"application/pdf","file_size":518729,"creator":"system"}],"language":[{"iso":"eng"}],"pubrep_id":"397","status":"public","date_created":"2018-12-11T11:57:31Z","external_id":{"isi":["000321524500001"]},"quality_controlled":"1","month":"02","date_updated":"2025-09-29T14:15:59Z","issue":"1","publication_status":"published","department":[{"_id":"JoBo"}],"file_date_updated":"2020-07-14T12:45:40Z","abstract":[{"text":"Background: The CRISPR/Cas system is known to act as an adaptive and heritable immune system in Eubacteria and Archaea. Immunity is encoded in an array of spacer sequences. Each spacer can provide specific immunity to invasive elements that carry the same or a similar sequence. Even in closely related strains, spacer content is very dynamic and evolves quickly. Standard models of nucleotide evolutioncannot be applied to quantify its rate of change since processes other than single nucleotide changes determine its evolution.Methods We present probabilistic models that are specific for spacer content evolution. They account for the different processes of insertion and deletion. Insertions can be constrained to occur on one end only or are allowed to occur throughout the array. One deletion event can affect one spacer or a whole fragment of adjacent spacers. Parameters of the underlying models are estimated for a pair of arrays by maximum likelihood using explicit ancestor enumeration.Results Simulations show that parameters are well estimated on average under the models presented here. There is a bias in the rate estimation when including fragment deletions. The models also estimate times between pairs of strains. But with increasing time, spacer overlap goes to zero, and thus there is an upper bound on the distance that can be estimated. Spacer content similarities are displayed in a distance based phylogeny using the estimated times.We use the presented models to analyze different Yersinia pestis data sets and find that the results among them are largely congruent. The models also capture the variation in diversity of spacers among the data sets. A comparison of spacer-based phylogenies and Cas gene phylogenies shows that they resolve very different time scales for this data set.Conclusions The simulations and data analyses show that the presented models are useful for quantifying spacer content evolution and for displaying spacer content similarities of closely related strains in a phylogeny. This allows for comparisons of different CRISPR arrays or for comparisons between CRISPR arrays and nucleotide substitution rates.","lang":"eng"}],"article_processing_charge":"No","publisher":"BioMed Central","has_accepted_license":"1","doi":"10.1186/1471-2148-13-54","intvolume":"        13","author":[{"last_name":"Kupczok","id":"2BB22BC2-F248-11E8-B48F-1D18A9856A87","first_name":"Anne","full_name":"Kupczok, Anne"},{"orcid":"0000-0002-4624-4612","id":"2C6FA9CC-F248-11E8-B48F-1D18A9856A87","last_name":"Bollback","first_name":"Jonathan P","full_name":"Bollback, Jonathan P"}],"ddc":["576"],"citation":{"ista":"Kupczok A, Bollback JP. 2013. Probabilistic models for CRISPR spacer content evolution . BMC Evolutionary Biology. 13(1), 54–54.","short":"A. Kupczok, J.P. Bollback, BMC Evolutionary Biology 13 (2013) 54–54.","mla":"Kupczok, Anne, and Jonathan P. Bollback. “Probabilistic Models for CRISPR Spacer Content Evolution .” <i>BMC Evolutionary Biology</i>, vol. 13, no. 1, BioMed Central, 2013, pp. 54–54, doi:<a href=\"https://doi.org/10.1186/1471-2148-13-54\">10.1186/1471-2148-13-54</a>.","chicago":"Kupczok, Anne, and Jonathan P Bollback. “Probabilistic Models for CRISPR Spacer Content Evolution .” <i>BMC Evolutionary Biology</i>. BioMed Central, 2013. <a href=\"https://doi.org/10.1186/1471-2148-13-54\">https://doi.org/10.1186/1471-2148-13-54</a>.","ieee":"A. Kupczok and J. P. Bollback, “Probabilistic models for CRISPR spacer content evolution ,” <i>BMC Evolutionary Biology</i>, vol. 13, no. 1. BioMed Central, pp. 54–54, 2013.","ama":"Kupczok A, Bollback JP. Probabilistic models for CRISPR spacer content evolution . <i>BMC Evolutionary Biology</i>. 2013;13(1):54-54. doi:<a href=\"https://doi.org/10.1186/1471-2148-13-54\">10.1186/1471-2148-13-54</a>","apa":"Kupczok, A., &#38; Bollback, J. P. (2013). Probabilistic models for CRISPR spacer content evolution . <i>BMC Evolutionary Biology</i>. BioMed Central. <a href=\"https://doi.org/10.1186/1471-2148-13-54\">https://doi.org/10.1186/1471-2148-13-54</a>"}},{"doi":"10.1002/9783527671632.ch08","type":"book_chapter","author":[{"last_name":"Valderrama","full_name":"Valderrama, Mario","first_name":"Mario"},{"id":"421234E8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8790-1914","last_name":"Botella Soler","full_name":"Botella Soler, Vicente","first_name":"Vicente"},{"last_name":"Le Van Quyen","full_name":"Le Van Quyen, Michel","first_name":"Michel"}],"citation":{"chicago":"Valderrama, Mario, Vicente Botella Soler, and Michel Le Van Quyen. “Neuronal Oscillations Scale up and Scale down the Brain Dynamics .” In <i>Multiscale Analysis and Nonlinear Dynamics: From Genes to the Brain</i>, edited by Misha Meyer and Z. Pesenson. Wiley, 2013. <a href=\"https://doi.org/10.1002/9783527671632.ch08\">https://doi.org/10.1002/9783527671632.ch08</a>.","ieee":"M. Valderrama, V. Botella Soler, and M. Le Van Quyen, “Neuronal oscillations scale up and scale down the brain dynamics ,” in <i>Multiscale Analysis and Nonlinear Dynamics: From Genes to the Brain</i>, M. Meyer and Z. Pesenson, Eds. Wiley, 2013.","apa":"Valderrama, M., Botella Soler, V., &#38; Le Van Quyen, M. (2013). Neuronal oscillations scale up and scale down the brain dynamics . In M. Meyer &#38; Z. Pesenson (Eds.), <i>Multiscale Analysis and Nonlinear Dynamics: From Genes to the Brain</i>. Wiley. <a href=\"https://doi.org/10.1002/9783527671632.ch08\">https://doi.org/10.1002/9783527671632.ch08</a>","ama":"Valderrama M, Botella Soler V, Le Van Quyen M. Neuronal oscillations scale up and scale down the brain dynamics . In: Meyer M, Pesenson Z, eds. <i>Multiscale Analysis and Nonlinear Dynamics: From Genes to the Brain</i>. Wiley; 2013. doi:<a href=\"https://doi.org/10.1002/9783527671632.ch08\">10.1002/9783527671632.ch08</a>","mla":"Valderrama, Mario, et al. “Neuronal Oscillations Scale up and Scale down the Brain Dynamics .” <i>Multiscale Analysis and Nonlinear Dynamics: From Genes to the Brain</i>, edited by Misha Meyer and Z. Pesenson, Wiley, 2013, doi:<a href=\"https://doi.org/10.1002/9783527671632.ch08\">10.1002/9783527671632.ch08</a>.","ista":"Valderrama M, Botella Soler V, Le Van Quyen M. 2013.Neuronal oscillations scale up and scale down the brain dynamics . In: Multiscale Analysis and Nonlinear Dynamics: From Genes to the Brain. Reviews of Nonlinear Dynamics and Complexity, .","short":"M. Valderrama, V. Botella Soler, M. Le Van Quyen, in:, M. Meyer, Z. Pesenson (Eds.), Multiscale Analysis and Nonlinear Dynamics: From Genes to the Brain, Wiley, 2013."},"language":[{"iso":"eng"}],"department":[{"_id":"GaTk"}],"year":"2013","_id":"2413","abstract":[{"text":"Progress in understanding the global brain dynamics has remained slow to date in large part because of the highly multiscale nature of brain activity. Indeed, normal brain dynamics is characterized by complex interactions between multiple levels: from the microscopic scale of single neurons to the mesoscopic level of local groups of neurons, and finally to the macroscopic level of the whole brain. Among the most difficult tasks are those of identifying which scales are significant for a given particular function and describing how the scales affect each other. It is important to realize that the scales of time and space are linked together, or even intertwined, and that causal inference is far more ambiguous between than within levels. We approach this problem from the perspective of our recent work on simultaneous recording from micro- and macroelectrodes in the human brain. We propose a physiological description of these multilevel interactions, based on phase–amplitude coupling of neuronal oscillations that operate at multiple frequencies and on different spatial scales. Specifically, the amplitude of the oscillations on a particular spatial scale is modulated by phasic variations in neuronal excitability induced by lower frequency oscillations that emerge on a larger spatial scale. Following this general principle, it is possible to scale up or scale down the multiscale brain dynamics. It is expected that large-scale network oscillations in the low-frequency range, mediating downward effects, may play an important role in attention and consciousness.","lang":"eng"}],"article_processing_charge":"No","oa_version":"None","publisher":"Wiley","month":"08","scopus_import":"1","publication_identifier":{"eisbn":["9783527671632"],"isbn":["9783527411986 "]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","editor":[{"last_name":"Meyer","first_name":"Misha","full_name":"Meyer, Misha"},{"last_name":"Pesenson","first_name":"Z.","full_name":"Pesenson, Z."}],"date_updated":"2025-06-03T11:46:23Z","date_published":"2013-08-01T00:00:00Z","fulldoi":"https://doi.org/10.1002/9783527671632.ch08","publication_status":"published","title":"Neuronal oscillations scale up and scale down the brain dynamics ","status":"public","alternative_title":["Reviews of Nonlinear Dynamics and Complexity"],"publist_id":"4513","day":"01","date_created":"2018-12-11T11:57:31Z","quality_controlled":"1","publication":"Multiscale Analysis and Nonlinear Dynamics: From Genes to the Brain"},{"abstract":[{"text":"We consider two core algorithmic problems for probabilistic verification: the maximal end-component decomposition and the almost-sure reachability set computation for Markov decision processes (MDPs). For MDPs with treewidth k, we present two improved static algorithms for both the problems that run in time O(n·k 2.38·2k ) and O(m·logn· k), respectively, where n is the number of states and m is the number of edges, significantly improving the previous known O(n·k·√n· k) bound for low treewidth. We also present decremental algorithms for both problems for MDPs with constant treewidth that run in amortized logarithmic time, which is a huge improvement over the previously known algorithms that require amortized linear time.","lang":"eng"}],"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1304.0084"}],"department":[{"_id":"KrCh"}],"publisher":"Springer","author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"full_name":"Ła̧Cki, Jakub","first_name":"Jakub","last_name":"Ła̧Cki"}],"intvolume":"      8044","doi":"10.1007/978-3-642-39799-8_36","citation":{"ieee":"K. Chatterjee and J. Ła̧Cki, “Faster algorithms for Markov decision processes with low treewidth,” vol. 8044. Springer, pp. 543–558, 2013.","apa":"Chatterjee, K., &#38; Ła̧Cki, J. (2013). Faster algorithms for Markov decision processes with low treewidth. Presented at the CAV: Computer Aided Verification, St. Petersburg, Russia: Springer. <a href=\"https://doi.org/10.1007/978-3-642-39799-8_36\">https://doi.org/10.1007/978-3-642-39799-8_36</a>","ama":"Chatterjee K, Ła̧Cki J. Faster algorithms for Markov decision processes with low treewidth. 2013;8044:543-558. doi:<a href=\"https://doi.org/10.1007/978-3-642-39799-8_36\">10.1007/978-3-642-39799-8_36</a>","chicago":"Chatterjee, Krishnendu, and Jakub Ła̧Cki. “Faster Algorithms for Markov Decision Processes with Low Treewidth.” Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-39799-8_36\">https://doi.org/10.1007/978-3-642-39799-8_36</a>.","mla":"Chatterjee, Krishnendu, and Jakub Ła̧Cki. <i>Faster Algorithms for Markov Decision Processes with Low Treewidth</i>. Vol. 8044, Springer, 2013, pp. 543–58, doi:<a href=\"https://doi.org/10.1007/978-3-642-39799-8_36\">10.1007/978-3-642-39799-8_36</a>.","ista":"Chatterjee K, Ła̧Cki J. 2013. Faster algorithms for Markov decision processes with low treewidth. 8044, 543–558.","short":"K. Chatterjee, J. Ła̧Cki, 8044 (2013) 543–558."},"date_created":"2018-12-11T11:57:42Z","status":"public","quality_controlled":"1","conference":{"end_date":"2013-07-19","start_date":"2013-07-13","name":"CAV: Computer Aided Verification","location":"St. Petersburg, Russia"},"external_id":{"arxiv":["1304.0084"]},"project":[{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"Game Theory","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"ec_funded":1,"month":"07","publication_status":"published","date_updated":"2020-08-11T10:09:47Z","oa_version":"Preprint","_id":"2444","arxiv":1,"year":"2013","type":"conference","series_title":"Lecture Notes in Computer Science","volume":8044,"language":[{"iso":"eng"}],"day":"01","publist_id":"4459","alternative_title":["LNCS"],"title":"Faster algorithms for Markov decision processes with low treewidth","page":"543 - 558","scopus_import":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"fulldoi":"https://doi.org/10.1007/978-3-642-39799-8_36","date_published":"2013-07-01T00:00:00Z"},{"publication_status":"published","date_updated":"2026-04-09T10:54:00Z","project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","grant_number":"267989","call_identifier":"FP7"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"}],"month":"07","ec_funded":1,"quality_controlled":"1","conference":{"location":"St. Petersburg, Russia","start_date":"2013-07-13","name":"CAV: Computer Aided Verification","end_date":"2013-07-19"},"date_created":"2018-12-11T11:57:42Z","status":"public","citation":{"chicago":"Cerny, Pavol, Thomas A Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, and Thorsten Tarrach. “Efficient Synthesis for Concurrency by Semantics-Preserving Transformations,” 8044:951–67. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-39799-8_68\">https://doi.org/10.1007/978-3-642-39799-8_68</a>.","ieee":"P. Cerny, T. A. Henzinger, A. Radhakrishna, L. Ryzhyk, and T. Tarrach, “Efficient synthesis for concurrency by semantics-preserving transformations,” presented at the CAV: Computer Aided Verification, St. Petersburg, Russia, 2013, vol. 8044, pp. 951–967.","apa":"Cerny, P., Henzinger, T. A., Radhakrishna, A., Ryzhyk, L., &#38; Tarrach, T. (2013). Efficient synthesis for concurrency by semantics-preserving transformations (Vol. 8044, pp. 951–967). Presented at the CAV: Computer Aided Verification, St. Petersburg, Russia: Springer. <a href=\"https://doi.org/10.1007/978-3-642-39799-8_68\">https://doi.org/10.1007/978-3-642-39799-8_68</a>","ama":"Cerny P, Henzinger TA, Radhakrishna A, Ryzhyk L, Tarrach T. Efficient synthesis for concurrency by semantics-preserving transformations. In: Vol 8044. Springer; 2013:951-967. doi:<a href=\"https://doi.org/10.1007/978-3-642-39799-8_68\">10.1007/978-3-642-39799-8_68</a>","mla":"Cerny, Pavol, et al. <i>Efficient Synthesis for Concurrency by Semantics-Preserving Transformations</i>. Vol. 8044, Springer, 2013, pp. 951–67, doi:<a href=\"https://doi.org/10.1007/978-3-642-39799-8_68\">10.1007/978-3-642-39799-8_68</a>.","ista":"Cerny P, Henzinger TA, Radhakrishna A, Ryzhyk L, Tarrach T. 2013. Efficient synthesis for concurrency by semantics-preserving transformations. CAV: Computer Aided Verification, LNCS, vol. 8044, 951–967.","short":"P. Cerny, T.A. Henzinger, A. Radhakrishna, L. Ryzhyk, T. Tarrach, in:, Springer, 2013, pp. 951–967."},"ddc":["000","004"],"author":[{"full_name":"Cerny, Pavol","first_name":"Pavol","last_name":"Cerny","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A"},{"last_name":"Radhakrishna","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","full_name":"Radhakrishna, Arjun","first_name":"Arjun"},{"first_name":"Leonid","full_name":"Ryzhyk, Leonid","last_name":"Ryzhyk"},{"full_name":"Tarrach, Thorsten","first_name":"Thorsten","last_name":"Tarrach","id":"3D6E8F2C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4409-8487"}],"intvolume":"      8044","doi":"10.1007/978-3-642-39799-8_68","publisher":"Springer","has_accepted_license":"1","abstract":[{"text":"We develop program synthesis techniques that can help programmers fix concurrency-related bugs. We make two new contributions to synthesis for concurrency, the first improving the efficiency of the synthesized code, and the second improving the efficiency of the synthesis procedure itself. The first contribution is to have the synthesis procedure explore a variety of (sequential) semantics-preserving program transformations. Classically, only one such transformation has been considered, namely, the insertion of synchronization primitives (such as locks). Based on common manual bug-fixing techniques used by Linux device-driver developers, we explore additional, more efficient transformations, such as the reordering of independent instructions. The second contribution is to speed up the counterexample-guided removal of concurrency bugs within the synthesis procedure by considering partial-order traces (instead of linear traces) as counterexamples. A partial-order error trace represents a set of linear (interleaved) traces of a concurrent program all of which lead to the same error. By eliminating a partial-order error trace, we eliminate in a single iteration of the synthesis procedure all linearizations of the partial-order trace. We evaluated our techniques on several simplified examples of real concurrency bugs that occurred in Linux device drivers.","lang":"eng"}],"file_date_updated":"2020-07-14T12:45:40Z","department":[{"_id":"ToHe"}],"oa":1,"fulldoi":"https://doi.org/10.1007/978-3-642-39799-8_68","date_published":"2013-07-01T00:00:00Z","page":"951 - 967","related_material":{"record":[{"relation":"dissertation_contains","id":"1130","status":"public"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":1,"alternative_title":["LNCS"],"publist_id":"4458","day":"01","title":"Efficient synthesis for concurrency by semantics-preserving transformations","pubrep_id":"199","language":[{"iso":"eng"}],"file":[{"relation":"main_file","file_name":"IST-2014-199-v1+1_cav2013-final.pdf","date_updated":"2020-07-14T12:45:40Z","file_id":"5158","checksum":"70c70ca5487faba82262c63e1b678a27","access_level":"open_access","content_type":"application/pdf","file_size":365548,"creator":"system","date_created":"2018-12-12T10:15:37Z"}],"type":"conference","volume":8044,"oa_version":"Submitted Version","_id":"2445","year":"2013"},{"citation":{"short":"K. Chatterjee, A. Gaiser, J. Kretinsky, 8044 (2013) 559–575.","ista":"Chatterjee K, Gaiser A, Kretinsky J. 2013. Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis. 8044, 559–575.","mla":"Chatterjee, Krishnendu, et al. <i>Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis</i>. Vol. 8044, Springer, 2013, pp. 559–75, doi:<a href=\"https://doi.org/10.1007/978-3-642-39799-8_37\">10.1007/978-3-642-39799-8_37</a>.","apa":"Chatterjee, K., Gaiser, A., &#38; Kretinsky, J. (2013). Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis. Presented at the CAV: Computer Aided Verification, St. Petersburg, Russia: Springer. <a href=\"https://doi.org/10.1007/978-3-642-39799-8_37\">https://doi.org/10.1007/978-3-642-39799-8_37</a>","ieee":"K. Chatterjee, A. Gaiser, and J. Kretinsky, “Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis,” vol. 8044. Springer, pp. 559–575, 2013.","ama":"Chatterjee K, Gaiser A, Kretinsky J. Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis. 2013;8044:559-575. doi:<a href=\"https://doi.org/10.1007/978-3-642-39799-8_37\">10.1007/978-3-642-39799-8_37</a>","chicago":"Chatterjee, Krishnendu, Andreas Gaiser, and Jan Kretinsky. “Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis.” Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-39799-8_37\">https://doi.org/10.1007/978-3-642-39799-8_37</a>."},"doi":"10.1007/978-3-642-39799-8_37","intvolume":"      8044","author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"last_name":"Gaiser","first_name":"Andreas","full_name":"Gaiser, Andreas"},{"first_name":"Jan","full_name":"Kretinsky, Jan","last_name":"Kretinsky","orcid":"0000-0002-8122-2881","id":"44CEF464-F248-11E8-B48F-1D18A9856A87"}],"publisher":"Springer","department":[{"_id":"KrCh"}],"abstract":[{"text":"The model-checking problem for probabilistic systems crucially relies on the translation of LTL to deterministic Rabin automata (DRW). Our recent Safraless translation [KE12, GKE12] for the LTL(F,G) fragment produces smaller automata as compared to the traditional approach. In this work, instead of DRW we consider deterministic automata with acceptance condition given as disjunction of generalized Rabin pairs (DGRW). The Safraless translation of LTL(F,G) formulas to DGRW results in smaller automata as compared to DRW. We present algorithms for probabilistic model-checking as well as game solving for DGRW conditions. Our new algorithms lead to improvement both in terms of theoretical bounds as well as practical evaluation. We compare PRISM with and without our new translation, and show that the new translation leads to significant improvements.","lang":"eng"}],"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1304.5281"}],"date_updated":"2020-08-11T10:09:47Z","publication_status":"published","ec_funded":1,"month":"07","project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","grant_number":"S11407"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"external_id":{"arxiv":["1304.5281"]},"conference":{"end_date":"2013-07-19","start_date":"2013-07-13","name":"CAV: Computer Aided Verification","location":"St. Petersburg, Russia"},"quality_controlled":"1","status":"public","date_created":"2018-12-11T11:57:42Z","language":[{"iso":"eng"}],"volume":8044,"series_title":"Lecture Notes in Computer Science","type":"conference","year":"2013","arxiv":1,"_id":"2446","oa_version":"Preprint","date_published":"2013-07-01T00:00:00Z","fulldoi":"https://doi.org/10.1007/978-3-642-39799-8_37","oa":1,"scopus_import":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"559 - 575","title":"Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis","publist_id":"4457","alternative_title":["LNCS"],"day":"01"},{"quality_controlled":"1","conference":{"end_date":"2013-07-19","name":"CAV: Computer Aided Verification","start_date":"2013-07-13","location":"St. Petersburg, Russia"},"date_created":"2018-12-11T11:57:43Z","status":"public","publication_status":"published","date_updated":"2020-08-11T10:09:47Z","month":"07","has_accepted_license":"1","publisher":"Springer","article_processing_charge":"No","abstract":[{"text":"Separation logic (SL) has gained widespread popularity because of its ability to succinctly express complex invariants of a program’s heap configurations. Several specialized provers have been developed for decidable SL fragments. However, these provers cannot be easily extended or combined with solvers for other theories that are important in program verification, e.g., linear arithmetic. In this paper, we present a reduction of decidable SL fragments to a decidable first-order theory that fits well into the satisfiability modulo theories (SMT) framework. We show how to use this reduction to automate satisfiability, entailment, frame inference, and abduction problems for separation logic using SMT solvers. Our approach provides a simple method of integrating separation logic into existing verification tools that provide SMT backends, and an elegant way of combining SL fragments with other decidable first-order theories. We implemented this approach in a verification tool and applied it to heap-manipulating programs whose verification involves reasoning in theory combinations.\r\n","lang":"eng"}],"department":[{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:45:41Z","citation":{"chicago":"Piskac, Ruzica, Thomas Wies, and Damien Zufferey. “Automating Separation Logic Using SMT.” Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-39799-8_54\">https://doi.org/10.1007/978-3-642-39799-8_54</a>.","ama":"Piskac R, Wies T, Zufferey D. Automating separation logic using SMT. 2013;8044:773-789. doi:<a href=\"https://doi.org/10.1007/978-3-642-39799-8_54\">10.1007/978-3-642-39799-8_54</a>","apa":"Piskac, R., Wies, T., &#38; Zufferey, D. (2013). Automating separation logic using SMT. Presented at the CAV: Computer Aided Verification, St. Petersburg, Russia: Springer. <a href=\"https://doi.org/10.1007/978-3-642-39799-8_54\">https://doi.org/10.1007/978-3-642-39799-8_54</a>","ieee":"R. Piskac, T. Wies, and D. Zufferey, “Automating separation logic using SMT,” vol. 8044. Springer, pp. 773–789, 2013.","mla":"Piskac, Ruzica, et al. <i>Automating Separation Logic Using SMT</i>. Vol. 8044, Springer, 2013, pp. 773–89, doi:<a href=\"https://doi.org/10.1007/978-3-642-39799-8_54\">10.1007/978-3-642-39799-8_54</a>.","short":"R. Piskac, T. Wies, D. Zufferey, 8044 (2013) 773–789.","ista":"Piskac R, Wies T, Zufferey D. 2013. Automating separation logic using SMT. 8044, 773–789."},"ddc":["000"],"author":[{"first_name":"Ruzica","full_name":"Piskac, Ruzica","last_name":"Piskac"},{"first_name":"Thomas","full_name":"Wies, Thomas","last_name":"Wies","id":"447BFB88-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-3197-8736","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","last_name":"Zufferey","first_name":"Damien","full_name":"Zufferey, Damien"}],"intvolume":"      8044","doi":"10.1007/978-3-642-39799-8_54","day":"01","publist_id":"4456","alternative_title":["LNCS"],"title":"Automating separation logic using SMT","oa":1,"fulldoi":"https://doi.org/10.1007/978-3-642-39799-8_54","date_published":"2013-07-01T00:00:00Z","page":"773 - 789","scopus_import":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","_id":"2447","year":"2013","language":[{"iso":"eng"}],"type":"conference","file":[{"date_created":"2020-05-15T11:13:01Z","content_type":"application/pdf","checksum":"2e866932ab688f47ecd504acb4d5c7d4","access_level":"open_access","creator":"dernst","file_size":309182,"file_name":"2013_CAV_Piskac.pdf","relation":"main_file","file_id":"7859","date_updated":"2020-07-14T12:45:41Z"}],"series_title":"Lecture Notes in Computer Science","volume":8044},{"project":[{"name":"Polarity and subcellular dynamics in plants","grant_number":"282300","_id":"25716A02-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"ec_funded":1,"month":"07","publication_status":"published","date_updated":"2025-04-15T07:48:02Z","issue":"10","date_created":"2018-12-11T11:57:43Z","status":"public","quality_controlled":"1","external_id":{"pmid":["23857365"]},"author":[{"last_name":"Remy","full_name":"Remy, Estelle","first_name":"Estelle"},{"first_name":"Pawel","full_name":"Baster, Pawel","last_name":"Baster","id":"3028BD74-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Friml","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jirí","full_name":"Friml, Jirí"},{"last_name":"Duque","full_name":"Duque, Paula","first_name":"Paula"}],"doi":"10.4161/psb.25688","intvolume":"         8","citation":{"ista":"Remy E, Baster P, Friml J, Duque P. 2013. ZIFL1.1 transporter modulates polar auxin transport by stabilizing membrane abundance of multiple PINs in Arabidopsis root tip. Plant Signaling &#38; Behavior. 8(10), e25688.","short":"E. Remy, P. Baster, J. Friml, P. Duque, Plant Signaling &#38; Behavior 8 (2013).","mla":"Remy, Estelle, et al. “ZIFL1.1 Transporter Modulates Polar Auxin Transport by Stabilizing Membrane Abundance of Multiple PINs in Arabidopsis Root Tip.” <i>Plant Signaling &#38; Behavior</i>, vol. 8, no. 10, e25688, Taylor &#38; Francis, 2013, doi:<a href=\"https://doi.org/10.4161/psb.25688\">10.4161/psb.25688</a>.","chicago":"Remy, Estelle, Pawel Baster, Jiří Friml, and Paula Duque. “ZIFL1.1 Transporter Modulates Polar Auxin Transport by Stabilizing Membrane Abundance of Multiple PINs in Arabidopsis Root Tip.” <i>Plant Signaling &#38; Behavior</i>. Taylor &#38; Francis, 2013. <a href=\"https://doi.org/10.4161/psb.25688\">https://doi.org/10.4161/psb.25688</a>.","ieee":"E. Remy, P. Baster, J. Friml, and P. Duque, “ZIFL1.1 transporter modulates polar auxin transport by stabilizing membrane abundance of multiple PINs in Arabidopsis root tip,” <i>Plant Signaling &#38; Behavior</i>, vol. 8, no. 10. Taylor &#38; Francis, 2013.","apa":"Remy, E., Baster, P., Friml, J., &#38; Duque, P. (2013). ZIFL1.1 transporter modulates polar auxin transport by stabilizing membrane abundance of multiple PINs in Arabidopsis root tip. <i>Plant Signaling &#38; Behavior</i>. Taylor &#38; Francis. <a href=\"https://doi.org/10.4161/psb.25688\">https://doi.org/10.4161/psb.25688</a>","ama":"Remy E, Baster P, Friml J, Duque P. ZIFL1.1 transporter modulates polar auxin transport by stabilizing membrane abundance of multiple PINs in Arabidopsis root tip. <i>Plant Signaling &#38; Behavior</i>. 2013;8(10). doi:<a href=\"https://doi.org/10.4161/psb.25688\">10.4161/psb.25688</a>"},"main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4091088/","open_access":"1"}],"article_processing_charge":"No","abstract":[{"lang":"eng","text":"Cell-to-cell directional flow of the phytohormone auxin is primarily established by polar localization of the PIN auxin transporters, a process tightly regulated at multiple levels by auxin itself. We recently reported that, in the context of strong auxin flows, activity of the vacuolar ZIFL1.1 transporter is required for fine-tuning of polar auxin transport rates in the Arabidopsis root. In particular, ZIFL1.1 function protects plasma-membrane stability of the PIN2 carrier in epidermal root tip cells under conditions normally triggering PIN2 degradation. Here, we show that ZIFL1.1 activity at the root tip also promotes PIN1 plasma-membrane abundance in central cylinder cells, thus supporting the notion that ZIFL1.1 acts as a general positive modulator of polar auxin transport in roots."}],"department":[{"_id":"JiFr"}],"publisher":"Taylor & Francis","scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"date_published":"2013-07-10T00:00:00Z","fulldoi":"https://doi.org/10.4161/psb.25688","publist_id":"4455","day":"10","title":"ZIFL1.1 transporter modulates polar auxin transport by stabilizing membrane abundance of multiple PINs in Arabidopsis root tip","article_number":"e25688","publication":"Plant Signaling & Behavior","type":"journal_article","volume":8,"pmid":1,"language":[{"iso":"eng"}],"year":"2013","oa_version":"Submitted Version","_id":"2448","article_type":"original"},{"quality_controlled":"1","external_id":{"isi":["000327541200010"]},"date_created":"2018-12-11T11:57:44Z","status":"public","publication_status":"published","issue":"6","date_updated":"2025-09-29T14:14:22Z","month":"11","publisher":"Cell Press","article_processing_charge":"No","abstract":[{"text":"Intracellular protein routing is mediated by vesicular transport which is tightly regulated in eukaryotes. The protein and lipid homeostasis depends on coordinated delivery of de novo synthesized or recycled cargoes to the plasma membrane by exocytosis and their subsequent removal by rerouting them for recycling or degradation. Here, we report the characterization of protein affected trafficking 3 (pat3) mutant that we identified by an epifluorescence-based forward genetic screen for mutants defective in subcellular distribution of Arabidopsis auxin transporter PIN1–GFP. While pat3 displays largely normal plant morphology and development in nutrient-rich conditions, it shows strong ectopic intracellular accumulations of different plasma membrane cargoes in structures that resemble prevacuolar compartments (PVC) with an aberrant morphology. Genetic mapping revealed that pat3 is defective in vacuolar protein sorting 35A (VPS35A), a putative subunit of the retromer complex that mediates retrograde trafficking between the PVC and trans-Golgi network. Similarly, a mutant defective in another retromer subunit, vps29, shows comparable subcellular defects in PVC morphology and protein accumulation. Thus, our data provide evidence that the retromer components VPS35A and VPS29 are essential for normal PVC morphology and normal trafficking of plasma membrane proteins in plants. In addition, we show that, out of the three VPS35 retromer subunits present in Arabidopsis thaliana genome, the VPS35 homolog A plays a prevailing role in trafficking to the lytic vacuole, presenting another level of complexity in the retromer-dependent vacuolar sorting. ","lang":"eng"}],"department":[{"_id":"JiFr"}],"citation":{"ista":"Nodzyński T, Feraru M, Hirsch S, De Rycke R, Nicuales C, Van Leene J, De Jaeger G, Vanneste S, Friml J. 2013. Retromer subunits VPS35A and VPS29 mediate prevacuolar compartment (PVC) function in Arabidopsis. Molecular Plant. 6(6), 1849–1862.","short":"T. Nodzyński, M. Feraru, S. Hirsch, R. De Rycke, C. Nicuales, J. Van Leene, G. De Jaeger, S. Vanneste, J. Friml, Molecular Plant 6 (2013) 1849–1862.","apa":"Nodzyński, T., Feraru, M., Hirsch, S., De Rycke, R., Nicuales, C., Van Leene, J., … Friml, J. (2013). Retromer subunits VPS35A and VPS29 mediate prevacuolar compartment (PVC) function in Arabidopsis. <i>Molecular Plant</i>. Cell Press. <a href=\"https://doi.org/10.1093/mp/sst044\">https://doi.org/10.1093/mp/sst044</a>","ieee":"T. Nodzyński <i>et al.</i>, “Retromer subunits VPS35A and VPS29 mediate prevacuolar compartment (PVC) function in Arabidopsis,” <i>Molecular Plant</i>, vol. 6, no. 6. Cell Press, pp. 1849–1862, 2013.","ama":"Nodzyński T, Feraru M, Hirsch S, et al. Retromer subunits VPS35A and VPS29 mediate prevacuolar compartment (PVC) function in Arabidopsis. <i>Molecular Plant</i>. 2013;6(6):1849-1862. doi:<a href=\"https://doi.org/10.1093/mp/sst044\">10.1093/mp/sst044</a>","chicago":"Nodzyński, Tomasz, Murguel Feraru, Sibylle Hirsch, Riet De Rycke, Claudiu Nicuales, Jelle Van Leene, Geert De Jaeger, Steffen Vanneste, and Jiří Friml. “Retromer Subunits VPS35A and VPS29 Mediate Prevacuolar Compartment (PVC) Function in Arabidopsis.” <i>Molecular Plant</i>. Cell Press, 2013. <a href=\"https://doi.org/10.1093/mp/sst044\">https://doi.org/10.1093/mp/sst044</a>.","mla":"Nodzyński, Tomasz, et al. “Retromer Subunits VPS35A and VPS29 Mediate Prevacuolar Compartment (PVC) Function in Arabidopsis.” <i>Molecular Plant</i>, vol. 6, no. 6, Cell Press, 2013, pp. 1849–62, doi:<a href=\"https://doi.org/10.1093/mp/sst044\">10.1093/mp/sst044</a>."},"author":[{"last_name":"Nodzyński","first_name":"Tomasz","full_name":"Nodzyński, Tomasz"},{"last_name":"Feraru","first_name":"Murguel","full_name":"Feraru, Murguel"},{"first_name":"Sibylle","full_name":"Hirsch, Sibylle","last_name":"Hirsch"},{"full_name":"De Rycke, Riet","first_name":"Riet","last_name":"De Rycke"},{"full_name":"Nicuales, Claudiu","first_name":"Claudiu","last_name":"Nicuales"},{"last_name":"Van Leene","full_name":"Van Leene, Jelle","first_name":"Jelle"},{"last_name":"De Jaeger","full_name":"De Jaeger, Geert","first_name":"Geert"},{"full_name":"Vanneste, Steffen","first_name":"Steffen","last_name":"Vanneste"},{"last_name":"Friml","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jirí","full_name":"Friml, Jirí"}],"intvolume":"         6","doi":"10.1093/mp/sst044","publication":"Molecular Plant","day":"01","publist_id":"4454","title":"Retromer subunits VPS35A and VPS29 mediate prevacuolar compartment (PVC) function in Arabidopsis","isi":1,"fulldoi":"https://doi.org/10.1093/mp/sst044","date_published":"2013-11-01T00:00:00Z","page":"1849 - 1862","corr_author":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","scopus_import":"1","oa_version":"None","_id":"2449","year":"2013","language":[{"iso":"eng"}],"type":"journal_article","volume":6},{"month":"07","page":"69 - 151","date_updated":"2021-01-12T06:57:33Z","date_published":"2013-07-01T00:00:00Z","fulldoi":"https://doi.org/10.1515/crelle.2012.039","issue":"680","publication_status":"published","oa":1,"title":"Inhomogeneous cubic congruences and rational points on del Pezzo surfaces","status":"public","day":"01","publist_id":"7659","date_created":"2018-12-11T11:45:24Z","quality_controlled":0,"publication":"Journal fur die Reine und Angewandte Mathematik","doi":"10.1515/crelle.2012.039","type":"journal_article","author":[{"last_name":"Baier","full_name":"Baier, Stephan","first_name":"Stephan"},{"last_name":"Browning","orcid":"0000-0002-8314-0177","id":"35827D50-F248-11E8-B48F-1D18A9856A87","first_name":"Timothy D","full_name":"Timothy Browning"}],"citation":{"ieee":"S. Baier and T. D. Browning, “Inhomogeneous cubic congruences and rational points on del Pezzo surfaces,” <i>Journal fur die Reine und Angewandte Mathematik</i>, no. 680. Walter de Gruyter, pp. 69–151, 2013.","apa":"Baier, S., &#38; Browning, T. D. (2013). Inhomogeneous cubic congruences and rational points on del Pezzo surfaces. <i>Journal Fur Die Reine Und Angewandte Mathematik</i>. Walter de Gruyter. <a href=\"https://doi.org/10.1515/crelle.2012.039\">https://doi.org/10.1515/crelle.2012.039</a>","ama":"Baier S, Browning TD. Inhomogeneous cubic congruences and rational points on del Pezzo surfaces. <i>Journal fur die Reine und Angewandte Mathematik</i>. 2013;(680):69-151. doi:<a href=\"https://doi.org/10.1515/crelle.2012.039\">10.1515/crelle.2012.039</a>","chicago":"Baier, Stephan, and Timothy D Browning. “Inhomogeneous Cubic Congruences and Rational Points on Del Pezzo Surfaces.” <i>Journal Fur Die Reine Und Angewandte Mathematik</i>. Walter de Gruyter, 2013. <a href=\"https://doi.org/10.1515/crelle.2012.039\">https://doi.org/10.1515/crelle.2012.039</a>.","mla":"Baier, Stephan, and Timothy D. Browning. “Inhomogeneous Cubic Congruences and Rational Points on Del Pezzo Surfaces.” <i>Journal Fur Die Reine Und Angewandte Mathematik</i>, no. 680, Walter de Gruyter, 2013, pp. 69–151, doi:<a href=\"https://doi.org/10.1515/crelle.2012.039\">10.1515/crelle.2012.039</a>.","ista":"Baier S, Browning TD. 2013. Inhomogeneous cubic congruences and rational points on del Pezzo surfaces. Journal fur die Reine und Angewandte Mathematik. (680), 69–151.","short":"S. Baier, T.D. Browning, Journal Fur Die Reine Und Angewandte Mathematik (2013) 69–151."},"extern":1,"year":"2013","_id":"245","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1011.3434"}],"abstract":[{"text":"For given non-zero integers a, b, q we investigate the density of solutions (x; y) ∈ ℤ2 to the binary cubic congruence ax2 + by3 ≡ 0 mod q, and use it to establish the Manin conjecture for a singular del Pezzo surface of degree 2 defined over ℚ.","lang":"eng"}],"publisher":"Walter de Gruyter"},{"citation":{"ista":"Liu J, Menhi S, Topping J, Friml J, Lindsey K. 2013. Interaction of PLS and PIN and hormonal crosstalk in Arabidopsis root development. Frontiers in Plant Science. 4(75).","short":"J. Liu, S. Menhi, J. Topping, J. Friml, K. Lindsey, Frontiers in Plant Science 4 (2013).","mla":"Liu, Junli, et al. “Interaction of PLS and PIN and Hormonal Crosstalk in Arabidopsis Root Development.” <i>Frontiers in Plant Science</i>, vol. 4, no. 75, Frontiers Research Foundation, 2013, doi:<a href=\"https://doi.org/10.3389/fpls.2013.00075\">10.3389/fpls.2013.00075</a>.","apa":"Liu, J., Menhi, S., Topping, J., Friml, J., &#38; Lindsey, K. (2013). Interaction of PLS and PIN and hormonal crosstalk in Arabidopsis root development. <i>Frontiers in Plant Science</i>. Frontiers Research Foundation. <a href=\"https://doi.org/10.3389/fpls.2013.00075\">https://doi.org/10.3389/fpls.2013.00075</a>","ama":"Liu J, Menhi S, Topping J, Friml J, Lindsey K. Interaction of PLS and PIN and hormonal crosstalk in Arabidopsis root development. <i>Frontiers in Plant Science</i>. 2013;4(75). doi:<a href=\"https://doi.org/10.3389/fpls.2013.00075\">10.3389/fpls.2013.00075</a>","ieee":"J. Liu, S. Menhi, J. Topping, J. Friml, and K. Lindsey, “Interaction of PLS and PIN and hormonal crosstalk in Arabidopsis root development,” <i>Frontiers in Plant Science</i>, vol. 4, no. 75. Frontiers Research Foundation, 2013.","chicago":"Liu, Junli, Saher Menhi, Jennifer Topping, Jiří Friml, and Keith Lindsey. “Interaction of PLS and PIN and Hormonal Crosstalk in Arabidopsis Root Development.” <i>Frontiers in Plant Science</i>. Frontiers Research Foundation, 2013. <a href=\"https://doi.org/10.3389/fpls.2013.00075\">https://doi.org/10.3389/fpls.2013.00075</a>."},"type":"journal_article","author":[{"last_name":"Liu","full_name":"Liu, Junli","first_name":"Junli"},{"last_name":"Menhi","full_name":"Menhi, Saher","first_name":"Saher"},{"first_name":"Jennifer","full_name":"Topping, Jennifer","last_name":"Topping"},{"first_name":"Jirí","full_name":"Jirí Friml","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml"},{"last_name":"Lindsey","first_name":"Keith","full_name":"Lindsey, Keith"}],"volume":4,"doi":"10.3389/fpls.2013.00075","intvolume":"         4","publisher":"Frontiers Research Foundation","year":"2013","_id":"2450","abstract":[{"lang":"eng","text":"Understanding how hormones and genes interact to coordinate plant growth is a major challenge in developmental biology. The activities of auxin, ethylene, and cytokinin depend on cellular context and exhibit either synergistic or antagonistic interactions. Here we use experimentation and network construction to elucidate the role of the interaction of the POLARIS peptide (PLS) and the auxin efflux carrier PIN proteins in the crosstalk of three hormones (auxin, ethylene, and cytokinin) in Arabidopsis root development. In ethylene hypersignaling mutants such as polaris (pls), we show experimentally that expression of both PIN1 and PIN2 significantly increases. This relationship is analyzed in the context of the crosstalk between auxin, ethylene, and cytokinin: in pls, endogenous auxin, ethylene and cytokinin concentration decreases, approximately remains unchanged and increases, respectively. Experimental data are integrated into a hormonal crosstalk network through combination with information in literature. Network construction reveals that the regulation of both PIN1 and PIN2 is predominantly via ethylene signaling. In addition, it is deduced that the relationship between cytokinin and PIN1 and PIN2 levels implies a regulatory role of cytokinin in addition to its regulation to auxin, ethylene, and PLS levels. We discuss how the network of hormones and genes coordinates plant growth by simultaneously regulating the activities of auxin, ethylene, and cytokinin signaling pathways.hormonal crosstalk, root development, auxin flux, PIN proteins, PLS protein, signaling network"}],"extern":1,"publication_status":"published","date_published":"2013-04-01T00:00:00Z","date_updated":"2021-01-12T06:57:34Z","fulldoi":"https://doi.org/10.3389/fpls.2013.00075","issue":"75","month":"04","quality_controlled":0,"publication":"Frontiers in Plant Science","publist_id":"4453","day":"01","date_created":"2018-12-11T11:57:44Z","title":"Interaction of PLS and PIN and hormonal crosstalk in Arabidopsis root development","status":"public"},{"type":"journal_article","author":[{"last_name":"Barbez","first_name":"Elke","full_name":"Barbez, Elke"},{"first_name":"Martina","full_name":"Laňková, Martina","last_name":"Laňková"},{"first_name":"Markéta","full_name":"Pařezová, Markéta","last_name":"Pařezová"},{"first_name":"Alexis","full_name":"Maizel, Alexis","last_name":"Maizel"},{"last_name":"Zažímalová","full_name":"Zažímalová, Eva","first_name":"Eva"},{"full_name":"Petrášek, Jan","first_name":"Jan","last_name":"Petrášek"},{"first_name":"Jirí","full_name":"Jirí Friml","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml"},{"full_name":"Kleine-Vehn, Jürgen","first_name":"Jürgen","last_name":"Kleine Vehn"}],"volume":13,"doi":"10.1186/1471-2229-13-20","intvolume":"        13","citation":{"short":"E. Barbez, M. Laňková, M. Pařezová, A. Maizel, E. Zažímalová, J. Petrášek, J. Friml, J. Kleine Vehn, BMC Plant Biology 13 (2013).","ista":"Barbez E, Laňková M, Pařezová M, Maizel A, Zažímalová E, Petrášek J, Friml J, Kleine Vehn J. 2013. Single-cell-based system to monitor carrier driven cellular auxin homeostasis. BMC Plant Biology. 13(1).","mla":"Barbez, Elke, et al. “Single-Cell-Based System to Monitor Carrier Driven Cellular Auxin Homeostasis.” <i>BMC Plant Biology</i>, vol. 13, no. 1, BioMed Central, 2013, doi:<a href=\"https://doi.org/10.1186/1471-2229-13-20\">10.1186/1471-2229-13-20</a>.","chicago":"Barbez, Elke, Martina Laňková, Markéta Pařezová, Alexis Maizel, Eva Zažímalová, Jan Petrášek, Jiří Friml, and Jürgen Kleine Vehn. “Single-Cell-Based System to Monitor Carrier Driven Cellular Auxin Homeostasis.” <i>BMC Plant Biology</i>. BioMed Central, 2013. <a href=\"https://doi.org/10.1186/1471-2229-13-20\">https://doi.org/10.1186/1471-2229-13-20</a>.","ama":"Barbez E, Laňková M, Pařezová M, et al. Single-cell-based system to monitor carrier driven cellular auxin homeostasis. <i>BMC Plant Biology</i>. 2013;13(1). doi:<a href=\"https://doi.org/10.1186/1471-2229-13-20\">10.1186/1471-2229-13-20</a>","apa":"Barbez, E., Laňková, M., Pařezová, M., Maizel, A., Zažímalová, E., Petrášek, J., … Kleine Vehn, J. (2013). Single-cell-based system to monitor carrier driven cellular auxin homeostasis. <i>BMC Plant Biology</i>. BioMed Central. <a href=\"https://doi.org/10.1186/1471-2229-13-20\">https://doi.org/10.1186/1471-2229-13-20</a>","ieee":"E. Barbez <i>et al.</i>, “Single-cell-based system to monitor carrier driven cellular auxin homeostasis,” <i>BMC Plant Biology</i>, vol. 13, no. 1. BioMed Central, 2013."},"year":"2013","abstract":[{"text":"Background: Abundance and distribution of the plant hormone auxin play important roles in plant development. Besides other metabolic processes, various auxin carriers control the cellular level of active auxin and, hence, are major regulators of cellular auxin homeostasis. Despite the developmental importance of auxin transporters, a simple medium-to-high throughput approach to assess carrier activities is still missing. Here we show that carrier driven depletion of cellular auxin correlates with reduced nuclear auxin signaling in tobacco Bright Yellow-2 (BY-2) cell cultures.Results: We developed an easy to use transient single-cell-based system to detect carrier activity. We use the relative changes in signaling output of the auxin responsive promoter element DR5 to indirectly visualize auxin carrier activity. The feasibility of the transient approach was demonstrated by pharmacological and genetic interference with auxin signaling and transport. As a proof of concept, we provide visual evidence that the prominent auxin transport proteins PIN-FORMED (PIN)2 and PIN5 regulate cellular auxin homeostasis at the plasma membrane and endoplasmic reticulum (ER), respectively. Our data suggest that PIN2 and PIN5 have different sensitivities to the auxin transport inhibitor 1-naphthylphthalamic acid (NPA). Also the putative PIN-LIKES (PILS) auxin carrier activity at the ER is insensitive to NPA in our system, indicating that NPA blocks intercellular, but not intracellular auxin transport.Conclusions: This single-cell-based system is a useful tool by which the activity of putative auxin carriers, such as PINs, PILS and WALLS ARE THIN1 (WAT1), can be indirectly visualized in a medium-to-high throughput manner. Moreover, our single cell system might be useful to investigate also other hormonal signaling pathways, such as cytokinin.","lang":"eng"}],"_id":"2452","extern":1,"publisher":"BioMed Central","month":"02","publication_status":"published","date_updated":"2021-01-12T06:57:34Z","date_published":"2013-02-01T00:00:00Z","fulldoi":"https://doi.org/10.1186/1471-2229-13-20","issue":"1","day":"01","publist_id":"4451","date_created":"2018-12-11T11:57:45Z","title":"Single-cell-based system to monitor carrier driven cellular auxin homeostasis","status":"public","quality_controlled":0,"publication":"BMC Plant Biology"},{"publication":"Trends in Plant Science","quality_controlled":"1","date_created":"2018-12-11T11:57:46Z","publist_id":"4446","day":"01","status":"public","title":"Origin and evolution of PIN auxin transporters in the green lineage","publication_status":"published","issue":"1","fulldoi":"https://doi.org/10.1016/j.tplants.2012.08.009","date_published":"2013-01-01T00:00:00Z","date_updated":"2021-01-12T06:57:36Z","page":"5 - 10","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","month":"01","publisher":"Cell Press","oa_version":"None","_id":"2457","year":"2013","extern":"1","language":[{"iso":"eng"}],"citation":{"short":"T. Viaene, C. Delwiche, S. Rensing, J. Friml, Trends in Plant Science 18 (2013) 5–10.","ista":"Viaene T, Delwiche C, Rensing S, Friml J. 2013. Origin and evolution of PIN auxin transporters in the green lineage. Trends in Plant Science. 18(1), 5–10.","ieee":"T. Viaene, C. Delwiche, S. Rensing, and J. Friml, “Origin and evolution of PIN auxin transporters in the green lineage,” <i>Trends in Plant Science</i>, vol. 18, no. 1. Cell Press, pp. 5–10, 2013.","ama":"Viaene T, Delwiche C, Rensing S, Friml J. Origin and evolution of PIN auxin transporters in the green lineage. <i>Trends in Plant Science</i>. 2013;18(1):5-10. doi:<a href=\"https://doi.org/10.1016/j.tplants.2012.08.009\">10.1016/j.tplants.2012.08.009</a>","apa":"Viaene, T., Delwiche, C., Rensing, S., &#38; Friml, J. (2013). Origin and evolution of PIN auxin transporters in the green lineage. <i>Trends in Plant Science</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.tplants.2012.08.009\">https://doi.org/10.1016/j.tplants.2012.08.009</a>","chicago":"Viaene, Tom, Charles Delwiche, Stefan Rensing, and Jiří Friml. “Origin and Evolution of PIN Auxin Transporters in the Green Lineage.” <i>Trends in Plant Science</i>. Cell Press, 2013. <a href=\"https://doi.org/10.1016/j.tplants.2012.08.009\">https://doi.org/10.1016/j.tplants.2012.08.009</a>.","mla":"Viaene, Tom, et al. “Origin and Evolution of PIN Auxin Transporters in the Green Lineage.” <i>Trends in Plant Science</i>, vol. 18, no. 1, Cell Press, 2013, pp. 5–10, doi:<a href=\"https://doi.org/10.1016/j.tplants.2012.08.009\">10.1016/j.tplants.2012.08.009</a>."},"author":[{"last_name":"Viaene","first_name":"Tom","full_name":"Viaene, Tom"},{"full_name":"Delwiche, Charles","first_name":"Charles","last_name":"Delwiche"},{"first_name":"Stefan","full_name":"Rensing, Stefan","last_name":"Rensing"},{"id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596","last_name":"Friml","full_name":"Friml, Jirí","first_name":"Jirí"}],"type":"journal_article","intvolume":"        18","doi":"10.1016/j.tplants.2012.08.009","volume":18},{"acknowledgement":"EP/E053262/1\tEngineering and Physical Sciences Research Council","citation":{"short":"T.D. Browning, R. Munshi, Compositio Mathematica 149 (2013) 1457–1494.","ista":"Browning TD, Munshi R. 2013. Rational points on singular intersections of quadrics. Compositio Mathematica. 149(9), 1457–1494.","mla":"Browning, Timothy D., and Ritabrata Munshi. “Rational Points on Singular Intersections of Quadrics.” <i>Compositio Mathematica</i>, vol. 149, no. 9, Cambridge University Press, 2013, pp. 1457–94, doi:<a href=\"https://doi.org/10.1112/S0010437X13007185\">10.1112/S0010437X13007185</a>.","ama":"Browning TD, Munshi R. Rational points on singular intersections of quadrics. <i>Compositio Mathematica</i>. 2013;149(9):1457-1494. doi:<a href=\"https://doi.org/10.1112/S0010437X13007185\">10.1112/S0010437X13007185</a>","ieee":"T. D. Browning and R. Munshi, “Rational points on singular intersections of quadrics,” <i>Compositio Mathematica</i>, vol. 149, no. 9. Cambridge University Press, pp. 1457–1494, 2013.","apa":"Browning, T. D., &#38; Munshi, R. (2013). Rational points on singular intersections of quadrics. <i>Compositio Mathematica</i>. Cambridge University Press. <a href=\"https://doi.org/10.1112/S0010437X13007185\">https://doi.org/10.1112/S0010437X13007185</a>","chicago":"Browning, Timothy D, and Ritabrata Munshi. “Rational Points on Singular Intersections of Quadrics.” <i>Compositio Mathematica</i>. Cambridge University Press, 2013. <a href=\"https://doi.org/10.1112/S0010437X13007185\">https://doi.org/10.1112/S0010437X13007185</a>."},"type":"journal_article","author":[{"full_name":"Timothy Browning","first_name":"Timothy D","last_name":"Browning","id":"35827D50-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8314-0177"},{"full_name":"Munshi, Ritabrata","first_name":"Ritabrata","last_name":"Munshi"}],"doi":"10.1112/S0010437X13007185","volume":149,"intvolume":"       149","publisher":"Cambridge University Press","year":"2013","_id":"246","abstract":[{"text":"Given an intersection of two quadrics X Pm1, with m &gt; 9, the quantitative arithmetic of the set X(Q) is investigated under the assumption that the singular locus of X consists of a pair of conjugate singular points defined over Q(i).","lang":"eng"}],"extern":1,"publication_status":"published","date_updated":"2021-01-12T06:57:37Z","date_published":"2013-09-01T00:00:00Z","fulldoi":"https://doi.org/10.1112/S0010437X13007185","issue":"9","page":"1457 - 1494","month":"09","quality_controlled":0,"publication":"Compositio Mathematica","publist_id":"7658","day":"01","date_created":"2018-12-11T11:45:25Z","title":"Rational points on singular intersections of quadrics","status":"public"}]