T. Axford, Concurrent Programming Fundamental Techniques for Real Time and Parallel Software Design, John Wiley & Sons, New York, 1989.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....[44] the family of finite degree state languages, see [23] An anti AFL is a family of languages that is not closed under any of the AFL operations. For all other notions and results in formal languages that are used in this paper we refer the reader to [43] The reader may consult [34] 35] [2] , 3] or [18] for general results concerning the theory of concurrency. However, our approach will not use these results. In the sequel we recall some operations from formal languages that simulate the parallel composition of words. The shuffle operation, denoted by tt, it is defined recursively ....

T. Axford, Concurrent Programming Fundamental Techniques for Real Time and Parallel Software Design, John Wiley & Sons, New York, 1989.

....of two languages L 1 and L 2 is : L 1 ttL 2 = u2L 1 ;v2L 2 uttv: It is well known that the shuffle operation is a commutative and an associative operation with the unit element . The shuffle operation is not suitable to describe the existence of re entrant routines. A re entrant routine, see [1], 3] is a routine that can be executed concurrently by more than one user (process) Throughout this paper the reader may consult the monograph [15] for all unexplained notions of formal languages. For general results concerning the theory of semirings, the reader may consult the monographs [5] ....

T. Axford; Concurrent Programming Fundamental Techniques for Real Time and Parallel Software Design, John Wiley & Sons, New York, 1989.

.... the local clocks of the synchronising actions match exactly (rule Sync) This seems reasonable, as any protocol which implements synchronisation requires a set up phase before the synchronisation can be said to have happened, during which what effectively happens is a synchronisation of clocks [4]. Moreover, our clocks are not supposed to model all of the features of physical clocks in actual implementations, so abstracting away from the details of clock synchronisation is not unreasonable. Note, though, that our assignment of clocks to each parallel process is rather close to Matthern s ....

....notion of refinement; we even forbid processes that are always quicker than an action from being valid refinements of it. We do this partly for technical reasons, and partly to emphasise that speed up is not always desirable; there are protocols which work at some speeds and fail at faster rates [4]. Note that we do not allow for refinement of actions by cIpa processes which are rooted branching bisimilar to Nil (since Delta(a) 0 for all a, and such processes have f0g for their dur) Moreover, we do not consider refinements for processes including restriction (as here dur is not defined) ....

T. Axford, Concurrent Programming: Fundamental Techniques for Real-Time and Parallel Software Design, Wiley, 1989.

....to the object oriented paradigm supports both forward and backward error recovery, backward error recovery being provided through distributed actions that are atomic with respect to exceptions. 1 Introduction The importance of software reliability is now widely accepted. As discussed in [Axford89] one of the key to greater software reliability is to be systematic and thorough. Therefore, programming language mechanisms that encourage such an approach during program design are likely to increase the reliability of the final software. In particular, structuring, simplicity in the design, ....

Axford (T.). -- Concurrent Programming: Fundamental Techniques for RealTime and Parallel Software Design. -- Wiley, 1989, Series in Parallel Computing.

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