Synthesis of Open Reactive Systems from Scenario-Based Specifications

Authors:
Yves Bontemps;Pierre-Yves Schobbens;Christof Löding
Affiliations:
Computer Science Department, University of Namur Namur, Belgium and FUNDP, Institut d'Informatique, 21, rue Grandgagnage, B5000 - Namur (Belgium);Computer Science Department, University of Namur Namur, Belgium and FUNDP, Institut d'Informatique, 21, rue Grandgagnage, B5000 - Namur (Belgium);Lehrstuhl für Informatik VII, RWTH Aachen, Aachen, Germany
Venue:
Fundamenta Informaticae - Application of Concurrency to System Design (ACSD'03)
Year:
2004

Citing 40
Cited 3

On supervisory control real-time discrete-event systems

Information Sciences: an International Journal
On the synthesis of a reactive module

POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Object-oriented software engineering

Object-oriented software engineering
Composing specifications

ACM Transactions on Programming Languages and Systems (TOPLAS)
Formal Approach to Scenario Analysis

IEEE Software
Control of Infinite Behavior of Finite Automata

SIAM Journal on Control and Optimization
Supervision of Infinite Behavior of Discrete-Event Systems

SIAM Journal on Control and Optimization
Synthesis and verification of discrete controllers for robotics and manufacturing devices with temporal logic and the control-D system

Synthesis and verification of discrete controllers for robotics and manufacturing devices with temporal logic and the control-D system
Integration of Sequential Scenarios

IEEE Transactions on Software Engineering
Control of &khgr;-automata under state fairness assumptions

Systems & Control Letters
Patterns in property specifications for finite-state verification

Proceedings of the 21st international conference on Software engineering
Inference of message sequence charts

Proceedings of the 22nd international conference on Software engineering
Generating statechart designs from scenarios

Proceedings of the 22nd international conference on Software engineering
The foundations of Esterel

Proof, language, and interaction
Synthesis of Communicating Processes from Temporal Logic Specifications

ACM Transactions on Programming Languages and Systems (TOPLAS)
Module checking

Information and Computation - Special issue on FLOC '96
A workbench for synthesising behaviour models from scenarios

ICSE '01 Proceedings of the 23rd International Conference on Software Engineering
Detecting implied scenarios in message sequence chart specifications

Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering
LSCs: Breathing Life into Message Sequence Charts

Formal Methods in System Design
Modeling Reactive Systems with Statecharts: The Statemate Approach

Modeling Reactive Systems with Statecharts: The Statemate Approach
Alternating-time temporal logic

Journal of the ACM (JACM)
Scenarios in System Development: Current Practice

IEEE Software
Realizable and Unrealizable Specifications of Reactive Systems

ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Smart Play-out of Behavioral Requirements

FMCAD '02 Proceedings of the 4th International Conference on Formal Methods in Computer-Aided Design
An Automata Based Interpretation of Live Sequence Charts

TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
A Decidable Class of Asynchronous Distributed Controllers

CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Timed Interfaces

EMSOFT '02 Proceedings of the Second International Conference on Embedded Software
Synthesizing State-Based Object Systems from LSC Specifications

CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Consistent Graphical Specification of Distributed Systems

FME '97 Proceedings of the 4th International Symposium of Formal Methods Europe on Industrial Applications and Strengthened Foundations of Formal Methods
A Discrete Strategy Improvement Algorithm for Solving Parity Games

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Infinite Games and Verification (Extended Abstract of a Tutorial)

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Synthesizing Processes and Schedulers from Temporal Specifications

CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
An Automata-Theoretic Approach to Fair Realizability and Synthesis

Proceedings of the 7th International Conference on Computer Aided Verification
Come, Let's Play: Scenario-Based Programming Using LSC's and the Play-Engine

Come, Let's Play: Scenario-Based Programming Using LSC's and the Play-Engine
Synthesizing Distributed Systems

LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Automata logics, and infinite games: a guide to current research

Automata logics, and infinite games: a guide to current research
Undecidable problems of decentralized observation and control on regular languages

Information Processing Letters
Constructing Programs from Example Computations

IEEE Transactions on Software Engineering
On the complexity of omega -automata

SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Supervisory control of discrete event systems

Mathematical and Computer Modelling: An International Journal

Design Synthesis from Interaction and State-Based Specifications

IEEE Transactions on Software Engineering
Synthesizing nonanomalous event-based controllers for liveness goals

ACM Transactions on Software Engineering and Methodology (TOSEM)
Counter play-out: executing unrealizable scenario-based specifications

Proceedings of the 2013 International Conference on Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose here Live Sequence Charts with a new, game-based semantics to model interactions between the system and its environment. For constructing programs automatically, we give an algorithm to synthesize either a strategy for the system ensuring that the specification is respected, or, if the specification is unimplementable, a strategy for the environment forcing the system to fail. We introduce the concept of mercifulness, a desirable property of the synthesized program. We give a polynomial time algorithm for synthesizing merciful winning strategies.