论文信息 - An Automaton Interpretation of Message Sequence Charts

An Automaton Interpretation of Message Sequence Charts

We give a precise semantics to Message Sequence Charts (MSCs), by interpreting MSC speci cations by B uchi automata. The state transition graph is uniquely determined by the speci cation, but di erent automata may be de ned to accept di erent sets of traces allowed by the speci cation. The precise automaton chosen therefore depends on reliability properties of communications assumed by the speci cation. CR

Peter B. Ladkin | Stefan Leue | P. Ladkin | S. Leue

[1] Leslie Lamport,et al. The temporal logic of actions , 1994, TOPL.

[2] Â. È Ê Â Â Û Û Ò Ç ^ R R Ó Ae Ú Ú Ë Ë Â Ê Ì È Â Ê Â. Verifying Temporal Properties without Temporal Logic , 1988 .

[3] C. A. R. Hoare,et al. Communicating sequential processes , 1978, CACM.

[4] Bowen Alpern,et al. Recognizing safety and liveness , 2005, Distributed Computing.

[5] Peter B. Ladkin,et al. Compile-time analysis of communicating processes , 1992, ICS '92.

[6] Pierre Wolper,et al. Automata theoretic techniques for modal logics of programs: (Extended abstract) , 1984, STOC '84.

[7] Giuseppe De Giacomo,et al. An Automata-Theoretic Approach to , 2009 .