[{"_id":"13142","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"location":"Paris, France","end_date":"2023-04-27","start_date":"2023-04-22","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems"},"type":"conference","status":"public","date_updated":"2023-06-19T08:30:54Z","ddc":["000"],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"file_date_updated":"2023-06-19T08:29:30Z","abstract":[{"text":"Reinforcement learning has received much attention for learning controllers of deterministic systems. We consider a learner-verifier framework for stochastic control systems and survey recent methods that formally guarantee a conjunction of reachability and safety properties. Given a property and a lower bound on the probability of the property being satisfied, our framework jointly learns a control policy and a formal certificate to ensure the satisfaction of the property with a desired probability threshold. Both the control policy and the formal certificate are continuous functions from states to reals, which are learned as parameterized neural networks. While in the deterministic case, the certificates are invariant and barrier functions for safety, or Lyapunov and ranking functions for liveness, in the stochastic case the certificates are supermartingales. For certificate verification, we use interval arithmetic abstract interpretation to bound the expected values of neural network functions.","lang":"eng"}],"oa_version":"Published Version","alternative_title":["LNCS"],"scopus_import":"1","intvolume":" 13993","month":"04","publication_status":"published","publication_identifier":{"eissn":["1611-3349"],"isbn":["9783031308222"],"issn":["0302-9743"]},"language":[{"iso":"eng"}],"file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","success":1,"file_id":"13150","checksum":"3d8a8bb24d211bc83360dfc2fd744307","creator":"dernst","file_size":528455,"date_updated":"2023-06-19T08:29:30Z","file_name":"2023_LNCS_Chatterjee.pdf","date_created":"2023-06-19T08:29:30Z"}],"license":"https://creativecommons.org/licenses/by/4.0/","ec_funded":1,"volume":13993,"project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818"},{"grant_number":"665385","name":"International IST Doctoral Program","call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"citation":{"mla":"Chatterjee, Krishnendu, et al. “A Learner-Verifier Framework for Neural Network Controllers and Certificates of Stochastic Systems.” Tools and Algorithms for the Construction and Analysis of Systems , vol. 13993, Springer Nature, 2023, pp. 3–25, doi:10.1007/978-3-031-30823-9_1.","short":"K. Chatterjee, T.A. Henzinger, M. Lechner, D. Zikelic, in:, Tools and Algorithms for the Construction and Analysis of Systems , Springer Nature, 2023, pp. 3–25.","ieee":"K. Chatterjee, T. A. Henzinger, M. Lechner, and D. Zikelic, “A learner-verifier framework for neural network controllers and certificates of stochastic systems,” in Tools and Algorithms for the Construction and Analysis of Systems , Paris, France, 2023, vol. 13993, pp. 3–25.","apa":"Chatterjee, K., Henzinger, T. A., Lechner, M., & Zikelic, D. (2023). A learner-verifier framework for neural network controllers and certificates of stochastic systems. In Tools and Algorithms for the Construction and Analysis of Systems (Vol. 13993, pp. 3–25). Paris, France: Springer Nature. https://doi.org/10.1007/978-3-031-30823-9_1","ama":"Chatterjee K, Henzinger TA, Lechner M, Zikelic D. A learner-verifier framework for neural network controllers and certificates of stochastic systems. In: Tools and Algorithms for the Construction and Analysis of Systems . Vol 13993. Springer Nature; 2023:3-25. doi:10.1007/978-3-031-30823-9_1","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Mathias Lechner, and Dorde Zikelic. “A Learner-Verifier Framework for Neural Network Controllers and Certificates of Stochastic Systems.” In Tools and Algorithms for the Construction and Analysis of Systems , 13993:3–25. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-30823-9_1.","ista":"Chatterjee K, Henzinger TA, Lechner M, Zikelic D. 2023. A learner-verifier framework for neural network controllers and certificates of stochastic systems. Tools and Algorithms for the Construction and Analysis of Systems . TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 13993, 3–25."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger"},{"first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner","full_name":"Lechner, Mathias"},{"id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","first_name":"Dorde","last_name":"Zikelic","full_name":"Zikelic, Dorde"}],"title":"A learner-verifier framework for neural network controllers and certificates of stochastic systems","acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093, ERC CoG 863818 (FoRM-SMArt) and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.","oa":1,"publisher":"Springer Nature","quality_controlled":"1","year":"2023","has_accepted_license":"1","publication":"Tools and Algorithms for the Construction and Analysis of Systems ","day":"22","page":"3-25","date_created":"2023-06-18T22:00:47Z","date_published":"2023-04-22T00:00:00Z","doi":"10.1007/978-3-031-30823-9_1"},{"volume":13994,"publication_identifier":{"isbn":["9783031308192"],"eissn":["1611-3349"],"issn":["0302-9743"]},"publication_status":"published","file":[{"file_name":"2023_LNCS_Anand.pdf","date_created":"2023-06-19T08:43:21Z","creator":"dernst","file_size":521425,"date_updated":"2023-06-19T08:43:21Z","success":1,"file_id":"13151","checksum":"60dcafc1b4f6f070be43bad3fe877974","relation":"main_file","access_level":"open_access","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"alternative_title":["LNCS"],"scopus_import":"1","month":"04","intvolume":" 13994","abstract":[{"lang":"eng","text":"We automatically compute a new class of environment assumptions in two-player turn-based finite graph games which characterize an “adequate cooperation” needed from the environment to allow the system player to win. Given an ω-regular winning condition Φ for the system player, we compute an ω-regular assumption Ψ for the environment player, such that (i) every environment strategy compliant with Ψ allows the system to fulfill Φ (sufficiency), (ii) Ψ\r\n can be fulfilled by the environment for every strategy of the system (implementability), and (iii) Ψ does not prevent any cooperative strategy choice (permissiveness).\r\nFor parity games, which are canonical representations of ω-regular games, we present a polynomial-time algorithm for the symbolic computation of adequately permissive assumptions and show that our algorithm runs faster and produces better assumptions than existing approaches—both theoretically and empirically. To the best of our knowledge, for ω\r\n-regular games, we provide the first algorithm to compute sufficient and implementable environment assumptions that are also permissive."}],"oa_version":"Published Version","file_date_updated":"2023-06-19T08:43:21Z","department":[{"_id":"ToHe"}],"date_updated":"2023-06-19T08:49:46Z","ddc":["000"],"type":"conference","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","end_date":"2023-04-27","location":"Paris, France","start_date":"2023-04-22"},"status":"public","_id":"13141","page":"211-228","doi":"10.1007/978-3-031-30820-8_15","date_published":"2023-04-20T00:00:00Z","date_created":"2023-06-18T22:00:47Z","has_accepted_license":"1","year":"2023","day":"20","publication":"TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems","quality_controlled":"1","publisher":"Springer Nature","oa":1,"author":[{"first_name":"Ashwani","last_name":"Anand","full_name":"Anand, Ashwani"},{"id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598","first_name":"Kaushik","full_name":"Mallik, Kaushik","orcid":"0000-0001-9864-7475","last_name":"Mallik"},{"full_name":"Nayak, Satya Prakash","last_name":"Nayak","first_name":"Satya Prakash"},{"first_name":"Anne Kathrin","last_name":"Schmuck","full_name":"Schmuck, Anne Kathrin"}],"article_processing_charge":"No","title":"Computing adequately permissive assumptions for synthesis","citation":{"mla":"Anand, Ashwani, et al. “Computing Adequately Permissive Assumptions for Synthesis.” TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems, vol. 13994, Springer Nature, 2023, pp. 211–28, doi:10.1007/978-3-031-30820-8_15.","ama":"Anand A, Mallik K, Nayak SP, Schmuck AK. Computing adequately permissive assumptions for synthesis. In: TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems. Vol 13994. Springer Nature; 2023:211-228. doi:10.1007/978-3-031-30820-8_15","apa":"Anand, A., Mallik, K., Nayak, S. P., & Schmuck, A. K. (2023). Computing adequately permissive assumptions for synthesis. In TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems (Vol. 13994, pp. 211–228). Paris, France: Springer Nature. https://doi.org/10.1007/978-3-031-30820-8_15","ieee":"A. Anand, K. Mallik, S. P. Nayak, and A. K. Schmuck, “Computing adequately permissive assumptions for synthesis,” in TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems, Paris, France, 2023, vol. 13994, pp. 211–228.","short":"A. Anand, K. Mallik, S.P. Nayak, A.K. Schmuck, in:, TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems, Springer Nature, 2023, pp. 211–228.","chicago":"Anand, Ashwani, Kaushik Mallik, Satya Prakash Nayak, and Anne Kathrin Schmuck. “Computing Adequately Permissive Assumptions for Synthesis.” In TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems, 13994:211–28. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-30820-8_15.","ista":"Anand A, Mallik K, Nayak SP, Schmuck AK. 2023. Computing adequately permissive assumptions for synthesis. TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 13994, 211–228."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"ec_funded":1,"language":[{"iso":"eng"}],"file":[{"date_created":"2023-04-20T09:14:38Z","file_name":"Thesis_Pokusaeva.docx","date_updated":"2023-04-20T09:26:51Z","file_size":14507243,"creator":"vpokusae","checksum":"5f589a9af025f7eeebfd0c186209913e","file_id":"12857","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","access_level":"closed","relation":"source_file"},{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","success":1,"checksum":"bbeed76db45a996b4c91a9abe12ce0ec","file_id":"12858","file_size":10090711,"date_updated":"2023-04-20T09:14:44Z","creator":"vpokusae","file_name":"Thesis_Pokusaeva.pdf","date_created":"2023-04-20T09:14:44Z"}],"degree_awarded":"PhD","publication_status":"published","publication_identifier":{"issn":["2663 - 337X"]},"month":"04","alternative_title":["ISTA Thesis"],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"During navigation, animals can infer the structure of the environment by computing the optic flow cues elicited by their own movements, and subsequently use this information to instruct proper locomotor actions. These computations require a panoramic assessment of the visual environment in order to disambiguate similar sensory experiences that may require distinct behavioral responses. The estimation of the global motion patterns is therefore essential for successful navigation. Yet, our understanding of the algorithms and implementations that enable coherent panoramic visual perception remains scarce. Here I pursue this problem by dissecting the functional aspects of interneuronal communication in the lobula plate tangential cell network in Drosophila melanogaster. The results presented in the thesis demonstrate that the basis for effective interpretation of the optic flow in this circuit are stereotyped synaptic connections that mediate the formation of distinct subnetworks, each extracting a particular pattern of global motion. \r\nFirstly, I show that gap junctions are essential for a correct interpretation of binocular motion cues by horizontal motion-sensitive cells. HS cells form electrical synapses with contralateral H2 neurons that are involved in detecting yaw rotation and translation. I developed an FlpStop-mediated mutant of a gap junction protein ShakB that disrupts these electrical synapses. While the loss of electrical synapses does not affect the tuning of the direction selectivity in HS neurons, it severely alters their sensitivity to horizontal motion in the contralateral side. These physiological changes result in an inappropriate integration of binocular motion cues in walking animals. While wild-type flies form a binocular perception of visual motion by non-linear integration of monocular optic flow cues, the mutant flies sum the monocular inputs linearly. These results indicate that rather than averaging signals in neighboring neurons, gap-junctions operate in conjunction with chemical synapses to mediate complex non-linear optic flow computations.\r\nSecondly, I show that stochastic manipulation of neuronal activity in the lobula plate tangential cell network is a powerful approach to study the neuronal implementation of optic flow-based navigation in flies. Tangential neurons form multiple subnetworks, each mediating course-stabilizing response to a particular global pattern of visual motion. Application of genetic mosaic techniques can provide sparse optogenetic activation of HS cells in numerous combinations. These distinct combinations of activated neurons drive an array of distinct behavioral responses, providing important insights into how visuomotor transformation is performed in the lobula plate tangential cell network. This approach can be complemented by stochastic silencing of tangential neurons, enabling direct assessment of the functional role of individual tangential neurons in the processing of specific visual motion patterns.\r\n\tTaken together, the findings presented in this thesis suggest that establishing specific activity patterns of tangential cells via stereotyped synaptic connectivity is a key to efficient optic flow-based navigation in Drosophila melanogaster."}],"acknowledged_ssus":[{"_id":"Bio"},{"_id":"LifeSc"}],"department":[{"_id":"MaJö"},{"_id":"GradSch"}],"file_date_updated":"2023-04-20T09:26:51Z","ddc":["570","571"],"date_updated":"2023-06-23T09:47:36Z","supervisor":[{"id":"2BD278E6-F248-11E8-B48F-1D18A9856A87","first_name":"Maximilian A","orcid":"0000-0002-3937-1330","full_name":"Jösch, Maximilian A","last_name":"Jösch"}],"status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"dissertation","_id":"12826","date_created":"2023-04-14T14:56:04Z","date_published":"2023-04-18T00:00:00Z","doi":"10.15479/at:ista:12826","page":"106","day":"18","year":"2023","has_accepted_license":"1","oa":1,"publisher":"Institute of Science and Technology Austria","title":"Neural control of optic flow-based navigation in Drosophila melanogaster","article_processing_charge":"No","author":[{"first_name":"Victoria","id":"3184041C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7660-444X","full_name":"Pokusaeva, Victoria","last_name":"Pokusaeva"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"mla":"Pokusaeva, Victoria. Neural Control of Optic Flow-Based Navigation in Drosophila Melanogaster. Institute of Science and Technology Austria, 2023, doi:10.15479/at:ista:12826.","ama":"Pokusaeva V. Neural control of optic flow-based navigation in Drosophila melanogaster. 2023. doi:10.15479/at:ista:12826","apa":"Pokusaeva, V. (2023). Neural control of optic flow-based navigation in Drosophila melanogaster. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:12826","short":"V. Pokusaeva, Neural Control of Optic Flow-Based Navigation in Drosophila Melanogaster, Institute of Science and Technology Austria, 2023.","ieee":"V. Pokusaeva, “Neural control of optic flow-based navigation in Drosophila melanogaster,” Institute of Science and Technology Austria, 2023.","chicago":"Pokusaeva, Victoria. “Neural Control of Optic Flow-Based Navigation in Drosophila Melanogaster.” Institute of Science and Technology Austria, 2023. https://doi.org/10.15479/at:ista:12826.","ista":"Pokusaeva V. 2023. Neural control of optic flow-based navigation in Drosophila melanogaster. Institute of Science and Technology Austria."},"project":[{"name":"International IST Doctoral Program","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}]},{"author":[{"orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Osang, Georg F","last_name":"Osang","first_name":"Georg F","id":"464B40D6-F248-11E8-B48F-1D18A9856A87"}],"external_id":{"isi":["000846967100001"]},"article_processing_charge":"Yes (via OA deal)","title":"A simple algorithm for higher-order Delaunay mosaics and alpha shapes","citation":{"ista":"Edelsbrunner H, Osang GF. 2023. A simple algorithm for higher-order Delaunay mosaics and alpha shapes. Algorithmica. 85, 277–295.","chicago":"Edelsbrunner, Herbert, and Georg F Osang. “A Simple Algorithm for Higher-Order Delaunay Mosaics and Alpha Shapes.” Algorithmica. Springer Nature, 2023. https://doi.org/10.1007/s00453-022-01027-6.","ama":"Edelsbrunner H, Osang GF. A simple algorithm for higher-order Delaunay mosaics and alpha shapes. Algorithmica. 2023;85:277-295. doi:10.1007/s00453-022-01027-6","apa":"Edelsbrunner, H., & Osang, G. F. (2023). A simple algorithm for higher-order Delaunay mosaics and alpha shapes. Algorithmica. Springer Nature. https://doi.org/10.1007/s00453-022-01027-6","ieee":"H. Edelsbrunner and G. F. Osang, “A simple algorithm for higher-order Delaunay mosaics and alpha shapes,” Algorithmica, vol. 85. Springer Nature, pp. 277–295, 2023.","short":"H. Edelsbrunner, G.F. Osang, Algorithmica 85 (2023) 277–295.","mla":"Edelsbrunner, Herbert, and Georg F. Osang. “A Simple Algorithm for Higher-Order Delaunay Mosaics and Alpha Shapes.” Algorithmica, vol. 85, Springer Nature, 2023, pp. 277–95, doi:10.1007/s00453-022-01027-6."},"user_id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","project":[{"_id":"266A2E9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"788183","name":"Alpha Shape Theory Extended"},{"call_identifier":"FWF","_id":"268116B8-B435-11E9-9278-68D0E5697425","grant_number":"Z00342","name":"The Wittgenstein Prize"},{"grant_number":"I02979-N35","name":"Persistence and stability of geometric complexes","call_identifier":"FWF","_id":"2561EBF4-B435-11E9-9278-68D0E5697425"}],"page":"277-295","date_published":"2023-01-01T00:00:00Z","doi":"10.1007/s00453-022-01027-6","date_created":"2022-09-11T22:01:57Z","has_accepted_license":"1","isi":1,"year":"2023","day":"01","publication":"Algorithmica","quality_controlled":"1","publisher":"Springer Nature","oa":1,"acknowledgement":"Open access funding provided by Austrian Science Fund (FWF). This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme, Grant No. 788183, from the Wittgenstein Prize, Austrian Science Fund (FWF), Grant No. Z 342-N31, and from the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, Austrian Science Fund (FWF), Grant No. I 02979-N35.","department":[{"_id":"HeEd"}],"file_date_updated":"2023-01-20T10:02:48Z","date_updated":"2023-06-27T12:53:43Z","ddc":["510"],"article_type":"original","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","_id":"12086","volume":85,"ec_funded":1,"publication_identifier":{"issn":["0178-4617"],"eissn":["1432-0541"]},"publication_status":"published","file":[{"creator":"dernst","file_size":911017,"date_updated":"2023-01-20T10:02:48Z","file_name":"2023_Algorithmica_Edelsbrunner.pdf","date_created":"2023-01-20T10:02:48Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","success":1,"checksum":"71685ca5121f4c837f40c3f8eb50c915","file_id":"12322"}],"language":[{"iso":"eng"}],"scopus_import":"1","month":"01","intvolume":" 85","abstract":[{"lang":"eng","text":"We present a simple algorithm for computing higher-order Delaunay mosaics that works in Euclidean spaces of any finite dimensions. The algorithm selects the vertices of the order-k mosaic from incrementally constructed lower-order mosaics and uses an algorithm for weighted first-order Delaunay mosaics as a black-box to construct the order-k mosaic from its vertices. Beyond this black-box, the algorithm uses only combinatorial operations, thus facilitating easy implementation. We extend this algorithm to compute higher-order α-shapes and provide open-source implementations. We present experimental results for properties of higher-order Delaunay mosaics of random point sets."}],"oa_version":"Published Version"},{"language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"12325","checksum":"1f34f3e2cb521033de6154f274ea3a4e","success":1,"date_updated":"2023-01-20T10:45:06Z","file_size":422612,"creator":"dernst","date_created":"2023-01-20T10:45:06Z","file_name":"2023_JourEvolutionEquations_DelloSchiavo.pdf"}],"publication_status":"published","publication_identifier":{"eissn":["1424-3202"],"issn":["1424-3199"]},"ec_funded":1,"volume":23,"issue":"1","oa_version":"Published Version","abstract":[{"text":"We study ergodic decompositions of Dirichlet spaces under intertwining via unitary order isomorphisms. We show that the ergodic decomposition of a quasi-regular Dirichlet space is unique up to a unique isomorphism of the indexing space. Furthermore, every unitary order isomorphism intertwining two quasi-regular Dirichlet spaces is decomposable over their ergodic decompositions up to conjugation via an isomorphism of the corresponding indexing spaces.","lang":"eng"}],"intvolume":" 23","month":"01","scopus_import":"1","ddc":["510"],"date_updated":"2023-06-28T11:54:35Z","department":[{"_id":"JaMa"}],"file_date_updated":"2023-01-20T10:45:06Z","_id":"12104","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","article_type":"original","publication":"Journal of Evolution Equations","day":"01","year":"2023","has_accepted_license":"1","isi":1,"date_created":"2023-01-08T23:00:53Z","doi":"10.1007/s00028-022-00859-7","date_published":"2023-01-01T00:00:00Z","acknowledgement":"Research supported by the Austrian Science Fund (FWF) grant F65 at the Institute of Science and Technology Austria and by the European Research Council (ERC) (Grant agreement No. 716117 awarded to Prof. Dr. Jan Maas). L.D.S. gratefully acknowledges funding of his current position by the Austrian Science Fund (FWF) through the ESPRIT Programme (Grant No. 208). M.W. gratefully acknowledges funding of his current position by the Austrian Science Fund (FWF) through the ESPRIT Programme (Grant No. 156).","oa":1,"quality_controlled":"1","publisher":"Springer Nature","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Dello Schiavo, Lorenzo, and Melchior Wirth. “Ergodic Decompositions of Dirichlet Forms under Order Isomorphisms.” Journal of Evolution Equations, vol. 23, no. 1, 9, Springer Nature, 2023, doi:10.1007/s00028-022-00859-7.","ama":"Dello Schiavo L, Wirth M. Ergodic decompositions of Dirichlet forms under order isomorphisms. Journal of Evolution Equations. 2023;23(1). doi:10.1007/s00028-022-00859-7","apa":"Dello Schiavo, L., & Wirth, M. (2023). Ergodic decompositions of Dirichlet forms under order isomorphisms. Journal of Evolution Equations. Springer Nature. https://doi.org/10.1007/s00028-022-00859-7","short":"L. Dello Schiavo, M. Wirth, Journal of Evolution Equations 23 (2023).","ieee":"L. Dello Schiavo and M. Wirth, “Ergodic decompositions of Dirichlet forms under order isomorphisms,” Journal of Evolution Equations, vol. 23, no. 1. Springer Nature, 2023.","chicago":"Dello Schiavo, Lorenzo, and Melchior Wirth. “Ergodic Decompositions of Dirichlet Forms under Order Isomorphisms.” Journal of Evolution Equations. Springer Nature, 2023. https://doi.org/10.1007/s00028-022-00859-7.","ista":"Dello Schiavo L, Wirth M. 2023. Ergodic decompositions of Dirichlet forms under order isomorphisms. Journal of Evolution Equations. 23(1), 9."},"title":"Ergodic decompositions of Dirichlet forms under order isomorphisms","article_processing_charge":"Yes (via OA deal)","external_id":{"isi":["000906214600004"]},"author":[{"last_name":"Dello Schiavo","orcid":"0000-0002-9881-6870","full_name":"Dello Schiavo, Lorenzo","id":"ECEBF480-9E4F-11EA-B557-B0823DDC885E","first_name":"Lorenzo"},{"last_name":"Wirth","orcid":"0000-0002-0519-4241","full_name":"Wirth, Melchior","first_name":"Melchior","id":"88644358-0A0E-11EA-8FA5-49A33DDC885E"}],"article_number":"9","project":[{"_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","grant_number":"F6504","name":"Taming Complexity in Partial Differential Systems"},{"name":"Optimal Transport and Stochastic Dynamics","grant_number":"716117","call_identifier":"H2020","_id":"256E75B8-B435-11E9-9278-68D0E5697425"},{"_id":"34dbf174-11ca-11ed-8bc3-afe9d43d4b9c","grant_number":"E208","name":"Configuration Spaces over Non-Smooth Spaces"},{"name":"Gradient flow techniques for quantum Markov semigroups","grant_number":"ESP156_N","_id":"34c6ea2d-11ca-11ed-8bc3-c04f3c502833"}]}]