616 search results - page 55 / 124 » Bounded Model Checking with Description Logic Reasoning |
CORR
2008
Springer
13 years 9 months ago
2008
Springer
Probabilistic timed automata are an extension of timed automata with discrete probability distributions. We consider model-checking algorithms for the subclasses of probabilistic t...
FUIN
2000
13 years 8 months ago
2000
We give algorithms to construct the least L-model for a given positive modal logic program P, where L can be one of the modal logics KD, T, KDB, B, KD4, S4, KD5, KD45, and S5. If L...
WIFT
1998
IEEE
14 years 1 months ago
1998
IEEE
The Unified Modeling Language (UML) is likely to become an important industry standard language for modelling object-oriented systems. However, its use as a precise analysis tool ...
ATAL
2006
Springer
14 years 17 days ago
2006
Springer
This paper is concerned with the problem of obtaining predictable interactions between groups of agents in open environments when individual agents do not expose their bdi logic. ...
ICCAD
2010
IEEE
13 years 6 months ago
2010
IEEE
State-based model checking methods comprise computing and storing reachable states, while stateless model checking methods directly reason about reachable paths using decision proc...