462 search results - page 57 / 93 » Symbolic Bounded Synthesis |
135
click to vote
FORMATS
2006
Springer
15 years 5 months ago
2006
Springer
In this paper we describe an extension of timed automata with priorities, and efficient algorithms to compute subtraction on DBMs (difference bounded matrices), needed in symbolic ...
107
click to vote
STRINGOLOGY
2008
15 years 3 months ago
2008
Abstract. We study the problem of finding local and global covers as well as seeds in conservative indeterminate strings. An indeterminate string is a sequence T = T[1]T[2] . . . T...
122
click to vote
ACSD
2008
IEEE
15 years 8 months ago
2008
IEEE
Asynchronous data communication mechanisms (ACMs) have been extensively studied as data connectors between independently timed concurrent processes. In previous work, two automati...
CDC
2008
IEEE
15 years 8 months ago
2008
IEEE
— This paper provides a reformulation of closed-loop systems that have negative imaginary frequency response to closed-loop systems that have bounded gain, so that theory and res...
114
Voted
ASPDAC
1995
ACM
15 years 5 months ago
1995
ACM
- We address the problem of transforming a behavioral specification so that synthesis of a testable implementation from the new specification requires significantly less area and ...