Affiliation:
1. Dept. of Computing Science, University of Stirling, UK
2. Institut für Informatik, Universität Bern, Switzerland
Abstract
Abstract
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 unambiguously 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 Büchi automaton by considering safety and liveness properties of the system. In order easily to describe liveness properties, 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 Büchi automaton by means of a set of MFGs.
Publisher
Association for Computing Machinery (ACM)
Subject
Theoretical Computer Science,Software
Reference60 articles.
1. Recognizing safety and liveness
2. Aggrawal S. and Sabnani K.: editors. Protocol Specification Testing and Verification VIII. Proceedings of the IFIP WG 6.1 Eighth International Symposium on Protocol Specification Testing and Verification . North Holland 1989.
3. Verifying temporal properties without temporal logic
4. Berry G. and Gonthier G.: The Esterel synchronous programming language: Design semantics implementation. Rapport de Recherche 842 Institut National de Recherche en Informatique et en Automatique (INRIA) 1988.
Cited by
48 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Stellar: A Programming Model for Developing Protocol-Compliant Agents;Engineering Multi-Agent Systems;2019
2. Coping with Bad Agent Interaction Protocols When Monitoring Partially Observable Multiagent Systems;Advances in Practical Applications of Agents, Multi-Agent Systems, and Complexity: The PAAMS Collection;2018
3. Static deadlock detection for concurrent go by global session graph synthesis;Proceedings of the 25th International Conference on Compiler Construction;2016-03-17
4. Controllable-Choice Message Sequence Graphs;Mathematical and Engineering Methods in Computer Science;2013
5. A framework for pathologies of message sequence charts;Information and Software Technology;2012-11