Bounded synthesis

A fundamental challenge in the synthesis of reactive systems is the size of the search space: the number of candidate implementations of a temporal specification is typically superexponential or even, for distributed system architectures, infinite. In this article, we introduce the bounded synthesis...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:International journal on software tools for technology transfer Ročník 15; číslo 5-6; s. 519 - 539
Hlavní autoři: Finkbeiner, Bernd, Schewe, Sven
Médium: Journal Article
Jazyk:angličtina
Vydáno: Berlin/Heidelberg Springer Berlin Heidelberg 01.10.2013
Springer Nature B.V
Témata:
Automation
Backbone
Computer architecture
Computer networks
Computer programs
Computer Science
Distributed control systems
Distributed processing
Protocol verification
Searching
Software Engineering
Software Engineering/Programming and Operating Systems
Specifications
Synthesis
Temporal logic
Theory of Computation
LTL synthesis
Reactive systems
Co-Büchi automata
SMT-based synthesis
Synthesis of distributed systems
Infinite games
ISSN:1433-2779, 1433-2787
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:A fundamental challenge in the synthesis of reactive systems is the size of the search space: the number of candidate implementations of a temporal specification is typically superexponential or even, for distributed system architectures, infinite. In this article, we introduce the bounded synthesis approach, which makes it possible to traverse this immense search space in a structured manner. We fix a bound on a system parameter, such as the number of states, and limit the search to those implementations that fall below the bound. By incrementally expanding the search to larger bounds, we maintain completeness, while orienting the search towards the simplest (and often most useful) solutions. The technical backbone of this solution is a novel translation from formulas of linear-time temporal logic to sequences of safety tree automata, which are guaranteed to underapproximate the specification and to eventually become emptiness-equivalent. Bounded synthesis is applicable to the entire range of synthesis problems, from individual processes to synchronous and asynchronous distributed systems, to systems with additional design constraints, such as symmetry. We include experimental results from a SMT-based implementation, which demonstrate that bounded synthesis solves many synthesis problems that were previously considered intractable.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:1433-2779
1433-2787
DOI:10.1007/s10009-012-0228-z