Computer-aided verification of coordinating processes: the automata-theoretic approach
Computer-aided verification of coordinating processes: the automata-theoretic approach
Efficient generation of counterexamples and witnesses in symbolic model checking
DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
LSCs: Breathing Life into Message Sequence Charts
Formal Methods in System Design
Multiple instances and symbolic variables in executable sequence charts
OOPSLA '02 Proceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Verification of a Radio-Based Signaling System Using the STATEMATE Verification Environment
Formal Methods in System Design
Regular Collections of Message Sequence Charts
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Smart Play-out of Behavioral Requirements
FMCAD '02 Proceedings of the 4th International Conference on Formal Methods in Computer-Aided Design
On Message Sequence Graphs and Finitely Generated Regular MSC Languages
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
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
Compositional Message Sequence Charts
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Model Checking of Message Sequence Charts
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Deciding Properties for Message Sequence Charts
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
Counterexample-Guided Abstraction Refinement
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Formal Modeling of C. elegans Development: A Scenario-Based Approach
CMSB '03 Proceedings of the First International Workshop on Computational Methods in Systems Biology
Scenario-Based Monitoring and Testing of Real-Time UML Models
«UML» '01 Proceedings of the 4th International Conference on The Unified Modeling Language, Modeling Languages, Concepts, and Tools
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
Telecommunications Systems - Modeling, analysis, design and management
FASE'07 Proceedings of the 10th international conference on Fundamental approaches to software engineering
Machine checked formal proof of a scheduling protocol for smartcard personalization
FMICS'07 Proceedings of the 12th international conference on Formal methods for industrial critical systems
Programming coordinated behavior in java
ECOOP'10 Proceedings of the 24th European conference on Object-oriented programming
Model-checking behavioral programs
EMSOFT '11 Proceedings of the ninth ACM international conference on Embedded software
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
Synthesis revisited: generating statechart models from scenario-based requirements
Formal Methods in Software and Systems Modeling
| Hi-index | 0.00 |
The play-in/play-out approach is a method for specifying and developing complex reactive systems. It is built upon a scenario-based philosophy, and uses the language of live sequence charts (LSCs) and a support tool called the Play-Engine. We present some conclusions from the initial experience we have had using the approach on several projects, and discuss methodological aspects rising from this experience. The projects are from aviation, telecommunication and system manufacturing domains.