SOFSEM
2012
Springer
11 years 12 months ago
2012
Springer
In automated synthesis, we transform a specification into a system that is guaranteed to satisfy the specification against all environments. While modelchecking theory has led to...
FOSSACS
2012
Springer
12 years 19 hour ago
2012
Springer
Synthesis from components is the automated construction of a composite system from a library of reusable components such that the system satisfies the given specification. This i...
EMSOFT
2011
Springer
12 years 4 months ago
2011
Springer
Given a multi-modal dynamical system, optimal switching logic synthesis involves generating conditions for switching between the system modes such that the resulting hybrid system...
CSFW
2011
IEEE
12 years 4 months ago
2011
IEEE
—In this paper, we investigate the computational complexity of quantitative information flow (QIF) problems. Information-theoretic quantitative relaxations of noninterference (b...
FSTTCS
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. We study the synthesis problem for external linear or branching specifications and distributed, synchronous architectures with arbitrary delays on processes. External mea...
CONCUR
2003
Springer
13 years 9 months ago
2003
Springer
Abstract. We apply the theory of asynchronous automata to the synthesis problem of closed distributed systems. We use safe asynchronous automata as implementation model, and charac...
LICS
2005
IEEE
13 years 10 months ago
2005
IEEE
We provide a uniform solution to the problem of synthesizing a finite-state distributed system. An instance of the synthesis problem consists of a system architecture and a tempo...
ATVA
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. The bounded synthesis problem is to construct an implementation that satisfies a given temporal specification and a given bound on the number of states. We present a so...