8828 search results - page 388 / 1766 » Formal methods in practice |
161
click to vote
FMCAD
2006
Springer
15 years 10 months ago
2006
Springer
We present an approach to automatic synthesis of specifications given in Linear Time Logic. The approach is based on a translation through universal co-B
178
click to vote
FMCO
2006
Springer
15 years 10 months ago
2006
Springer
In this paper, we give an overview on some algorithms for learning automata. Starting with Biermann's and Angluin's algorithms, we describe some of the extensions caterin...
184
click to vote
FORMATS
2006
Springer
15 years 10 months ago
2006
Springer
Timed and weak timed simulation relations are often used to show that operations on hybrid systems result in equivalent behavior or in conservative overapproximations. Given that s...
176
click to vote
FORMATS
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We show how to transform formulae written in the real-time temporal logic MITL into timed automata that recognize their satisfying models. This compositional construction...
141
click to vote
FMCAD
2000
Springer
15 years 10 months ago
2000
Springer
We present a symbolic algorithm for strongly connected component decomposition. The algorithm performs (n log n) image and preimage computations in the worst case, where n is the n...