551 search results - page 5 / 111 » Formalizing the Logic-Automaton Connection |
67
Voted
FORMATS
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. In this paper we propose a novel technique for constructing timed automata from properties expressed in the logic MTL, under bounded-variability assumptions. We handle fu...
FMCAD
2000
Springer
15 years 3 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...
ACL
1992
15 years 24 days ago
1992
A formalism will be presented in this paper which makes it possible to realise the idea of assigning only one scope-ambiguous representation to a sentence that is ambiguous with r...
78
Voted
ISOLA
2010
Springer
14 years 10 months ago
2010
Springer
On the fly synthesis of mediators is a revolutionary approach to the seamless networking of today’s and future digital systems that increasingly need be connected. The resulting...
COMBINATORICS
2004
14 years 11 months ago
2004
Until now, the enumeration of connected graphs has been dealt with by probabilistic methods, by special combinatorial decompositions or by somewhat indirect formal series manipula...