894 search results - page 3 / 179 » Optimizations for LTL Synthesis |
136
Voted
DAC
2012
ACM
13 years 6 months ago
2012
ACM
In this work we address the problem of managing interconnect timing in high-level synthesis by generating a layoutfriendly microarchitecture. A metric called spreading score is pr...
111
Voted
RV
2009
Springer
15 years 10 months ago
2009
Springer
Synthesizing monitor circuits for LTL formulas is expensive, because the number of flip-flops in the circuit is exponential in the length of the formula. As a result, the IEEE st...
134
Voted
ATVA
2006
Springer
15 years 7 months ago
2006
Springer
In synthesis we construct finite state systems from temporal specifications. While this problem is well understood in the classical setting of non-probabilistic synthesis, this pap...
114
Voted
LPAR
2005
Springer
15 years 9 months ago
2005
Springer
We present an algorithm for the conversion of very weak alternating Büchi automata into nondeterministic Büchi automata (NBA), and we introduce a local optimization criterion fo...
238
Voted
NFM
2011
14 years 10 months ago
2011
Synthesis of finite-state machines from linear-time temporal logic (LTL) formulas is an important formal specification debugging technique for reactive systems and can quickly ge...