5863 search results - page 7 / 1173 » On Model-Checking of P Systems |
CAV
2006
Springer
14 years 1 months ago
2006
Springer
We study languages of nested trees--structures obtained by augmenting trees with sets of nested jump-edges. These graphs can naturally model branching behaviors of pushdown program...
ICRA
2000
IEEE
14 years 2 months ago
2000
IEEE
TOIS
1998
13 years 9 months ago
1998
LMCS
2006
13 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 ...
CHARME
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. Model checking is a formal technique for automatically verifying that a finite-state model satisfies a temporal property. In model checking, generally Binary Decision D...