4340 search results - page 735 / 868 » Formal Methods and Cryptography |
141
click to vote
ATAL
2005
Springer
15 years 10 months ago
2005
Springer
We present a general logic of explicit knowledge represented as finite sets of logical formulae which can evolve by nondeterministic reasoning and communication. It is partly bas...
121
click to vote
ATAL
2005
Springer
15 years 10 months ago
2005
Springer
There is a growing need for a theory of “local to global” in distributed multi-agent systems, one which is able systematically to describe and analyze a variety of problems. T...
129
click to vote
CAV
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. The coverability problem is decidable for the class of wellstructured transition systems. Until recently, the only known algorithm to solve this problem was based on symb...
146
Voted
CAV
2005
Springer
15 years 10 months ago
2005
Springer
In this work we study hybrid approaches to LTL symbolic model checking; that is, approaches that use explicit representations of the property automaton, whose state space is often ...
202
click to vote
CHARME
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Model checking is a formal technique for automatically verifying that a finite-state model satisfies a temporal property. In model checking, generally Binary Decision D...