TY - GEN
T1 - Synthesis of succinct systems
AU - Fearnley, John
AU - Peled, Doron
AU - Schewe, Sven
N1 - Funding Information: This work was supported by the Engineering and Physical Science Research Council through the grants EP/H046623/1 ‘Synthesis and Verification in Markov Game Structures’ and EP/L011018/1 ‘Algorithms for Finding Approximate Nash Equilibria’, by the Israel Science Foundation through grant 126-12 ‘Practical Synthesis of Control for Distributed Systems’, and by a short visit grant ‘Circuit Complexity for Synthesis’ within the framework of the ESF activity ‘Games for Design and Verification’. A preliminary version of this article appeared in ATVA 2012 [5] .
PY - 2012
Y1 - 2012
N2 - Synthesis of correct by design systems from specification has recently attracted much attention. The theoretical results imply that this problem is highly intractable, e.g., synthesizing a system is 2EXPTIME-complete for an LTL specification and EXPTIME-complete for CTL. An argument in favor of synthesis is that the temporal specification is highly compact, and the complexity reflects the large size of the system constructed. A careful observation reveals that the size of the system is presented in such arguments as the size of its state space. This view is a bit biased, in the sense that the state space can be exponentially larger than the size of a reasonable implementation such as a circuit or a program. Although this alternative measure of the size of the synthesized system is more intuitive (e.g., this is the standard way model checking problems are measured), research on synthesis has so far stayed with measuring the system in terms of the explicit state space. This raises the question of whether or not there exists a small bound on the circuits or programs. In this paper, we show that this is the case if, and only if, PSPACE = EXPTIME.
AB - Synthesis of correct by design systems from specification has recently attracted much attention. The theoretical results imply that this problem is highly intractable, e.g., synthesizing a system is 2EXPTIME-complete for an LTL specification and EXPTIME-complete for CTL. An argument in favor of synthesis is that the temporal specification is highly compact, and the complexity reflects the large size of the system constructed. A careful observation reveals that the size of the system is presented in such arguments as the size of its state space. This view is a bit biased, in the sense that the state space can be exponentially larger than the size of a reasonable implementation such as a circuit or a program. Although this alternative measure of the size of the synthesized system is more intuitive (e.g., this is the standard way model checking problems are measured), research on synthesis has so far stayed with measuring the system in terms of the explicit state space. This raises the question of whether or not there exists a small bound on the circuits or programs. In this paper, we show that this is the case if, and only if, PSPACE = EXPTIME.
UR - http://www.scopus.com/inward/record.url?scp=84868258055&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-33386-6_18
DO - 10.1007/978-3-642-33386-6_18
M3 - منشور من مؤتمر
SN - 9783642333859
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 208
EP - 222
BT - Automated Technology for Verification and Analysis - 10th International Symposium, ATVA 2012, Proceedings
T2 - 10th International Symposium on Automated Technology for Verification and Analysis, ATVA 2012
Y2 - 3 October 2012 through 6 October 2012
ER -