--- _id: '8787' abstract: - lang: eng text: Breakdown of vascular barriers is a major complication of inflammatory diseases. Anucleate platelets form blood-clots during thrombosis, but also play a crucial role in inflammation. While spatio-temporal dynamics of clot formation are well characterized, the cell-biological mechanisms of platelet recruitment to inflammatory micro-environments remain incompletely understood. Here we identify Arp2/3-dependent lamellipodia formation as a prominent morphological feature of immune-responsive platelets. Platelets use lamellipodia to scan for fibrin(ogen) deposited on the inflamed vasculature and to directionally spread, to polarize and to govern haptotactic migration along gradients of the adhesive ligand. Platelet-specific abrogation of Arp2/3 interferes with haptotactic repositioning of platelets to microlesions, thus impairing vascular sealing and provoking inflammatory microbleeding. During infection, haptotaxis promotes capture of bacteria and prevents hematogenic dissemination, rendering platelets gate-keepers of the inflamed microvasculature. Consequently, these findings identify haptotaxis as a key effector function of immune-responsive platelets. acknowledgement: "We thank Sebastian Helmer, Nicole Blount, Christine Mann, and Beate Jantz for technical assistance; Hellen Ishikawa-Ankerhold for help and advice; Michael Sixt for critical\r\ndiscussions. This study was supported by the DFG SFB 914 (S.M. [B02 and Z01], K.Sch.\r\n[B02], B.W. [A02 and Z03], C.A.R. [B03], C.S. [A10], J.P. [Gerok position]), the DFG\r\nSFB 1123 (S.M. [B06]), the DFG FOR 2033 (S.M. and F.G.), the German Center for\r\nCardiovascular Research (DZHK) (Clinician Scientist Program [L.N.], MHA 1.4VD\r\n[S.M.], Postdoc Start-up Grant, 81×3600213 [F.G.]), FP7 program (project 260309,\r\nPRESTIGE [S.M.]), FöFoLe project 1015/1009 (L.N.), FöFoLe project 947 (F.G.), the\r\nFriedrich-Baur-Stiftung project 41/16 (F.G.), and LMUexcellence NFF (F.G.). This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation program (grant agreement no.\r\n833440) (S.M.). F.G. received funding from the European Union’s Horizon 2020 research\r\nand innovation program under the Marie Skłodowska-Curie grant agreement no.\r\n747687." article_number: '5778' article_processing_charge: No article_type: original author: - first_name: Leo full_name: Nicolai, Leo last_name: Nicolai - first_name: Karin full_name: Schiefelbein, Karin last_name: Schiefelbein - first_name: Silvia full_name: Lipsky, Silvia last_name: Lipsky - first_name: Alexander full_name: Leunig, Alexander last_name: Leunig - first_name: Marie full_name: Hoffknecht, Marie last_name: Hoffknecht - first_name: Kami full_name: Pekayvaz, Kami last_name: Pekayvaz - first_name: Ben full_name: Raude, Ben last_name: Raude - first_name: Charlotte full_name: Marx, Charlotte last_name: Marx - first_name: Andreas full_name: Ehrlich, Andreas last_name: Ehrlich - first_name: Joachim full_name: Pircher, Joachim last_name: Pircher - first_name: Zhe full_name: Zhang, Zhe last_name: Zhang - first_name: Inas full_name: Saleh, Inas last_name: Saleh - first_name: Anna-Kristina full_name: Marel, Anna-Kristina last_name: Marel - first_name: Achim full_name: Löf, Achim last_name: Löf - first_name: Tobias full_name: Petzold, Tobias last_name: Petzold - first_name: Michael full_name: Lorenz, Michael last_name: Lorenz - first_name: Konstantin full_name: Stark, Konstantin last_name: Stark - first_name: Robert full_name: Pick, Robert last_name: Pick - first_name: Gerhild full_name: Rosenberger, Gerhild last_name: Rosenberger - first_name: Ludwig full_name: Weckbach, Ludwig last_name: Weckbach - first_name: Bernd full_name: Uhl, Bernd last_name: Uhl - first_name: Sheng full_name: Xia, Sheng last_name: Xia - first_name: Christoph Andreas full_name: Reichel, Christoph Andreas last_name: Reichel - first_name: Barbara full_name: Walzog, Barbara last_name: Walzog - first_name: Christian full_name: Schulz, Christian last_name: Schulz - first_name: Vanessa full_name: Zheden, Vanessa id: 39C5A68A-F248-11E8-B48F-1D18A9856A87 last_name: Zheden orcid: 0000-0002-9438-4783 - first_name: Markus full_name: Bender, Markus last_name: Bender - first_name: Rong full_name: Li, Rong last_name: Li - first_name: Steffen full_name: Massberg, Steffen last_name: Massberg - first_name: Florian R full_name: Gärtner, Florian R id: 397A88EE-F248-11E8-B48F-1D18A9856A87 last_name: Gärtner orcid: 0000-0001-6120-3723 citation: ama: Nicolai L, Schiefelbein K, Lipsky S, et al. Vascular surveillance by haptotactic blood platelets in inflammation and infection. Nature Communications. 2020;11. doi:10.1038/s41467-020-19515-0 apa: Nicolai, L., Schiefelbein, K., Lipsky, S., Leunig, A., Hoffknecht, M., Pekayvaz, K., … Gärtner, F. R. (2020). Vascular surveillance by haptotactic blood platelets in inflammation and infection. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-020-19515-0 chicago: Nicolai, Leo, Karin Schiefelbein, Silvia Lipsky, Alexander Leunig, Marie Hoffknecht, Kami Pekayvaz, Ben Raude, et al. “Vascular Surveillance by Haptotactic Blood Platelets in Inflammation and Infection.” Nature Communications. Springer Nature, 2020. https://doi.org/10.1038/s41467-020-19515-0. ieee: L. Nicolai et al., “Vascular surveillance by haptotactic blood platelets in inflammation and infection,” Nature Communications, vol. 11. Springer Nature, 2020. ista: Nicolai L, Schiefelbein K, Lipsky S, Leunig A, Hoffknecht M, Pekayvaz K, Raude B, Marx C, Ehrlich A, Pircher J, Zhang Z, Saleh I, Marel A-K, Löf A, Petzold T, Lorenz M, Stark K, Pick R, Rosenberger G, Weckbach L, Uhl B, Xia S, Reichel CA, Walzog B, Schulz C, Zheden V, Bender M, Li R, Massberg S, Gärtner FR. 2020. Vascular surveillance by haptotactic blood platelets in inflammation and infection. Nature Communications. 11, 5778. mla: Nicolai, Leo, et al. “Vascular Surveillance by Haptotactic Blood Platelets in Inflammation and Infection.” Nature Communications, vol. 11, 5778, Springer Nature, 2020, doi:10.1038/s41467-020-19515-0. short: L. Nicolai, K. Schiefelbein, S. Lipsky, A. Leunig, M. Hoffknecht, K. Pekayvaz, B. Raude, C. Marx, A. Ehrlich, J. Pircher, Z. Zhang, I. Saleh, A.-K. Marel, A. Löf, T. Petzold, M. Lorenz, K. Stark, R. Pick, G. Rosenberger, L. Weckbach, B. Uhl, S. Xia, C.A. Reichel, B. Walzog, C. Schulz, V. Zheden, M. Bender, R. Li, S. Massberg, F.R. Gärtner, Nature Communications 11 (2020). date_created: 2020-11-22T23:01:23Z date_published: 2020-11-13T00:00:00Z date_updated: 2023-08-22T13:26:26Z day: '13' ddc: - '570' department: - _id: MiSi - _id: EM-Fac doi: 10.1038/s41467-020-19515-0 ec_funded: 1 external_id: isi: - '000594648000014' pmid: - '33188196' file: - access_level: open_access checksum: 485b7b6cf30198ba0ce126491a28f125 content_type: application/pdf creator: dernst date_created: 2020-11-23T13:29:49Z date_updated: 2020-11-23T13:29:49Z file_id: '8798' file_name: 2020_NatureComm_Nicolai.pdf file_size: 7035340 relation: main_file success: 1 file_date_updated: 2020-11-23T13:29:49Z has_accepted_license: '1' intvolume: ' 11' isi: 1 language: - iso: eng license: https://creativecommons.org/licenses/by/4.0/ month: '11' oa: 1 oa_version: Published Version pmid: 1 project: - _id: 260AA4E2-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '747687' name: Mechanical Adaptation of Lamellipodial Actin Networks in Migrating Cells publication: Nature Communications publication_identifier: eissn: - '20411723' publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: link: - relation: erratum url: https://doi.org/10.1038/s41467-022-31310-7 scopus_import: '1' status: public title: Vascular surveillance by haptotactic blood platelets in inflammation and infection tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 11 year: '2020' ... --- _id: '8789' abstract: - lang: eng text: Cooperation is a ubiquitous and beneficial behavioural trait despite being prone to exploitation by free-riders. Hence, cooperative populations are prone to invasions by selfish individuals. However, a population consisting of only free-riders typically does not survive. Thus, cooperators and free-riders often coexist in some proportion. An evolutionary version of a Snowdrift Game proved its efficiency in analysing this phenomenon. However, what if the system has already reached its stable state but was perturbed due to a change in environmental conditions? Then, individuals may have to re-learn their effective strategies. To address this, we consider behavioural mistakes in strategic choice execution, which we refer to as incompetence. Parametrising the propensity to make such mistakes allows for a mathematical description of learning. We compare strategies based on their relative strategic advantage relying on both fitness and learning factors. When strategies are learned at distinct rates, allowing learning according to a prescribed order is optimal. Interestingly, the strategy with the lowest strategic advantage should be learnt first if we are to optimise fitness over the learning path. Then, the differences between strategies are balanced out in order to minimise the effect of behavioural uncertainty. acknowledgement: "This work was supported by the European Union’s Horizon 2020 research and innovation program under the Marie Sklodowska-Curie Grant Agreement #754411, the Australian Research Council Discovery Grants DP160101236 and DP150100618, and the European Research Council Consolidator Grant 863818 (FoRM-SMArt).\r\nAuthors would like to thank Patrick McKinlay for his work on the preliminary results for this paper." article_number: '1945' article_processing_charge: No article_type: original author: - first_name: Maria full_name: Kleshnina, Maria id: 4E21749C-F248-11E8-B48F-1D18A9856A87 last_name: Kleshnina - first_name: Sabrina full_name: Streipert, Sabrina last_name: Streipert - first_name: Jerzy full_name: Filar, Jerzy last_name: Filar - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X citation: ama: Kleshnina M, Streipert S, Filar J, Chatterjee K. Prioritised learning in snowdrift-type games. Mathematics. 2020;8(11). doi:10.3390/math8111945 apa: Kleshnina, M., Streipert, S., Filar, J., & Chatterjee, K. (2020). Prioritised learning in snowdrift-type games. Mathematics. MDPI. https://doi.org/10.3390/math8111945 chicago: Kleshnina, Maria, Sabrina Streipert, Jerzy Filar, and Krishnendu Chatterjee. “Prioritised Learning in Snowdrift-Type Games.” Mathematics. MDPI, 2020. https://doi.org/10.3390/math8111945. ieee: M. Kleshnina, S. Streipert, J. Filar, and K. Chatterjee, “Prioritised learning in snowdrift-type games,” Mathematics, vol. 8, no. 11. MDPI, 2020. ista: Kleshnina M, Streipert S, Filar J, Chatterjee K. 2020. Prioritised learning in snowdrift-type games. Mathematics. 8(11), 1945. mla: Kleshnina, Maria, et al. “Prioritised Learning in Snowdrift-Type Games.” Mathematics, vol. 8, no. 11, 1945, MDPI, 2020, doi:10.3390/math8111945. short: M. Kleshnina, S. Streipert, J. Filar, K. Chatterjee, Mathematics 8 (2020). date_created: 2020-11-22T23:01:24Z date_published: 2020-11-04T00:00:00Z date_updated: 2023-08-22T13:25:45Z day: '04' ddc: - '000' department: - _id: KrCh doi: 10.3390/math8111945 ec_funded: 1 external_id: isi: - '000593962100001' file: - access_level: open_access checksum: 61cfcc3b35760656ce7a9385a4ace5d2 content_type: application/pdf creator: dernst date_created: 2020-11-23T13:06:30Z date_updated: 2020-11-23T13:06:30Z file_id: '8797' file_name: 2020_Mathematics_Kleshnina.pdf file_size: 565191 relation: main_file success: 1 file_date_updated: 2020-11-23T13:06:30Z has_accepted_license: '1' intvolume: ' 8' isi: 1 issue: '11' language: - iso: eng month: '11' oa: 1 oa_version: Published Version project: - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships - _id: 0599E47C-7A3F-11EA-A408-12923DDC885E call_identifier: H2020 grant_number: '863818' name: 'Formal Methods for Stochastic Models: Algorithms and Applications' publication: Mathematics publication_identifier: eissn: - '22277390' publication_status: published publisher: MDPI quality_controlled: '1' scopus_import: '1' status: public title: Prioritised learning in snowdrift-type games tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 8 year: '2020' ... --- _id: '8287' abstract: - lang: eng text: Reachability analysis aims at identifying states reachable by a system within a given time horizon. This task is known to be computationally expensive for linear hybrid systems. Reachability analysis works by iteratively applying continuous and discrete post operators to compute states reachable according to continuous and discrete dynamics, respectively. In this paper, we enhance both of these operators and make sure that most of the involved computations are performed in low-dimensional state space. In particular, we improve the continuous-post operator by performing computations in high-dimensional state space only for time intervals relevant for the subsequent application of the discrete-post operator. Furthermore, the new discrete-post operator performs low-dimensional computations by leveraging the structure of the guard and assignment of a considered transition. We illustrate the potential of our approach on a number of challenging benchmarks. article_processing_charge: No author: - first_name: Sergiy full_name: Bogomolov, Sergiy last_name: Bogomolov - first_name: Marcelo full_name: Forets, Marcelo last_name: Forets - first_name: Goran full_name: Frehse, Goran last_name: Frehse - first_name: Kostiantyn full_name: Potomkin, Kostiantyn last_name: Potomkin - first_name: Christian full_name: Schilling, Christian id: 3A2F4DCE-F248-11E8-B48F-1D18A9856A87 last_name: Schilling orcid: 0000-0003-3658-1065 citation: ama: 'Bogomolov S, Forets M, Frehse G, Potomkin K, Schilling C. Reachability analysis of linear hybrid systems via block decomposition. In: Proceedings of the International Conference on Embedded Software. ; 2020.' apa: Bogomolov, S., Forets, M., Frehse, G., Potomkin, K., & Schilling, C. (2020). Reachability analysis of linear hybrid systems via block decomposition. In Proceedings of the International Conference on Embedded Software. Virtual . chicago: Bogomolov, Sergiy, Marcelo Forets, Goran Frehse, Kostiantyn Potomkin, and Christian Schilling. “Reachability Analysis of Linear Hybrid Systems via Block Decomposition.” In Proceedings of the International Conference on Embedded Software, 2020. ieee: S. Bogomolov, M. Forets, G. Frehse, K. Potomkin, and C. Schilling, “Reachability analysis of linear hybrid systems via block decomposition,” in Proceedings of the International Conference on Embedded Software, Virtual , 2020. ista: 'Bogomolov S, Forets M, Frehse G, Potomkin K, Schilling C. 2020. Reachability analysis of linear hybrid systems via block decomposition. Proceedings of the International Conference on Embedded Software. EMSOFT: International Conference on Embedded Software.' mla: Bogomolov, Sergiy, et al. “Reachability Analysis of Linear Hybrid Systems via Block Decomposition.” Proceedings of the International Conference on Embedded Software, 2020. short: S. Bogomolov, M. Forets, G. Frehse, K. Potomkin, C. Schilling, in:, Proceedings of the International Conference on Embedded Software, 2020. conference: end_date: 2020-09-25 location: 'Virtual ' name: 'EMSOFT: International Conference on Embedded Software' start_date: 2020-09-20 date_created: 2020-08-24T12:56:20Z date_published: 2020-01-01T00:00:00Z date_updated: 2023-08-22T13:27:32Z ddc: - '000' department: - _id: ToHe ec_funded: 1 external_id: arxiv: - '1905.02458' file: - access_level: open_access checksum: d19e97d0f8a3a441dc078ec812297d75 content_type: application/pdf creator: cschilli date_created: 2020-08-24T12:53:15Z date_updated: 2020-08-24T12:53:15Z file_id: '8288' file_name: 2020EMSOFT.pdf file_size: 696384 relation: main_file success: 1 file_date_updated: 2020-08-24T12:53:15Z has_accepted_license: '1' keyword: - reachability - hybrid systems - decomposition language: - iso: eng oa: 1 oa_version: Preprint project: - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 25C5A090-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z00312 name: The Wittgenstein Prize - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships publication: Proceedings of the International Conference on Embedded Software publication_status: published quality_controlled: '1' related_material: record: - id: '8790' relation: later_version status: public status: public title: Reachability analysis of linear hybrid systems via block decomposition tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2020' ... --- _id: '8788' abstract: - lang: eng text: 'We consider a real-time setting where an environment releases sequences of firm-deadline tasks, and an online scheduler chooses on-the-fly the ones to execute on a single processor so as to maximize cumulated utility. The competitive ratio is a well-known performance measure for the scheduler: it gives the worst-case ratio, among all possible choices for the environment, of the cumulated utility of the online scheduler versus an offline scheduler that knows these choices in advance. Traditionally, competitive analysis is performed by hand, while automated techniques are rare and only handle static environments with independent tasks. We present a quantitative-verification framework for precedence-aware competitive analysis, where task releases may depend on preceding scheduling choices, i.e., the environment can respond to scheduling decisions dynamically . We consider two general classes of precedences: 1) follower precedences force the release of a dependent task upon the completion of a set of precursor tasks, while and 2) pairing precedences modify the characteristics of a dependent task provided the completion of a set of precursor tasks. Precedences make competitive analysis challenging, as the online and offline schedulers operate on diverging sequences. We make a formal presentation of our framework, and use a GPU-based implementation to analyze ten well-known schedulers on precedence-based application examples taken from the existing literature: 1) a handshake protocol (HP); 2) network packet-switching; 3) query scheduling (QS); and 4) a sporadic-interrupt setting. Our experimental results show that precedences and task parameters can vary drastically the best scheduler. Our framework thus supports application designers in choosing the best scheduler among a given set automatically.' acknowledgement: 'This work was supported by the Austrian Science Foundation (FWF) under the NFN RiSE/SHiNE under Grant S11405 and Grant S11407. This article was presented in the International Conference on Embedded Software 2020 and appears as part of the ESWEEK-TCAD special issue. ' article_processing_charge: No article_type: original author: - first_name: Andreas full_name: Pavlogiannis, Andreas id: 49704004-F248-11E8-B48F-1D18A9856A87 last_name: Pavlogiannis orcid: 0000-0002-8943-0722 - first_name: Nico full_name: Schaumberger, Nico last_name: Schaumberger - first_name: Ulrich full_name: Schmid, Ulrich last_name: Schmid - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X citation: ama: Pavlogiannis A, Schaumberger N, Schmid U, Chatterjee K. Precedence-aware automated competitive analysis of real-time scheduling. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 2020;39(11):3981-3992. doi:10.1109/TCAD.2020.3012803 apa: Pavlogiannis, A., Schaumberger, N., Schmid, U., & Chatterjee, K. (2020). Precedence-aware automated competitive analysis of real-time scheduling. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. IEEE. https://doi.org/10.1109/TCAD.2020.3012803 chicago: Pavlogiannis, Andreas, Nico Schaumberger, Ulrich Schmid, and Krishnendu Chatterjee. “Precedence-Aware Automated Competitive Analysis of Real-Time Scheduling.” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. IEEE, 2020. https://doi.org/10.1109/TCAD.2020.3012803. ieee: A. Pavlogiannis, N. Schaumberger, U. Schmid, and K. Chatterjee, “Precedence-aware automated competitive analysis of real-time scheduling,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 39, no. 11. IEEE, pp. 3981–3992, 2020. ista: Pavlogiannis A, Schaumberger N, Schmid U, Chatterjee K. 2020. Precedence-aware automated competitive analysis of real-time scheduling. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 39(11), 3981–3992. mla: Pavlogiannis, Andreas, et al. “Precedence-Aware Automated Competitive Analysis of Real-Time Scheduling.” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 39, no. 11, IEEE, 2020, pp. 3981–92, doi:10.1109/TCAD.2020.3012803. short: A. Pavlogiannis, N. Schaumberger, U. Schmid, K. Chatterjee, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 39 (2020) 3981–3992. date_created: 2020-11-22T23:01:24Z date_published: 2020-11-01T00:00:00Z date_updated: 2023-08-22T13:27:05Z day: '01' department: - _id: KrCh doi: 10.1109/TCAD.2020.3012803 external_id: isi: - '000587712700069' intvolume: ' 39' isi: 1 issue: '11' language: - iso: eng month: '11' oa_version: None page: 3981-3992 project: - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 25863FF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11407 name: Game Theory publication: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems publication_identifier: eissn: - '19374151' issn: - '02780070' publication_status: published publisher: IEEE quality_controlled: '1' scopus_import: '1' status: public title: Precedence-aware automated competitive analysis of real-time scheduling type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 39 year: '2020' ... --- _id: '8790' abstract: - lang: eng text: Reachability analysis aims at identifying states reachable by a system within a given time horizon. This task is known to be computationally expensive for linear hybrid systems. Reachability analysis works by iteratively applying continuous and discrete post operators to compute states reachable according to continuous and discrete dynamics, respectively. In this article, we enhance both of these operators and make sure that most of the involved computations are performed in low-dimensional state space. In particular, we improve the continuous-post operator by performing computations in high-dimensional state space only for time intervals relevant for the subsequent application of the discrete-post operator. Furthermore, the new discrete-post operator performs low-dimensional computations by leveraging the structure of the guard and assignment of a considered transition. We illustrate the potential of our approach on a number of challenging benchmarks. acknowledgement: 'This research was supported in part by the Austrian Science Fund (FWF) under grants S11402-N23 (RiSE/SHiNE) and Z211-N23 (Wittgenstein Award), the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 754411, and the Air Force Office of Scientific Research under award number FA2386-17-1-4065. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the United States Air Force. ' article_processing_charge: No article_type: original author: - first_name: Sergiy full_name: Bogomolov, Sergiy id: 369D9A44-F248-11E8-B48F-1D18A9856A87 last_name: Bogomolov orcid: 0000-0002-0686-0365 - first_name: Marcelo full_name: Forets, Marcelo last_name: Forets - first_name: Goran full_name: Frehse, Goran last_name: Frehse - first_name: Kostiantyn full_name: Potomkin, Kostiantyn last_name: Potomkin - first_name: Christian full_name: Schilling, Christian id: 3A2F4DCE-F248-11E8-B48F-1D18A9856A87 last_name: Schilling orcid: 0000-0003-3658-1065 citation: ama: Bogomolov S, Forets M, Frehse G, Potomkin K, Schilling C. Reachability analysis of linear hybrid systems via block decomposition. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 2020;39(11):4018-4029. doi:10.1109/TCAD.2020.3012859 apa: Bogomolov, S., Forets, M., Frehse, G., Potomkin, K., & Schilling, C. (2020). Reachability analysis of linear hybrid systems via block decomposition. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. IEEE. https://doi.org/10.1109/TCAD.2020.3012859 chicago: Bogomolov, Sergiy, Marcelo Forets, Goran Frehse, Kostiantyn Potomkin, and Christian Schilling. “Reachability Analysis of Linear Hybrid Systems via Block Decomposition.” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. IEEE, 2020. https://doi.org/10.1109/TCAD.2020.3012859. ieee: S. Bogomolov, M. Forets, G. Frehse, K. Potomkin, and C. Schilling, “Reachability analysis of linear hybrid systems via block decomposition,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 39, no. 11. IEEE, pp. 4018–4029, 2020. ista: Bogomolov S, Forets M, Frehse G, Potomkin K, Schilling C. 2020. Reachability analysis of linear hybrid systems via block decomposition. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 39(11), 4018–4029. mla: Bogomolov, Sergiy, et al. “Reachability Analysis of Linear Hybrid Systems via Block Decomposition.” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 39, no. 11, IEEE, 2020, pp. 4018–29, doi:10.1109/TCAD.2020.3012859. short: S. Bogomolov, M. Forets, G. Frehse, K. Potomkin, C. Schilling, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 39 (2020) 4018–4029. date_created: 2020-11-22T23:01:25Z date_published: 2020-11-01T00:00:00Z date_updated: 2023-08-22T13:27:33Z day: '01' department: - _id: ToHe doi: 10.1109/TCAD.2020.3012859 ec_funded: 1 external_id: arxiv: - '1905.02458' isi: - '000587712700072' intvolume: ' 39' isi: 1 issue: '11' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1905.02458 month: '11' oa: 1 oa_version: Preprint page: 4018-4029 project: - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 25F42A32-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z211 name: The Wittgenstein Prize - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships publication: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems publication_identifier: eissn: - '19374151' issn: - '02780070' publication_status: published publisher: IEEE quality_controlled: '1' related_material: record: - id: '8287' relation: earlier_version status: public scopus_import: '1' status: public title: Reachability analysis of linear hybrid systems via block decomposition type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 39 year: '2020' ...