Sciweavers

395 search results - page 2 / 79
» Polynomial Approximations for Model Checking
Sort
View
CONCUR
2004
Springer
13 years 10 months ago
Model Checking Timed Automata with One or Two Clocks
In this paper, we study model checking of timed automata (TAs), and more precisely we aim at finding efficient model checking for subclasses of TAs. For this, we consider model ch...
François Laroussinie, Nicolas Markey, Ph. S...
VMCAI
2004
Springer
13 years 10 months ago
Approximate Probabilistic Model Checking
In this paper we deal with the problem of applying model checking to real programs. We verify a program without constructing the whole transition system using a technique based on...
Thomas Hérault, Richard Lassaigne, Fr&eacut...
MP
2010
172views more  MP 2010»
13 years 3 months ago
Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
In this paper, we consider approximation algorithms for optimizing a generic multi-variate homogeneous polynomial function, subject to homogeneous quadratic constraints. Such opti...
Simai He, Zhening Li, Shuzhong Zhang
FORMATS
2007
Springer
13 years 11 months ago
Quantitative Model Checking Revisited: Neither Decidable Nor Approximable
Abstract. Quantitative model checking computes the probability values of a given property quantifying over all possible schedulers. It turns out that maximum and minimum probabilit...
Sergio Giro, Pedro R. D'Argenio
ICFEM
2009
Springer
13 years 12 months ago
Approximate Model Checking of PCTL Involving Unbounded Path Properties
Abstract. We study the problem of applying statistical methods for approximate model checking of probabilistic systems against properties encoded as PCTL formulas. Such approximate...
Samik Basu, Arka P. Ghosh, Ru He