J. C. M. Baeten, editor. Applications of Process Algebra. Cambridge University Press, 1990.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....on correctness issues of the specified systems more complicate. In particular, new verification techniques have to be investigated [AD96] for such a generalised framework. We aim to adopt and combine existing verification techniques that are already well established for process algebras [Mil89, Bae90] and functional programming [Cle87] respectively. To achieve this goal it appears more promising to provide a restricted interface between both paradigms as it is done in ProFun. An similar asymmetric integration of the data sublanguage into a process algebra can be found in the specification ....

J.C.M. Baeten, editor. Applications of Process Algebra. Cambridge University Press, 1990.

....static analysis (e.g. type inference) necessarily gives weaker results. Moreover, new verification techniques have to be investigated [FHJ95, AD96] for such a generalised framework. We aim to adopt and combine existing verification techniques that are already well established for process algebras [Mil89, Bae90] and functional programming [Cle87] respectively. To achieve this goal it appears more promising to provide a restricted interface between both paradigms as it is done in ProFun. The functional concurrent language Erlang differs in various aspects from ProFun. Erlang is type less and ....

J.C.M. Baeten, editor. Applications of Process Algebra. Cambridge University Press, 1990.

....completely defined. 3. 5 Semantics of Task Structures through Process Algebra In this section the semantics of task structures is defined by means of a translation to Process Algebra ( BW90a] Process Algebra has been applied to specify and verify a variety of processes and protocols (see e.g. Bae90] One of its virtues is its ability to prove equivalence of process specifications. As an algebraic theory Process Algebra belongs to the same family as CCS [Mil89] and CSP [Hoa85] First a short introduction to the important ingredients of Process Algebra is given (for an in depth treatment we ....

J.C.M. Baeten, editor. Applications of Process Algebra. Cambridge University Press, Cambridge, United Kingdom, 1990. 29

.... type of process and process decompositions, can complicate correct workflow execution, we show how a formal semantics can be assigned for the constructs using a formal language from the Process Algebra family, the Algebra of Communicating Processes (ACP) 4] which has had significant applications [3]. 2. Essential process control concepts The specification of workflows in general is known to be quite complex and many issues are involved. Workflow specifications should incorporate execution dependencies between tasks, information flow between tasks, access to distributed databases, temporal ....

J.C.M. Baeten, editor. Applications of Process Algebra. Cambridge University Press, Cambridge, United Kingdom, 1990.

....advanced techniques, such as model checking [Clarke et al. 1986] work. However, only with the advent of verification tools [Cleaveland et al. 1993; Henzinger et al. 1997; Holzmann 1991; Larsen et al. 1997] in the last decade have formal approaches emerged as practical aids for system designers [Baeten 1990; Cleaveland et al. 1996; Elseaidy et al. 1996] This paper addresses the problem of modeling and verifying concurrent systems where real time plays an important role for their functional behavior. On the one hand, real time is often used to implement synchronization constraints in distributed ....

Baeten, J., Ed. (1990), Applications of Process Algebra, volume 17 of Cambridge Tracts in Theoretical Computer Science, Cambridge University Press, Cambridge, UK.

.... including process algebraic frameworks (Milner 1989) and model checking (Clarke et al. 1986, Kozen 1983) However, only with the advent of verification tools (Bengtsson et al. 1995, Cleaveland Sims 1996, Holzmann 1991) in the last decade they have emerged as practical aids for system designers (Baeten 1990, Cleaveland et al. 1996, Elseaidy et al. 1996) This paper addresses the problem of modeling and verifying concurrent systems where real time plays an important role for functional behavior. On the one hand, real time is used to implement abstract synchronization constraints in distributed ....

Baeten, J., ed. (1990), Applications of Process Algebra, Vol. 17 of Cambridge Tracts in Theoretical Computer Science, Cambridge University Press, Cambridge, England.

....Petri Nets [9] could be used as interface graphs and as a basis for structural and behavioural analysis. This aspect may also treated by means of approaches similar to nets. For example, COSY [10] trace theory (cf. Mazurkiewicz in [9] as well as the different notions of process algebra, e.g. [11, 12], may be useful. The observable actions of a module can be defined also in terms of state machines, especially those of [13] The ideas to combine structural reasoning with variable states arose from the work on axiomatic semantics and verification for parallel programs [5, 7] as well as from work ....

J.C.M. Baeten [ed]. Applications of Process Algebra. Cambridge University Press, New York, USA, 1987.

....same type of process and process decompositions, can complicate correct workflow execution. We show how a formal semantics can be assigned for the constructs using a formal language from the Process Algebra family, Algebra of Communicating Processes (ACP) 5] which has had significant applications [4]. The organisation of this paper is as follows. In section 2, we describe the modelling extensions and their contribution to concurrent workflow coordination. Examples are drawn from an industrial case study, the tenure administration of Road Closures documented in [7] In section 3, the formal ....

.... to the same family as CSP [15] and CCS [21] Our translation is based on a particular Process Algebra, the Algebra of Communicating Processes with the empty action (which we will abbreviate to ACP ) An in depth description may be found in [5] with a useful set of applications described in [4]. The axioms of ACP are listed in Table 1. The units of Process Algebra are atomic actions. The set of all atomic actions is called A . Starting with atomic actions, new processes can be constructed by applying sequential and alternative composition ( Delta resp. The algebra that ....

J.C.M. Baeten, editor. Applications of Process Algebra. Cambridge University Press, Cambridge, United Kingdom, 1990.

....Since there are many views of what exactly constitutes a process, the theory avoids trying to capture all possible properties a process may have. Instead it treats processes in an axiomatic way. Throughout the years Process Algebra has proven its value in various application domains (see e.g. [4]) The need for formal foundations of specifications and specification techniques has been stressed by various authors (see e.g. 5, 6] In this paper, we will focus on the definition of the formal semantics of task structure diagrams through a translation to Process Algebra. Furthermore, we will ....

.... ; o 2 ) Sup(o 1 ) Sup(o 2 ) 4 Semantics of Task Structure Diagrams In this section we will define the semantics of task structure diagrams by means of a translation to Process Algebra ( 3] Process Algebra has been applied to specify and verify a variety of processes and protocols (see e.g. [4]) One of its virtues is the ability to prove equivalence of process specifications. Another advantage of Process Algebra is that it has few concepts but a great expressive power. As an algebraic theory Process Algebra belongs to the same family as CCS [8] and CSP [9] In section 4.1 we will ....

[Article contains additional citation context not shown here]

J.C.M. Baeten, editor. Applications of Process Algebra. Cambridge University Press, Cambridge, United Kingdom, 1990.

....on the same principles. Our translation is based on a particular Process Algebra, the Algebra of Communicating Processes with the empty action and process creation (which we will abbreviate to ACP c ) An in depth description may be found in [BW90] with a useful set of applications described in [Bae90]. The axioms of ACP c are listed in Table 1. The units of Process Algebra are atomic actions. The set of all atomic actions is called A . Although they are units of calculation, atomic actions need not be indivisible (see [GW96] Starting with atomic actions, new processes can be constructed ....

J.C.M. Baeten, editor. Applications of Process Algebra. Cambridge University Press, Cambridge, United Kingdom, 1990.

....by interpreting the language into labelled transition systems, or axiomatically by postulating the appropriate algebraic laws. The LOTOS specification language [vEVD89] uses CCS as a semantic basis, and several examples of protocol verifications within this or closely related theories exist [BK84, Koo85, SFD85, LM87, Par88, BSV88, BA90, Bae90, EFJ91], some of which used automated tools. One limitation of traditional process algebras is that the linkage between processes cannot change as the processes execute. The linkage is determined by the choice of port names (an output action can only combine with an input action on the same port) and ....

J.C.M. Baeten, editor. Applications of Process Algebra. Cambridge University Press, 1990.

.... algebra has been used to give a semantics to a communications protocol language, LOTOS; a parallel object oriented language, POOL; a computer integrated manufacturing system; and to the specification of low level digital hardware; these and other applications of process algebra may be found in [Mil85, Bae90, Bri88]. Of the formalisms, all except CIRCAL are for specifying asynchronous systems. CIRCAL is similar to SCCS, and our choice of SCCS is largely pragmatic: there is a large body or research to draw upon for doing formal analysis, and there are also tools available. There has been some research into ....

J.C.M. Baeten, editor. Applications of Process Algebra. Cambridge University Press, 1990.

....is completely defined. 3. 5 Semantics of Task Structures through Process Algebra In this section the semantics of task structures is defined by means of a translation to Process Algebra ( BW90] Process Algebra has been applied to specify and verify a variety of processes and protocols (see e.g. Bae90] One of its virtues is its ability to prove equivalence of process specifications. As an algebraic theory Process Algebra belongs to the same family as CCS [Mil89] and CSP [Hoa85] First a short introduction to the important ingredients of Process Algebra is given (for an in depth treatment we ....

J.C.M. Baeten, editor. Applications of Process Algebra. Cambridge University Press, Cambridge, United Kingdom, 1990.

....to standard works that have a strong relation to the general research themes of the project. Important general presentations of the process algebraic theory of concurrency and some applications can be found in [Mil80, Mil89, Hoa85, BW90] Further applications of the theory can be found in [Bae90, vEVD89, Tur93] An interesting introduction to a theory of design at a more informal level can be found in [Sim69] The area of tool environments for design support is relatively new and therefore less developed. Currently, their are no real standard references in this particular area. Much of ....

J.C.M. Baeten. Applications of Process Algebra. Cambridge University Press, 1990.

No context found.

J. C. M. Baeten, editor. Applications of Process Algebra. Cambridge University Press, 1990.

No context found.

J.C.M. Baeten, editor. Applications of Process Algebra. Cambridge University Press, Cambridge, United Kingdom, 1990.

No context found.

J. C. M. Baeten, editor. Applications of Process Algebra. Cambridge University Press, 1990.

No context found.

J. C. M. Baeten, editor. Applications of Process Algebra. Cambridge University Press, 1990.

No context found.

J. C. M. Baeten, editor. Applications of Process Algebra. Cambridge University Press, 1990.

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