Abstract | ||
---|---|---|
We propose a semantics for Message Sequence Charts (MSCs). Our requirements are:to determine unambiguously which execution traces are allowed by an MSC; and to usea finite-state interpretation. Our semantics handles both synchronous and asynchronouscommunication. We define a global state automaton from an MSC, by first defining atransition system of global states, and from that a Buchi automaton. In using MSCs,properties of the environment and liveness properties of the MSC itself may be... |
Year | Venue | Keywords |
---|---|---|
1993 | FORTE | message sequence charts mean,message sequence chart |
Field | DocType | Volume |
Programming language,Computer science,Protocol specification,Verification | Conference | 22 |
ISSN | ISBN | Citations |
0926-549X | 0-444-81773-5 | 22 |
PageRank | References | Authors |
5.83 | 8 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Peter B. Ladkin | 1 | 626 | 90.51 |
Stefan Leue | 2 | 1199 | 108.55 |