Modelling, specifying, and verifying message passing systems

We present a model for message passing systems unifying concepts of message sequence charts (MSCs) and Lamport diagrams. Message passing systems may be defined-similarly to MSCs-without having a concrete communication medium in mind. Our main contribution is that we equip such systems with a tool set of specification and verification procedures. We provide a global linear time temporal logic which may be employed for specifying message passing systems. In an independent step, a communication channel may be specified. Given both specifications, we construct a Buchi automaton accepting those linearisations of MSCs which satisfy the given formula and correspond to a fixed but arbitrary channel.

[1]  Anca Muscholl,et al.  Deciding Properties for Message Sequence Charts , 1998, FoSSaCS.

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

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

[4]  Ramaswamy Ramanujam,et al.  Reasoning about Message Passing in Finite State Environments , 2000, ICALP.

[5]  Moshe Y. Vardi.  An Automata-Theoretic Approach to Linear Temporal Logic , 1996, Banff Higher Order Workshop.

[6]  Nancy A. Lynch,et al.  Distributed Computing: Models and Methods , 1990, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[7]  A. Prasad Sistla,et al.  Automatic Temporal Verification of Buffer Systems , 1991, CAV.

[8]  A. Prasad Sistla,et al.  Can Message Buffers Be Axiomatized in Linear Temporal Logic? , 1984, Inf. Control..

[9]  Doron A. Peled,et al.  Ten Years of Partial Order Reduction , 1998, CAV.

[10]  Zohar Manna,et al.  The Temporal Logic of Reactive and Concurrent Systems , 1991, Springer New York.

[11]  Leslie Lamport,et al.  Time, clocks, and the ordering of events in a distributed system , 1978, CACM.

[12]  Rajeev Alur,et al.  An Analyzer for Message Sequence Charts , 1996, Softw. Concepts Tools.

[13]  Igor Walukiewicz,et al.  An expressively complete linear time temporal logic for Mazurkiewicz traces , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[14]  Benedikt Bollig,et al.  Deciding LTL over Mazurkiewicz traces , 2001, Proceedings Eighth International Symposium on Temporal Representation and Reasoning. TIME 2001.