Filters








1,694 Hits in 2.2 sec

Uppaal Stratego [chapter]

Alexandre David, Peter Gjøl Jensen, Kim Guldstrand Larsen, Marius Mikučionis, Jakob Haahr Taankvist
2015 Lecture Notes in Computer Science  
The tool allows for efficient and flexible "strategy-space" exploration before adaptation in a final implementation by maintaining strategies as first class objects in the model-checking query language  ...  Uppaal Stratego is a novel tool which facilitates generation, optimization, comparison as well as consequence and performance exploration of strategies for stochastic priced timed games in a user-friendly  ...  The learning algorithm uses a simulation based method for learning near-optimal strategies for a given price metric.  ... 
doi:10.1007/978-3-662-46681-0_16 fatcat:iucowhwv6rg4xafcci7jrupigm

Sciduction

Sanjit A. Seshia
2012 Proceedings of the 49th Annual Design Automation Conference on - DAC '12  
In this position paper, we contend that these challenges can be tackled by integrating traditional, deductive methods with inductive inference (learning from examples) using hypotheses about system structure  ...  Chief amongst these are environment modeling, incompleteness in specifications, and the complexity of underlying decision problems.  ...  Acknowledgments This article is a result of ideas synthesized and verified (!) over the last few years in collaboration with several students and colleagues.  ... 
doi:10.1145/2228360.2228425 dblp:conf/dac/Seshia12 fatcat:otziclzmebemdcllerhtwbknsi

Sciduction: Combining Induction, Deduction, and Structure for Verification and Synthesis [article]

Sanjit A. Seshia
2012 arXiv   pre-print
Sciduction constrains inductive and deductive reasoning using structure hypotheses, and actively combines inductive and deductive reasoning: for instance, deductive techniques generate examples for learning  ...  We illustrate this approach with three applications: (i) timing analysis of software; (ii) synthesis of loop-free programs, and (iii) controller synthesis for hybrid systems.  ...  Acknowledgments This article is a result of ideas synthesized and verified (!) over the last few years in collaboration with several students and colleagues.  ... 
arXiv:1201.0979v1 fatcat:ij726hwu3faytg3knqrmp5trjq

CONNECT Challenges: Towards Emergent Connectors for Eternal Networked Systems

Valérie Issarny, Bernhard Steffen, Bengt Jonsson, Gordon Blair, Paul Grace, Marta Kwiatkowska, Radu Calinescu, Paola Inverardi, Massimo Tivoli, Antonia Bertolino, Antonino Sabetta
2009 2009 14th IEEE International Conference on Engineering of Complex Computer Systems  
CONNECT then investigates formal foundations for connectors together with associated automated support for learning, reasoning about and adapting the interaction behavior of networked systems. I.  ...  It does so by adopting a revolutionary approach to the seamless networking of digital systems, that is, synthesizing on the fly the connectors via which networked systems communicate.  ...  ACKNOWLEDGMENT The CONNECT project (www.connect-forever.eu) acknowledges the financial support of the Future and Emerging Technologies (FET) programme within the ICT theme of the Seventh Framework Programme for  ... 
doi:10.1109/iceccs.2009.44 dblp:conf/iceccs/IssarnySJBGKCITBS09 fatcat:narkc5s7oraopbmnwqzd5wq4ie

On Automation and Medical Image Interpretation, With Applications for Laryngeal Imaging [article]

H. J. Moukalled
2013 arXiv   pre-print
In this work, we motivate the use of automation, review some mathematical models of computation.  ...  and quite possibly other areas of biomedical image analysis.  ...  Automata are All Around Us and Also Within Us (Contribution 2) Indeed, automata are all around us and some within us.  ... 
arXiv:1212.6933v3 fatcat:rsbzafx5cfe7rc6st2xjek7c3a

Specification Formalisms for Modern Cyber-Physical Systems (Dagstuhl Seminar 19071)

Jyotirmoy V. Deshmukh, Oded Maler, Dejan Nickovic, Michael Wagner
2019 Dagstuhl Reports  
the world of learning and data-mining.  ...  This report documents the program and the outcomes of Dagstuhl Seminar 19071 "Specification Formalisms for Modern Cyber-Physical Systems."  ...  In reactive synthesis, we can use parity games to synthesize winning strategies. Strategies guaranteeing satisfaction of every ω-regular language can be learned using such techniques.  ... 
doi:10.4230/dagrep.9.2.48 dblp:journals/dagstuhl-reports/DeshmukhMN19 fatcat:qs52xpqxbzh6vajciydqb3ujgi

Formal Synthesis of Cyber-Physical Systems (Dagstuhl Seminar 17201)

Calin A. Belta, Rupak Majumdar, Maijid Zamani, Matthias Rungger, Marc Herbstritt
2017 Dagstuhl Reports  
Formal synthesis is the application of algorithmic techniques based on automata and logic to the design of controllers for hybrid systems in which continuous components interact with discrete ones.  ...  Success has already been demonstrated in robotics applications where robots learn automata modeling the behavior of the environment and, then, using this information to plan and complete their missions  ...  In this case, we first construct a finite-state abstraction of the differential equation and then use the results for finite-state automata.  ... 
doi:10.4230/dagrep.7.5.84 dblp:journals/dagstuhl-reports/BeltaMZR17 fatcat:dztnkkozqng47hyneovjb6c3p4

Non-Zero-Sum-Games and Control (Dagstuhl Seminar 15061)

Krishnendu Chatterjee, Stéphane Lafortune, Nicolas Markey, Wolfgang Thomas, Marc Herbstritt
2015 Dagstuhl Reports  
The area of non-zero-sum games is addressed in a wide range of topics: multi-player games, partial-observation games, quantitative game models, and -as a special focus -connections with control engineering  ...  Quantitative game models These are a prominent class of game models for applications to verification and synthesis.  ...  Statistical model checking in particular offers a very effective technique for strategy optimization. Robustness analysis of timed models makes the verification process even more faithful.  ... 
doi:10.4230/dagrep.5.2.1 dblp:journals/dagstuhl-reports/ChatterjeeLMT15 fatcat:3g2k4ej7n5hczbe33yhxrh3h5a

Synthesizing Finite-State Protocols from Scenarios and Requirements [chapter]

Rajeev Alur, Milo Martin, Mukund Raghothaman, Christos Stergiou, Stavros Tripakis, Abhishek Udupa
2014 Lecture Notes in Computer Science  
In this paper we propose a new way of specifying and synthesizing finite-state protocols using scenarios: we show that it is possible to automatically derive a distributed implementation from a set of  ...  We evaluate the proposed methodology for protocol specification and the effectiveness of the synthesis algorithm using the classical alternating-bit protocol, the VI cache-coherence protocol, and a consensus  ...  The work in [21] generalizes Angluin's learning algorithm to synthesize automata from MSCs but does not allow for the specification of requirements and relies on the programmer to answer classification  ... 
doi:10.1007/978-3-319-13338-6_7 fatcat:du4zoubcavdzvdsu7ia3ajwbgm

Combining Induction, Deduction, and Structure for Verification and Synthesis

Sanjit A. Seshia
2015 Proceedings of the IEEE  
The second is to solve the resulting synthesis problem by integrating traditional, deductive methods with inductive inference (learning from examples) using hypotheses about system structure.  ...  Chief amongst these are environment modeling, incompleteness in specifications, and the hardness of underlying decision problems.  ...  Acknowledgments This article is a result of ideas synthesized and verified (!) over many years in collaboration with several students and colleagues.  ... 
doi:10.1109/jproc.2015.2471838 fatcat:cfj3tcy3njg3debcuxzqjye2ii

Prognosis: Closed-Box Analysis of Network Protocol Implementations [article]

Tiago Ferreira, Harrison Brewton, Loris D'Antoni, Alexandra Silva
2021 arXiv   pre-print
Prognosis can learn models that vary in abstraction level from simple deterministic automata to models containing data operations, such as register updates, and can be used to unlock a variety of analysis  ...  We present Prognosis, a framework offering automated closed-box learning and analysis of models of network protocol implementations.  ...  The authors would like to thank Hongqiang Liu for his help in preparing the final version of the paper.  ... 
arXiv:2201.02577v1 fatcat:ex5z5ngdd5d6xavgadv3rutuxy

On the Power of Statistical Model Checking [chapter]

Kim G. Larsen, Axel Legay
2016 Lecture Notes in Computer Science  
Uppaal SMC and Uppaal Stratego, which supports statstical model checking of stochastic hybrid automata and synthesis learning for stochastic hybrid games, respectively.  ...  Modeling The modeling formalism of Uppaal SMC is based on a stochastic interpretation and extension of the timed automata (TA) formalism [2] used in the classical model checking version of Uppaal [5  ... 
doi:10.1007/978-3-319-47169-3_62 fatcat:n5qwlsmzkvaqnfmkjdbfgps66a

Towards Verified Artificial Intelligence [article]

Sanjit A. Seshia, Dorsa Sadigh, S. Shankar Sastry
2020 arXiv   pre-print
We describe five challenges for achieving Verified AI, and five corresponding principles for addressing these challenges.  ...  We believe a three-pronged approach is required: first, define model templates/features based on expert knowledge; then, use offline learning to complete the model for design time use, and finally, learn  ...  There is thus a need for techniques that can analyze ML models in the context of the systems within which they are used, i.e., for semantic adversarial analysis [25] .  ... 
arXiv:1606.08514v4 fatcat:ozoldsdnzjghddhwz5xju6zqvu

Batteries in Space [article]

Erik Ramsgaard Wognsen
2016 Ph.d.-serien for Det Teknisk-Naturvidenskabelige Fakultet, Aalborg Universitet  
model checked.  ...  Formal methods provide many techniques to analyze, check, prove, and synthesize systems. But in addition to correctness we are also interested in energy and how it is used.  ...  In addition to analyzing the performance of an existing system model, SMC can be combined with reinforcement learning to synthesize control strategies that are optimized for a given criterion.  ... 
doi:10.5278/vbn.phd.engsci.00072 fatcat:jpclsc7jazhinmnn3wfrjissx4

Incremental Adaptive Attack Synthesis [article]

Seemanta Saha, William Eiers, Ismet Burak Kadron, Lucas Bang, Tevfik Bultan
2019 arXiv   pre-print
We use symbolic execution to extract path constraints, automata-based model counting to estimate probabilities of execution paths, and meta-heuristics to maximize information gain based on entropy in order  ...  to minimize the number of synthesized attack steps.  ...  Then, we discuss the use of automata-based model counting for computing the objective function.  ... 
arXiv:1905.05322v1 fatcat:ptjsehwawbbdpmuis2oluiat64
« Previous Showing results 1 — 15 out of 1,694 results