4340 search results - page 603 / 868 » Formal Methods and Cryptography |
161
click to vote
FM
2005
Springer
16 years 3 days ago
2005
Springer
Recently we have proposed the ”almost ASAP” semantics as an alternative semantics for timed automata. This semantics is useful when modeling real-time controllers : control str...
198
click to vote
FMCO
2005
Springer
16 years 3 days ago
2005
Springer
Abstract. In recent years a bundle of parallel and distributed algorithms for verification of finite state systems has appeared. We survey distributed-memory enumerative LTL mode...
187
click to vote
FMCO
2005
Springer
16 years 3 days ago
2005
Springer
Abstract. Separation logic is a program logic for reasoning about programs that manipulate pointer data structures. We describe Smallfoot, a tool for checking certain lightweight s...
168
click to vote
FORMATS
2005
Springer
16 years 3 days ago
2005
Springer
Abstract. We examine to what extent implementation of timed automata can be achieved using the standard semantics and appropriate modeling, instead of introducing new semantics. We...
180
click to vote
FORMATS
2005
Springer
16 years 3 days ago
2005
Springer
Within hybrid systems theory, o-minimal automata are often considered on the border between decidability and undecidability. In such classes of hybrid automata, the constraint of h...