The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This short introduction to an algebraic approach to concurrency has necessarily omitted some intricate details, as well as paying no attention to other algebraic approaches (for example, Vaughan Pratt has suggested an approach which generalises the Kahn networks in a different manner). What we hope to have shown is that four kinds of operator — namely atomic action (α.), summation (+), product (&...
This paper attempts to lend perspective to several different methods that have been employed for specifying computer communication protocols by comparing a spectrum of specification techniques. The paper characterizes specification languages such as state transition diagrams, variants of temporal logic approaches, and sequence expressions by the extent to which information is encoded as properties...
The main thesis of this paper is that the analysis of concurrent programs (i.e. their specifications, their proofs of correctness, deadlockfreeness, etc.), can be done by using methods very similar to those used for analysing sequential programs. This approach, which is certainly not new (for instance see (1),(5),(12), and (13) among others), is illustrated by various examples. The first...
In this note we sketch how an abstract mathematical model can be used to specify the two-way channel. We see how theorems proved about the abstract specification suggest designs of processes which satisfy it. The model used can express safety and liveness properties and allows non-determinism. It does not deal with fairness however.
A hierarchical specification method is given which, through the use of a past time temporal logic, handles both safety and liveness requirements. The technique is applied to the specification of a "two way channel with disconnect", and in the partial development of a "packet switching communications network". An inference rule for the justification of parallel composition is indicated.
In this paper we show how trace theory can be used to describe the behaviour of "concurrent systems". We present a short introduction to trace theory. We also discuss a program notation that specifies the trace set of a component. As an example we derive a solution for one of the problems of the STC Workshop [5].
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.