201 search results - page 3 / 41 » On the Decidability of Model-Checking for P Systems |
77
Voted
FOSSACS
2003
Springer
15 years 2 months ago
2003
Springer
Lossy channel systems (LCS’s) are systems of finite state automata that communicate via unreliable unbounded fifo channels. We propose a new probabilistic model for these syste...
FOSSACS
2010
Springer
15 years 4 months ago
2010
Springer
FORMATS
2007
Springer
15 years 3 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...
LMCS
2006
14 years 9 months ago
2006
We consider the model checking problem for probabilistic pushdown automata (pPDA) and properties expressible in various probabilistic logics. We start with properties that can be ...
ICALP
2000
Springer
15 years 1 months ago
2000
Springer
We show the decidability of model checking PA-processes against several first-order logics based upon the reachability predicate. The main tool for this result is the recognizabil...