HOME

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
summerschool2018:lecture10 [2018/04/25 17:29]
nour.assy
summerschool2018:lecture10 [2018/05/01 12:45]
nour.assy
Line 1: Line 1:
-==== Holger HermannsSaarland ​University, ​Germany ​====+==== Jaco van de Pol & Arnd Hartmanns, University ​of Twentethe Netherlands ​====
  
 ---- ----
 +
 \\ \\
  
-<​WRAP ​JUSTIFY+<​WRAP ​justify> 
-| [[https://depend.cs.uni-saarland.de/~hermanns/|{{ :​summerschool2018:​holger-hermanns.jpg?​direct&​200 }}]] |+ 
 +| [[http://wwwhome.cs.utwente.nl/~vdpol/|{{ :​summerschool2018:​jaco-vdpol.jpg?​direct&​200 }}]] | [[http://​arnd.hartmanns.name/|{{ :​summerschool2018:​arnd-hartmanns.jpg?​direct&​200 }}]] |
  
 \\ \\ \\ \\
Line 13: Line 15:
 \\ \\ \\ \\
  
-**Title**: Quantitative Modelling ​-- From Fiji to Earth Orbit+**Title**: ​A Modest Tutorial in Quantitative Modelling ​and Analysis
  
 \\ \\ \\ \\
  
-**Abstract**: ​Performance,​ dependabilityand security are notoriously difficult ​to get right at system design timeYetdesign decisions are known to be the prime source of difficult-to-fix embedded problemsFor low budget or experimental designs it might suffice ​to perform some back-of ​the-envelope calculations, a few component measurements,​ a bit of spreadsheetingmaybe rough Matlab model. But for mission critical or high volume applications deeper ​quantitative ​evaluations are needed early in the design ​process. This presentation will discuss a modest approach to deriving design-time guarantees for complex data driven behaviours, leveraging foundational insights ​to practical problemsThe approach revolves around the stochastic ​timed automata ​formalism, and is supported by a portfolio of quantitative ​model checking techniques ​and toolsThis modest approach is exemplified in the context of different power-aware embedded applications,​ ranging from stability studies of electric power grids in Europe compared ​to the South Pacific, to the interoperability of components in light electric vehicles, to the control of nano-satellites in low-earth orbit.+**Abstract**: ​Over the last three decadessignificant progress has been made in the area of formal methods ​to allow the construction and analysis of mathematically precise models of critical systemsClassicallymodel checking has been used to verify functional properties related to correctness and safety. However, since e.g. correct system implementations may still be unusably slow, performance requirements have to be considered as wellThis need to evaluate both qualitative as well as quantitative properties fostered ​the development of integrative approaches that combine probabilities,​ real-time aspects and costs with formal verification techniques. 
 +\\ 
 +Todaybehavioural modelling and analysis is supported by wide range of tools and formalisms. In this lecturewe give practical introduction to quantitative ​verification using the Modest modelling language. Modest is rooted in process ​algebra, but borrows syntax and concepts from widely-used programming languages ​to be more accessible to programmers and engineersWe present its mathematical foundations,​ ranging from Markov chains to priced probabilistic ​timed automata. The analysis of Modest models ​is supported by the Modest Toolset with exhaustive and statistical ​model checking techniques. ​Our lecture concludes with a hands-on experience ​to model and optimise ​the experiment scheduling on nanosatellites and attacks on the Bitcoin cryptocurrency. 
  
 \\ \\ \\ \\
  
-**Short bio**: **[[https://depend.cs.uni-saarland.de/~hermanns/|Holger Hermanns]]** is a full professor in computer science ​at Saarland ​University ​in Germanyheading ​the Dependable ​Systems ​and Software groupFrom April 2004 to March 2006Holger Hermanns has served as Dean of Studies ​of the Faculty ​of Mathematics and Computer Science, and has served as its Dean from April 2010 to March 2012. Afterwards ​he did his best to serve as Dean of Hearts. Holger Hermanns ​is elected member ​of Academia EuropaeaIn 2016 he got awarded an ERC Advanced Grant.+**Short bio**: **[[http://wwwhome.cs.utwente.nl/~vdpol/|Jaco van de Pol]]** studied Computer Science ​at Utrecht ​University, ​and received his PhD from the Faculty of Philosophy in Utrecht (1996) on Termination of Higher-order Rewrite ​Systems. ​After positions at the LMU MunichTU/​Eindhoven and CWI Amsterdam, he became full professor in Formal Methods and Tools at the University ​of Twente, being Head of the CS Department from 2014-2017. He was tool chair of TACAS 2015, and he is in the editorial board of the journals ​ SCP and STTTHe was invited professor at the lab LIPN of Université Paris 13, both in 2016 and in 2017. His research interests include symbolic methods and parallel algorithms for verification and testing. Recent achievements are in scalable multi-core NDFS and multi-core SCC algorithms, and in multi-core Decision Diagram data-structures. These high-performance and/or symbolic algorithms are implemented in the LTSmin toolset, which won several prizes. The algorithms are available through a high-level API to multiple modelling formalisms, like Timed Automata (Uppaal), Promela (SPIN), Petri-Nets (PNML), Process Algebras (mCRL2), DiVinE, and B CSP (ProB). He applied verification technology in projects on railway interlockings,​ energy aware scheduling, biological signalling networks, and socio-technical security models.
  
-</​WRAP>​+\\
  
 +**[[http://​arnd.hartmanns.name/​|Arnd Hartmanns]]** is an assistant professor in the Formal Methods and Tools group at the University of Twente. His primary research interests are modelling tools and formalisms for stochastic timed and hybrid systems (in particular Modest) and their applications in various fields. Arnd was previously a postdoc in the Formal Methods and Tools group at the University of Twente and the Dependable Systems and Software group at Saarland University, where he also completed his Ph.D. in computer science with a thesis On the Analysis of Stochastic Timed Systems in 2015.
 +</​WRAP>​
 \\ \\
 \\ \\
Line 30: Line 37:
 ---- ----
 |  [[https://​www.tue.nl/​|{{ :​bsr-ws2016:​tue.png?​75 }}]]  |  [[http://​tudelft.nl/​en/​|{{ :​bsr-ws2016:​tud.png?​100 }}]]  |  [[https://​www.utwente.nl/​en/​|{{ :​bsr-ws2016:​ut.png?​110 }}]]  |  [[https://​www.3tu.nl/​nirict/​en/​|{{ :​3tu-bsr:​nirict.jpg?​110 }}]]  | |  [[https://​www.tue.nl/​|{{ :​bsr-ws2016:​tue.png?​75 }}]]  |  [[http://​tudelft.nl/​en/​|{{ :​bsr-ws2016:​tud.png?​100 }}]]  |  [[https://​www.utwente.nl/​en/​|{{ :​bsr-ws2016:​ut.png?​110 }}]]  |  [[https://​www.3tu.nl/​nirict/​en/​|{{ :​3tu-bsr:​nirict.jpg?​110 }}]]  |
 +
 +