Scenario realizability with constraint optimization

Authors:
Rouwaida Abdallah;Arnaud Gotlieb;Loïc Hélouët;Claude Jard
Affiliations:
ENS Cachan (antenne de Bretagne), France;SIMULA, Norway;INRIA Rennes, France;Université de Nantes, France
Venue:
FASE'13 Proceedings of the 16th international conference on Fundamental Approaches to Software Engineering
Year:
2013

Citing 8
Cited 0

Realizability and Verification of MSC Graphs

ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Syntactic Detection of Process Divergence and Non-local Choice inMessage Sequence Charts

TACAS '97 Proceedings of the Third International Workshop on Tools and Algorithms for Construction and Analysis of Systems
An Open-Ended Finite Domain Constraint Solver

PLILP '97 Proceedings of the9th International Symposium on Programming Languages: Implementations, Logics, and Programs: Including a Special Trach on Declarative Programming Languages in Education
Communicating Transaction Processes

ACSD '03 Proceedings of the Third International Conference on Application of Concurrency to System Design
Realizability of high-level message sequence charts: closing the gaps

Theoretical Computer Science
A comparative survey of scenario-based to state-based model synthesis approaches

Proceedings of the 2006 international workshop on Scenarios and state machines: models, algorithms, and tools
Infinite-state high-level MSCs: Model-checking and realizability

Journal of Computer and System Sciences
Synthesis of safe message-passing systems

FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work considers implementation of requirements expressed as High-level Message Sequence Charts (HMSCs). All HMSCs are not implementable, but a particular subclass called local HMSCs can be implemented using a simple projection operation. This paper proposes a new technique to transform an arbitrary HMSC specification into a local HMSC, hence allowing implementation. We show that this transformation can be automated as a constraint optimization problem. The impact of modifications brought to the original specification can be minimized w.r.t. a cost function. The approach was evaluated on a large number of randomly generated HMSCs. The results show an average runtime of a few seconds, which demonstrates applicability of the technique.