395 search results - page 30 / 79 » Polynomial Approximations for Model Checking |
122
click to vote
ATAL
1997
Springer
15 years 2 months ago
1997
Springer
Abstract. Just as cooperation in multi-agent systems is a central issue for solving complex tasks, so too is the ability for an intelligent agent to reason about combined knowledge...
ENTCS
2007
14 years 10 months ago
2007
Much of the literature on symmetry reductions for model checking assumes a simple model of computation where the local state of each component in a concurrent system can be repres...
FUIN
2000
14 years 9 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...
CONCUR
2006
Springer
15 years 1 months ago
2006
Springer
We describe an incomplete but sound and efficient livelock freedom test for infinite state asynchronous reactive systems. The method s a system into a set of simple control flow cy...
MP
2002
14 years 9 months ago
2002
UOBYQA is a new algorithm for general unconstrained optimization calculations, that takes account of the curvature of the objective function, F say, by forming quadratic models by ...