Anchored Concatenation of MSCs

[1]  David Harel,et al.  Executable object modeling with statecharts , 1997, Computer.

[2]  Madhavan Mukund,et al.  A theory of regular MSC languages , 2005, Inf. Comput..

[3]  Anca Muscholl,et al.  A Note on the Commutative Closure of Star-Free Languages , 1996, Inf. Process. Lett..

[4]  Sebastián Uchitel,et al.  Detecting implied scenarios in message sequence chart specifications , 2001, ESEC/FSE-9.

[5]  Michel A. Reniers,et al.  High-level message sequence charts , 1997, SDL Forum.

[6]  Ivar Jacobson,et al.  The Unified Modeling Language User Guide , 1998, J. Database Manag..

[7]  Madhavan Mukund,et al.  On Message Sequence Graphs and Finitely Generated Regular MSC Languages , 2000, ICALP.

[8]  Madhavan Mukund,et al.  Regular Collections of Message Sequence Charts , 2000, MFCS.

[9]  Dietrich Kuske,et al.  A Further Step towards a Theory of Regular MSC Languages , 2002, STACS.

[10]  Rajeev Alur,et al.  Model Checking of Message Sequence Charts , 1999, CONCUR.

[11]  David Harel,et al.  Come, let's play - scenario-based programming using LSCs and the play-engine , 2003 .

[12]  Ekkart Rudolph,et al.  Tutorial on Message Sequence Charts , 1996, Comput. Networks ISDN Syst..

[13]  Jacques Sakarovitch.  The "Last" Decision Problem for Rational Trace Languages , 1992, LATIN.

[14]  Madhavan Mukund,et al.  Netcharts: Bridging the gap between HMSCs and executable specifications , 2003, CONCUR.

[15]  Rajeev Alur,et al.  Realizability and verification of MSC graphs , 2005, Theor. Comput. Sci..

[16]  Anca Muscholl,et al.  Message Sequence Graphs and Decision Problems on Mazurkiewicz Traces , 1999, MFCS.

[17]  Rémi Morin,et al.  The Pros and Cons of Netcharts , 2004, CONCUR.