5863 search results - page 66 / 1173 » On Model-Checking of P Systems |
CONCUR
2009
Springer
14 years 4 months ago
2009
Springer
We propose how to present and compute a counterexample in probabilistic LTL model checking for discrete-time Markov chains. In qualitative probabilistic model checking, we present ...
SPIN
1999
Springer
14 years 2 months ago
1999
Springer
Operator procedures are documents telling operators what to do in various situations. They are widely used in process industries including the nuclear power industry. The correctne...
CADE
2004
Springer
14 years 10 months ago
2004
Springer
LRR [3] is a rewriting system developed at the Computer Science Department of University of Houston. LRR has two subsystems: Smaran (for tabled rewriting), and TGR (for untabled re...
FORMATS
2007
Springer
14 years 4 months ago
2007
Springer
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...
MEMOCODE
2003
IEEE
14 years 3 months ago
2003
IEEE
— Modern SAT solvers have proved highly successful in finding counterexamples to temporal properties of systems, using a method known as ”bounded model checking”. It is natu...