Learning regular sets from queries and counterexamples
Information and Computation
On Communicating Finite-State Machines
Journal of the ACM (JACM)
DIPES '98 Proceedings of the IFIP WG10.3/WG10.5 international workshop on Distributed and parallel embedded systems
Requirements engineering: a roadmap
Proceedings of the Conference on The Future of Software Engineering
MAS — an interactive synthesizer to support behavioral modelling in UML
ICSE '01 Proceedings of the 23rd International Conference on Software Engineering
LSCs: Breathing Life into Message Sequence Charts
Formal Methods in System Design
Synthesis of Behavioral Models from Scenarios
IEEE Transactions on Software Engineering
Recognizable Sets of Message Sequence Charts
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects 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
Inference of Message Sequence Charts
IEEE Transactions on Software Engineering
Regular sets of infinite message sequence charts
Information and Computation
Realizability of high-level message sequence charts: closing the gaps
Theoretical Computer Science
Realizability and verification of MSC graphs
Theoretical Computer Science - Automata, languages and programming
From Live Sequence Charts to State Machines and Back: A Guided Tour
IEEE Transactions on Software Engineering
Message-passing automata are expressively equivalent to EMSO logic
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
Triggered Message Sequence Charts
IEEE Transactions on Software Engineering
Protocol conformance for logic-based agents
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
A theory of regular MSC languages
Information and Computation
A Kleene theorem and model checking algorithms for existentially bounded communicating automata
Information and Computation
Causal closure for MSC languages
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Compositional message sequence charts (CMSCs) are better to implement than MSCs
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
MSCAN: a tool for analyzing MSC specifications
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
LearnLib: a library for automata learning and experimentation
FASE'06 Proceedings of the 9th international conference on Fundamental Approaches to Software Engineering
Smyle: A Tool for Synthesizing Distributed Models from Scenarios by Learning
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
FMCO'06 Proceedings of the 5th international conference on Formal methods for components and objects
SMA: the smyle modeling approach
CEE-SET'08 Proceedings of the Third IFIP TC 2 Central and East European conference on Software engineering techniques
Hi-index | 0.00 |
This paper is concerned with bridging the gap between requirements, provided as a set of scenarios, and conforming design models. The novel aspect of our approach is to exploit learning for the synthesis of design models. In particular, we present a procedure that infers a message-passing automaton (MPA) from a given set of positive and negative scenarios of the system's behavior provided as message sequence charts (MSCs). The paper investigates which classes of regular MSC languages and corresponding MPA can (not) be learned, and presents a dedicated tool based on the learning library LearnLib that supports our approach.