论文信息 - An Effective Equivalence for Sets of Scenarios Represented by HMSCs

An Effective Equivalence for Sets of Scenarios Represented by HMSCs

This paper details a partial order semantics for families of scenarios represented by High-Level Message Sequence Charts (HMSCs): Graph grammars generating event structures are being used to represent HMSCs. A decision procedure for HMSC equivalence is then described. This can be considered as a first step toward formal manipulation of scenarios.

[1] David Harel,et al. LSCs: Breathing Life into Message Sequence Charts , 1999, Formal Methods Syst. Des..

[2] Peter B. Ladkin,et al. Four issues concerning the semantics of Message Flow Graphs , 1994, FORTE.

[3] Glynn Winskel,et al. Petri Nets, Event Structures and Domains, Part I , 1981, Theor. Comput. Sci..

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

[5] Peter B. Ladkin,et al. What Do Message Sequence Charts Mean? , 1993, FORTE.

[6] Sjouke Mauw,et al. The Formalization of Message Sequence Charts , 1996, Comput. Networks ISDN Syst..

[7] Robert E. Tarjan,et al. Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[8] Michel A. Reniers,et al. An Algebraic Semantics of Basic Message Sequence Charts , 1994, Comput. J..

[9] Joost-Pieter Katoen,et al. Pomsets for message sequence charts , 1998 .