5863 search results - page 48 / 1173 » On Model-Checking of P Systems |
FM
2001
Springer
14 years 2 months ago
2001
Springer
Classical logic cannot be used to effectively reason about systems with uncertainty (lack of essential information) or inconsistency (contradictory information often occurring when...
FOSSACS
2005
Springer
14 years 3 months ago
2005
Springer
Nominal calculi have been shown very effective to formally model a variety of computational phenomena. The models of nominal calculi have often infinite states, thus making model ...
FM
2009
Springer
14 years 4 months ago
2009
Springer
In Bounded Model Checking both the system model and the checked property are translated into a Boolean formula to be analyzed by a SAT-solver. We introduce a new encoding technique...
EWSA
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. Software architectures are engineering artifacts which provide high-level descriptions of complex systems. Certain recent architecture description languages (Adls) allow ...
GG
2004
Springer
14 years 3 months ago
2004
Springer
Model checking is increasingly popular for hardware and, more recently, software verification. In this paper we describe two different approaches to extend the benefits of model ...