<?xml version="1.0" encoding="UTF-8"?>
<TEI xml:space="preserve" xmlns="http://www.tei-c.org/ns/1.0" 
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" 
xsi:schemaLocation="http://www.tei-c.org/ns/1.0 https://raw.githubusercontent.com/kermitt2/grobid/master/grobid-home/schemas/xsd/Grobid.xsd"
 xmlns:xlink="http://www.w3.org/1999/xlink">
	<teiHeader xml:lang="en">
		<fileDesc>
			<titleStmt>
				<title level="a" type="main">Combining Quantitative and Qualitative Analysis for Safe and Resilient Intelligent Hybrid Systems</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author>
							<persName><forename type="first">Pauline</forename><surname>Blohm</surname></persName>
							<affiliation key="aff0">
								<orgName type="institution">University of Münster</orgName>
								<address>
									<settlement>Münster</settlement>
									<country key="DE">Germany</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Paula</forename><surname>Herber</surname></persName>
							<affiliation key="aff0">
								<orgName type="institution">University of Münster</orgName>
								<address>
									<settlement>Münster</settlement>
									<country key="DE">Germany</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Anne</forename><surname>Remke</surname></persName>
							<affiliation key="aff0">
								<orgName type="institution">University of Münster</orgName>
								<address>
									<settlement>Münster</settlement>
									<country key="DE">Germany</country>
								</address>
							</affiliation>
						</author>
						<title level="a" type="main">Combining Quantitative and Qualitative Analysis for Safe and Resilient Intelligent Hybrid Systems</title>
					</analytic>
					<monogr>
						<idno type="ISSN">1613-0073</idno>
					</monogr>
					<idno type="MD5">278E58DB16027C9FA89BFC973B4BAD43</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2025-04-23T20:06+0000">
					<desc>GROBID - A machine learning software for extracting information from scholarly documents</desc>
					<ref target="https://github.com/kermitt2/grobid"/>
				</application>
			</appInfo>
		</encodingDesc>
		<profileDesc>
			<textClass>
				<keywords>
					<term>Hybrid Systems</term>
					<term>Formal Verification</term>
					<term>Stochastic Failures</term>
					<term>Learning</term>
					<term>Simulink</term>
					<term>Hybrid Automata</term>
				</keywords>
			</textClass>
			<abstract>
<div xmlns="http://www.tei-c.org/ns/1.0"><p>Model-driven development frameworks such as MATLAB Simulink are widely used in industrial design processes to conquer the increasing complexity of embedded control systems such as self-driving cars or critical infrastructures. As these systems are often safety-critical, formal methods to ensure safety, performance and resilience are highly desirable, in particular also in the presence of dynamic and uncertain environments. Formal verification has the potential to a) ensure that embedded systems function correctly for all possible system parameters and input scenarios, and b) provide statistical guarantees in the presence of uncertainty and probabilistic behavior. However, the application of existing formal verification and stochastic analysis techniques to embedded control systems is a major challenge, in particular if they are hybrid, i.e. combine discrete and continuous behavior, and include learning components to adapt to dynamic environments. To tackle this challenge, we aim at providing a quantitative analysis for intelligent Simulink models via a transformation to Stochastic Hybrid Automata (SHA) that gives us access to established analysis techniques for stochastic systems, such as reachability analysis or (statistical) model checking. To incorporate dynamic adaptations via learning, we investigate techniques to integrate domain-specific abstractions of the learning components into the SHA model. To ensure resilience of learning hybrid systems, we aim at combining the strengths of qualitative and quantitative analyses.</p></div>
			</abstract>
		</profileDesc>
	</teiHeader>
	<text xml:lang="en">
		<body>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1.">Problem</head><p>The demands on the functionality and flexibility of embedded control systems are steadily increasing. At the same time, they are more and more used in critical infrastructures, for example, controlling the supply of energy or water, and in safety-critical systems such as self-driving cars and other autonomous vehicles. With that, we increasingly use embedded control systems not only for our convenience or for profit, but also trust our lives and personal well-being to these systems. At the same time, learning components are nowadays often used to cope with dynamic environments. This makes it crucial to ensure the safety, performance, and resilience of these systems under all circumstances. Qualitative analysis techniques such as deductive verification can provide safety guarantees for hybrid systems, however, they typically only consider the worst case scenario. In contrast, quantitative analysis techniques like analytical reachability analysis or statistical model checking (SMC) can provide statistical guarantees for safety or performance properties even in the presence of uncertainty, however, they might not provide guarantees for all possible scenarios.</p><p>The integration of learning components and uncertainties further complicates formal verification of hybrid systems. Qualitative analysis techniques often rely on abstractions, such as contracts, to handle learning components or uncertainties. While these abstractions are necessary to provide safety guarantees, they usually abstract from all quantitative information, yielding imprecise and overly pessimistic results. In contrast, quantitative techniques exploit statistical information like the distribution of events or failure and repair times. However, they suffer from state-space explosion, in particular if learning components have to be verified to ensure safety under all circumstances or with high accuracy. Furthermore, quantitative analyses techniques typically do not provide us with PhD Symposium of the 19th International Conference on Integrated Formal Methods (iFM) at the University of Manchester, UK, 12 November 2024. Envelope pauline.blohm@uni-muenster.de (P. Blohm); paula.herber@uni-muenster.de (P. Herber); anne.remke@uni-muenster.de (A. Remke) techniques for modular reasoning.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.">Proposed Solution</head><p>To ensure the safety and resilience of hybrid systems even in the presence of learning and in uncertain environments, we aim at combining the strengths of qualitative analysis with the strength of quantitative analysis. We focus on hybrid systems modelled in Simulink as it is widely adopted for embedded control systems that combine discrete and continuous behavior. Previous work of one of the co-authors has presented an approach for a qualitative analysis of Simulink models via a transformation to Differential Dynamic Logic (dL) <ref type="bibr" target="#b0">[1,</ref><ref type="bibr" target="#b1">2]</ref> which is implemented in the tool Simulink2dL. The resulting dL Model can then be analyzed using Deductive Verification to obtain formal guarantees that a system satisfies a given Safety Property. Our aim is to complement this with efficient and scalable quantitative analysis <ref type="bibr" target="#b2">[3,</ref><ref type="bibr" target="#b3">4,</ref><ref type="bibr" target="#b4">5]</ref> and also to combine these techniques to provide an approach for comprehensive safety, resilience and performance analysis for intelligent hybrid systems. The concept of the thesis is shown in Fig. <ref type="figure" target="#fig_0">1</ref> and consists of four main parts:</p><p>1. We plan to provide an automated transformation Simulink2SHA from Simulink to Stochastic Hybrid Automata. With this transformation, we define a formal semantics for Simulink, and it gives us access to established Quantitative Analysis techniques, such as reachability analysis or (statistical) model checking.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.">We aim at investigating how to introduce stochastic components via Probability Distributions into</head><p>the Simulink model to model uncertainties like component failure or sensor noise. With that, we can also investigate resilience and performance of a model under verification. 3. We aim at investigating how Qualitative and Quantitative Properties for the dL and SHA models can be derived from safety, resilience and performance requirements. 4. We plan to provide a technique to combine Qualitative Analysis results (e.g. from deductive verification) with a Quantitative Analysis for (potentially learning) Simulink models. In particular, we aim at investigating two different approaches: a) the integration of shielded SMC-based learning, which has been proposed by one of the co-authors in previous work <ref type="bibr" target="#b5">[6]</ref>, and b) the use of contracts or other domain-specific abstractions to safely integrate learning components, as has been proposed by two of the co-authors in <ref type="bibr" target="#b1">[2,</ref><ref type="bibr" target="#b6">7]</ref>.</p><p>As a first step, we have presented an approach for a manual transformation from Simulink to SHA, which has been accepted at iFM 2024 <ref type="bibr" target="#b7">[8]</ref>. Open research problems we plan to address in this thesis are how to model uncertainties such that the resulting models are still analyzable, how to capture qualitative and quantitative properties of intelligent systems appropriately and also how to combine qualitative with quantitative analysis techniques for SHA with learning components. One key challenge is that, while modular reasoning would be highly desirable to handle complex systems, there exists no established concept to include quantitative and statistical information in contracts.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.">Related Work</head><p>There have been quite some efforts to enable the formal verification of systems that are modeled in Simulink <ref type="bibr" target="#b8">[9,</ref><ref type="bibr" target="#b9">10,</ref><ref type="bibr" target="#b10">11,</ref><ref type="bibr" target="#b11">12,</ref><ref type="bibr" target="#b12">13,</ref><ref type="bibr" target="#b13">14,</ref><ref type="bibr" target="#b14">15]</ref>. Yet, all of these approaches, including the Simulink Design Verifier <ref type="bibr" target="#b15">[16]</ref>, are limited to discrete subsets of Simulink. Formal verification methods that support hybrid systems modeled in Simulink are, e.g., proposed in <ref type="bibr" target="#b0">[1,</ref><ref type="bibr" target="#b16">17,</ref><ref type="bibr" target="#b17">18,</ref><ref type="bibr" target="#b18">19,</ref><ref type="bibr" target="#b19">20,</ref><ref type="bibr" target="#b20">21]</ref>. However, they either focus on techniques for a special class of systems and do not provide general transformation rules for a broader set of blocks or focus on the qualitative analysis of safety properties and they neither take stochastic components nor learning into consideration.</p><p>There also has been a number of works on statistical model checking (SMC) for Simulink, for example <ref type="bibr" target="#b21">[22,</ref><ref type="bibr" target="#b22">23,</ref><ref type="bibr" target="#b23">24]</ref>. Still they do not provide a stochastic model with formal semantics and thus cannot make use of more advanced quantitative analysis techniques. In <ref type="bibr" target="#b24">[25]</ref>, the authors propose a transformation from Simulink into stochastic timed automata (STA) and perform SMC with UPPAAL SMC on the resulting network of STA. However, they do not consider stochastic blocks and transform a given Simulink model into a deterministic STA model where all probabilities are one.</p><p>There also exists a broad variety of approaches to formally ensure safety of learning components using shielding or runtime monitoring <ref type="bibr" target="#b25">[26,</ref><ref type="bibr" target="#b26">27,</ref><ref type="bibr" target="#b27">28]</ref>. These approaches do not directly support Simulink though, and they do not consider formal analysis techniques that take stochastic failures and learning into account.</p><p>Uppaal Stratego <ref type="bibr" target="#b28">[29]</ref> uses priced timed automata to model stochastic behavior, and provides tooling for statistical model checking <ref type="bibr" target="#b29">[30]</ref>, timed games <ref type="bibr" target="#b30">[31]</ref> and learning-based strategy synthesis <ref type="bibr" target="#b31">[32]</ref>. While Uppaal Stratego comes with a graphical interface and is designed for usability, the underlying formalisms are less expressive than stochastic hybrid automata, in particular w.r.t. continuous system behavior governed by differential equations and controlled by continuous and stochastic variables.</p><p>Finally, there has been some work on combining rigorous formal and statistical methods. In <ref type="bibr" target="#b32">[33]</ref>, the authors incorporate statistical hypothesis testing to compute promising configurations of program verifiers automatically. However, they do not support hybrid systems, and they do not consider both safety and performance properties. In <ref type="bibr" target="#b33">[34]</ref>, the authors present a formal framework for an integrated qualitative and quantitative model-based safety analysis. However, they do not support hybrid systems and do not consider deductive verification methods.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.">Progress and Current State</head><p>The first step towards safe and resilient hybrid system is enabling a quantitative analysis for (stochastic) Simulink models. As Simulink does not offer elaborate quantitative analysis, such as reachability analysis or statistical model checking, a transformation into a formal model is desired. To tackle this problem, we are currently working on a modular approach to transform Simulink models into SHA. In <ref type="bibr" target="#b7">[8]</ref>, we present an approach that enables us to transform a subset of Simulink models to SHA and analyze the SHA using the tool RealySt <ref type="bibr" target="#b2">[3]</ref> to obtain reachability probabilities for critical safety properties. This is an important first step towards ensuring safety and resilience of hybrid systems in the presence of uncertainties. However, it still has some limitations, e.g. we only provide transformation rules for a subset of Simulink blocks and the parallel composition has to be performed manually. To tackle these limitations, we are currently working on a tool to automatically transform a given Simulink model to an SHA using the transformation rules provided in <ref type="bibr" target="#b7">[8]</ref>. Additionally, we plan to define transformation rules for a larger subset of Simulink blocks and provide better support for the integration of stochasticity into Simulink models, e.g. by providing parameterized subsystems that model specific stochastic behaviour.</p><p>As next steps, we plan to address the research challenges defined above, namely the integration of stochastic and learning components in Simulink, the derivation of qualitative and quantitative properties that are important for safety, resilience and performance of intelligent Simulink models in uncertain and dynamic environments, and the development of combined quantitative and quantitative analysis techniques that enable us to formally analyze these properties.</p></div><figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_0"><head>Figure 1 :</head><label>1</label><figDesc>Figure 1: Combining the Strengths of Quantitative and Qualitative Analysis.</figDesc><graphic coords="2,94.57,65.61,406.14,176.43" type="bitmap" /></figure>
		</body>
		<back>
			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<analytic>
		<title level="a" type="main">Deductive verification of hybrid control systems modeled in Simulink with KeYmaera X</title>
		<author>
			<persName><forename type="first">T</forename><surname>Liebrenz</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Herber</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Glesner</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-3-030-02450-5_6</idno>
	</analytic>
	<monogr>
		<title level="m">Int. Conference on Formal Engineering Methods</title>
				<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2018">2018</date>
			<biblScope unit="volume">11232</biblScope>
			<biblScope unit="page" from="89" to="105" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b1">
	<analytic>
		<title level="a" type="main">Formal Verification of Intelligent Hybrid Systems that are modeled with Simulink and the Reinforcement Learning Toolbox</title>
		<author>
			<persName><forename type="first">J</forename><surname>Adelt</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Liebrenz</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Herber</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-3-030-90870-6_19</idno>
	</analytic>
	<monogr>
		<title level="m">Formal Methods</title>
				<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2021">2021</date>
			<biblScope unit="volume">13047</biblScope>
			<biblScope unit="page" from="349" to="366" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b2">
	<analytic>
		<title level="a" type="main">Realyst: A C++ tool for optimizing reachability probabilities in stochastic hybrid systems</title>
		<author>
			<persName><forename type="first">J</forename><surname>Delicaris</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Stübbe</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Schupp</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Remke</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-3-031-48885-6_11</idno>
	</analytic>
	<monogr>
		<title level="m">16th EAI Int. Conference on Performance Evaluation Methodologies and Tools</title>
				<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2023">2023</date>
			<biblScope unit="volume">539</biblScope>
			<biblScope unit="page" from="170" to="182" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b3">
	<analytic>
		<title level="a" type="main">Optimizing reachability probabilities for a restricted class of stochastic hybrid automata via flowpipe construction</title>
		<author>
			<persName><forename type="first">C</forename><forename type="middle">Da</forename><surname>Silva</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Schupp</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Remke</surname></persName>
		</author>
		<idno type="DOI">10.1145/3607197</idno>
	</analytic>
	<monogr>
		<title level="j">ACM Trans. Model. Comput. Simul</title>
		<imprint>
			<biblScope unit="volume">33</biblScope>
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b4">
	<analytic>
		<title level="a" type="main">The best of both worlds: Analytically-guided simulation of hpngs for optimal reachability</title>
		<author>
			<persName><forename type="first">M</forename><surname>Niehage</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Remke</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-3-031-48885-6_5</idno>
	</analytic>
	<monogr>
		<title level="m">Performance Evaluation Methodologies and Tools</title>
				<imprint>
			<date type="published" when="2024">2024</date>
			<biblScope unit="page" from="61" to="81" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b5">
	<analytic>
		<title level="a" type="main">Learning optimal decisions for stochastic hybrid systems</title>
		<author>
			<persName><forename type="first">M</forename><surname>Niehage</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Hartmanns</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Remke</surname></persName>
		</author>
		<idno type="DOI">10.1145/3487212.3487339</idno>
	</analytic>
	<monogr>
		<title level="m">ACM-IEEE Int. Conference on Formal Methods and Models for System Design</title>
				<imprint>
			<publisher>ACM</publisher>
			<date type="published" when="2021">2021</date>
			<biblScope unit="page" from="44" to="55" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b6">
	<analytic>
		<title level="a" type="main">Safe Integration of Learning in SystemC using Timed Contracts and Model Checking</title>
		<author>
			<persName><forename type="first">P</forename><surname>Blohm</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Adelt</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Herber</surname></persName>
		</author>
		<idno type="DOI">10.1145/3610579.3611078</idno>
	</analytic>
	<monogr>
		<title level="m">21st ACM-IEEE International Symposium on Formal Methods and Models for System Design, ACM / IEEE</title>
				<editor>
			<persName><forename type="first">R</forename><surname>Hanxleden</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">S</forename><forename type="middle">A</forename><surname>Edwards</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">J</forename><surname>Brandt</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">Q</forename><surname>Zhu</surname></persName>
		</editor>
		<imprint>
			<date type="published" when="2023">2023</date>
			<biblScope unit="page" from="12" to="22" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b7">
	<analytic>
		<title level="a" type="main">Towards Quantitative Analysis of Simulink Models using Stochastic Hybrid Automata</title>
		<author>
			<persName><forename type="first">P</forename><surname>Blohm</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Herber</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Remke</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">International Conference on Integrated Formal Methods</title>
				<imprint>
			<date type="published" when="2024">2024</date>
		</imprint>
	</monogr>
	<note>accepted for publication</note>
</biblStruct>

<biblStruct xml:id="b8">
	<analytic>
		<title level="a" type="main">Formal verification of control systems&apos; properties with theorem proving</title>
		<author>
			<persName><forename type="first">D</forename><surname>Araiza-Illan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Eder</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Richards</surname></persName>
		</author>
		<idno type="DOI">10.1109/CONTROL.2014.6915147</idno>
	</analytic>
	<monogr>
		<title level="m">UKACC Int. Conference on Control</title>
				<imprint>
			<publisher>IEEE</publisher>
			<date type="published" when="2014">2014</date>
			<biblScope unit="page" from="244" to="249" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b9">
	<analytic>
		<title level="a" type="main">Z3: An efficient SMT solver</title>
		<author>
			<persName><forename type="first">L</forename><forename type="middle">De</forename><surname>Moura</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Bjørner</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-3-540-78800-3_24</idno>
	</analytic>
	<monogr>
		<title level="m">International conference on Tools and Algorithms for the Construction and Analysis of Systems</title>
				<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2008">2008</date>
			<biblScope unit="page" from="337" to="340" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b10">
	<analytic>
		<title level="a" type="main">Why3 -where programs meet provers</title>
		<author>
			<persName><forename type="first">J.-C</forename><surname>Filliâtre</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Paskevich</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-3-642-37036-6_8</idno>
	</analytic>
	<monogr>
		<title level="m">European Symposium on Programming</title>
				<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2013">2013</date>
			<biblScope unit="page" from="125" to="128" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b11">
	<analytic>
		<title level="a" type="main">Bit-precise formal verification of discrete-time MAT-LAB/Simulink models using SMT solving</title>
		<author>
			<persName><forename type="first">P</forename><surname>Herber</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Reicherdt</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Bittner</surname></persName>
		</author>
		<idno type="DOI">10.1109/EMSOFT.2013.6658586</idno>
	</analytic>
	<monogr>
		<title level="m">Int. Conference on Embedded Software</title>
				<imprint>
			<publisher>IEEE</publisher>
			<date type="published" when="2013">2013</date>
			<biblScope unit="page" from="1" to="10" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b12">
	<analytic>
		<title level="a" type="main">The UCLID decision procedure</title>
		<author>
			<persName><forename type="first">S</forename><forename type="middle">K</forename><surname>Lahiri</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><forename type="middle">A</forename><surname>Seshia</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-3-540-27813-9_40</idno>
	</analytic>
	<monogr>
		<title level="m">Int. Conference on Computer Aided Verification</title>
				<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2004">2004</date>
			<biblScope unit="page" from="475" to="478" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b13">
	<analytic>
		<title level="a" type="main">Formal verification of discrete-time MATLAB/Simulink models using Boogie</title>
		<author>
			<persName><forename type="first">R</forename><surname>Reicherdt</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Glesner</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-3-319-10431-7_14</idno>
	</analytic>
	<monogr>
		<title level="m">Int. Conference on Software Engineering and Formal Methods</title>
				<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2014">2014</date>
			<biblScope unit="volume">8702</biblScope>
			<biblScope unit="page" from="190" to="204" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b14">
	<analytic>
		<title level="a" type="main">Boogie: A modular reusable verifier for object-oriented programs</title>
		<author>
			<persName><forename type="first">M</forename><surname>Barnett</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B.-Y</forename><forename type="middle">E</forename><surname>Chang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Deline</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Jacobs</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><forename type="middle">R M</forename><surname>Leino</surname></persName>
		</author>
		<idno type="DOI">10.1007/11804192_17</idno>
	</analytic>
	<monogr>
		<title level="m">Int. Symposium on Formal Methods for Components and Objects</title>
				<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2005">2005</date>
			<biblScope unit="page" from="364" to="387" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b15">
	<monogr>
		<ptr target="https://de.mathworks.com/products/simulink-design-verifier.html" />
		<title level="m">Simulink Design Verifier</title>
				<imprint>
			<date type="published" when="2024">2024</date>
		</imprint>
	</monogr>
	<note>The MathWorks</note>
</biblStruct>

<biblStruct xml:id="b16">
	<analytic>
		<title level="a" type="main">Computational techniques for hybrid system verification</title>
		<author>
			<persName><forename type="first">A</forename><surname>Chutinan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><forename type="middle">H</forename><surname>Krogh</surname></persName>
		</author>
		<idno type="DOI">10.1109/TAC.2002.806655</idno>
	</analytic>
	<monogr>
		<title level="j">IEEE Trans. on Automatic Control</title>
		<imprint>
			<biblScope unit="volume">48</biblScope>
			<biblScope unit="issue">1</biblScope>
			<biblScope unit="page" from="64" to="75" />
			<date type="published" when="2003">2003</date>
			<publisher>IEEE</publisher>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b17">
	<analytic>
		<title level="a" type="main">SL2SX translator: from Simulink to SpaceEx models</title>
		<author>
			<persName><forename type="first">S</forename><surname>Minopoli</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Frehse</surname></persName>
		</author>
		<idno type="DOI">10.1145/2883817.2883826</idno>
	</analytic>
	<monogr>
		<title level="m">Int. Conf. on Hybrid Systems: Computation and Control</title>
				<imprint>
			<publisher>ACM</publisher>
			<date type="published" when="2016">2016</date>
			<biblScope unit="page" from="93" to="98" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b18">
	<analytic>
		<title level="a" type="main">Formal Verification of Simulink/Stateflow Diagrams</title>
		<author>
			<persName><forename type="first">L</forename><surname>Zou</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Zhan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Wang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Fränzle</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-3-319-47016-0</idno>
	</analytic>
	<monogr>
		<title level="m">Int. Symposium on Automated Technology for Verification and Analysis (ATVA)</title>
				<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2015">2015</date>
			<biblScope unit="volume">9364</biblScope>
			<biblScope unit="page" from="464" to="481" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b19">
	<analytic>
		<title level="a" type="main">MARS: A toolchain for modelling, analysis and verification of hybrid systems</title>
		<author>
			<persName><forename type="first">M</forename><surname>Chen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">X</forename><surname>Han</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Tang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Wang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Yang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Zhan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Zhao</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Zou</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-3-319-48628-4_3</idno>
	</analytic>
	<monogr>
		<title level="m">Provably Correct Systems</title>
				<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2017">2017</date>
			<biblScope unit="page" from="39" to="58" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b20">
	<analytic>
		<title level="a" type="main">A service-oriented approach for decomposing and verifying hybrid system models</title>
		<author>
			<persName><forename type="first">T</forename><surname>Liebrenz</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Herber</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Glesner</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-3-030-40914-2_7</idno>
	</analytic>
	<monogr>
		<title level="m">Int. Conference on Formal Aspects of Component Software</title>
				<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2019">2019</date>
			<biblScope unit="volume">12018</biblScope>
			<biblScope unit="page" from="127" to="146" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b21">
	<analytic>
		<title level="a" type="main">Bayesian statistical model checking with application to stateflow/simulink verification</title>
		<author>
			<persName><forename type="first">P</forename><surname>Zuliani</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Platzer</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><forename type="middle">M</forename><surname>Clarke</surname></persName>
		</author>
		<idno type="DOI">10.1007/s10703-013-0195-3</idno>
	</analytic>
	<monogr>
		<title level="j">Formal Methods in System Design</title>
		<imprint>
			<biblScope unit="volume">43</biblScope>
			<biblScope unit="page" from="338" to="367" />
			<date type="published" when="2013">2013</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b22">
	<analytic>
		<title level="a" type="main">Statistical model checking of simulink models with Plasma Lab</title>
		<author>
			<persName><forename type="first">A</forename><surname>Legay</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L.-M</forename><surname>Traonouez</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-3-319-29510-7_15</idno>
	</analytic>
	<monogr>
		<title level="m">Formal Techniques for Safety-Critical Systems: 4th International Workshop</title>
				<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2016">2016</date>
			<biblScope unit="page" from="259" to="264" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b23">
	<analytic>
		<title level="a" type="main">PLASMA-lab: A flexible, distributable statistical model checking library</title>
		<author>
			<persName><forename type="first">B</forename><surname>Boyer</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Corre</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Legay</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Sedwards</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-3-642-40196-1_12</idno>
	</analytic>
	<monogr>
		<title level="m">Quantitative Evaluation of Systems: 10th International Conference</title>
				<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2013">2013</date>
			<biblScope unit="page" from="160" to="164" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b24">
	<analytic>
		<title level="a" type="main">Simulink to uppaal statistical model checker: Analyzing automotive industrial systems</title>
		<author>
			<persName><forename type="first">P</forename><surname>Filipovikj</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Mahmud</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Marinescu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Seceleanu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">O</forename><surname>Ljungkrantz</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Lönn</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-3-319-48989-6_46</idno>
	</analytic>
	<monogr>
		<title level="m">International Symposium on Formal Methods</title>
				<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2016">2016</date>
			<biblScope unit="page" from="748" to="756" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b25">
	<analytic>
		<title level="a" type="main">Safe Reinforcement Learning via Shielding</title>
		<author>
			<persName><forename type="first">M</forename><surname>Alshiekh</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Bloem</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Ehlers</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Könighofer</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Niekum</surname></persName>
		</author>
		<author>
			<persName><forename type="first">U</forename><surname>Topcu</surname></persName>
		</author>
		<idno type="DOI">10.5555/3504035.3504361</idno>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the AAAI Conference on Artificial Intelligence</title>
				<meeting>the AAAI Conference on Artificial Intelligence</meeting>
		<imprint>
			<date type="published" when="2018">2018</date>
			<biblScope unit="volume">32</biblScope>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b26">
	<analytic>
		<title level="a" type="main">Shield synthesis for reinforcement learning</title>
		<author>
			<persName><forename type="first">B</forename><surname>Könighofer</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Lorber</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Jansen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Bloem</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-3-030-61362-4_16</idno>
	</analytic>
	<monogr>
		<title level="m">International Symposium on Leveraging Applications of Formal Methods</title>
				<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2020">2020</date>
			<biblScope unit="page" from="290" to="306" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b27">
	<analytic>
		<title level="a" type="main">A Component-Based Simplex Architecture for High-Assurance Cyber-Physical Systems</title>
		<author>
			<persName><forename type="first">D</forename><surname>Phan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Yang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Clark</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Grosu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Schierman</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Smolka</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Stoller</surname></persName>
		</author>
		<idno type="DOI">10.1109/ACSD.2017.23</idno>
	</analytic>
	<monogr>
		<title level="m">2017 17th International Conference on Application of Concurrency to System Design (ACSD), IEEE</title>
				<imprint>
			<date type="published" when="2017">2017</date>
			<biblScope unit="page" from="49" to="58" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b28">
	<analytic>
		<title level="a" type="main">Uppaal stratego</title>
		<author>
			<persName><forename type="first">A</forename><surname>David</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><forename type="middle">G</forename><surname>Jensen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><forename type="middle">G</forename><surname>Larsen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Mikučionis</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">H</forename><surname>Taankvist</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-3-662-46681-0_16</idno>
	</analytic>
	<monogr>
		<title level="m">Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems</title>
				<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2015">2015</date>
			<biblScope unit="page" from="206" to="211" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b29">
	<analytic>
		<title level="a" type="main">Uppaal smc tutorial</title>
		<author>
			<persName><forename type="first">A</forename><surname>David</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><forename type="middle">G</forename><surname>Larsen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Legay</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Mikučionis</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><forename type="middle">B</forename><surname>Poulsen</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">International Journal on Software Tools for Technology Transfer</title>
		<imprint>
			<biblScope unit="volume">17</biblScope>
			<biblScope unit="page" from="397" to="415" />
			<date type="published" when="2015">2015</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b30">
	<analytic>
		<title level="a" type="main">Efficient on-the-fly algorithms for the analysis of timed games</title>
		<author>
			<persName><forename type="first">F</forename><surname>Cassez</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>David</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Fleury</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><forename type="middle">G</forename><surname>Larsen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Lime</surname></persName>
		</author>
		<idno type="DOI">10.1007/11539452_9</idno>
	</analytic>
	<monogr>
		<title level="m">Concurrency Theory</title>
				<editor>
			<persName><forename type="first">M</forename><surname>Abadi</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">L</forename><surname>Alfaro</surname></persName>
		</editor>
		<meeting><address><addrLine>Berlin, Heidelberg</addrLine></address></meeting>
		<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2005">2005</date>
			<biblScope unit="page" from="66" to="80" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b31">
	<analytic>
		<title level="a" type="main">SOS: Safe, optimal and small strategies for hybrid markov decision processes</title>
		<author>
			<persName><forename type="first">P</forename><surname>Ashok</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Křetínskỳ</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><forename type="middle">G</forename><surname>Larsen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Le Coënt</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">H</forename><surname>Taankvist</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Weininger</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-3-030-30281-8_9</idno>
	</analytic>
	<monogr>
		<title level="m">International Conference on Quantitative Evaluation of Systems</title>
				<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2019">2019</date>
			<biblScope unit="page" from="147" to="164" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b32">
	<analytic>
		<title level="a" type="main">GUIDO: Automated Guidance for the Configuration of Deductive Program Verifiers</title>
		<author>
			<persName><forename type="first">A</forename><surname>Knüppel</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Thüm</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Schaefer</surname></persName>
		</author>
		<idno type="DOI">10.1109/FormaliSE52586.2021.00018</idno>
	</analytic>
	<monogr>
		<title level="m">IEEE/ACM Int. Conference on Formal Methods in Software Engineering (FormaliSE)</title>
				<imprint>
			<publisher>IEEE</publisher>
			<date type="published" when="2021">2021</date>
			<biblScope unit="page" from="124" to="129" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b33">
	<analytic>
		<title level="a" type="main">A framework for qualitative and quantitative formal model-based safety analysis</title>
		<author>
			<persName><forename type="first">M</forename><surname>Gudemann</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Ortmeier</surname></persName>
		</author>
		<idno type="DOI">10.1109/HASE.2010.24</idno>
	</analytic>
	<monogr>
		<title level="m">IEEE Int. Symposium on High Assurance Systems Engineering</title>
				<imprint>
			<publisher>IEEE</publisher>
			<date type="published" when="2010">2010</date>
			<biblScope unit="page" from="132" to="141" />
		</imprint>
	</monogr>
</biblStruct>

				</listBibl>
			</div>
		</back>
	</text>
</TEI>
