221 Hits in 3.2 sec

Discrete-Time Verification and Control for Probabilistic Rectangular Hybrid Automata

Jeremy Sproston
2011 2011 Eighth International Conference on Quantitative Evaluation of SysTems  
Our main contribution is to give algorithms for the verification and control problems for probabilistic rectangular automata in a semantics in which discrete control transitions can occur only at integer  ...  Hybrid automata provide a modeling formalism for systems characterized by a combination of discrete and continuous components.  ...  The author would like to thank Arnaud Sangnier for useful comments on a draft of this paper.  ... 
doi:10.1109/qest.2011.18 dblp:conf/qest/Sproston11 fatcat:hnimaovwyvb37b25qceqjvotva

Verification and Control of Probabilistic Rectangular Hybrid Automata [chapter]

Jeremy Sproston
2015 Lecture Notes in Computer Science  
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.  ...  Next we consider both verification and control of probabilistic rectangular automata with the discrete-time semantics.  ... 
doi:10.1007/978-3-319-22975-1_1 fatcat:gaosj6zatramnpqt246wibpt5i

Symbolic Reachability Analysis of Probabilistic Linear Hybrid Automata

2005 IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences  
For the purpose of system verification, we formally define probabilistic linear hybrid automaton and its symbolic reachability analysis method.  ...  We can model embedded systems as hybrid systems. Moreover, they are distributed and real-time systems. Therefore, it is important to specify and verify randomness and soft real-time properties.  ...  Reachability for probabilistic rectangular automata has been mentioned in [5] , but the verification methods for general class of probabilistic hybrid automata have not been developed.  ... 
doi:10.1093/ietfec/e88-a.11.2972 fatcat:tok2g4ebincititpg4jwfqvumu

$$2^5$$ Years of Model Checking [chapter]

Edmund M. Clarke, Qinsi Wang
2015 Lecture Notes in Computer Science  
Model Checking is an automatic verification technique for large state transition systems. It was originally developed for reasoning about finite-state concurrent systems.  ...  It is beginning to be used for analyzing cyberphysical, biological, and financial systems as well. The major challenge for the technique is a phenomenon called the State Explosion Problem.  ...  hybrid systems, especially for probabilistic hybrid automata.  ... 
doi:10.1007/978-3-662-46823-4_2 fatcat:g4tbd7fribgothf2bfgajkywfe

Analysis of Non-Linear Probabilistic Hybrid Systems

Joseph Assouramou, Josée Desharnais
2011 Electronic Proceedings in Theoretical Computer Science  
This paper shows how to compute, for probabilistic hybrid systems, the clock approximation and linear phase-portrait approximation that have been proposed for non probabilistic processes by Henzinger et  ...  The conditions that we need for probabilistic processes are the same as those for the classic case.  ...  Especially, the largest class for which verification is decidable is the class of rectangular hybrid automata [7, 6] .  ... 
doi:10.4204/eptcs.57.8 fatcat:asosifz37rdqnfsfouldzzujcm

Safety Verification for Probabilistic Hybrid Systems [chapter]

Lijun Zhang, Zhikun She, Stefan Ratschan, Holger Hermanns, Ernst Moritz Hahn
2010 Lecture Notes in Computer Science  
The interplay of random phenomena and continuous real-time control deserves increased attention for instance in wireless sensing and control applications.  ...  Safety verification for such systems thus needs to consider probabilistic variations of systems with hybrid dynamics.  ...  Holger Hermanns and Ernst Moritz Hahn were supported by the NWO-DFG bilateral project ROCKS, by the DFG as part of the Transregional Collaborative Research Centre SFB/TR 14 AVACS, and by the European Community's  ... 
doi:10.1007/978-3-642-14295-6_21 fatcat:p6uph75la5hgblgfmw7eacft2u

Hybrid Automata for Formal Modeling and Verification of Cyber-Physical Systems [article]

Shankara Narayanan Krishna, Ashutosh Trivedi
2015 arXiv   pre-print
In this article we present a review of hybrid automata as modeling and verification framework for cyber-physical systems, and survey some of the key results related to practical verification questions  ...  Considering the richness of the dynamics in a hybrid automaton, it is perhaps not surprising that the fundamental verification questions, like reachability and schedulability, for the general model are  ...  automata and initialized rectangular hybrid automata.  ... 
arXiv:1503.04928v1 fatcat:6kyfz6azy5dptnuxcppzfhh2mi

Measurability and safety verification for stochastic hybrid systems

Martin Fränzle, Ernst Moritz Hahn, Holger Hermanns, Nicolás Wolovick, Lijun Zhang
2011 Proceedings of the 14th international conference on Hybrid systems: computation and control - HSCC '11  
Dealing with the interplay of randomness and continuous time is important for the formal verification of many real systems.  ...  In this paper, we consider stochastic hybrid systems where the continuous-time behaviour is given by differential equations, as for usual hybrid systems, but the targets of discrete jumps are chosen by  ...  We would like to thank Pedro Sánchez Terraf from the National University of Córdoba and Stefan Ratschan from the Academy of Sciences of the Czech Republic for fruitful discussions on the measurability  ... 
doi:10.1145/1967701.1967710 dblp:conf/hybrid/FranzleHHWZ11 fatcat:v6lty6xka5au7fa2gwrfdr4n6m

C2E2: A Verification Tool for Stateflow Models [chapter]

Parasara Sridhar Duggirala, Sayan Mitra, Mahesh Viswanathan, Matthew Potok
2015 Lecture Notes in Computer Science  
We present Compare-Execute-Check-Engine (C2E2)-a verification tool for continuous and hybrid Stateflow models.  ...  It checks bounded time invariant properties of models with nonlinear dynamics, and discrete transitions with guards and resets.  ...  Conclusions and Future Work C2E2 presented in this paper is a tool for verifying a broad class of hybrid and dynamical systems models.  ... 
doi:10.1007/978-3-662-46681-0_5 fatcat:nprplxi27ndrrah4cmz5djxy7e

Modeling, Verification, and Testing Using Timed and Hybrid Automata [chapter]

Stavros Tripakis, Thao Dang
2009 Model-Based Design for Embedded Systems  
MODELING, VERIFICATION AND TESTING USING TIMED AND HYBRID AUTOM is to be implemented, for instance, as an embedded controller.  ...  Verification of hybrid automata Timed automata are a very special class of hybrid automata.  ... 
doi:10.1201/9781420067859-c13 fatcat:ipdmb52ph5bjxir65x527fqj2u

Symbolic Computation of Maximal Probabilisti Reachability [chapter]

Marta Kwiatkowska, Gethin Norman, Jeremy Sproston
2001 Lecture Notes in Computer Science  
The problem involves the computation of the maximal probability of reaching a given set of states, and underlies decision procedures for the automatic verification of probabilistic systems.  ...  We illustrate our approach with examples of probabilistic timed automata, for which previous approaches to this reachability problem were either based on unnecessarily fine subdivisions of the state space  ...  Two verification methods for probabilistic timed automata are presented in [15] .  ... 
doi:10.1007/3-540-44685-0_12 fatcat:pwmnsjbtnzc4venxbjbceqoxae

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  ...  stochastic similarity relations, (control) barrier certificates, compositional techniques, and a selection of results on continuous-time stochastic systems; we finally survey recently developed software  ...  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

Timed Automata [chapter]

Rajeev Alur
1999 Lecture Notes in Computer Science  
This paper provides a survey of the theory of timed automata, and their role in specification and verification of real-time systems.  ...  Model checking is emerging as a practical tool for automated debugging of complex reactive systems such as embedded controllers and network protocols (see [23] for a survey).  ...  My research on timed automata has been in collaboration with Costas Courcoubetis, David Dill, Tom Henzinger, Bob Kurshan, and many others.  ... 
doi:10.1007/3-540-48683-6_3 fatcat:krziony2hzgj5ploa37xa5jfcy

Game-based Abstraction and Controller Synthesis for Probabilistic Hybrid Systems

Ernst Moritz Hahn, Gethin Norman, David Parker, Bjorn Wachter, Lijun Zhang
2011 2011 Eighth International Conference on Quantitative Evaluation of SysTems  
We consider a class of hybrid systems that involve random phenomena, in addition to discrete and continuous behaviour. Examples of such systems include wireless sensing and control applications.  ...  For the latter, we demonstrate how existing solvers for hybrid systems can be leveraged to perform the computation.  ...  We model these systems using probabilistic hybrid automata (PHAs), which extend standard hybrid automata with discrete probabilistic choices.  ... 
doi:10.1109/qest.2011.17 dblp:conf/qest/HahnNPWZ11 fatcat:fdwygmpuqndovkxcu7jdlw4euq

Quantitative automata model checking of autonomous stochastic hybrid systems

Alessandro Abate, Joost-Pieter Katoen, Alexandru Mereacre
2011 Proceedings of the 14th international conference on Hybrid systems: computation and control - HSCC '11  
This paper considers the quantitative verification of discretetime stochastic hybrid systems (DTSHS) against linear time objectives.  ...  The computation of reachability probabilities can be performed in a backwardrecursive manner, and quantitatively approximated by procedures over discrete-time Markov chains.  ...  [20] propose a technique for verifying probabilistic safety problems by adopting abstraction techniques from the verification of hybrid systems.  ... 
doi:10.1145/1967701.1967715 dblp:conf/hybrid/AbateKM11 fatcat:c2tgbcbjtvfjpmdy2i3jzqph6e
« Previous Showing results 1 — 15 out of 221 results