Assume-guarantee scenarios: Semantics and synthesis

30Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The behavior of open reactive systems is best described in an assume-guarantee style specification: a system guarantees certain prescribed behavior provided that its environment follows certain given assumptions. Scenario-based modeling languages, such as variants of message sequence charts, have been used to specify reactive systems behavior in a visual, modular, intuitive way. However, none have yet provided full support for assume-guarantee style specifications. In this paper we present assume-guarantee scenarios, which extend live sequence charts (lsc) - a visual, expressive, scenario-based language - syntax and semantics, with an explicit distinction between system and environment entities and with support not only for safety and liveness system guarantees but also for safety and liveness environment assumptions. Moreover, the semantics is defined using a reduction to gr(1), a fragment of ltl that enables game-based, symbolic, efficient synthesis of a correct-by-construction controller. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Maoz, S., & Sa’ar, Y. (2012). Assume-guarantee scenarios: Semantics and synthesis. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7590 LNCS, pp. 335–351). https://doi.org/10.1007/978-3-642-33666-9_22

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free