5863 search results - page 35 / 1173 » On Model-Checking of P Systems |
110
click to vote
ATVA
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. Symbolic model checking provides partially effective verification procedures that can handle systems with an infinite state space. So-called “acceleration techniques...
168
Voted
SPIN
2000
Springer
15 years 6 months ago
2000
Springer
Systematic state-space exploration is a powerful technique for veri cation of concurrent software systems. Most work in this area deals with manually-constructed models of those sy...
133
click to vote
STACS
2010
Springer
15 years 10 months ago
2010
Springer
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...
130
click to vote
TACAS
2001
Springer
15 years 7 months ago
2001
Springer
In formal verification, we verify that a system is correct with respect to a specification. Even when the system is proven to be correct, there is still a question of how complet...
140
click to vote
IJCAI
2003
15 years 4 months ago
2003
This paper addresses the formal verification of diagnosis systems. We tackle the problem of diagnosability: given a partially observable dynamic system, and a diagnosis system obs...