1116 search results - page 155 / 224 » Applying Predicate Abstraction to Abstract State Machines |
129
click to vote
ABIALS
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. In order to establish autonomous behavior for technical systems, the well known trade-off between reactive control and deliberative planning has to be considered. Within ...
AIPS
2011
14 years 2 months ago
2011
We consider the problem of finding generalized plans for situations where the number of objects may be unknown and unbounded during planning. The input is a domain specification...
IWRIDL
2006
ACM
15 years 5 months ago
2006
ACM
We present the state of the art of a computational platform for the analysis of classical Sanskrit. The platform comprises modules for phonology, morphology, segmentation and shal...
ASM
2004
ASM
15 years 4 months ago
2004
ASM
Consider a multiple-agent transition system such that, for some basic types T1, . . . , Tn, the state of any agent can be represented as an element of the Cartesian product T1 ×·...
EUROSYS
2010
ACM
15 years 8 months ago
2010
ACM
Modern Byzantine fault-tolerant state machine replication (BFT) protocols involve about 20.000 lines of challenging C++ code encompassing synchronization, networking and cryptogra...