Netcharts: Bridging the gap between HMSCs and executable specifications

We define a new notation called netcharts for describing sets of message sequence chart scenarios (MSCs). Netcharts correspond to a distributed version of High-level Message Sequence Charts (HMSCs). Netcharts improve on HMSCs in two respects.

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

[2]  Anca Muscholl,et al.  Compositional message sequence charts , 2001, International Journal on Software Tools for Technology Transfer.

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

[4]  P. S. Thiagarajan,et al.  Communicating transaction processes , 2003, Third International Conference on Application of Concurrency to System Design, 2003. Proceedings..

[5]  David Harel,et al.  Executable object modeling with statecharts , 1996, Proceedings of IEEE 18th International Conference on Software Engineering.

[6]  Claude Jard,et al.  Modeling and Verification of Parallel Processes , 2001, Lecture Notes in Computer Science.

[7]  Kousha Etessami,et al.  Optimizing Büchi Automata , 2000, CONCUR.

[8]  Sjouke Mauw,et al.  Message Sequence Chart (MSC) , 1996 .

[9]  Leszek Pacholski,et al.  Mathematical Foundations of Computer Science 1999 , 1999, Lecture Notes in Computer Science.

[10]  Jörg Desel,et al.  Free Choice Petri Nets (Cambridge Tracts in Theoretical Computer Science) , 2005 .

[11]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[12]  Jörg Desel,et al.  Free choice Petri nets , 1995 .

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

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

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

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

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

[18]  Mogens Nielsen,et al.  Mathematical Foundations of Computer Science 2000 , 2001, Lecture Notes in Computer Science.

[19]  Loïc Hélouët,et al.  HMSCs as Partial Specifications ... with PNs as Completions , 2000, MOVEP.

[20]  C. A. Petri,et al.  Concurrency Theory , 1986, Advances in Petri Nets.

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

[22]  Madhavan Mukund,et al.  Synthesizing Distributed Finite-State Systems from MSCs , 2000, CONCUR.

[23]  Rajeev Alur,et al.  A Temporal Logic of Nested Calls and Returns , 2004, TACAS.