Sciweavers

577 search results - page 17 / 116
» Model Checking Based on Simultaneous Reachability Analysis
Sort
View
TSE
2011
134views more  TSE 2011»
13 years 2 months ago
Verifying the Evolution of Probability Distributions Governed by a DTMC
— We propose a new probabilistic temporal logic iLTL which captures properties of systems whose state can be represented by probability mass functions (pmf’s). Using iLTL, we c...
YoungMin Kwon, Gul A. Agha
CAV
2012
Springer
231views Hardware» more  CAV 2012»
11 years 10 months ago
Incremental, Inductive CTL Model Checking
A SAT-based incremental, inductive algorithm for model checking CTL properties is proposed. As in classic CTL model checking, the parse graph of the property shapes the analysis. H...
Zyad Hassan, Aaron R. Bradley, Fabio Somenzi
QEST
2006
IEEE
14 years 1 months ago
Strategy Improvement for Concurrent Reachability Games
A concurrent reachability game is a two-player game played on a graph: at each state, the players simultaneously and independently select moves; the two moves determine jointly a ...
Krishnendu Chatterjee, Luca de Alfaro, Thomas A. H...
HYBRID
2004
Springer
14 years 1 months ago
Understanding the Bacterial Stringent Response Using Reachability Analysis of Hybrid Systems
Abstract. In this paper we model coupled genetic and metabolic networks as hybrid systems. The vector fields are multi - affine, i.e., have only product - type nonlinearities to a...
Calin Belta, Peter Finin, Luc C. G. J. M. Habets, ...
CAV
2004
Springer
152views Hardware» more  CAV 2004»
14 years 1 months ago
Abstract Regular Model Checking
Regular Tree Model Checking Ahmed Bouajjani, Peter Habermehl 1 LIAFA, University Paris 7, Case 7014, 2, place Jussieu, F-75251 Paris Cedex 05, France Adam Rogalewicz, Tom´aˇs Voj...
Ahmed Bouajjani, Peter Habermehl, Tomás Voj...