Controller Synthesis from LSC Requirements

Kugler, Hillel; Plock, Cory; Pnueli, Amir

doi:10.1007/978-3-642-00593-0_6

Cited by 17 publications

(13 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Boundedness problems: divergence [16], model checking problem [20,34], synthesis problem [19,34,35,36,37,30] and non-regularity [32]. Although they are slightly different problems, we group them together since an unbounded communication pattern in a loop structure in HMSCs causes all these problems.…”

Section: Categorisation Of Identified Pathologiesmentioning

confidence: 99%

A framework for pathologies of message sequence charts

Dan

Hierons

Counsell

2012

Information and Software Technology

View full text Add to dashboard Cite

Context: It is known that a Message Sequence Chart (MSC) specification can contain different types of pathology. However, definitions of different types of pathology and the problems caused by pathologies are unclear, let alone the relationships between them. In this circumstance, it can be problematic for software engineers to accurately predict the possible problems that may exist in implementations of MSC specifications and to trace back to the design problems in MSC specifications from the observed problems of an implementation. Objective: We focus on generating a clearer view on MSC pathologies and building formal relationships between pathologies and the problems that they may cause. Method: By concentrating on the problems caused by pathologies, a categorisation of problems that a distributed system may suffer is first introduced. We investigate the different types of problems and map them to a categories of pathologies. Thus, existing concepts related to pathology are refined and necessary concepts in the pathology framework are identified. Finally, we formally prove the relationships between the concepts in the framework. Results: A pathology framework is established as desired based on a restriction that considers problematic scenarios with a single undesirable event. In this framework, we define disjoint categories of both pathologies and the problems caused; the identified types of pathology are successfully mapped to the problems that they may cause. Conclusion: The framework achieved in this paper introduces taxonomies into and clarifies relationships between concepts in research on MSC pathologies. The taxonomies and relationships in the framework can help software engineers to predict problems and verify MSC specifications. The single undesirable event restriction not only enables a categorisation of pathological scenarios, but also has the potential practical benefit that a software engineer can concentrate on key problematic scenarios. This may make it easier to either remove pathologies from an MSC specification M or test an implementation developed from M for potential problems resulting from such pathologies.

show abstract

Section: Categorisation Of Identified Pathologiesmentioning

confidence: 99%

A framework for pathologies of message sequence charts

Dan

Hierons

Counsell

2012

Information and Software Technology

View full text Add to dashboard Cite

show abstract

“…In [3], games with GR(1) conditions are introduced. GR(1) games allow for polynomial-time solutions and have been widely applied in practice [4], [26], [40]. By extending 2-player GR(1) games with a stochastic component introducing 2 1 /2-player GR(1) games, our approach expands the applicability of 2-player GR(1) games in domains such as robotics and autonomous systems where stochastic models are a more natural modeling approach.…”

Section: Algorithmmentioning

confidence: 99%

“…GR(1) games have been applied in numerous settings such as hardware design [4], high-level strategies for selfadaptive systems [15], [5], robot-controller planning [11], [21], [24], [25], [40] and user programming [26], [27]. In addition, many tools for solving GR(1) games have been developed [22], [38], [2], [16] showing that there is real interest in the application of games with GR(1) winning conditions.…”

Section: Introductionmentioning

confidence: 99%

2½-player generalized reactivity (1) games

Rodrı́guez

Braberman

D’Ippolito

et al. 2016

2016 IEEE 55th Conference on Decision and Control (CDC)

View full text Add to dashboard Cite

Abstract-We introduce a new class of 2 1 /2-player games, the 2 1 /2-player GR(1) games, that allows for solving problems of stochastic nature by adding a probabilistic component to simple 2-player GR(1) games. Further, we present an efficient approach for solving qualitative 2 1 /2-player GR(1) games with polynomial-time complexity. Our approach is based on a reduction from 2 1 /2-player GR(1) games to 2-player GR(1) games that allows for solving the game and constructing, from a sure winning strategy for player 2 (resp. 3) in a 2-player GR (1) game, an almost-sure (resp. positively) winning strategy for its corresponding 2 1 /2-player GR(1) game. Key to the effectiveness of the proposed approach is the fact that the reduction generates a 2-player game that is linearly larger than the original 2 1 /2-player game, more precisely, it is linear with respect to the number of probabilistic states in the 2 1 /2-player GR(1) game.

show abstract

“…Synthesis from LSCs using a reduction to CSP is described in [35]. In [22] synthesis from LSC is tackled somewhat similarly to this paper, however compositional synthesis is not considered at all.…”

Section: Related Workmentioning

confidence: 99%

Compositional Synthesis of Reactive Systems from Live Sequence Chart Specifications

Kugler

Segall

2009

Tools and Algorithms for the Construction and Analysis of Systems

Self Cite

View full text Add to dashboard Cite

Abstract. Synthesis is the process of automatically generating a correct running system from its specification. In this paper, we suggest a translation of a Live Sequence Chart specification into a two-player game for the purpose of synthesis. We use this representation for synthesizing a reactive system, and introduce a novel algorithm for composing two such systems for two subsets of a specification. Even though this algorithm may fail to compose the systems, or to prove the joint specification to be inconsistent, we present some promising results for which the composition algorithm does succeed and saves significant running time. We also discuss options for extending the algorithm into a sound and complete one.

show abstract

Controller Synthesis from LSC Requirements

Cited by 17 publications

References 31 publications

A framework for pathologies of message sequence charts

A framework for pathologies of message sequence charts

2½-player generalized reactivity (1) games

Compositional Synthesis of Reactive Systems from Live Sequence Chart Specifications

Contact Info

Product

Resources

About