4,669 Hits in 6.7 sec

U-Check: Model Checking and Parameter Synthesis Under Uncertainty [chapter]

Luca Bortolussi, Dimitrios Milios, Guido Sanguinetti
2015 Lecture Notes in Computer Science  
Novel applications of formal modelling such as systems biology have highlighted the need to extend formal analysis techniques to domains with pervasive parametric uncertainty.  ...  In this paper, we introduce a toolbox for parameter synthesis and model checking in uncertain systems based on Gaussian Process emulation and optimisation.  ...  In this paper we describe U-check, a novel tool which implements a number of Gaussian Process based methods for formal of uncertain stochastic processes.  ... 
doi:10.1007/978-3-319-22264-6_6 fatcat:3guu6xnqszantbqm4ux7pkul4a

Parameter Synthesis for Probabilistic Timed Automata Using Stochastic Game Abstractions [chapter]

Aleksandra Jovanović, Marta Kwiatkowska
2014 Lecture Notes in Computer Science  
In the parametric setting, our method is able to determine all the possible maximum (or minimum) reachability probabilities that arise for different values of timing parameters, and yields optimal valuations  ...  We propose a method to synthesise optimal values of timing parameters for probabilistic timed automata, in the sense that the probability of reaching some set of states is either maximised or minimised  ...  Synthesis with Game-based Abstraction Refinement In [14] , stochastic two-player games are used as abstractions for MDPs.  ... 
doi:10.1007/978-3-319-11439-2_14 fatcat:jgffahmybjaxpognc2j2fzqgiu

Parameter synthesis for probabilistic timed automata using stochastic game abstractions

Aleksandra Jovanović, Marta Kwiatkowska
2018 Theoretical Computer Science  
In the parametric setting, our method is able to determine all the possible maximum (or minimum) reachability probabilities that arise for different values of timing parameters, and yields optimal valuations  ...  We propose a method to synthesise optimal values of timing parameters for probabilistic timed automata, in the sense that the probability of reaching some set of states is either maximised or minimised  ...  Synthesis with Game-based Abstraction Refinement In [14] , stochastic two-player games are used as abstractions for MDPs.  ... 
doi:10.1016/j.tcs.2017.05.005 fatcat:a6wbugvjxnaupijcndpsipr644

Verification of Networks of Smart Energy Systems over the Cloud [chapter]

Alessandro Abate
2017 Lecture Notes in Computer Science  
, error-based refinements, and the use of interface functions for the synthesis of abstract controllers and their concrete implementation.  ...  Formal techniques can provide compelling solutions not only when safety-critical goals are the target, but also to tackle verification and synthesis problems on populations of such devices: we argue that  ...  The author would like to thank former and current students involved in this specific area of work, particularly Sofie Haesaert, Sadegh E.S.  ... 
doi:10.1007/978-3-319-54292-8_1 fatcat:h6uu3iojxvh45k6sorpxgse7tq

Automated Verification and Synthesis of Stochastic Hybrid Systems: A Survey [article]

Abolfazl Lavaei, Sadegh Soudjani, Alessandro Abate, Majid Zamani
2022 arXiv   pre-print
Automated verification and policy synthesis for stochastic hybrid systems can be inherently challenging: this is due to the heterogeneity of their dynamics (presence of continuous and discrete components  ...  In this survey, we overview the most recent results in the literature and discuss different approaches, including (in)finite abstractions, verification and synthesis for temporal logic specifications,  ...  We hope that this survey article provides an introduction to the foundations of SHS, towards an easier understanding of many challenges and existing solutions related to formal verification and control  ... 
arXiv:2101.07491v2 fatcat:dpir554ebfclhpj5m7e7fi2hv4

Advances in Quantitative Verification for Ubiquitous Computing [chapter]

Marta Kwiatkowska
2013 Lecture Notes in Computer Science  
strategy synthesis, stochastic game models (SMGs) for collaborative protocols, parametric models • See: 18 Quantitative verification in action • Bluetooth device  ...  /parametric models and analyse their performance wrt realistic parameter values − Synthesise (optimal) parameter values to guarantee that the property is satisfied Motivating example 30 − reliability  ... 
doi:10.1007/978-3-642-39718-9_3 fatcat:emkb7jqcurg37nhkdyeel6icma

AMYTISS: Parallelized Automated Controller Synthesis for Large-Scale Stochastic Systems [chapter]

Abolfazl Lavaei, Mahmoud Khaled, Sadegh Soudjani, Majid Zamani
2020 Lecture Notes in Computer Science  
This tool is employed to (i) build finite Markov decision processes (MDPs) as finite abstractions of given original systems, and (ii) synthesize controllers for the constructed finite MDPs satisfying bounded-time  ...  Unlike all existing tools for stochastic systems, AMYTISS can utilize high-performance computing (HPC) platforms and cloudcomputing services to mitigate the effects of the state-explosion problem, which  ...  The authors would like to thank Thomas Gabler for his help in implementing traditional serial algorithms for the purpose of analysis and then comparing with the parallel ones.  ... 
doi:10.1007/978-3-030-53291-8_24 fatcat:jsbksoaoczgrnmufodo3uplvtq

Syntax-Guided Optimal Synthesis for Chemical Reaction Networks [chapter]

Luca Cardelli, Milan Češka, Martin Fränzle, Marta Kwiatkowska, Luca Laurenti, Nicola Paoletti, Max Whitby
2017 Lecture Notes in Computer Science  
We study the problem of optimal syntax-guided synthesis of stochastic Chemical Reaction Networks (CRNs) that plays a fundamental role in design automation of molecular devices and in the construction of  ...  We design and implement a novel algorithm for the optimal synthesis of CRNs that employs almost complete refutation procedure for SMT over reals and ODEs, and exploits a meta-sketching abstraction controlling  ...  We demonstrate that our approach is able to synthesise a CRN that behaves as a stochastic process, namely, a super Poisson process having variance greater than its expectation.  ... 
doi:10.1007/978-3-319-63390-9_20 fatcat:xkxi2dyy2vc5lper6q6hf732ge

Formal Methods for the Synthesis of Biomolecular Circuits (Dagstuhl Seminar 18082)

Yaakov Benenson, Neil Dalchau, Heinz Koeppl, Oded Maler, Michael Wagner
2018 Dagstuhl Reports  
This report documents the program and the outcomes of Dagstuhl Seminar 18082 "Formal Methods for the Synthesis of Biomolecular Circuits".  ...  Hence, although circuits in synthetic biology are still by far less understood and characterized than electronic circuits, the opportunity for the formal synthesis of circuit designs with respect to a  ...  -Formal Methods for the Synthesis of Biomolecular Circuits  ... 
doi:10.4230/dagrep.8.2.88 dblp:journals/dagstuhl-reports/BenensonDKM18 fatcat:gh3poeii3ndmffhuiax3bf2pfu

Industrial Cyber-Physical Systems – iCyPhy [chapter]

Amit Fisher, Clas A. Jacobson, Edward A. Lee, Richard M. Murray, Alberto Sangiovanni-Vincentelli, Eelco Scholte
2014 Complex Systems Design & Management  
ICyPhy is a pre-competitive industry-academic partnership focused on architectures, abstractions, technologies, methodologies, and supporting tools for the design, modeling, and analysis of large-scale  ...  The focus is on cyber-physical systems, which combine a cyber side (computing and networking) with a physical side (e.g., mechanical, electrical, and chemical processes).  ...  Formal methods and tools do not take humans out of the design process.  ... 
doi:10.1007/978-3-319-02812-5_2 dblp:conf/csdm/FisherJLMSS13 fatcat:pnb2o3qkbfcwjoqmbw6syvky5i

Page 3808 of Mathematical Reviews Vol. , Issue 81I [page]

1981 Mathematical Reviews  
Mazurov, Synthesis of nonstationary processes of mathematical program- ming containing pattern recognition (pp. 61—68); J.  ...  Kall, Solving complete fixed re. course problems by successive discretization—extended abstract (pp. 135-138); J. G. Kallberg and W. T.  ... 

Analysis of Autonomous Mobile Collectives in Complex Physical Environments (Dagstuhl Seminar 19432)

Mario Gleirscher, Anne E. Haxthausen, Martin Leucker, Sven Linker, Michael Wagner
2020 Dagstuhl Reports  
application of several rigorous engineering methods and formal analysis techniques.  ...  Our aim was to understand the practical challenges and the capabilities and limitations of recent formal modelling and analysis techniques when tackling these challenges, and to initiate a special research  ...  The formalism used could be (variants of) parametric timed data automata, a formalism recently proposed with Ichiro Hasuo and Masaki Waga [2] .  ... 
doi:10.4230/dagrep.9.10.95 dblp:journals/dagstuhl-reports/GleirscherHLL19 fatcat:ut2tli44vrbplhpfjb42w7jpja

Probabilistic Model Checking and Autonomy [article]

Marta Kwiatkowska, Gethin Norman, David Parker
2021 arXiv   pre-print
This method has recently been extended to multi-agent systems that exhibit competitive or cooperative behaviour modelled via stochastic games and synthesis of equilibria strategies.  ...  Design and control of autonomous systems that operate in uncertain or adversarial environments can be facilitated by formal modelling and analysis.  ...  ACKNOWLEDGMENTS This project has received funding from the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation programme (grant agreement No. 834115) and the  ... 
arXiv:2111.10630v1 fatcat:ckaniytpargkpcug52qvwgh3iy

Precise Parameter Synthesis for Stochastic Biochemical Systems [chapter]

Milan Češka, Frits Dannenberg, Marta Kwiatkowska, Nicola Paoletti
2014 Lecture Notes in Computer Science  
We consider the problem of synthesising rate parameters for stochastic biochemical networks so that a given CSL time-bounded property is guaranteed to hold, or, in the case of quantitative properties,  ...  We evaluate the usefulness of the methods by synthesising rates for two biologically motivated case studies, including the reliability analysis of a DNA walker.  ...  This work has been partially supported by the ERC Advanced Grant VERIWARE, Microsoft Studentship (Frits Dannenberg) and the Ministry of Education, Youth, and Sport project No.  ... 
doi:10.1007/978-3-319-12982-2_7 fatcat:xjdrq4ibszb6vdhkhinrn4iutu

CosyVerif: An Open Source Extensible Verification Environment

Etienne Andre, Yousra Lembachar, Laure Petrucci, Francis Hulin-Hubard, Alban Linard, Lom Hillah, Fabrice Kordon
2013 2013 18th International Conference on Engineering of Complex Computer Systems  
Several tools have already been integrated for the formal verification of (extensions of) Petri nets and timed automata.  ...  It has been designed in order to 1) support different formalisms with the ability to easily create new ones, 2) provide a graphical user interface for every formalism, 3) include verification tools called  ...  The toolset contains in particular an unfolding construction tool [10] and a reachability and deadlock checking tool [11] . d) IMITATOR [12] : This tool performs parameter synthesis for parametric  ... 
doi:10.1109/iceccs.2013.15 dblp:conf/iceccs/AndreLPHLHK13 fatcat:v6y3yrp7yngqheiboo4elf5mzi
« Previous Showing results 1 — 15 out of 4,669 results