Interpreting Message Flow

We give a semantics for Message Flow Graphs (MFGs), which play the role for interprocess communication that Program Dependence Graphs play for control flow in parallel processes. MFGs have been used to analyse parallel code, and are closely related to Message Sequence Charts and Time Sequence Diagrams in telecommunications systems. Our requirements are firstly, to determine unam- biguously exactly what execution traces are specified by an MFG, and secondly, to use a finite-state interpretation. Our methods function for both asynchronous and synchronous communications. From a set of MFGs, we define a transition system of global states, and from that a Btichi automaton by considering safety and liveness properties of the system. In order easily to describe liveness proper- ties, we interpret the traces of the transition system as a model of Manna-Pnueli temporal logic. Finally, we describe the expressive power of MFGs by mimicking an arbitrary Biichi automaton by means of a set of MFGs.

[1]  Reinhard Gotzhein,et al.  Temporal Logic and Applications-A Tutorial , 1992, Comput. Networks ISDN Syst..

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

[3]  Pierre Wolper.  Temporal Logic Can Be More Expressive , 1983, Inf. Control..

[4]  Reinhard Gotzhein,et al.  Formal Description Techniques IX , 1996, IFIP Advances in Information and Communication Technology.

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

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

[7]  J. Rushby,et al.  Formal verification of algorithms for critical systems , 1991, SIGSOFT '91.

[8]  Bowen Alpern,et al.  Verifying temporal properties without temporal logic , 1989, TOPL.

[9]  Barbara Simons,et al.  Static Deadlock Analysis for CSP-Type Communications , 1995, Responsive Computer Systems.

[10]  Albert Benveniste,et al.  programmi language and its , 2001 .

[11]  C. A. R. Hoare,et al.  Communicating Sequential Processes (Reprint) , 1983, Commun. ACM.

[12]  Urs Eppenberger.  X.500 Directory Service Usage for X.400 E-Mail , 1993, Comput. Networks ISDN Syst..

[13]  William E. Lorensen,et al.  Object-Oriented Modeling and Design , 1991, TOOLS.

[14]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[15]  Martin Peschke,et al.  Design and Validation of Computer Protocols , 2003 .

[16]  Reinhard Gotzhein,et al.  Formal Definition and Representation of Interaction Points , 1992, Comput. Networks ISDN Syst..

[17]  Jos C. M. Baeten,et al.  Delayed choice: an operator for joining Message Sequence Charts , 1994, FORTE.

[18]  P. Le Guernic,et al.  Hybrid dynamical systems theory and the Signal language , 1990 .

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

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

[21]  Albert Benveniste,et al.  The synchronous approach to reactive and real-time systems , 1991 .

[22]  David Cohen,et al.  An Experiment in Analyzing Switch Recovery Procedures , 1992, FORTE.

[23]  Gérard Berry,et al.  The Esterel Synchronous Programming Language: Design, Semantics, Implementation , 1992, Sci. Comput. Program..

[24]  Pierre Wolper,et al.  Using partial orders for the efficient verification of deadlock freedom and safety properties , 1991, Formal Methods Syst. Des..

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

[26]  Wayne Citrin,et al.  An environment for interactive design of communications architectures , 1990, PSTV.

[27]  Wolfgang Thomas,et al.  Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[28]  Lenore D. Zuck,et al.  Timed Ethernet: Real-Time Formal Specification of Ethernet , 1992, CONCUR.

[29]  L. Ferreira Pires,et al.  Protocol Design and Implementation Using Formal Methods , 1992, Comput. J..

[30]  Michael Z. Spivey,et al.  The Z notation , 1989 .

[31]  Krishan K. Sabnani,et al.  Protocol specification, testing, and verification, VIII : proceedings of the IFIP WG 6.1 Eighth International Symposium on Protocol Specification, Testing, and Verification, Atlantic City, New Jersey, USA, June 7-10, 1988 , 1988 .