| C. Groza. An experiment in implementing process algebra speci cations in a procedural language. |
....level description. In [1] LOTOS is synthesised to C, where each LOTOS process is mapped to a reentrant C function and where interaction is done via system calls of an operating system. Only a subset of the LOTOS primitives can be translated. Data can only partially be translated automatically. In [3] Process Specification Formalism (PSF) is translated to an extended version of C, which supports concurrent programming. PSF processes are translated to finite automata. Data must be translated partially by hand. Another approach that uses finite automata is demonstrated in [9] where Templated ....
....an abstract model and fill in more details in a later stage. Data in POOSL is object oriented and typeless data objects interact by sending messages to each other. Upon reception of such a message, the receiving data object calls a corresponding data method. This method synthesis method [1] 2] [3] [4] 5] 6] 7] 8] 9] specification language LOTOS PSF C like, based on CSP formalisms Estelle Esterel Templated T LOTOS target language C extended C C C C C subset of source language yes yes yes uses OS yes yes no no no yes yes scheduling method static static, uses EDF ....
C. Groza, "An Experiment in Implementing Process Algebra Specifications in a Procedural Language", Workshop in computing, Algebra of Communication Processes, Utrecht, ed. A. Ponse, C. Verhoef, S.F.M. van Vlijmen, Springer Verlag, London, 1994.
No context found.
C. Groza. An experiment in implementing process algebra speci cations in a procedural language.
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