Synthesis from scenario-based specifications

David Harel; Itai Segall

doi:https://doi.org/10.1016/j.jcss.2011.08.008

Synthesis from scenario-based specifications

David Harel, Itai Segall

Department of Computer Science and Applied Mathematics

Weizmann Institute of Science

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

Abstract

We consider the problem of the automatic generation of reactive systems from specifications given in the scenario-based language of live sequence charts (LSCs). We start by extending the language so that it becomes more suitable for synthesis. We then translate a system specification given in the language into a two-player game between the system and the environment. By solving the game, we generate a winning strategy for the system, which corresponds to a correct implementation of the specification. We also define two notions of system correctness, and show how each can be synthesized.

Original language	English
Pages (from-to)	970-980
Number of pages	11
Journal	Journal of Computer and System Sciences
Volume	78
Issue number	3
DOIs	https://doi.org/10.1016/j.jcss.2011.08.008
State	Published - May 2012

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
General Computer Science
Applied Mathematics
Computer Networks and Communications
Computational Theory and Mathematics

Access to Document

https://doi.org/10.1016/j.jcss.2011.08.008

Cite this

@article{cdbf7f2eba8f4ba383d48e214a3846e0,

title = "Synthesis from scenario-based specifications",

abstract = "We consider the problem of the automatic generation of reactive systems from specifications given in the scenario-based language of live sequence charts (LSCs). We start by extending the language so that it becomes more suitable for synthesis. We then translate a system specification given in the language into a two-player game between the system and the environment. By solving the game, we generate a winning strategy for the system, which corresponds to a correct implementation of the specification. We also define two notions of system correctness, and show how each can be synthesized.",

author = "David Harel and Itai Segall",

note = "John von Neumann Minerva Center for the Development of Reactive Systems at the Weizmann Institute of Science; European Research Council (ERC) under the European CommunityThis research was supported by the John von Neumann Minerva Center for the Development of Reactive Systems at the Weizmann Institute of Science, and by an Advanced Research Grant from the European Research Council (ERC) under the European Community's 7th Framework Programme (FP7/2007-2013).",

year = "2012",

month = may,

doi = "https://doi.org/10.1016/j.jcss.2011.08.008",

language = "الإنجليزيّة",

volume = "78",

pages = "970--980",

journal = "Journal of Computer and System Sciences",

issn = "0022-0000",

publisher = "Academic Press Inc.",

number = "3",

}

TY - JOUR

T1 - Synthesis from scenario-based specifications

AU - Harel, David

AU - Segall, Itai

N1 - John von Neumann Minerva Center for the Development of Reactive Systems at the Weizmann Institute of Science; European Research Council (ERC) under the European CommunityThis research was supported by the John von Neumann Minerva Center for the Development of Reactive Systems at the Weizmann Institute of Science, and by an Advanced Research Grant from the European Research Council (ERC) under the European Community's 7th Framework Programme (FP7/2007-2013).

PY - 2012/5

Y1 - 2012/5

N2 - We consider the problem of the automatic generation of reactive systems from specifications given in the scenario-based language of live sequence charts (LSCs). We start by extending the language so that it becomes more suitable for synthesis. We then translate a system specification given in the language into a two-player game between the system and the environment. By solving the game, we generate a winning strategy for the system, which corresponds to a correct implementation of the specification. We also define two notions of system correctness, and show how each can be synthesized.

AB - We consider the problem of the automatic generation of reactive systems from specifications given in the scenario-based language of live sequence charts (LSCs). We start by extending the language so that it becomes more suitable for synthesis. We then translate a system specification given in the language into a two-player game between the system and the environment. By solving the game, we generate a winning strategy for the system, which corresponds to a correct implementation of the specification. We also define two notions of system correctness, and show how each can be synthesized.

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

U2 - https://doi.org/10.1016/j.jcss.2011.08.008

DO - https://doi.org/10.1016/j.jcss.2011.08.008

M3 - مقالة

SN - 0022-0000

VL - 78

SP - 970

EP - 980

JO - Journal of Computer and System Sciences

JF - Journal of Computer and System Sciences

IS - 3

ER -

Synthesis from scenario-based specifications

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this