Sciweavers

56 search results - page 1 / 12
» Compositional Algorithms for LTL Synthesis
Sort
View
ATVA
2010
Springer
169views Hardware» more  ATVA 2010»
13 years 6 months ago
Compositional Algorithms for LTL Synthesis
In this paper, we provide two compositional algorithms to solve safety games and apply them to provide compositional algorithms for the LTL synthesis problem. We have implemented t...
Emmanuel Filiot, Naiyong Jin, Jean-François...
SEW
2007
IEEE
13 years 11 months ago
LTL Guided Planning: Revisiting Automatic Tool Composition in ETI
We revisit the automatic tool composition feature of the Electronic Tool Integration platform under the perspective of planning. It turns out that in todays terminology, ETIs temp...
Tiziana Margaria, Bernhard Steffen
ATVA
2007
Springer
152views Hardware» more  ATVA 2007»
13 years 11 months ago
Bounded Synthesis
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...
Sven Schewe, Bernd Finkbeiner
CAV
2006
Springer
164views Hardware» more  CAV 2006»
13 years 8 months ago
Allen Linear (Interval) Temporal Logic - Translation to LTL and Monitor Synthesis
The relationship between two well established formalisms for temporal reasoning is first investigated, namely between Allen's interval algebra (or Allen's temporal logic,...
Grigore Rosu, Saddek Bensalem
FOSSACS
2009
Springer
13 years 11 months ago
Synthesis from Component Libraries
Abstract. Synthesis is the automatic construction of a system from its specification. In the classical synthesis algorithms it is always assumed the system is “constructed from ...
Yoad Lustig, Moshe Y. Vardi