| J.A. Bergstra, C.A. Middelburg, and Y.S. Usenko. Discrete time process algebra and the semantics of SDL. CWI Report SEN-R9809, Centre for Mathematics and Computer Science, June 1998. To appear in J.A. Bergstra, A. Ponse and S.A. Smolka, editors, Handbook of Process Algebra, Elsevier. |
....in 1974 and it has been standardized by CCITT in 1988 [IT94c] sdl is based on extended finite state machines communicating asynchronously via queues. There exists a formal semantics of the language defined in [IT94a,IT94b] various authors have criticized it and proposed alternative ones [Bro91,BMU98,God91] to name only a few of them. Currently, sdl is widely accepted by the industrial community. This is due mainly to the fact that sdl development is supported by methodologies [OFMP 94] and tools [Ver96,AB93] in all phases from requirement analysis, design and validation to ....
J.A. Bergstra, C.A. Middelburg, and Y.S. Usenko. Discrete Time Process Algebra and the Semantics of SDL. Technical Report SEN-R9809, CWI, June 1998.
....covers sdl systems, processes, blocks and channels is given in [God91] It defines a method to build labeled transition systems from sdl specifications. The approach is relatively complete, however in this case too, time is not handled in a satisfactory manner. An important work is done in [BM95, BMU98] which gives a semantics based on process algebra to a rather simple subset of sdl, called Gamma sdl. A method is given, for translating each sdl system into a term of PA Gamma drt ID which is a discrete time process algebra extended with propositional signals and conditions, counting ....
J.A. Bergstra, C.A. Middelburg, and Y.S. Usenko. Discrete Time Process Algebra and the Semantics of SDL. Technical Report SEN-R9809, CWI, June 1998.
....in 1974 and it has been standardized by CCITT in 1988 [IT94] sdl is based on extended finite state machines communicating asynchronously via queues. There exists a formal semantics of the language defined in [IT94] various authors have criticized it and proposed alternative ones, such as [Bro91,BMU98,God91] to name only a few of them. Currently, sdl is widely accepted by the industrial community. This is due mainly to the fact that sdl development is supported by methodologies [OFMP 94] and commercial tools [Ver96,AB93] in all phases from requirement analysis, design and validation to ....
J.A. Bergstra, C.A. Middelburg, and Y.S. Usenko. Discrete Time Process Algebra and the Semantics of SDL. Technical Report SEN-R9809, CWI, June 1998.
....which covers sdl systems, processes, blocks and channels is given in [9] It defines a method to build labeled transition systems from sdl specifications. The approach is relatively complete, however in this case too, time is not handled in a satisfactory manner. An important work is done in [10,11] which gives a semantics based on process algebra to a rather simple subset of sdl, called Gamma sdl. A method is given, for translating each sdl system into a term of PA psc drt ID which is a discrete time process algebra extended with propositional signals and conditions, counting ....
J.A. Bergstra, C.A. Middelburg, and Y.S. Usenko. Discrete Time Process Algebra and the Semantics of SDL. Technical Report SEN-R9809, CWI, June 1998.
.... in the setting of the discrete time extension of ACP presented in [5] This extension has already been used as the basis of the semantics of some languages related to programming, e.g. the language T of the ToolBus software interconnection architecture [9] and a semantically clear subset of SDL [10]; and it is envisaged to use it for the semantics of other languages related to programming as well, e.g. a tractable subset of a widely used modern programming language such as C [33] or Java [2] A useful topic for further work is the lifting of the results from Section 5 concerning the ....
J.A. Bergstra, C.A. Middelburg, and Y.S. Usenko. Discrete time process algebra and the semantics of SDL. CWI Report SEN-R9809, Centre for Mathematics and Computer Science, June 1998. To appear in J.A. Bergstra, A. Ponse and S.A. Smolka, editors, Handbook of Process Algebra, Elsevier.
....referred to in this chapter. Some of those versions have been successfully used for describing and analyzing systems and protocols of various kinds, see e.g. 16] 27] 31] 32] 40] 41] and [45] as well as for de ning semantics of programming and speci cation languages, see e.g. 12] [14] and [17] We did not give explicit consideration to other algebraic concurrency theories that deal with time dependent behaviour. In general, they have urgent actions and relative timing. This is, for example, the case with ATP [37] the di erent versions of CCS with timing [19, 35, 44] and TIC ....
J.A. Bergstra, C.A. Middelburg, and Y.S. Usenko. Discrete time process algebra and the semantics of SDL. Chapter 6.2 of this issue.
....with timing referred to in this paper. Some of those versions have been successfully used for describing and analyzing systems and protocols of various kinds, see e.g. 13] 22] 25] 33] 34] and [36] as well as for de ning semantics of programming and speci cation languages, see e.g. 10] [12] and [14] We did not give explicit consideration to other algebraic concurrency theories that deal with time dependent behaviour. In general, they have urgent actions and relative timing. This is, for example, the case with ATP [30] the di erent versions of CCS with timing [16, 28, 35] and TIC ....
J.A. Bergstra, C.A. Middelburg, and Y.S. Usenko. Discrete time process algebra and the semantics of SDL. CWI Report SEN-R9809, Centre for Mathematics and Computer Science, June 1998. To appear in J.A. Bergstra, A. Ponse and S.A. Smolka, editors, Handbook of Process Algebra, Elsevier.
No context found.
J.A.Bergstra, C.A.Middelburg and Y.S.Usenko. Discrete Time Process Algebra and the Semantics of SDL. Report SEN-R9809, Centrum voor Wiskunde en Informatica (CWI), June 1998, the Netherlands.
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