Sciweavers

56 search results - page 3 / 12
» Compositional Algorithms for LTL Synthesis
Sort
View
NFM
2011
306views Formal Methods» more  NFM 2011»
13 years 1 months ago
Generalized Rabin(1) Synthesis with Applications to Robust System Synthesis
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...
Rüdiger Ehlers
EON
2008
13 years 7 months ago
Synthesizing the Mediator with jABC/ABC
Abstract. In this paper we show how to apply a tableau-based software composition technique to automatically generate the mediator's service logic. This uses an LTL planning (...
Tiziana Margaria
IRI
2008
IEEE
14 years 21 days ago
Modeling and synthesis of service composition using tree automata
— We revisit the problem of synthesis of service composition in the context of service oriented architecture from a tree automata perspective. Comparing to existing finite state...
Ken Q. Pu, Ying Zhu
LICS
2005
IEEE
13 years 12 months ago
Uniform Distributed Synthesis
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...
Bernd Finkbeiner, Sven Schewe
IICS
2005
Springer
13 years 11 months ago
Compositional Constraints Generation for Concurrent Real-Time Loops with Interdependent Iterations
Abstract. In this paper we describe an assume/guarantee based execution constraints synthesis algorithm for concurrent threads executing on parallel platforms. Threads are loops wh...
Ismail Assayad, Sergio Yovine