Replaying play in and play out: Synthesis of design models from scenarios by learning

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4424 LNCS, Issue , 2007, Pages 435-450

  Bollig, Benedikt ^a   Katoen, Joost Pieter ^b   Kern, Carsten ^b   Leucker, Martin ^c  

^a CNRS   (France)

^b RWTH AACHEN UNIVERSITY   (Germany)

^c TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTER AIDED SOFTWARE ENGINEERING; COMPUTER PROGRAMMING LANGUAGES; DIGITAL LIBRARIES; ELECTRONIC DATA INTERCHANGE; MATHEMATICAL MODELS; FLOWCHARTING;

DESIGN MODELS; LEARNING LIBRARY; MESSAGE SEQUENCE CHARTS (MSCS); NEGATIVE SCENARIOS; DEDICATED TOOLS; MESSAGE SEQUENCE CHARTS; MESSAGE-PASSING AUTOMATA;

LEARNING ALGORITHMS; MESSAGE PASSING;

EID: 37149001046     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71209-1_33     Document Type: Conference Paper

References (30)

1. B. Adsul, M. Mukund, K. N. Kumar, and V. Narayanan. Causal closure for MSC languages. In FSTTCS 2005, volume 3821 of LNCS, pages 335-347. Springer, 2005.
2. R. Alur, K. Etessami, and M. Yannakakis. Inference of message sequence charts. IEEE Trans. Softw. Eng., 29(7):623-633, 2003.
3. R. Alur, K. Etessami, and M. Yannakakis. Realizability and verification of MSC graphs. Th. Comp. Sc., 331(1):97-114, 2005.
4. D. Angluin. Learning regular sets from queries and counterexamples. Inf. Comput., 75(2):87-106, 1987.
5. AT&T. Grappa - A Java Graph Package. http://www.research.att. com/john/Grappa/.
6. B. Bollig, J.-P. Katoen, C. Kern, and M. Leucker. Replaying play in and play out: Synthesis of design models from scenarios by learning. Research Report AIB-2006-12, RWTH Aachen, 2006.
7. B. Bollig, C. Kern, M. Schlütter, and V. Stolz. MSCan: A tool for analyzing MSC specifications. In TACAS 2006, volume 3920 of LNCS, pages 455-458. Springer, 2006.
8. B. Bollig and M. Leucker. Message-passing automata are expressively equivalent to EMSO logic. Th. Comp. Sc., 358(2-3):150-172, 2006.
9. Y. Bontemps, P. Heymand, and P.-Y. Schobbens. From live sequence charts to state machines and back: a guided tour. IEEE Trans. Softw. Eng., 31(12):999-1014, 2005.
10. D. Brand and P. Zafiropulo. On communicating finite-state machines. J. of the ACM, 30(2):323-342, 1983.
11. W. Damm and D. Harel. LSCs: Breathing life into message sequence charts. Formal Methods in System Design, 19:1:45-80., 2001.
12. D.Harel and R. Marelly. Come, Let's Play: Scenario-Based Programming Using LSCs and the Play-Engine. Springer, 2003.
13. U. Endriss, N. Maudet, F. Sadri, and F. Toni. Logic-based agent communication protocols. In Workshop on Agent Communication Languages, pages 91-107, 2003.
14. U. Endriss, N. Maudet, F. Sadri, and F. Toni. Protocol conformance for logic-based agents. In IJCAI 2003, pages 679-684, 2003.
15. B. Genest. Compositional message sequence charts (CMSCs) are better to implement than MSCs. In TACAS 2005, volume 3440 of LNCS, pages 429-444. Springer, 2005.
16. B. Genest, D. Kuske, and A. Muscholl. A Kleene theorem and model checking algorithms for existentially bounded communicating automata. Inf. Comput., 204(6):920-956, 2006.
17. J. G. Henriksen, M. Mukund, K. N. Kumar, M. Sohoni, and P. S. Thiagarajan. A theory of regular MSC languages. Inf. and Comput., 202(1):1-38, 2005.
18. H. Hungar, O. Niese, and B. Steffen. Domain-specific optimization in automata learning. In CAV 2003, volume 2725 of LNCS, pages 315-327. Springer, 2003.
19. I. Krüger, R. Grosu, P. Scholz, and M. Broy. From MSCs to Statecharts. In DIPES 1998, volume 155 of IFIP Conf. Proc., pages 61-72. Kluwer, 1998.
20. D. Kuske. Regular sets of infinite message sequence charts. Inf. Comput., 187:80-109, 2003.
21. M. Lohrey. Realizability of high-level message sequence charts: closing the gaps. Th. Comp. Sc., 309(1-3):529-554, 2003.
22. J. Ltd. JGraph - Java Graph Visualization and Layout. http://www.jgraph.com/.
23. E. Mäkinen and T. Systä. MAS - An interactive synthesizer to support behavioral modeling in UML. In ICSE 2001, pages 15-24. IEEE Computer Society, 2001.
24. R. Morin. Recognizable sets of message sequence charts. In STACS 2002, volume 2285 of LNCS, pages 523-534. Springer, 2002.
25. A. Muscholl and D. Peled. From finite state communication protocols to high-level message sequence charts. In ICALP 2001, volume 2076 of LNCS, pages 720-731. Springer, 2001.
26. B. Nuseibeh and S. Easterbrook. Requirements engineering: a roadmap. In ICSE 2000, pages 35-46. ACM, 2000.
27. H. Raffelt and B. Steffen. LearnLib: A library for automata learning and experimentation. In FASE 2006, volume 3922 of LNCS, pages 377-380, 2006.
28. B. Sengupta and R. Cleaveland. Triggered message sequence charts. IEEE Trans. Softw. Eng., 32(8):587-607, 2006.
29. S. Uchitel, J. Kramer, and J. Magee. Synthesis of behavioral models from scenarios. IEEE Trans. Softw. Eng., 29(2):99-115, 2003.
30. Y. L. Varol and D. Rotem. An algorithm to generate all topological sorting arrangements. Comput. J., 24(1):83-84, 1981.