5216 search results - page 279 / 1044 » Planning as Model Checking |
139
click to vote
OTM
2010
Springer
15 years 3 months ago
2010
Springer
In this paper, we present generic algorithms to ensure the consistency of mutual-exclusion and binding constraints in a business process context. We repeatedly identified the need...
148
click to vote
ATAL
2008
Springer
15 years 6 months ago
2008
Springer
Business contracts tend to be complex. In current practice, contracts are often designed by hand and adopted by their participants after, at best, a manual analysis. This paper mo...
144
click to vote
BMCBI
2005
15 years 4 months ago
2005
Background: Ambiguity is a problem in biosequence analysis that arises in various analysis tasks solved via dynamic programming, and in particular, in the modeling of families of ...
135
click to vote
CONCUR
2004
Springer
15 years 8 months ago
2004
Springer
We introduce a generic family of behavioral relations for which the problem of comparing an arbitrary transition system to some finite-state specification can be reduced to a model...
128
click to vote
CAV
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. We describe an interpolant-based approach to test generation and model checking for sequential programs. The method generates Floyd/Hoare style annotations of the program...