A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit <a rel="external noopener" href="https://iris.unito.it/retrieve/handle/2318/1568125/152905/pra_4aperto.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
<i title="Springer International Publishing">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a>
Hybrid systems are characterised by a combination of discrete and continuous components. In many application areas for hybrid systems, such as vehicular control and systems biology, stochastic behaviour is intrinsic. This has led to the development of stochastic extensions of formalisms, such as hybrid automata, for the modelling of hybrid systems, together with their associated verification and controller synthesis algorithms, in order to allow reasoning about quantitative properties such as<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-22975-1_1">doi:10.1007/978-3-319-22975-1_1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/gaosj6zatramnpqt246wibpt5i">fatcat:gaosj6zatramnpqt246wibpt5i</a> </span>
more »... he vehicle's speed will reach 50kph within 10 seconds with probability at least 0.99". We consider probabilistic rectangular hybrid automata, which generalise the well-known class of rectangular hybrid automata with the possibility of representing random behavior of the discrete components of the system, permitting the modeling of the likelihood of faults, choices in randomised algorithms and message losses. We highlight the differences between verification and control problems for probabilistic rectangular hybrid automata and the corresponding problems for non-probabilistic rectangular hybrid automata. Furthermore, we will describe the effect of assumptions on the underlying model of time (discrete or continuous) on the considered verification and control problems. Finally, we will also consider how probabilistic rectangular hybrid automata can be used as abstract models for more general classes of stochastic hybrid systems.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180720002149/https://iris.unito.it/retrieve/handle/2318/1568125/152905/pra_4aperto.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/9a/8d/9a8dd6311ea3d9bbe8ffc14a8e29469be253f49f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-22975-1_1"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>