Synthesis of succinct systems

John Fearnley; Doron Peled; Sven Schewe

doi:10.1016/j.jcss.2015.02.005

Synthesis of succinct systems

John Fearnley, Doron Peled, Sven Schewe

Department of Computer Science

University of Liverpool

Research output: Contribution to journal › Article › peer-review

2 Scopus citations

Abstract

Synthesis of correct by design systems from specifications has recently attracted a lot of attention. The theoretical results imply that this problem is highly intractable. For example, synthesizing a system is 2EXPTIME-complete for an LTL specification and EXPTIME-complete for CTL. An argument in favour of synthesis is that temporal specifications are 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 slightly biased, in that the state space can be exponentially larger than the size of a reasonable implementation like a circuit or program. This raises the question if there exists a small bound on the circuits or programs. We show that small succinct model theorems depend on the collapse of complexity classes, e.g., of PSPACE and EXPTIME for CTL.

Original language	English
Pages (from-to)	1171-1193
Number of pages	23
Journal	Journal of Computer and System Sciences
Volume	81
Issue number	7
DOIs	https://doi.org/10.1016/j.jcss.2015.02.005
State	Published - 1 Nov 2015

Bibliographical note

Publisher Copyright:
© 2015 Elsevier Inc.

Funding

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] .

Funders	Funder number
Israel Science Foundation
Engineering and Physical Sciences Research Council	EP/L011018/1, EP/H046623/1
Israel Science Foundation	126-12

Keywords

CTL
LTL
Online Turing machine
Succinct synthesis

Access to Document

10.1016/j.jcss.2015.02.005

Cite this

@article{260fee9cc69d4fafa50094ec4b8a4495,

title = "Synthesis of succinct systems",

abstract = "Synthesis of correct by design systems from specifications has recently attracted a lot of attention. The theoretical results imply that this problem is highly intractable. For example, synthesizing a system is 2EXPTIME-complete for an LTL specification and EXPTIME-complete for CTL. An argument in favour of synthesis is that temporal specifications are 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 slightly biased, in that the state space can be exponentially larger than the size of a reasonable implementation like a circuit or program. This raises the question if there exists a small bound on the circuits or programs. We show that small succinct model theorems depend on the collapse of complexity classes, e.g., of PSPACE and EXPTIME for CTL.",

keywords = "CTL, LTL, Online Turing machine, Succinct synthesis",

author = "John Fearnley and Doron Peled and Sven Schewe",

note = "Publisher Copyright: {\textcopyright} 2015 Elsevier Inc.",

year = "2015",

month = nov,

day = "1",

doi = "10.1016/j.jcss.2015.02.005",

language = "אנגלית",

volume = "81",

pages = "1171--1193",

journal = "Journal of Computer and System Sciences",

issn = "0022-0000",

publisher = "Academic Press Inc.",

number = "7",

}

TY - JOUR

T1 - Synthesis of succinct systems

AU - Fearnley, John

AU - Peled, Doron

AU - Schewe, Sven

PY - 2015/11/1

Y1 - 2015/11/1

N2 - Synthesis of correct by design systems from specifications has recently attracted a lot of attention. The theoretical results imply that this problem is highly intractable. For example, synthesizing a system is 2EXPTIME-complete for an LTL specification and EXPTIME-complete for CTL. An argument in favour of synthesis is that temporal specifications are 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 slightly biased, in that the state space can be exponentially larger than the size of a reasonable implementation like a circuit or program. This raises the question if there exists a small bound on the circuits or programs. We show that small succinct model theorems depend on the collapse of complexity classes, e.g., of PSPACE and EXPTIME for CTL.

AB - Synthesis of correct by design systems from specifications has recently attracted a lot of attention. The theoretical results imply that this problem is highly intractable. For example, synthesizing a system is 2EXPTIME-complete for an LTL specification and EXPTIME-complete for CTL. An argument in favour of synthesis is that temporal specifications are 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 slightly biased, in that the state space can be exponentially larger than the size of a reasonable implementation like a circuit or program. This raises the question if there exists a small bound on the circuits or programs. We show that small succinct model theorems depend on the collapse of complexity classes, e.g., of PSPACE and EXPTIME for CTL.

KW - CTL

KW - LTL

KW - Online Turing machine

KW - Succinct synthesis

UR - http://www.scopus.com/inward/record.url?scp=84930767209&partnerID=8YFLogxK

U2 - 10.1016/j.jcss.2015.02.005

DO - 10.1016/j.jcss.2015.02.005

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:84930767209

SN - 0022-0000

VL - 81

SP - 1171

EP - 1193

JO - Journal of Computer and System Sciences

JF - Journal of Computer and System Sciences

IS - 7

ER -

Synthesis of succinct systems

Abstract

Bibliographical note

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this