[{"day":"01","publist_id":"208","type":"conference","author":[{"first_name":"Ashutosh","last_name":"Gupta","id":"335E5684-F248-11E8-B48F-1D18A9856A87","full_name":"Ashutosh Gupta"},{"last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Thomas Henzinger","orcid":"0000−0002−2985−7724"},{"last_name":"Majumdar","first_name":"Ritankar","full_name":"Majumdar, Ritankar S"},{"last_name":"Rybalchenko","first_name":"Andrey","full_name":"Rybalchenko, Andrey"},{"last_name":"Xu","first_name":"Ru","full_name":"Xu, Ru-Gang"}],"citation":{"chicago":"Gupta, Ashutosh, Thomas A Henzinger, Ritankar Majumdar, Andrey Rybalchenko, and Ru Xu. “Proving Non-Termination,” 147–58. ACM, 2008. <a href=\"https://doi.org/10.1145/1328438.1328459\">https://doi.org/10.1145/1328438.1328459</a>.","ista":"Gupta A, Henzinger TA, Majumdar R, Rybalchenko A, Xu R. 2008. Proving non-termination. POPL: Principles of Programming Languages, 147–158.","mla":"Gupta, Ashutosh, et al. <i>Proving Non-Termination</i>. ACM, 2008, pp. 147–58, doi:<a href=\"https://doi.org/10.1145/1328438.1328459\">10.1145/1328438.1328459</a>.","ieee":"A. Gupta, T. A. Henzinger, R. Majumdar, A. Rybalchenko, and R. Xu, “Proving non-termination,” presented at the POPL: Principles of Programming Languages, 2008, pp. 147–158.","apa":"Gupta, A., Henzinger, T. A., Majumdar, R., Rybalchenko, A., &#38; Xu, R. (2008). Proving non-termination (pp. 147–158). Presented at the POPL: Principles of Programming Languages, ACM. <a href=\"https://doi.org/10.1145/1328438.1328459\">https://doi.org/10.1145/1328438.1328459</a>","ama":"Gupta A, Henzinger TA, Majumdar R, Rybalchenko A, Xu R. Proving non-termination. In: ACM; 2008:147-158. doi:<a href=\"https://doi.org/10.1145/1328438.1328459\">10.1145/1328438.1328459</a>","short":"A. Gupta, T.A. Henzinger, R. Majumdar, A. Rybalchenko, R. Xu, in:, ACM, 2008, pp. 147–158."},"date_updated":"2021-01-12T07:59:25Z","extern":1,"status":"public","title":"Proving non-termination","doi":"10.1145/1328438.1328459","date_published":"2008-01-01T00:00:00Z","year":"2008","_id":"4521","date_created":"2018-12-11T12:09:17Z","page":"147 - 158","conference":{"name":"POPL: Principles of Programming Languages"},"quality_controlled":0,"main_file_link":[{"open_access":"0","url":"http://pub.ist.ac.at/%7Etah/Publications/proving_non-termination.pdf"}],"abstract":[{"lang":"eng","text":"The search for proof and the search for counterexamples (bugs) are complementary activities that need to be pursued concurrently in order to maximize the practical success rate of verification tools.While this is well-understood in safety verification, the current focus of liveness verification has been almost exclusively on the search for termination proofs. A counterexample to termination is an infinite programexecution. In this paper, we propose a method to search for such counterexamples. The search proceeds in two phases. We first dynamically enumerate lasso-shaped candidate paths for counterexamples, and then statically prove their feasibility. We illustrate the utility of our nontermination prover, called TNT, on several nontrivial examples, some of which require bit-level reasoning about integer representations."}],"publication_status":"published","publisher":"ACM","month":"01"},{"supervisor":[{"last_name":"Sangiovanni-Vincentelli","first_name":"Alberto","full_name":"Sangiovanni-Vincentelli, Alberto"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","first_name":"Thomas A","last_name":"Henzinger"},{"full_name":"Lee, Edward","last_name":"Lee","first_name":"Edward"},{"first_name":"Karl","last_name":"Hedrick","full_name":"Hedrick, Karl"}],"date_updated":"2021-01-12T07:59:26Z","author":[{"last_name":"Ghosal","first_name":"Arkadeb","full_name":"Ghosal, Arkadeb"}],"citation":{"ista":"Ghosal A. 2008. A hierarchical coordination language for reliable real-time tasks. University of California, Berkeley.","chicago":"Ghosal, Arkadeb. “A Hierarchical Coordination Language for Reliable Real-Time Tasks.” University of California, Berkeley, 2008.","apa":"Ghosal, A. (2008). <i>A hierarchical coordination language for reliable real-time tasks</i>. University of California, Berkeley.","ieee":"A. Ghosal, “A hierarchical coordination language for reliable real-time tasks,” University of California, Berkeley, 2008.","ama":"Ghosal A. A hierarchical coordination language for reliable real-time tasks. 2008:1-210.","mla":"Ghosal, Arkadeb. <i>A Hierarchical Coordination Language for Reliable Real-Time Tasks</i>. University of California, Berkeley, 2008, pp. 1–210.","short":"A. Ghosal, A Hierarchical Coordination Language for Reliable Real-Time Tasks, University of California, Berkeley, 2008."},"type":"dissertation","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"199","day":"31","status":"public","title":"A hierarchical coordination language for reliable real-time tasks","language":[{"iso":"eng"}],"date_published":"2008-01-31T00:00:00Z","extern":"1","page":"1 - 210","_id":"4524","year":"2008","acknowledgement":"978-0-549-83679-7","date_created":"2018-12-11T12:09:18Z","abstract":[{"lang":"eng","text":"Complex requirements, time-to-market pressure and regulatory constraints have made the designing of embedded systems extremely challenging. This is evident by the increase in effort and expenditure for design of safety-driven real-time control-dominated applications like automotive and avionic controllers. Design processes are often challenged by lack of proper programming tools for specifying and verifying critical requirements (e.g. timing and reliability) of such applications. Platform based design, an approach for designing embedded systems, addresses the above concerns by separating requirement from architecture. The requirement specifies the intended behavior of an application while the architecture specifies the guarantees (e.g. execution speed, failure rate etc). An implementation, a mapping of the requirement on the architecture, is then analyzed for correctness. The orthogonalization of concerns makes the specification and analyses simpler. An effective use of such design methodology has been proposed in Logical Execution Time (LET) model of real-time tasks. The model separates the timing requirements (specified by release and termination instances of a task) from the architecture guarantees (specified by worst-case execution time of the task).\r\n\r\nThis dissertation proposes a coordination language, Hierarchical Timing Language (HTL), that captures the timing and reliability requirements of real-time applications. An implementation of the program on an architecture is then analyzed to check whether desired timing and reliability requirements are met or not. The core framework extends the LET model by accounting for reliability and refinement. The reliability model separates the reliability requirements of tasks from the reliability guarantees of the architecture. The requirement expresses the desired long-term reliability while the architecture provides a short-term reliability guarantee (e.g. failure rate for each iteration). The analysis checks if the short-term guarantee ensures the desired long-term reliability. The refinement model allows replacing a task by another task during program execution. Refinement preserves schedulability and reliability, i.e., if a refined task is schedulable and reliable for an implementation, then the refining task is also schedulable and reliable for the implementation. Refinement helps in concise specification without overloading analysis.\r\n\r\nThe work presents the formal model, the analyses (both with and without refinement), and a compiler for HTL programs. The compiler checks composition and refinement constraints, performs schedulability and reliability analyses, and generates code for implementation of an HTL program on a virtual machine. Three real-time controllers, one each from automatic control, automotive control and avionic control, are used to illustrate the steps in modeling and analyzing HTL programs."}],"month":"01","publisher":"University of California, Berkeley","publication_status":"published","article_processing_charge":"No","oa_version":"None"},{"quality_controlled":0,"main_file_link":[{"url":"http://pub.ist.ac.at/%7Etah/Publications/bounded_asynchrony.pdf","open_access":"0"}],"abstract":[{"text":"We introduce bounded asynchrony, a notion of concurrency tailored to the modeling of biological cell-cell interactions. Bounded asynchrony is the result of a scheduler that bounds the number of steps that one process gets ahead of other processes; this allows the components of a system to move independently while keeping them coupled. Bounded asynchrony accurately reproduces the experimental observations made about certain cell-cell interactions: its constrained nondeterminism captures the variability observed in cells that, although equally potent, assume distinct fates. Real-life cells are not “scheduled”, but we show that distributed real-time behavior can lead to component interactions that are observationally equivalent to bounded asynchrony; this provides a possible mechanistic explanation for the phenomena observed during cell fate specification.\nWe use model checking to determine cell fates. The nondeterminism of bounded asynchrony causes state explosion during model checking, but partial-order methods are not directly applicable. We present a new algorithm that reduces the number of states that need to be explored: our optimization takes advantage of the bounded-asynchronous progress and the spatially local interactions of components that model cells. We compare our own communication-based reduction with partial-order reduction (on a restricted form of bounded asynchrony) and experiments illustrate that our algorithm leads to significant savings.","lang":"eng"}],"publication_status":"published","publisher":"Springer","month":"05","year":"2008","_id":"4527","date_created":"2018-12-11T12:09:19Z","acknowledgement":"Supported in part by the Swiss National Science Foundation (grant 205321-111840).","page":"17 - 32","conference":{"name":"FMSB: Formal Methods in Systems Biology"},"alternative_title":["LNCS"],"intvolume":"      5054","extern":1,"status":"public","title":"Bounded asynchrony: Concurrency for modeling cell-cell interactions","doi":"10.1007/978-3-540-68413-8_2","date_published":"2008-05-26T00:00:00Z","day":"26","publist_id":"196","volume":5054,"citation":{"short":"J. Fisher, T.A. Henzinger, M. Mateescu, N. Piterman, in:, Springer, 2008, pp. 17–32.","ista":"Fisher J, Henzinger TA, Mateescu M, Piterman N. 2008. Bounded asynchrony: Concurrency for modeling cell-cell interactions. FMSB: Formal Methods in Systems Biology, LNCS, vol. 5054, 17–32.","chicago":"Fisher, Jasmin, Thomas A Henzinger, Maria Mateescu, and Nir Piterman. “Bounded Asynchrony: Concurrency for Modeling Cell-Cell Interactions,” 5054:17–32. Springer, 2008. <a href=\"https://doi.org/10.1007/978-3-540-68413-8_2\">https://doi.org/10.1007/978-3-540-68413-8_2</a>.","ieee":"J. Fisher, T. A. Henzinger, M. Mateescu, and N. Piterman, “Bounded asynchrony: Concurrency for modeling cell-cell interactions,” presented at the FMSB: Formal Methods in Systems Biology, 2008, vol. 5054, pp. 17–32.","apa":"Fisher, J., Henzinger, T. A., Mateescu, M., &#38; Piterman, N. (2008). Bounded asynchrony: Concurrency for modeling cell-cell interactions (Vol. 5054, pp. 17–32). Presented at the FMSB: Formal Methods in Systems Biology, Springer. <a href=\"https://doi.org/10.1007/978-3-540-68413-8_2\">https://doi.org/10.1007/978-3-540-68413-8_2</a>","ama":"Fisher J, Henzinger TA, Mateescu M, Piterman N. Bounded asynchrony: Concurrency for modeling cell-cell interactions. In: Vol 5054. Springer; 2008:17-32. doi:<a href=\"https://doi.org/10.1007/978-3-540-68413-8_2\">10.1007/978-3-540-68413-8_2</a>","mla":"Fisher, Jasmin, et al. <i>Bounded Asynchrony: Concurrency for Modeling Cell-Cell Interactions</i>. Vol. 5054, Springer, 2008, pp. 17–32, doi:<a href=\"https://doi.org/10.1007/978-3-540-68413-8_2\">10.1007/978-3-540-68413-8_2</a>."},"type":"conference","author":[{"full_name":"Fisher, Jasmin","first_name":"Jasmin","last_name":"Fisher"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Thomas Henzinger","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A"},{"id":"3B43276C-F248-11E8-B48F-1D18A9856A87","full_name":"Maria Mateescu","last_name":"Mateescu","first_name":"Maria"},{"full_name":"Piterman, Nir","first_name":"Nir","last_name":"Piterman"}],"date_updated":"2021-01-12T07:59:27Z"},{"date_created":"2018-12-11T12:09:20Z","year":"2008","_id":"4532","page":"549 - 563","quality_controlled":0,"main_file_link":[{"open_access":"0","url":"http://pub.ist.ac.at/%7Etah/Publications/equivalence_of_labeled_markov_chains.pdf"}],"publication_status":"published","publisher":"World Scientific Publishing","month":"06","abstract":[{"lang":"eng","text":"We consider the equivalence problem for labeled Markov chains (LMCs), where each state is labeled with an observation. Two LMCs are equivalent if every finite sequence of observations has the same probability of occurrence in the two LMCs. We show that equivalence can be decided in polynomial time, using a reduction to the equivalence problem for probabilistic automata, which is known to be solvable in polynomial time. We provide an alternative algorithm to solve the equivalence problem, which is based on a new definition of bisimulation for probabilistic automata. We also extend the technique to decide the equivalence of weighted probabilistic automata."}],"day":"01","publist_id":"192","publication":"International Journal of Foundations of Computer Science","type":"journal_article","author":[{"last_name":"Doyen","first_name":"Laurent","full_name":"Doyen, Laurent"},{"first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Thomas Henzinger","orcid":"0000−0002−2985−7724"},{"full_name":"Raskin, Jean-François","first_name":"Jean","last_name":"Raskin"}],"citation":{"short":"L. Doyen, T.A. Henzinger, J. Raskin, International Journal of Foundations of Computer Science 19 (2008) 549–563.","chicago":"Doyen, Laurent, Thomas A Henzinger, and Jean Raskin. “Equivalence of Labeled Markov Chains.” <i>International Journal of Foundations of Computer Science</i>. World Scientific Publishing, 2008. <a href=\"https://doi.org/10.1142/S0129054108005814 \">https://doi.org/10.1142/S0129054108005814 </a>.","ista":"Doyen L, Henzinger TA, Raskin J. 2008. Equivalence of labeled Markov chains. International Journal of Foundations of Computer Science. 19(3), 549–563.","mla":"Doyen, Laurent, et al. “Equivalence of Labeled Markov Chains.” <i>International Journal of Foundations of Computer Science</i>, vol. 19, no. 3, World Scientific Publishing, 2008, pp. 549–63, doi:<a href=\"https://doi.org/10.1142/S0129054108005814 \">10.1142/S0129054108005814 </a>.","ieee":"L. Doyen, T. A. Henzinger, and J. Raskin, “Equivalence of labeled Markov chains,” <i>International Journal of Foundations of Computer Science</i>, vol. 19, no. 3. World Scientific Publishing, pp. 549–563, 2008.","ama":"Doyen L, Henzinger TA, Raskin J. Equivalence of labeled Markov chains. <i>International Journal of Foundations of Computer Science</i>. 2008;19(3):549-563. doi:<a href=\"https://doi.org/10.1142/S0129054108005814 \">10.1142/S0129054108005814 </a>","apa":"Doyen, L., Henzinger, T. A., &#38; Raskin, J. (2008). Equivalence of labeled Markov chains. <i>International Journal of Foundations of Computer Science</i>. World Scientific Publishing. <a href=\"https://doi.org/10.1142/S0129054108005814 \">https://doi.org/10.1142/S0129054108005814 </a>"},"date_updated":"2021-01-12T07:59:30Z","volume":19,"issue":"3","intvolume":"        19","extern":1,"doi":"10.1142/S0129054108005814 ","date_published":"2008-06-01T00:00:00Z","title":"Equivalence of labeled Markov chains","status":"public"},{"extern":1,"title":"Interface theories with component reuse","status":"public","doi":"10.1145/1450058.1450070","date_published":"2008-10-01T00:00:00Z","day":"01","publist_id":"193","date_updated":"2021-01-12T07:59:30Z","type":"conference","author":[{"full_name":"Doyen, Laurent","last_name":"Doyen","first_name":"Laurent"},{"full_name":"Thomas Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger"},{"full_name":"Jobstmann, Barbara","first_name":"Barbara","last_name":"Jobstmann"},{"first_name":"Tatjana","last_name":"Petrov","orcid":"0000-0002-9041-0905","id":"3D5811FC-F248-11E8-B48F-1D18A9856A87","full_name":"Tatjana Petrov"}],"citation":{"ieee":"L. Doyen, T. A. Henzinger, B. Jobstmann, and T. Petrov, “Interface theories with component reuse,” presented at the EMSOFT: Embedded Software , 2008, pp. 79–88.","apa":"Doyen, L., Henzinger, T. A., Jobstmann, B., &#38; Petrov, T. (2008). Interface theories with component reuse (pp. 79–88). Presented at the EMSOFT: Embedded Software , ACM. <a href=\"https://doi.org/10.1145/1450058.1450070\">https://doi.org/10.1145/1450058.1450070</a>","ama":"Doyen L, Henzinger TA, Jobstmann B, Petrov T. Interface theories with component reuse. In: ACM; 2008:79-88. doi:<a href=\"https://doi.org/10.1145/1450058.1450070\">10.1145/1450058.1450070</a>","mla":"Doyen, Laurent, et al. <i>Interface Theories with Component Reuse</i>. ACM, 2008, pp. 79–88, doi:<a href=\"https://doi.org/10.1145/1450058.1450070\">10.1145/1450058.1450070</a>.","ista":"Doyen L, Henzinger TA, Jobstmann B, Petrov T. 2008. Interface theories with component reuse. EMSOFT: Embedded Software , 79–88.","chicago":"Doyen, Laurent, Thomas A Henzinger, Barbara Jobstmann, and Tatjana Petrov. “Interface Theories with Component Reuse,” 79–88. ACM, 2008. <a href=\"https://doi.org/10.1145/1450058.1450070\">https://doi.org/10.1145/1450058.1450070</a>.","short":"L. Doyen, T.A. Henzinger, B. Jobstmann, T. Petrov, in:, ACM, 2008, pp. 79–88."},"quality_controlled":0,"main_file_link":[{"open_access":"0","url":"http://pub.ist.ac.at/%7Etah/Publications/interface_theories_with_component_reuse.pdf"}],"abstract":[{"text":"Interface theories have been proposed to support incremental design and independent implementability. Incremental design means that the compatibility checking of interfaces can proceed for partial system descriptions, without knowing the interfaces of all components. Independent implementability means that compatible interfaces can be refined separately, maintaining compatibility. We show that these interface theories provide no formal support for component reuse, meaning that the same component cannot be used to implement several different interfaces in a design. We add a new operation to interface theories in order to support such reuse. For example, different interfaces for the same component may refer to different aspects such as functionality, timing, and power consumption. We give both stateless and stateful examples for interface theories with component reuse. To illustrate component reuse in interface-based design, we show how the stateful theory provides a natural framework for specifying and refining PCI bus clients.","lang":"eng"}],"publication_status":"published","publisher":"ACM","month":"10","year":"2008","_id":"4533","date_created":"2018-12-11T12:09:21Z","page":"79 - 88","conference":{"name":"EMSOFT: Embedded Software "}},{"month":"03","publisher":"Elsevier","publication_status":"published","abstract":[{"text":"A stochastic graph game is played by two players on a game graph with probabilistic transitions. We consider stochastic graph games with ω-regular winning conditions specified as parity objectives, and mean-payoff (or limit-average) objectives. These games lie in NP ∩ coNP. We present a polynomial-time Turing reduction of stochastic parity games to stochastic mean-payoff games.","lang":"eng"}],"main_file_link":[{"open_access":"0","url":"http://pub.ist.ac.at/%7Etah/Publications/reduction_of_stochastic_parity_to_stochastic_mean-payoff_games.pdf"}],"quality_controlled":0,"page":"1 - 7","date_created":"2018-12-11T12:09:21Z","_id":"4534","year":"2008","date_published":"2008-03-31T00:00:00Z","doi":"10.1016/j.ipl.2007.08.035","title":"Reduction of stochastic parity to stochastic mean-payoff games","status":"public","extern":1,"issue":"1","intvolume":"       106","date_updated":"2021-01-12T07:59:30Z","type":"journal_article","citation":{"short":"K. Chatterjee, T.A. Henzinger, Information Processing Letters 106 (2008) 1–7.","mla":"Chatterjee, Krishnendu, and Thomas A. Henzinger. “Reduction of Stochastic Parity to Stochastic Mean-Payoff Games.” <i>Information Processing Letters</i>, vol. 106, no. 1, Elsevier, 2008, pp. 1–7, doi:<a href=\"https://doi.org/10.1016/j.ipl.2007.08.035\">10.1016/j.ipl.2007.08.035</a>.","apa":"Chatterjee, K., &#38; Henzinger, T. A. (2008). Reduction of stochastic parity to stochastic mean-payoff games. <i>Information Processing Letters</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ipl.2007.08.035\">https://doi.org/10.1016/j.ipl.2007.08.035</a>","ieee":"K. Chatterjee and T. A. Henzinger, “Reduction of stochastic parity to stochastic mean-payoff games,” <i>Information Processing Letters</i>, vol. 106, no. 1. Elsevier, pp. 1–7, 2008.","ama":"Chatterjee K, Henzinger TA. Reduction of stochastic parity to stochastic mean-payoff games. <i>Information Processing Letters</i>. 2008;106(1):1-7. doi:<a href=\"https://doi.org/10.1016/j.ipl.2007.08.035\">10.1016/j.ipl.2007.08.035</a>","chicago":"Chatterjee, Krishnendu, and Thomas A Henzinger. “Reduction of Stochastic Parity to Stochastic Mean-Payoff Games.” <i>Information Processing Letters</i>. Elsevier, 2008. <a href=\"https://doi.org/10.1016/j.ipl.2007.08.035\">https://doi.org/10.1016/j.ipl.2007.08.035</a>.","ista":"Chatterjee K, Henzinger TA. 2008. Reduction of stochastic parity to stochastic mean-payoff games. Information Processing Letters. 106(1), 1–7."},"author":[{"orcid":"0000-0002-4561-241X","full_name":"Krishnendu Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Thomas Henzinger","orcid":"0000−0002−2985−7724"}],"volume":106,"publist_id":"188","day":"31","publication":"Information Processing Letters"},{"extern":1,"doi":"10.1145/1403375.1403595","date_published":"2008-01-01T00:00:00Z","status":"public","title":"Logical reliability of interacting real-time tasks","day":"01","publist_id":"171","citation":{"chicago":"Chatterjee, Krishnendu, Arkadeb Ghosal, Thomas A Henzinger, Daniel Iercan, Christoph Kirsch, Claudio Pinello, and Alberto Sangiovanni Vincentelli. “Logical Reliability of Interacting Real-Time Tasks,” 909–14. IEEE, 2008. <a href=\"https://doi.org/10.1145/1403375.1403595\">https://doi.org/10.1145/1403375.1403595</a>.","ista":"Chatterjee K, Ghosal A, Henzinger TA, Iercan D, Kirsch C, Pinello C, Sangiovanni Vincentelli A. 2008. Logical reliability of interacting real-time tasks. DATE: Design, Automation and Test in Europe, 909–914.","mla":"Chatterjee, Krishnendu, et al. <i>Logical Reliability of Interacting Real-Time Tasks</i>. IEEE, 2008, pp. 909–14, doi:<a href=\"https://doi.org/10.1145/1403375.1403595\">10.1145/1403375.1403595</a>.","ieee":"K. Chatterjee <i>et al.</i>, “Logical reliability of interacting real-time tasks,” presented at the DATE: Design, Automation and Test in Europe, 2008, pp. 909–914.","apa":"Chatterjee, K., Ghosal, A., Henzinger, T. A., Iercan, D., Kirsch, C., Pinello, C., &#38; Sangiovanni Vincentelli, A. (2008). Logical reliability of interacting real-time tasks (pp. 909–914). Presented at the DATE: Design, Automation and Test in Europe, IEEE. <a href=\"https://doi.org/10.1145/1403375.1403595\">https://doi.org/10.1145/1403375.1403595</a>","ama":"Chatterjee K, Ghosal A, Henzinger TA, et al. Logical reliability of interacting real-time tasks. In: IEEE; 2008:909-914. doi:<a href=\"https://doi.org/10.1145/1403375.1403595\">10.1145/1403375.1403595</a>","short":"K. Chatterjee, A. Ghosal, T.A. Henzinger, D. Iercan, C. Kirsch, C. Pinello, A. Sangiovanni Vincentelli, in:, IEEE, 2008, pp. 909–914."},"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Krishnendu Chatterjee","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu"},{"full_name":"Ghosal, Arkadeb","first_name":"Arkadeb","last_name":"Ghosal"},{"first_name":"Thomas A","last_name":"Henzinger","full_name":"Thomas Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"},{"full_name":"Iercan, Daniel","last_name":"Iercan","first_name":"Daniel"},{"last_name":"Kirsch","first_name":"Christoph","full_name":"Kirsch, Christoph M"},{"last_name":"Pinello","first_name":"Claudio","full_name":"Pinello, Claudio"},{"full_name":"Sangiovanni-Vincentelli, Alberto","first_name":"Alberto","last_name":"Sangiovanni Vincentelli"}],"date_updated":"2021-01-12T07:59:36Z","type":"conference","quality_controlled":0,"main_file_link":[{"open_access":"0","url":"http://pub.ist.ac.at/%7Etah/Publications/logical_reliability_of_interacting_real-time_tasks.pdf"}],"publication_status":"published","publisher":"IEEE","month":"01","abstract":[{"lang":"eng","text":"We propose the notion of logical reliability for real-time program tasks that interact through periodically updated program variables. We describe a reliability analysis that checks if the given short-term (e.g., single-period) reliability of a program variable update in an implementation is sufficient to meet the logical reliability requirement (of the program variable) in the long run. We then present a notion of design by refinement where a task can be refined by another task that writes to program variables with less logical reliability. The resulting analysis can be combined with an incremental schedulability analysis for interacting real-time tasks proposed earlier for the Hierarchical Timing Language (HTL), a coordination language for distributed real-time systems. We implemented a logical-reliability-enhanced prototype of the compiler and runtime infrastructure for HTL."}],"date_created":"2018-12-11T12:09:25Z","year":"2008","_id":"4546","conference":{"name":"DATE: Design, Automation and Test in Europe"},"page":"909 - 914"},{"abstract":[{"lang":"eng","text":"The value of a finite-state two-player zero-sum stochastic game with limit-average payoff can be approximated to within ε in time exponential in a polynomial in the size of the game times polynomial in logarithmic in 1/ε, for all ε &gt; 0."}],"publisher":"Springer","publication_status":"published","month":"01","quality_controlled":0,"main_file_link":[{"url":"http://pub.ist.ac.at/%7Etah/Publications/stochastic_limit-average_games_are_in_exptime.pdf","open_access":"0"}],"page":"219 - 234","year":"2008","_id":"4548","date_created":"2018-12-11T12:09:25Z","title":"Stochastic limit-average games are in EXPTIME","status":"public","doi":"10.1007/s00182-007-0110-5","date_published":"2008-01-01T00:00:00Z","issue":"2","intvolume":"        37","extern":1,"volume":37,"type":"journal_article","date_updated":"2021-01-12T07:59:37Z","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Krishnendu Chatterjee"},{"last_name":"Majumdar","first_name":"Ritankar","full_name":"Majumdar, Ritankar S"},{"last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Thomas Henzinger","orcid":"0000−0002−2985−7724"}],"citation":{"ista":"Chatterjee K, Majumdar R, Henzinger TA. 2008. Stochastic limit-average games are in EXPTIME. International Journal of Game Theory. 37(2), 219–234.","chicago":"Chatterjee, Krishnendu, Ritankar Majumdar, and Thomas A Henzinger. “Stochastic Limit-Average Games Are in EXPTIME.” <i>International Journal of Game Theory</i>. Springer, 2008. <a href=\"https://doi.org/10.1007/s00182-007-0110-5\">https://doi.org/10.1007/s00182-007-0110-5</a>.","apa":"Chatterjee, K., Majumdar, R., &#38; Henzinger, T. A. (2008). Stochastic limit-average games are in EXPTIME. <i>International Journal of Game Theory</i>. Springer. <a href=\"https://doi.org/10.1007/s00182-007-0110-5\">https://doi.org/10.1007/s00182-007-0110-5</a>","ieee":"K. Chatterjee, R. Majumdar, and T. A. Henzinger, “Stochastic limit-average games are in EXPTIME,” <i>International Journal of Game Theory</i>, vol. 37, no. 2. Springer, pp. 219–234, 2008.","ama":"Chatterjee K, Majumdar R, Henzinger TA. Stochastic limit-average games are in EXPTIME. <i>International Journal of Game Theory</i>. 2008;37(2):219-234. doi:<a href=\"https://doi.org/10.1007/s00182-007-0110-5\">10.1007/s00182-007-0110-5</a>","mla":"Chatterjee, Krishnendu, et al. “Stochastic Limit-Average Games Are in EXPTIME.” <i>International Journal of Game Theory</i>, vol. 37, no. 2, Springer, 2008, pp. 219–34, doi:<a href=\"https://doi.org/10.1007/s00182-007-0110-5\">10.1007/s00182-007-0110-5</a>.","short":"K. Chatterjee, R. Majumdar, T.A. Henzinger, International Journal of Game Theory 37 (2008) 219–234."},"publication":"International Journal of Game Theory","day":"01","publist_id":"168"},{"_id":"4568","year":"2008","date_created":"2018-12-11T12:09:31Z","conference":{"name":"ASE: Automated Software Engineering"},"page":"29 - 38","main_file_link":[{"open_access":"0","url":"http://pub.ist.ac.at/%7Etah/Publications/program_analysis_with_dynamic_change_of_precision.pdf"}],"quality_controlled":0,"abstract":[{"lang":"eng","text":"We present and evaluate a framework and tool for combining multiple program analyses which allows the dynamic (on-line) adjustment of the precision of each analysis depending on the accumulated results. For example, the explicit tracking of the values of a variable may be switched off in favor of a predicate abstraction when and where the number of different variable values that have been encountered has exceeded a specified threshold. The method is evaluated on verifying the SSH client/server software and shows significant gains compared with predicate abstraction-based model checking."}],"month":"10","publication_status":"published","publisher":"ACM","publist_id":"140","day":"07","author":[{"first_name":"Dirk","last_name":"Beyer","full_name":"Beyer, Dirk"},{"last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Thomas Henzinger"},{"last_name":"Théoduloz","first_name":"Grégory","full_name":"Théoduloz, Grégory"}],"date_updated":"2021-01-12T07:59:46Z","type":"conference","citation":{"chicago":"Beyer, Dirk, Thomas A Henzinger, and Grégory Théoduloz. “Program Analysis with Dynamic Change of Precision,” 29–38. ACM, 2008. <a href=\"https://doi.org/10.1109/ASE.2008.13\">https://doi.org/10.1109/ASE.2008.13</a>.","ista":"Beyer D, Henzinger TA, Théoduloz G. 2008. Program analysis with dynamic change of precision. ASE: Automated Software Engineering, 29–38.","mla":"Beyer, Dirk, et al. <i>Program Analysis with Dynamic Change of Precision</i>. ACM, 2008, pp. 29–38, doi:<a href=\"https://doi.org/10.1109/ASE.2008.13\">10.1109/ASE.2008.13</a>.","ama":"Beyer D, Henzinger TA, Théoduloz G. Program analysis with dynamic change of precision. In: ACM; 2008:29-38. doi:<a href=\"https://doi.org/10.1109/ASE.2008.13\">10.1109/ASE.2008.13</a>","ieee":"D. Beyer, T. A. Henzinger, and G. Théoduloz, “Program analysis with dynamic change of precision,” presented at the ASE: Automated Software Engineering, 2008, pp. 29–38.","apa":"Beyer, D., Henzinger, T. A., &#38; Théoduloz, G. (2008). Program analysis with dynamic change of precision (pp. 29–38). Presented at the ASE: Automated Software Engineering, ACM. <a href=\"https://doi.org/10.1109/ASE.2008.13\">https://doi.org/10.1109/ASE.2008.13</a>","short":"D. Beyer, T.A. Henzinger, G. Théoduloz, in:, ACM, 2008, pp. 29–38."},"extern":1,"status":"public","title":"Program analysis with dynamic change of precision","date_published":"2008-10-07T00:00:00Z","doi":"10.1109/ASE.2008.13"},{"scopus_import":"1","year":"2008","_id":"517","date_created":"2018-12-11T11:46:55Z","page":"475 - 477","oa_version":"None","article_processing_charge":"No","quality_controlled":"1","publication_status":"published","department":[{"_id":"NiBa"}],"publisher":"Cambridge University Press","month":"10","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"Genetics Research","day":"29","publist_id":"7302","volume":89,"citation":{"short":"N.H. Barton, Genetics Research 89 (2008) 475–477.","ieee":"N. H. Barton, “Identity and coalescence in structured populations: A commentary on ‘Inbreeding coefficients and coalescence times’ by Montgomery Slatkin,” <i>Genetics Research</i>, vol. 89, no. 5–6. Cambridge University Press, pp. 475–477, 2008.","ama":"Barton NH. Identity and coalescence in structured populations: A commentary on “Inbreeding coefficients and coalescence times” by Montgomery Slatkin. <i>Genetics Research</i>. 2008;89(5-6):475-477. doi:<a href=\"https://doi.org/10.1017/S0016672308009683\">10.1017/S0016672308009683</a>","apa":"Barton, N. H. (2008). Identity and coalescence in structured populations: A commentary on “Inbreeding coefficients and coalescence times” by Montgomery Slatkin. <i>Genetics Research</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/S0016672308009683\">https://doi.org/10.1017/S0016672308009683</a>","mla":"Barton, Nicholas H. “Identity and Coalescence in Structured Populations: A Commentary on ‘Inbreeding Coefficients and Coalescence Times’ by Montgomery Slatkin.” <i>Genetics Research</i>, vol. 89, no. 5–6, Cambridge University Press, 2008, pp. 475–77, doi:<a href=\"https://doi.org/10.1017/S0016672308009683\">10.1017/S0016672308009683</a>.","ista":"Barton NH. 2008. Identity and coalescence in structured populations: A commentary on ‘Inbreeding coefficients and coalescence times’ by Montgomery Slatkin. Genetics Research. 89(5–6), 475–477.","chicago":"Barton, Nicholas H. “Identity and Coalescence in Structured Populations: A Commentary on ‘Inbreeding Coefficients and Coalescence Times’ by Montgomery Slatkin.” <i>Genetics Research</i>. Cambridge University Press, 2008. <a href=\"https://doi.org/10.1017/S0016672308009683\">https://doi.org/10.1017/S0016672308009683</a>."},"author":[{"last_name":"Barton","first_name":"Nicholas H","orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H"}],"date_updated":"2024-02-14T09:51:09Z","type":"journal_article","issue":"5-6","intvolume":"        89","language":[{"iso":"eng"}],"title":"Identity and coalescence in structured populations: A commentary on 'Inbreeding coefficients and coalescence times' by Montgomery Slatkin","status":"public","doi":"10.1017/S0016672308009683","date_published":"2008-10-29T00:00:00Z"},{"date_published":"2008-02-08T00:00:00Z","doi":"10.1126/science.1152697","title":"Observation of the spin hall effect of light via weak measurements","status":"public","extern":1,"issue":"5864","intvolume":"       319","citation":{"mla":"Hosten, Onur, and Paul Kwiat. “Observation of the Spin Hall Effect of Light via Weak Measurements.” <i>Science</i>, vol. 319, no. 5864, American Association for the Advancement of Science, 2008, pp. 787–90, doi:<a href=\"https://doi.org/10.1126/science.1152697\">10.1126/science.1152697</a>.","ama":"Hosten O, Kwiat P. Observation of the spin hall effect of light via weak measurements. <i>Science</i>. 2008;319(5864):787-790. doi:<a href=\"https://doi.org/10.1126/science.1152697\">10.1126/science.1152697</a>","apa":"Hosten, O., &#38; Kwiat, P. (2008). Observation of the spin hall effect of light via weak measurements. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.1152697\">https://doi.org/10.1126/science.1152697</a>","ieee":"O. Hosten and P. Kwiat, “Observation of the spin hall effect of light via weak measurements,” <i>Science</i>, vol. 319, no. 5864. American Association for the Advancement of Science, pp. 787–790, 2008.","chicago":"Hosten, Onur, and Paul Kwiat. “Observation of the Spin Hall Effect of Light via Weak Measurements.” <i>Science</i>. American Association for the Advancement of Science, 2008. <a href=\"https://doi.org/10.1126/science.1152697\">https://doi.org/10.1126/science.1152697</a>.","ista":"Hosten O, Kwiat P. 2008. Observation of the spin hall effect of light via weak measurements. Science. 319(5864), 787–790.","short":"O. Hosten, P. Kwiat, Science 319 (2008) 787–790."},"type":"journal_article","author":[{"orcid":"0000-0002-2031-204X","id":"4C02D85E-F248-11E8-B48F-1D18A9856A87","full_name":"Onur Hosten","last_name":"Hosten","first_name":"Onur"},{"full_name":"Kwiat, Paul","last_name":"Kwiat","first_name":"Paul"}],"date_updated":"2021-01-12T08:03:38Z","volume":319,"publist_id":"7226","day":"08","publication":"Science","month":"02","publisher":"American Association for the Advancement of Science","publication_status":"published","abstract":[{"text":"We have detected a spin-dependent displacement perpendicular to the refractive index gradient for photons passing through an air-glass interface. The effect is the photonic version of the spin Hall effect in electronic systems, indicating the universality of the effect for particles of different nature. Treating the effect as a weak measurement of the spin projection of the photons, we used a preselection and postselection technique on the spin state to enhance the original displacement by nearly four orders of magnitude, attaining sensitivity to displacements of ∼1 angstrom. The spin Hall effect can be used for manipulating photonic angular momentum states, and the measurement technique holds promise for precision metrology.","lang":"eng"}],"quality_controlled":0,"page":"787 - 790","date_created":"2018-12-11T11:47:19Z","_id":"581","year":"2008"},{"_id":"584","year":"2008","scopus_import":"1","date_created":"2018-12-11T11:47:20Z","conference":{"end_date":"2008-05-09","start_date":"2008-05-04","name":"QELS: Quantum Electronics and Laser Science Conference","location":"San Jose, CA, United States"},"article_processing_charge":"No","oa_version":"None","main_file_link":[{"url":"https://opg.optica.org/abstract.cfm?URI=QELS-2008-QFB7"}],"quality_controlled":"1","abstract":[{"lang":"eng","text":"Using “quantum weak-measurements” as a coherent enhancement technique for small signals, we have measured the recently proposed “spin Hall effect” of light at an air-glass interface, and are working on the smoothly varying refractive-index case."}],"month":"01","publisher":"Optica Publishing Group","publication_status":"published","publication_identifier":{"isbn":["978-155752859-9"],"issn":["21622701"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"7227","day":"01","citation":{"ista":"Hosten O, Kwiat P. 2008. Spin hall effect of light via weak measurements: Sharp and smooth index variations. QELS: Quantum Electronics and Laser Science Conference, Optics InfoBase Conference Papers, .","chicago":"Hosten, Onur, and Paul Kwiat. “Spin Hall Effect of Light via Weak Measurements: Sharp and Smooth Index Variations.” Optica Publishing Group, 2008.","apa":"Hosten, O., &#38; Kwiat, P. (2008). Spin hall effect of light via weak measurements: Sharp and smooth index variations. Presented at the QELS: Quantum Electronics and Laser Science Conference, San Jose, CA, United States: Optica Publishing Group.","ieee":"O. Hosten and P. Kwiat, “Spin hall effect of light via weak measurements: Sharp and smooth index variations,” presented at the QELS: Quantum Electronics and Laser Science Conference, San Jose, CA, United States, 2008.","ama":"Hosten O, Kwiat P. Spin hall effect of light via weak measurements: Sharp and smooth index variations. In: Optica Publishing Group; 2008.","mla":"Hosten, Onur, and Paul Kwiat. <i>Spin Hall Effect of Light via Weak Measurements: Sharp and Smooth Index Variations</i>. Optica Publishing Group, 2008.","short":"O. Hosten, P. Kwiat, in:, Optica Publishing Group, 2008."},"date_updated":"2022-05-24T09:10:41Z","author":[{"last_name":"Hosten","first_name":"Onur","id":"4C02D85E-F248-11E8-B48F-1D18A9856A87","full_name":"Hosten, Onur","orcid":"0000-0002-2031-204X"},{"last_name":"Kwiat","first_name":"Paul","full_name":"Kwiat, Paul"}],"type":"conference","extern":"1","alternative_title":["Optics InfoBase Conference Papers"],"status":"public","title":"Spin hall effect of light via weak measurements: Sharp and smooth index variations","language":[{"iso":"eng"}],"date_published":"2008-01-01T00:00:00Z"},{"page":"8044-8049","publisher":"Proceedings of the National Academy of Sciences","month":"06","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2020-07-14T12:47:20Z","volume":105,"type":"journal_article","ddc":["570"],"intvolume":"       105","extern":"1","language":[{"iso":"eng"}],"status":"public","doi":"10.1073/pnas.0707607105","date_published":"2008-06-10T00:00:00Z","year":"2008","_id":"6146","date_created":"2019-03-21T08:10:15Z","pmid":1,"oa_version":"Published Version","quality_controlled":"1","file":[{"date_updated":"2020-07-14T12:47:20Z","file_id":"6147","relation":"main_file","date_created":"2019-03-21T08:14:54Z","file_name":"2008_PNAS_Bretscher.pdf","access_level":"open_access","creator":"kschuh","file_size":501506,"content_type":"application/pdf","checksum":"eac0413064b022c1489f7b6719e7228c"}],"abstract":[{"text":"Homeostasis of internal carbon dioxide (CO2) and oxygen (O2) levels is fundamental to all animals. Here we examine the CO2 response of the nematode Caenorhabditis elegans. This species inhabits rotting material, which typically has a broad CO2 concentration range. We show that well fed C. elegans avoid CO2 levels above 0.5%. Animals can respond to both absolute CO2 concentrations and changes in CO2 levels within seconds. Responses to CO2 do not reflect avoidance of acid pH but appear to define a new sensory response. Sensation of CO2 is promoted by the cGMP-gated ion channel subunits TAX-2 and TAX-4, but other pathways are also important. Robust CO2 avoidance in well fed animals requires inhibition of the DAF-16 forkhead transcription factor by the insulin-like receptor DAF-2. Starvation, which activates DAF-16, strongly suppresses CO2 avoidance. Exposure to hypoxia (<1% O2) also suppresses CO2 avoidance via activation of the hypoxia-inducible transcription factor HIF-1. The npr-1 215V allele of the naturally polymorphic neuropeptide receptor npr-1, besides inhibiting avoidance of high ambient O2 in feeding C. elegans, also promotes avoidance of high CO2. C. elegans integrates competing O2 and CO2 sensory inputs so that one response dominates. Food and allelic variation at NPR-1 regulate which response prevails. Our results suggest that multiple sensory inputs are coordinated by C. elegans to generate different coherent foraging strategies.","lang":"eng"}],"publication_status":"published","publication_identifier":{"issn":["0027-8424","1091-6490"]},"publication":"Proceedings of the National Academy of Sciences","oa":1,"day":"10","citation":{"short":"A.J. Bretscher, K.E. Busch, M. de Bono, Proceedings of the National Academy of Sciences 105 (2008) 8044–8049.","ista":"Bretscher AJ, Busch KE, de Bono M. 2008. A carbon dioxide avoidance behavior is integrated with responses to ambient oxygen and food in Caenorhabditis elegans. Proceedings of the National Academy of Sciences. 105(23), 8044–8049.","chicago":"Bretscher, A. J., K. E. Busch, and Mario de Bono. “A Carbon Dioxide Avoidance Behavior Is Integrated with Responses to Ambient Oxygen and Food in Caenorhabditis Elegans.” <i>Proceedings of the National Academy of Sciences</i>. Proceedings of the National Academy of Sciences, 2008. <a href=\"https://doi.org/10.1073/pnas.0707607105\">https://doi.org/10.1073/pnas.0707607105</a>.","ieee":"A. J. Bretscher, K. E. Busch, and M. de Bono, “A carbon dioxide avoidance behavior is integrated with responses to ambient oxygen and food in Caenorhabditis elegans,” <i>Proceedings of the National Academy of Sciences</i>, vol. 105, no. 23. Proceedings of the National Academy of Sciences, pp. 8044–8049, 2008.","ama":"Bretscher AJ, Busch KE, de Bono M. A carbon dioxide avoidance behavior is integrated with responses to ambient oxygen and food in Caenorhabditis elegans. <i>Proceedings of the National Academy of Sciences</i>. 2008;105(23):8044-8049. doi:<a href=\"https://doi.org/10.1073/pnas.0707607105\">10.1073/pnas.0707607105</a>","apa":"Bretscher, A. J., Busch, K. E., &#38; de Bono, M. (2008). A carbon dioxide avoidance behavior is integrated with responses to ambient oxygen and food in Caenorhabditis elegans. <i>Proceedings of the National Academy of Sciences</i>. Proceedings of the National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.0707607105\">https://doi.org/10.1073/pnas.0707607105</a>","mla":"Bretscher, A. J., et al. “A Carbon Dioxide Avoidance Behavior Is Integrated with Responses to Ambient Oxygen and Food in Caenorhabditis Elegans.” <i>Proceedings of the National Academy of Sciences</i>, vol. 105, no. 23, Proceedings of the National Academy of Sciences, 2008, pp. 8044–49, doi:<a href=\"https://doi.org/10.1073/pnas.0707607105\">10.1073/pnas.0707607105</a>."},"date_updated":"2021-01-12T08:06:21Z","author":[{"first_name":"A. J.","last_name":"Bretscher","full_name":"Bretscher, A. J."},{"last_name":"Busch","first_name":"K. E.","full_name":"Busch, K. E."},{"first_name":"Mario","last_name":"de Bono","orcid":"0000-0001-8347-0443","id":"4E3FF80E-F248-11E8-B48F-1D18A9856A87","full_name":"de Bono, Mario"}],"issue":"23","has_accepted_license":"1","title":"A carbon dioxide avoidance behavior is integrated with responses to ambient oxygen and food in Caenorhabditis elegans","external_id":{"pmid":["18524954"]}},{"month":"04","publisher":"Elsevier","publication_status":"published","oa_version":"None","quality_controlled":"1","page":"178-185","_id":"6148","year":"2008","pmid":1,"date_created":"2019-03-21T08:19:45Z","status":"public","title":"Beyond induced mutants: using worms to study natural variation in genetic pathways","external_id":{"pmid":["18325626"]},"language":[{"iso":"eng"}],"date_published":"2008-04-01T00:00:00Z","doi":"10.1016/j.tig.2008.01.001","extern":"1","intvolume":"        24","issue":"4","volume":24,"citation":{"short":"J.E. Kammenga, P.C. Phillips, M. de Bono, A. Doroszuk, Trends in Genetics 24 (2008) 178–185.","ista":"Kammenga JE, Phillips PC, de Bono M, Doroszuk A. 2008. Beyond induced mutants: using worms to study natural variation in genetic pathways. Trends in Genetics. 24(4), 178–185.","chicago":"Kammenga, Jan E., Patrick C. Phillips, Mario de Bono, and Agnieszka Doroszuk. “Beyond Induced Mutants: Using Worms to Study Natural Variation in Genetic Pathways.” <i>Trends in Genetics</i>. Elsevier, 2008. <a href=\"https://doi.org/10.1016/j.tig.2008.01.001\">https://doi.org/10.1016/j.tig.2008.01.001</a>.","ieee":"J. E. Kammenga, P. C. Phillips, M. de Bono, and A. Doroszuk, “Beyond induced mutants: using worms to study natural variation in genetic pathways,” <i>Trends in Genetics</i>, vol. 24, no. 4. Elsevier, pp. 178–185, 2008.","apa":"Kammenga, J. E., Phillips, P. C., de Bono, M., &#38; Doroszuk, A. (2008). Beyond induced mutants: using worms to study natural variation in genetic pathways. <i>Trends in Genetics</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.tig.2008.01.001\">https://doi.org/10.1016/j.tig.2008.01.001</a>","ama":"Kammenga JE, Phillips PC, de Bono M, Doroszuk A. Beyond induced mutants: using worms to study natural variation in genetic pathways. <i>Trends in Genetics</i>. 2008;24(4):178-185. doi:<a href=\"https://doi.org/10.1016/j.tig.2008.01.001\">10.1016/j.tig.2008.01.001</a>","mla":"Kammenga, Jan E., et al. “Beyond Induced Mutants: Using Worms to Study Natural Variation in Genetic Pathways.” <i>Trends in Genetics</i>, vol. 24, no. 4, Elsevier, 2008, pp. 178–85, doi:<a href=\"https://doi.org/10.1016/j.tig.2008.01.001\">10.1016/j.tig.2008.01.001</a>."},"type":"journal_article","date_updated":"2021-01-12T08:06:21Z","author":[{"full_name":"Kammenga, Jan E.","last_name":"Kammenga","first_name":"Jan E."},{"last_name":"Phillips","first_name":"Patrick C.","full_name":"Phillips, Patrick C."},{"id":"4E3FF80E-F248-11E8-B48F-1D18A9856A87","full_name":"de Bono, Mario","orcid":"0000-0001-8347-0443","first_name":"Mario","last_name":"de Bono"},{"last_name":"Doroszuk","first_name":"Agnieszka","full_name":"Doroszuk, Agnieszka"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"issn":["0168-9525"]},"publication":"Trends in Genetics","day":"01"},{"language":[{"iso":"eng"}],"external_id":{"pmid":["18334193"]},"status":"public","title":"Sleep: dozy worms and sleepy flies","doi":"10.1016/j.cub.2008.01.002","date_published":"2008-03-11T00:00:00Z","issue":"5","intvolume":"        18","extern":"1","volume":18,"author":[{"full_name":"Olofsson, Birgitta","last_name":"Olofsson","first_name":"Birgitta"},{"first_name":"Mario","last_name":"de Bono","id":"4E3FF80E-F248-11E8-B48F-1D18A9856A87","full_name":"de Bono, Mario","orcid":"0000-0001-8347-0443"}],"type":"journal_article","date_updated":"2022-08-25T15:03:41Z","citation":{"chicago":"Olofsson, Birgitta, and Mario de Bono. “Sleep: Dozy Worms and Sleepy Flies.” <i>Current Biology</i>. Elsevier, 2008. <a href=\"https://doi.org/10.1016/j.cub.2008.01.002\">https://doi.org/10.1016/j.cub.2008.01.002</a>.","ista":"Olofsson B, de Bono M. 2008. Sleep: dozy worms and sleepy flies. Current Biology. 18(5), R204–R206.","mla":"Olofsson, Birgitta, and Mario de Bono. “Sleep: Dozy Worms and Sleepy Flies.” <i>Current Biology</i>, vol. 18, no. 5, Elsevier, 2008, pp. R204–06, doi:<a href=\"https://doi.org/10.1016/j.cub.2008.01.002\">10.1016/j.cub.2008.01.002</a>.","ieee":"B. Olofsson and M. de Bono, “Sleep: dozy worms and sleepy flies,” <i>Current Biology</i>, vol. 18, no. 5. Elsevier, pp. R204–R206, 2008.","ama":"Olofsson B, de Bono M. Sleep: dozy worms and sleepy flies. <i>Current Biology</i>. 2008;18(5):R204-R206. doi:<a href=\"https://doi.org/10.1016/j.cub.2008.01.002\">10.1016/j.cub.2008.01.002</a>","apa":"Olofsson, B., &#38; de Bono, M. (2008). Sleep: dozy worms and sleepy flies. <i>Current Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.cub.2008.01.002\">https://doi.org/10.1016/j.cub.2008.01.002</a>","short":"B. Olofsson, M. de Bono, Current Biology 18 (2008) R204–R206."},"publication_identifier":{"issn":["0960-9822"]},"publication":"Current Biology","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","day":"11","publisher":"Elsevier","publication_status":"published","month":"03","oa_version":"None","article_processing_charge":"No","quality_controlled":"1","page":"R204-R206","year":"2008","_id":"6149","pmid":1,"date_created":"2019-03-21T08:23:24Z"},{"_id":"7320","year":"2008","date_created":"2020-01-15T12:21:36Z","page":"551-559","article_processing_charge":"No","oa_version":"None","quality_controlled":"1","abstract":[{"text":"A comparative, experimental diffusivity study of gas diffusion layer (GDL) materials for polymer electrolyte fuel cells (PEFC) is presented for the first time. The GDL plays an important role for electrochemical losses due to gas transport limitations at high current densities. Characterization and optimization of these layers is therefore essential to improve power density. A recently developed method which allows for fast diffusimetry is applied and data compared to the literature values. Measurements are made as a function of direction and compression and the effect of different binder structures and hydrophobic treatments on effective diffusivities are discussed. A better understanding of the results is gained by including novel GDL cross-section images and a meaningful unit cell model for the interpretation of the data. The diffusivity data is valuable for GDL manufacturers and future PEFC models. The study reveals that a binder–fiber ratio larger than 50% has a negative impact on the effective diffusion properties. The hydrophobic treatment which is necessary to improve the water management can impede diffusion and thus reduce the power density. Furthermore binder has an isotropic effect while compression pronounces the in-plane orientation of the fibers.","lang":"eng"}],"month":"12","article_type":"original","publication_status":"published","publisher":"Elsevier","publication_identifier":{"issn":["0013-4686"]},"publication":"Electrochimica Acta","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"30","volume":54,"author":[{"last_name":"Flückiger","first_name":"Reto","full_name":"Flückiger, Reto"},{"id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425","full_name":"Freunberger, Stefan Alexander","orcid":"0000-0003-2902-5319","last_name":"Freunberger","first_name":"Stefan Alexander"},{"last_name":"Kramer","first_name":"Denis","full_name":"Kramer, Denis"},{"last_name":"Wokaun","first_name":"Alexander","full_name":"Wokaun, Alexander"},{"last_name":"Scherer","first_name":"Günther G.","full_name":"Scherer, Günther G."},{"full_name":"Büchi, Felix N.","first_name":"Felix N.","last_name":"Büchi"}],"date_updated":"2021-01-12T08:13:02Z","citation":{"mla":"Flückiger, Reto, et al. “Anisotropic, Effective Diffusivity of Porous Gas Diffusion Layer Materials for PEFC.” <i>Electrochimica Acta</i>, vol. 54, no. 2, Elsevier, 2008, pp. 551–59, doi:<a href=\"https://doi.org/10.1016/j.electacta.2008.07.034\">10.1016/j.electacta.2008.07.034</a>.","apa":"Flückiger, R., Freunberger, S. A., Kramer, D., Wokaun, A., Scherer, G. G., &#38; Büchi, F. N. (2008). Anisotropic, effective diffusivity of porous gas diffusion layer materials for PEFC. <i>Electrochimica Acta</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.electacta.2008.07.034\">https://doi.org/10.1016/j.electacta.2008.07.034</a>","ieee":"R. Flückiger, S. A. Freunberger, D. Kramer, A. Wokaun, G. G. Scherer, and F. N. Büchi, “Anisotropic, effective diffusivity of porous gas diffusion layer materials for PEFC,” <i>Electrochimica Acta</i>, vol. 54, no. 2. Elsevier, pp. 551–559, 2008.","ama":"Flückiger R, Freunberger SA, Kramer D, Wokaun A, Scherer GG, Büchi FN. Anisotropic, effective diffusivity of porous gas diffusion layer materials for PEFC. <i>Electrochimica Acta</i>. 2008;54(2):551-559. doi:<a href=\"https://doi.org/10.1016/j.electacta.2008.07.034\">10.1016/j.electacta.2008.07.034</a>","chicago":"Flückiger, Reto, Stefan Alexander Freunberger, Denis Kramer, Alexander Wokaun, Günther G. Scherer, and Felix N. Büchi. “Anisotropic, Effective Diffusivity of Porous Gas Diffusion Layer Materials for PEFC.” <i>Electrochimica Acta</i>. Elsevier, 2008. <a href=\"https://doi.org/10.1016/j.electacta.2008.07.034\">https://doi.org/10.1016/j.electacta.2008.07.034</a>.","ista":"Flückiger R, Freunberger SA, Kramer D, Wokaun A, Scherer GG, Büchi FN. 2008. Anisotropic, effective diffusivity of porous gas diffusion layer materials for PEFC. Electrochimica Acta. 54(2), 551–559.","short":"R. Flückiger, S.A. Freunberger, D. Kramer, A. Wokaun, G.G. Scherer, F.N. Büchi, Electrochimica Acta 54 (2008) 551–559."},"type":"journal_article","extern":"1","issue":"2","intvolume":"        54","status":"public","title":"Anisotropic, effective diffusivity of porous gas diffusion layer materials for PEFC","language":[{"iso":"eng"}],"date_published":"2008-12-30T00:00:00Z","doi":"10.1016/j.electacta.2008.07.034"},{"_id":"7321","year":"2008","date_created":"2020-01-15T12:21:47Z","abstract":[{"lang":"eng","text":"Cell interaction phenomena in polymer electrolyte fuel cell stacks that arise from imbalance between adjacent cells are investigated in detail experimentally and theoretically. A specialized two-cell stack with advanced localized diagnostics was developed and used to analyze the mechanism and effect of cell-to-cell coupling as a result of operationally relevant variations in reactant feed flow. Contributions to overall and local voltage changes with respect to uniformly operated cells are scrutinized. Unequal operation of the cells causes in-plane current in the bipolar plate to redistribute current and result in inhomogeneous polarization. Both increasing and decreasing polarization along the air-flow path reduces cell power as compared to isopotential operation. A two-dimensional model based on a commercial computational fluid dynamics code is used to back and extend the experimental results to more general cases. Furthermore, the experimental setup presented allowed for the first time to perform simultaneous localized electrochemical impedance spectroscopy beyond the single-cell level. The mechanism of mutual cell interaction on local and integral spectra is revealed. Results show that virtually identical operation of the cells is essential to obtain meaningful integral spectra."}],"month":"05","publisher":"The Electrochemical Society","publication_status":"published","article_type":"original","article_processing_charge":"No","oa_version":"None","quality_controlled":"1","volume":155,"type":"journal_article","citation":{"short":"S.A. Freunberger, I.A. Schneider, P.-C. Sui, A. Wokaun, N. Djilali, F.N. Büchi, Journal of The Electrochemical Society 155 (2008).","chicago":"Freunberger, Stefan Alexander, Ingo A. Schneider, Pang-Chieh Sui, Alexander Wokaun, Nedjib Djilali, and Felix N. Büchi. “Cell Interaction Phenomena in Polymer Electrolyte Fuel Cell Stacks.” <i>Journal of The Electrochemical Society</i>. The Electrochemical Society, 2008. <a href=\"https://doi.org/10.1149/1.2913095\">https://doi.org/10.1149/1.2913095</a>.","ista":"Freunberger SA, Schneider IA, Sui P-C, Wokaun A, Djilali N, Büchi FN. 2008. Cell interaction phenomena in polymer electrolyte fuel cell stacks. Journal of The Electrochemical Society. 155(7), B704.","mla":"Freunberger, Stefan Alexander, et al. “Cell Interaction Phenomena in Polymer Electrolyte Fuel Cell Stacks.” <i>Journal of The Electrochemical Society</i>, vol. 155, no. 7, B704, The Electrochemical Society, 2008, doi:<a href=\"https://doi.org/10.1149/1.2913095\">10.1149/1.2913095</a>.","apa":"Freunberger, S. A., Schneider, I. A., Sui, P.-C., Wokaun, A., Djilali, N., &#38; Büchi, F. N. (2008). Cell interaction phenomena in polymer electrolyte fuel cell stacks. <i>Journal of The Electrochemical Society</i>. The Electrochemical Society. <a href=\"https://doi.org/10.1149/1.2913095\">https://doi.org/10.1149/1.2913095</a>","ieee":"S. A. Freunberger, I. A. Schneider, P.-C. Sui, A. Wokaun, N. Djilali, and F. N. Büchi, “Cell interaction phenomena in polymer electrolyte fuel cell stacks,” <i>Journal of The Electrochemical Society</i>, vol. 155, no. 7. The Electrochemical Society, 2008.","ama":"Freunberger SA, Schneider IA, Sui P-C, Wokaun A, Djilali N, Büchi FN. Cell interaction phenomena in polymer electrolyte fuel cell stacks. <i>Journal of The Electrochemical Society</i>. 2008;155(7). doi:<a href=\"https://doi.org/10.1149/1.2913095\">10.1149/1.2913095</a>"},"author":[{"orcid":"0000-0003-2902-5319","id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425","full_name":"Freunberger, Stefan Alexander","last_name":"Freunberger","first_name":"Stefan Alexander"},{"first_name":"Ingo A.","last_name":"Schneider","full_name":"Schneider, Ingo A."},{"first_name":"Pang-Chieh","last_name":"Sui","full_name":"Sui, Pang-Chieh"},{"first_name":"Alexander","last_name":"Wokaun","full_name":"Wokaun, Alexander"},{"last_name":"Djilali","first_name":"Nedjib","full_name":"Djilali, Nedjib"},{"full_name":"Büchi, Felix N.","first_name":"Felix N.","last_name":"Büchi"}],"date_updated":"2021-01-12T08:13:03Z","publication_identifier":{"issn":["0013-4651"]},"publication":"Journal of The Electrochemical Society","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"08","title":"Cell interaction phenomena in polymer electrolyte fuel cell stacks","status":"public","language":[{"iso":"eng"}],"date_published":"2008-05-08T00:00:00Z","doi":"10.1149/1.2913095","extern":"1","issue":"7","article_number":"B704","intvolume":"       155"},{"date_published":"2008-01-01T00:00:00Z","doi":"10.1016/j.jelechem.2007.09.014","title":"Electrochemical diffusimetry of fuel cell gas diffusion layers","status":"public","language":[{"iso":"eng"}],"extern":"1","issue":"1","intvolume":"       612","type":"journal_article","author":[{"first_name":"Denis","last_name":"Kramer","full_name":"Kramer, Denis"},{"orcid":"0000-0003-2902-5319","id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425","full_name":"Freunberger, Stefan Alexander","last_name":"Freunberger","first_name":"Stefan Alexander"},{"last_name":"Flückiger","first_name":"Reto","full_name":"Flückiger, Reto"},{"first_name":"Ingo A.","last_name":"Schneider","full_name":"Schneider, Ingo A."},{"full_name":"Wokaun, Alexander","first_name":"Alexander","last_name":"Wokaun"},{"first_name":"Felix N.","last_name":"Büchi","full_name":"Büchi, Felix N."},{"first_name":"Günther G.","last_name":"Scherer","full_name":"Scherer, Günther G."}],"citation":{"short":"D. Kramer, S.A. Freunberger, R. Flückiger, I.A. Schneider, A. Wokaun, F.N. Büchi, G.G. Scherer, Journal of Electroanalytical Chemistry 612 (2008) 63–77.","mla":"Kramer, Denis, et al. “Electrochemical Diffusimetry of Fuel Cell Gas Diffusion Layers.” <i>Journal of Electroanalytical Chemistry</i>, vol. 612, no. 1, Elsevier, 2008, pp. 63–77, doi:<a href=\"https://doi.org/10.1016/j.jelechem.2007.09.014\">10.1016/j.jelechem.2007.09.014</a>.","apa":"Kramer, D., Freunberger, S. A., Flückiger, R., Schneider, I. A., Wokaun, A., Büchi, F. N., &#38; Scherer, G. G. (2008). Electrochemical diffusimetry of fuel cell gas diffusion layers. <i>Journal of Electroanalytical Chemistry</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jelechem.2007.09.014\">https://doi.org/10.1016/j.jelechem.2007.09.014</a>","ieee":"D. Kramer <i>et al.</i>, “Electrochemical diffusimetry of fuel cell gas diffusion layers,” <i>Journal of Electroanalytical Chemistry</i>, vol. 612, no. 1. Elsevier, pp. 63–77, 2008.","ama":"Kramer D, Freunberger SA, Flückiger R, et al. Electrochemical diffusimetry of fuel cell gas diffusion layers. <i>Journal of Electroanalytical Chemistry</i>. 2008;612(1):63-77. doi:<a href=\"https://doi.org/10.1016/j.jelechem.2007.09.014\">10.1016/j.jelechem.2007.09.014</a>","chicago":"Kramer, Denis, Stefan Alexander Freunberger, Reto Flückiger, Ingo A. Schneider, Alexander Wokaun, Felix N. Büchi, and Günther G. Scherer. “Electrochemical Diffusimetry of Fuel Cell Gas Diffusion Layers.” <i>Journal of Electroanalytical Chemistry</i>. Elsevier, 2008. <a href=\"https://doi.org/10.1016/j.jelechem.2007.09.014\">https://doi.org/10.1016/j.jelechem.2007.09.014</a>.","ista":"Kramer D, Freunberger SA, Flückiger R, Schneider IA, Wokaun A, Büchi FN, Scherer GG. 2008. Electrochemical diffusimetry of fuel cell gas diffusion layers. Journal of Electroanalytical Chemistry. 612(1), 63–77."},"date_updated":"2021-01-12T08:13:03Z","volume":612,"day":"01","publication_identifier":{"issn":["1572-6657"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"Journal of Electroanalytical Chemistry","month":"01","article_type":"original","publisher":"Elsevier","publication_status":"published","abstract":[{"text":"The gas diffusion layers (GDLs) of a membrane electrode assembly (MEA) serve as link between flow field and porous electrode within a polymer electrolyte fuel cell. Beside ensuring sufficient electrical and thermal contact between the whole electrode area and the flow field, these typically 200–400 μm thick porous structures enable the access of educts to the electrode area which would be occluded by the flow field lands if the flow field is directly attached to the electrode. Hence, the characterisation of properties pertaining to mass transport of educts and products through these structures is indispensable whilst examining the contribution of the GDLs to the overall electrochemical characteristics of a MEA. A fast and cost effective method to measure the effective diffusivity of a GDL is presented. Electrochemical impedance spectroscopy is applied to measure the effective ionic conductivity of an electrolyte-soaked GDL. Taking advantage of the analogy between Ficks and Ohms law, this provides a measure for the effective diffusivity. The method is described in detail, including experimental as well as theoretical aspects, and selected results, highlighting the anisotropy and dependence on the degree of compression, are shown. Moreover, a two-dimensional model consisting of regularly spaced ellipses is developed to represent the porous structure of the GDL, and by using conformal maps, the agreement between this model and experiment with respect to the sensitivity of the effective diffusivity towards compression is shown.","lang":"eng"}],"quality_controlled":"1","article_processing_charge":"No","oa_version":"None","page":"63-77","date_created":"2020-01-15T12:21:57Z","_id":"7322","year":"2008"},{"language":[{"iso":"eng"}],"status":"public","title":"Experimental investigation of the propagation of local current density variations to adjacent cells in PEFC stacks","doi":"10.1115/fuelcell2005-74116","date_published":"2008-10-13T00:00:00Z","extern":"1","author":[{"full_name":"Santis, Marco","first_name":"Marco","last_name":"Santis"},{"last_name":"Freunberger","first_name":"Stefan Alexander","full_name":"Freunberger, Stefan Alexander","id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425","orcid":"0000-0003-2902-5319"},{"full_name":"Papra, Matthias","last_name":"Papra","first_name":"Matthias"},{"first_name":"Felix N.","last_name":"Büchi","full_name":"Büchi, Felix N."}],"type":"conference","date_updated":"2021-01-12T08:13:33Z","citation":{"ista":"Santis M, Freunberger SA, Papra M, Büchi FN. 2008. Experimental investigation of the propagation of local current density variations to adjacent cells in PEFC stacks. 3rd International Conference on Fuel Cell Science, Engineering and Technology. International conference on fuel cell science, engineering and technology, 763–765.","chicago":"Santis, Marco, Stefan Alexander Freunberger, Matthias Papra, and Felix N. Büchi. “Experimental Investigation of the Propagation of Local Current Density Variations to Adjacent Cells in PEFC Stacks.” In <i>3rd International Conference on Fuel Cell Science, Engineering and Technology</i>, 763–65. ASMEDC, 2008. <a href=\"https://doi.org/10.1115/fuelcell2005-74116\">https://doi.org/10.1115/fuelcell2005-74116</a>.","apa":"Santis, M., Freunberger, S. A., Papra, M., &#38; Büchi, F. N. (2008). Experimental investigation of the propagation of local current density variations to adjacent cells in PEFC stacks. In <i>3rd International Conference on Fuel Cell Science, Engineering and Technology</i> (pp. 763–765). Ypsilanti, MI, United States: ASMEDC. <a href=\"https://doi.org/10.1115/fuelcell2005-74116\">https://doi.org/10.1115/fuelcell2005-74116</a>","ama":"Santis M, Freunberger SA, Papra M, Büchi FN. Experimental investigation of the propagation of local current density variations to adjacent cells in PEFC stacks. In: <i>3rd International Conference on Fuel Cell Science, Engineering and Technology</i>. ASMEDC; 2008:763-765. doi:<a href=\"https://doi.org/10.1115/fuelcell2005-74116\">10.1115/fuelcell2005-74116</a>","ieee":"M. Santis, S. A. Freunberger, M. Papra, and F. N. Büchi, “Experimental investigation of the propagation of local current density variations to adjacent cells in PEFC stacks,” in <i>3rd International Conference on Fuel Cell Science, Engineering and Technology</i>, Ypsilanti, MI, United States, 2008, pp. 763–765.","mla":"Santis, Marco, et al. “Experimental Investigation of the Propagation of Local Current Density Variations to Adjacent Cells in PEFC Stacks.” <i>3rd International Conference on Fuel Cell Science, Engineering and Technology</i>, ASMEDC, 2008, pp. 763–65, doi:<a href=\"https://doi.org/10.1115/fuelcell2005-74116\">10.1115/fuelcell2005-74116</a>.","short":"M. Santis, S.A. Freunberger, M. Papra, F.N. Büchi, in:, 3rd International Conference on Fuel Cell Science, Engineering and Technology, ASMEDC, 2008, pp. 763–765."},"publication":"3rd International Conference on Fuel Cell Science, Engineering and Technology","publication_identifier":{"isbn":["0791837645","0791837572"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"13","abstract":[{"text":"The propagation of single cell performance losses to adjacent cells in a polymer electrolyte fuel cell stack is studied by means of local current density measurements in a two cell stack. In this stack, the working conditions of adjacent cells can be controlled independently in order to deliberately change the performance of one cell (inducing cell) and study the coupling effects to the adjacent cell (response cell), while keeping the working conditions of the later one unchanged. The experiments have shown that changes in the current density distribution caused by lowering of the air stoichiometry in the inducing cell cause changes in the current density distribution of the response cell in the order of 60% of the change of the inducing cell, even when the air stoichiometry of the response cell is kept constant. The losses in cell voltage of the inducing cell cause losses in cell voltage of the response cell in a magnitude between 30 and 50%.","lang":"eng"}],"publication_status":"published","publisher":"ASMEDC","month":"10","oa_version":"None","article_processing_charge":"No","quality_controlled":"1","page":"763-765","conference":{"name":"International conference on fuel cell science, engineering and technology","start_date":"2005-05-23","location":"Ypsilanti, MI, United States","end_date":"2005-05-25"},"year":"2008","_id":"7425","date_created":"2020-01-31T10:14:45Z"},{"volume":"5218 LNCS","author":[{"orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian","last_name":"Alistarh"},{"full_name":"Gilbert, Seth","last_name":"Gilbert","first_name":"Seth"},{"first_name":"Rachid","last_name":"Guerraoui","full_name":"Guerraoui, Rachid"},{"last_name":"Travers","first_name":"Corentin","full_name":"Travers, Corentin"}],"citation":{"short":"D.-A. Alistarh, S. Gilbert, R. Guerraoui, C. Travers, in:, Springer, 2008, pp. 32–46.","ama":"Alistarh D-A, Gilbert S, Guerraoui R, Travers C. How to solve consensus in the smallest window of synchrony. In: Vol 5218 LNCS. Springer; 2008:32-46. doi:<a href=\"https://doi.org/10.1007/978-3-540-87779-0_3\">10.1007/978-3-540-87779-0_3</a>","ieee":"D.-A. Alistarh, S. Gilbert, R. Guerraoui, and C. Travers, “How to solve consensus in the smallest window of synchrony,” presented at the DISC: Distributed Computing, 2008, vol. 5218 LNCS, pp. 32–46.","apa":"Alistarh, D.-A., Gilbert, S., Guerraoui, R., &#38; Travers, C. (2008). How to solve consensus in the smallest window of synchrony (Vol. 5218 LNCS, pp. 32–46). Presented at the DISC: Distributed Computing, Springer. <a href=\"https://doi.org/10.1007/978-3-540-87779-0_3\">https://doi.org/10.1007/978-3-540-87779-0_3</a>","mla":"Alistarh, Dan-Adrian, et al. <i>How to Solve Consensus in the Smallest Window of Synchrony</i>. Vol. 5218 LNCS, Springer, 2008, pp. 32–46, doi:<a href=\"https://doi.org/10.1007/978-3-540-87779-0_3\">10.1007/978-3-540-87779-0_3</a>.","ista":"Alistarh D-A, Gilbert S, Guerraoui R, Travers C. 2008. How to solve consensus in the smallest window of synchrony. DISC: Distributed Computing, LNCS, vol. 5218 LNCS, 32–46.","chicago":"Alistarh, Dan-Adrian, Seth Gilbert, Rachid Guerraoui, and Corentin Travers. “How to Solve Consensus in the Smallest Window of Synchrony,” 5218 LNCS:32–46. Springer, 2008. <a href=\"https://doi.org/10.1007/978-3-540-87779-0_3\">https://doi.org/10.1007/978-3-540-87779-0_3</a>."},"type":"conference","date_updated":"2023-02-23T13:10:13Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"6904","day":"01","status":"public","title":"How to solve consensus in the smallest window of synchrony","language":[{"iso":"eng"}],"date_published":"2008-01-01T00:00:00Z","doi":"10.1007/978-3-540-87779-0_3","extern":"1","alternative_title":["LNCS"],"page":"32 - 46","conference":{"name":"DISC: Distributed Computing"},"_id":"753","year":"2008","date_created":"2018-12-11T11:48:19Z","abstract":[{"lang":"eng","text":"This paper addresses the following question: what is the minimum-sized synchronous window needed to solve consensus in an otherwise asynchronous system? In answer to this question, we present the first optimally-resilient algorithm ASAP that solves consensus as soon as possible in an eventually synchronous system, i.e., a system that from some time GST onwards, delivers messages in a timely fashion. ASAP guarantees that, in an execution with at most f failures, every process decides no later than round GST + f + 2, which is optimal."}],"month":"01","publication_status":"published","publisher":"Springer","article_processing_charge":"No","oa_version":"None"}]