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 finitestate 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��uchi 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��uchi automaton by means of a set of MFGs. 1.
|
2762
|
Communication and Concurrency
– Milner
- 1989
|
|
1524
|
Object-Oriented Modeling and Design
– Rumbaugh, Blaha, et al.
- 1991
|
|
1345
|
The Temporal Logic of Reactive and Concurrent Systems: Specification
– Manna, Pnueli
- 1992
|
|
737
|
The temporal logic of actions
– Lamport
- 1994
|
|
714
|
Design and Validation of Computer Protocols
– Holzmann
- 1991
|
|
562
|
The Esterel synchronous programming language: Design, semantics, implementation
– Berry, Gonthier
- 1992
|
|
410
|
Real-Time Object-Oriented Modeling
– Selic, Gullekson, et al.
- 1994
|
|
387
|
Automata on infinite objects
– Thomas
- 1990
|
|
283
|
The synchronous approach to reactive and real-time systems
– Benveniste, Berry
- 1991
|
|
183
|
unknown title
– ISO
- 1989
|
|
168
|
Temporal Logic Can Be More Expressive
– Wolper
- 1983
|
|
141
|
The Z Notation
– Spivey
- 1988
|
|
138
|
Using partial orders for the efficient verification of deadlock freedom and safety properties
– Godefroid, Wolper
- 1991
|
|
125
|
Recognizing safety and liveness
– Alpern, Schneider
- 1987
|
|
96
|
Trace theory
– Mazurkiewicz
- 1987
|
|
92
|
Synchronous programming with events and relations: the SIGNAL language and its semantics
– Benveniste, Guernic, et al.
- 1991
|
|
67
|
Reniers. An algebraic semantics of basic message sequence charts
– Mauw, A
- 1994
|
|
65
|
Hybrid dynamical systems theory and the SIGNAL language
– Benveniste, Guernic
- 1990
|
|
45
|
A hierarchy of temporal properties
– Manna, Pnueli
- 1990
|
|
44
|
A Formal Description Technique Based on an Extended State Transition Model
– ESTELLE
- 1988
|
|
38
|
Formal verification of algorithms for critical systems
– Rushby, Henke
- 1993
|
|
35
|
Occam Programming Manual
– Ltd
- 1983
|
|
33
|
Verifying temporal properties without temporal logic
– Alpern, Schneider
- 1989
|
|
24
|
Delayed choice: an operator for joining Message Sequence Charts
– Baeten, Mauw
- 1995
|
|
17
|
What do message sequence charts mean
– Ladkin, Leue
- 1994
|
|
16
|
Automata on in nite objects
– Thomas
- 1990
|
|
16
|
Computer aided verification
– Clarke, Kurshan
- 1996
|
|
15
|
Temporal logic and applications - a tutorial
– Gotzhein
- 1992
|
|
14
|
Compile-time analysis of communicating processes
– Ladkin, Simons
- 1992
|
|
13
|
Recommendation Z.120: Message Sequence Chart (MSC
– CCITT
- 1992
|
|
12
|
Interpreting Message Sequence Charts
– Ladkin, Leue
- 1992
|
|
12
|
Four issues concerning the semantics of Message Flow Graphs
– Ladkin, Leue
- 1995
|
|
11
|
Formal veri cation of algorithms for critical systems
– Rushby, Henke
- 1993
|
|
9
|
Protocol Design and Implementation using Formal Methods
– Sinderen, Pires, et al.
- 1992
|
|
9
|
a powerful dialect of Estelle for OSI protocol description
– Estelle
- 1988
|
|
7
|
An environment for interactive design of communication architectures
– Cockburn, Citrin, et al.
- 1990
|
|
5
|
Static Analysis of Interprocess Communication
– Ladkin, Simons
- 1994
|
|
5
|
Timed Ethernet: Real-time formal specification of Ethernet
– Weinberg, Zuck
- 1992
|
|
3
|
Static analysis of concurrent communicating loops
– Ladkin, Simons
- 1992
|
|
3
|
editors. Computer Aided Verification
– Larsen, Skou
- 1992
|
|
3
|
An Experiment in Analysing Switch Recovery Procedures
– Cohen, Dorn
- 1993
|
|
3
|
SDL and OSI: On the use of CCITT-SDL in the context of OSI. Habilitation Thesis
– Hogrefe
- 1989
|
|
2
|
Static deadlock analysis for CSP-type communications
– Ladkin, Simons
- 1994
|
|
2
|
Applying finite-state methods to infinite-state systems
– Lamport
- 1992
|
|
2
|
editors. Protocol Specification, Testing and Verification
– Logrippo, Probert, et al.
- 1991
|
|
2
|
An executable specification language for historysensitive systems
– Cockburn, Citrin
- 1991
|
|
2
|
Formal definition and representation of interaction points
– Gotzhein
- 1992
|
|
1
|
Automata-theoretic veri cation of communicating processes. Unpublished lecture notes
– Kurshan
- 1992
|
|
1
|
Using tense logic to describe digital computing systems
– Ladkin
- 1993
|
|
1
|
Applying nite-state methods to in nite-state systems. TLA Mailing List Note
– Lamport
- 1992
|
