| Ian G. Clark. A Unified Approach to the Study of Asynchronous Communication Mechanisms in Real Time Systems. PhD thesis, King's College, London University, May 2000. |
....not the additional desirable property that the reader always obtains recently written data. Furthermore, they conduct their examination by theorem proving (in PVS) whereas we note that, apart from the data communicated, the algorithm is finite state and can be examined by model checking. Clark [Cla00] examines several algorithms, including Simpson s, using Petri nets; we compare this work with ours in Chapter 3. We use the SAL model checking environment to examine Simpson s algorithm and show that concurrent reads and writes are indeed noninterfering but that access to the most recently ....
....behaviors (the counterexamples that exposed flawed assumptions were all found using only two values) Thus, we consider our model checking of the atomicity property to provide very strong, but not conclusive, evidence for correctness of Simpson s algorithm with atomic control registers. Clark [Cla00] has examined several atomic register constructions, including Simpson s, using Petri nets. His Petri net models are much further removed from the natural presentation of the algorithms than our SALenv specifications, and the required properties are also stated indirectly. Clark s treatment of ....
[Article contains additional citation context not shown here]
Ian G. Clark. A Unified Approach to the Study of Asynchronous Communication Mechanisms in Real Time Systems. PhD thesis, King's College, London University, May 2000.
....focussing on the work of Lamport, who first introduced the topic) but similar constructions were developed independently in the avionics and real time communities. The best known of these is the four slot protocol of Simpson [72] Formal analyses of Simpson s protocol have been developed by Clark [10] (using Petri nets) by Rushby [59] using model checking) and by Henderson and Paynter [18] using PVS) Hesselink [21] have verified some atomic register constructions from the computer science literature using ACL2. TTA uses a protocol called NBW (nonblocking write) 29] whose wait free ....
Ian G. Clark. A Unified Approach to the Study of Asynchronous Communication Mechanisms in Real Time Systems. PhD thesis, King's College, London University, May 2000. 15
....This is because for these systems, asynchrony is secondary to the preservation of data. These solutions are without data loss and repetition so have to maintain some synchronization. We do not cover these well studied ACMs in this paper. Pool ACMs have been extensively studied [3] 7] 9] [11]. The attention of this paper will be focused on the other two ACM types. High level definitions of both Signal and Message, which describe the basic asynchrony and data passing requirements, will be given in Petri net [8] form. Algorithmic forms of these ACMs, derived from results of hardware ....
....coherence, freshness, and sequencing. The ultimate goal of this study is to find out if the algorithms correctly implement the definitions given in Figures 4 and 5. These models are mainly in basic P T net format with additional techniques employed to simplify the modelling. 4. 1 Or arcs OR arcs [11] are an extension to standard Petri nets for the purpose of reducing model size without affecting model functionality. In the construction of safe, cyclic Petri net models with reference arcs (arcs with arrows at both ends, simulating a pair of arcs pointing to opposite directions between the same ....
[Article contains additional citation context not shown here]
Clark, I.G., "A unified approach to the study of asynchronous communication mechanisms in real time systems", Ph.D. Thesis, London University, King's College, May 2000. (Downloadable from: http://www.eee.kcl.ac.uk/~ianc/)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC