On the synthesis of a reactive module
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Journal of the ACM (JACM)
LSCs: Breathing Life into Message Sequence Charts
Formal Methods in System Design
On the complexity of verifying concurrent transition systems
Information and Computation
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
On the Synthesis of an Asynchronous Reactive Module
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
Deciding Properties for Message Sequence Charts
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
The common fragment of CTL and LTL
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
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
Undecidable problems of decentralized observation and control on regular languages
Information Processing Letters
Telecommunications Systems - Modeling, analysis, design and management
Synthesis of Open Reactive Systems from Scenario-Based Specifications
Fundamenta Informaticae - Application of Concurrency to System Design (ACSD'03)
From Live Sequence Charts to State Machines and Back: A Guided Tour
IEEE Transactions on Software Engineering
Design Synthesis from Interaction and State-Based Specifications
IEEE Transactions on Software Engineering
Some results on the expressive power and complexity of LSCs
Pillars of computer science
The good, the bad and the ugly: well-formedness of live sequence charts
FASE'06 Proceedings of the 9th international conference on Fundamental Approaches to Software Engineering
| Hi-index | 0.00 |
We are interested in implementing a fully automated software development process starting from sequence charts, which have proven their naturalness and usefulness in industry. We show in this paper that even for the simplest variants of sequence charts, there are strong impediments to the implementability of this dream. In the case of a manual development, we have to check the final implementation (the model). We show that centralized model-checking is co-NP-complete. Unfortunately, this problem is of little interest to industry. The real problem is distributed model-checking, that we show PSPACE complete, as well as several simple but interesting verification problems. The dream itself relies on program synthesis, formally called realizability. We show that the industrially relevant problem, distributed realizability, is undecidable. The less interesting problems of centralized and constrained realizability are exponential and doubly-exponential complete, respectively.