201 search results - page 6 / 41 » On the Decidability of Model-Checking for P Systems |
BIRTHDAY
2004
Springer
15 years 1 months ago
2004
Springer
Abstract. We consider programs which are data independent with respect to two type variables X and Y , and can in addition use arrays indexed by X and storing values from Y . We ar...
CHARME
2003
Springer
15 years 2 months ago
2003
Springer
We consider the problem of bounded model checking of systems expressed in a decidable fragment of first-order logic. While model checking is not guaranteed to terminate for an ar...
FOSSACS
2008
Springer
14 years 11 months ago
2008
Springer
We study complexity issues related to the model-checking problem for LTL with registers (a.k.a. freeze LTL) over one-counter automata. We consider several classes of one-counter au...
KBSE
2010
IEEE
14 years 8 months ago
2010
IEEE
We study the problem of statistical model checking of probabilistic systems for PCTL unbounded until property P1p(ϕ1 U ϕ2) (where 1 ∈ {<, ≤, >, ≥}) using the computa...
CAV
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. We apply model checking of knowledge properties to the design of distributed controllers that enforce global constraints on concurrent systems. We calculate when processe...