J.F. Groote and A. Ponse. The syntax and semantics of CRL. In A. Ponse, C. Verhoef, and S.F.M. van Vlijmen, editors, Algebra of Communicating Processes, Workshops in Computing, pages 26--62. Springer-Verlag, 1995.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....several optimizations [24, 25] improve both sequential and parallel application performance. Among them, the automatic home node migration reduces the amount of synchronization, by automatically appointing the processor that is likely to access a region most often as the region s home. CRL [10] is a formal language for specifying protocols and distributed systems in an algebraic style. To each CRL specification there belongs a labeled transition system (LTS) in which the edges between states are labeled with actions. The CRL toolset [3] can be used in combination with CADP [7] to ....

....hiding # I (p) renames all occurrences in p of actions from the set I into # . The data part contains equational specifications; one can declare sorts and functions working upon these sorts, and describe the meaning of these functions by equations. The syntax and semantics of CRL are given in [10]. The CRL toolset [3] is a collection of tools for analyzing and manipulating CRL specifications, based on term rewriting and linearization techniques.The CRL toolset, together with the CADP toolset [7] which acts as a backend for the CRL toolset, features visualization, simulation, LTS ....

J. Groote and A. Ponse. The syntax and semantics of CRL. In Proceedings 1st Workshop on the Algebra of Communicating Processes, Workshops in Computing Series, pages 26--62. Springer-Verlag, 1995.

....allowing one to express many sortedness, general binding mechanisms, and substitutions. Such variable binding mechanisms are widely used in SOS semantics for, e.g. concurrent and functional programming languages [32, 162, 178, 185, 197] the calculus [161] value passing process algebras [109, 121, 122], process algebras with recursion [128, 158] and timed process algebra [86] Several concepts in the setting of operational semantics with variable binding, which seem to be intuitively clear at first sight, turn out to be ambiguous when studied more carefully. In order to obtain a formal ....

....ffl or ae has a premise of the form t 1 or t 0 P , where 0 2 F ( Sigma 0 ) FV (t 0 ) EV (u ) where u denotes the source of ae 1 , a, or P is fresh. Theorem 6. 9 can be applied to extensions of higher order TSSs such as process algebra with time [86, 167] or data [109], where binding constructs enable one to parameterize processes over the time or data domain, process algebra with a recursive operator like the construct [118, 122, 197] the calculus [161, 196] and the lazy calculus [120, 195] 7 Denotational Semantics Following a bias towards operational ....

J. F. Groote and A. Ponse, The syntax and semantics of CRL, in Ponse et al. [181], pp. 26--62.

....Note: This research is supported by the Dutch Technology Foundation STW under the project CES5008: Improving the quality of embedded systems using formal design and systematic testing. 1. Introduction In order to make data a first class citizen in the study of processes, the language CRL [GP95] combines the process algebra ACP [BW90] with equational abstract data types [LEW96] Processes are intertwined with data: Actions and recursion variables are parametrized by data types; an if thenelse construct allows data objects to influence the course of a process; and alternative ....

....gave an adaptation of the cones and foci method from [GS01] to a timed setting, modulo timed branching bisimulation equivalence. We leave it as an open question whether our innovations for the cones and foci method can also be introduced in this timed setting. 2. Preliminaries 2. 1 CRL CRL [GP95] is a language for specifying distributed systems and protocols in an algebraic style. It is based on process algebra extended with equational abstract data types. In a CRL specification, one part specifies the data types, while a second part specifies the process behavior. We do not describe the ....

[Article contains additional citation context not shown here]

J.F. Groote and A. Ponse. The syntax and semantics of CRL. In A. Ponse, C. Verhoef, and S.F.M. van Vlijmen, editors, Proceedings of 1st Workshop on the Algebra of Communicating Processes, Workshops in Computing Series, pages 26--62. Springer-Verlag, 1995.

....signals is OE c oe rel (x) oe rel (OE c x) with the intuition that the passage of time cannot change the propositions that hold in the current state of a process. summation over data domains We will in addition use actions parametrized by data and summation over a data domain as in CRL [20, 21]. The notation a(d 1 ; d n ) where the d i s denote data values, is used for instances of parametrized actions. In x:D P , the scope of the variable x is exactly P . The behaviour of x:D P is a choice between the instances of P for the different values that x can take, i.e. the ....

J.F. Groote and A. Ponse. The syntax and semantics of CRL. In A. Ponse, C. Verhoef, and S.F.M. van Vlijmen, editors, Algebra of Communicating Processes 1994.

....part of the system with suitable formalisms. Algebraic specification languages and process algebras are respectively appropriate to specify the static part and the dynamic one. Several works have dealt with the combination of these languages; some wellknown results are LOTOS [2] PSF [7] and CRL [3]. In a similar direction, we have proposed a formalism which combines CCS with CASL [15] We extend this kind of formal combination to enable the specifier to be free to choose his her specification languages. Indeed, s)he could prefer a formalism for different reasons: suitability with reference ....

J. F. Groote and A. Ponse. The Syntax and Semantics of CRL. In A. Ponse, C. Verhoef, and S. F. M. van Vlijmen, eds., Proceedings of the 1st Workshop on the Algebra of Communicating Processes (ACP'94), Workshops in Computing Series, pages 26--62. Springer-Verlag, 1995.

....both the discrete model and the continuous model described in the previous sections into one model. This hybrid model then has to be intuitive, readable and concise. Using the formalism timed CRL [9] these goals can easily be achieved: the discrete model is easily translated to a model in CRL [10], and the timed features of timed CRL allow for a synchronisation of the continuous model and the discrete model in an intuitive fashion. For modelling the belt in a more detailed fashion, it is assumed that the following requirements hold: The belt is equipped with sensors, which are ....

J.F. Groote and A. Ponse. The syntax and semantics of  CRL. In A. Ponse, C. Verhoef, and S.F.M. van Vlijmen, editors, Algebra of Communicating Processes, Workshop in Computing, pages 26-62. Springer-Verlag, 1994.

.... algebras come in several variants (e.g. CSP [10] CCS [11] Lotos [4] ACP [3] Application of process algebras in the domain of hybrid systems is not unprecedented (e.g. 8] 5] In this paper, the use of various techniques, originally developed for the untimed and timed variants of CRL [7] are shown in the context of hybrid systems. Most notably, the use of invariants for proving conformance to design requirements of a system, is sketched. Some parts are illustrated by means of a simpli ed version of the case study that appeared in [12] consisting of a conveyor belt system. This ....

....parts of the case study and section IV describes the possibilities for analysis and veri cation. Section V concludes with some remarks, discusses ongoing research and hints at future research. II. Timed CRL The formalism CRL t [6] is a time extended variant of the process algebra CRL [7], which in turn is strongly rooted in ACP [3] Unlike in ACP, in CRL and CRL t data is an integral part of the formalism. Much research has already been conducted in the area of untimed process algebras and nowadays, there also is a lot of information available on timed process algebras. The ....

J.F. Groote and A. Ponse. The syntax and semantics of CRL. In A. Ponse, C. Verhoef, and S.F.M. van Vlijmen, editors, Algebra of Communicating Processes '94, Workshops in Computing Series, pages 26-62. Springer Verlag, 1995.

....influence the behaviour of the system. structelm expands the composite data types of a linearised crl specification. sumelm replaces in a linearised crl specification the sum variables that must be equal to a certain data term by that data term. Figure 1: Overview of the crl tool set crl [GP95] is a language to describe communicating processes. It is based on the process algebra acp [BW90, Fok00] extended with equationally specified data types [LEW96] Despite its simplicity it is quite adequate to specify and analyse (large) distributed systems and algorithms. crl has been extended ....

J.F. Groote and A. Ponse. The syntax and semantics of CRL. In A. Ponse, C. Verhoef, and S.F.M. van Vlijmen, editors, Algebra of Communicating Processes '94, Workshops in Computing Series, pages 26--62. Springer Verlag, 1995.

....to verify progress properties, which guarantee that a good thing will eventually happen. Special purpose theorem provers and model checkers have been developed which can check progress properties. Since these tools use their own languages, they cannot be applied to B speci cations directly. CRL [3, 9] provides a notation and a toolset for the speci cation and veri cation of distributed systems in an algebraic fashion. It targets the speci cation of system behaviour in a process algebraic style and of data elements in the form of abstract data types. The CRL toolset, together with the ....

J.F. Groote and A. Ponse. The syntax and semantics of CRL. In A. Ponse, C. Verhoef, and S.F.M. van Vlijmen, editors, Algebra of Communicating Processes 1994, pages 26-62. Workshop in Computing Series, Springer-Verlag, 1995.

....Algebra, Linearization of Recursive Specifications, Symbolic Representation of Transitions Systems, Program Transformation. 1. Introduction In this paper we address the issue of linearization of recursive specifications in the specification language CRL (micro Common Representation Language, [20, 16]) and extend the existing linearization techniques for a subset of the CRL called parallel pCRL [21] to the full CRL setting. The language CRL has been developed under the assumption that an extensive and mathematically precise study of the basic constructs of specification languages is ....

....right hand sides from the following subset of CRL terms p p p # c # p #H (p) # I (p) #R (p) 2. 1) The combination of the given data specification with a process definition (X( # t ) G) of process equations determines a CRL specification in the sense as defined in [20]. Such a specification depends on a finite subset act of ActLab and on comm, an enumeration of # restricted to the labels in act.So a finite system G implicitly describes a finitary based language. For a consistent (meaningful) specification, i.e. a Statically Semantically Correct specification, ....

J.F. Groote and A. Ponse. The syntax and semantics of CRL. In A. Ponse, C. Verhoef, and S.F.M. van Vlijmen, editors, Algebra of Communicating Processes 1994.

No context found.

J.F. Groote and A. Ponse. The syntax and semantics of CRL. In A. Ponse, C. Verhoef and S.F.M. van Vlijmen, editors, Algebra of Communicating Processes, Workshops in Computing, pages 26--62, 1994.

No context found.

J.F. Groote and A. Ponse. The syntax and semantics of CRL. In A. Ponse, C. Verhoef, and S.F.M. van Vlijmen, editors, Algebra of Communicating Processes, Utrecht 1994, Workshops in Computing, pages 26--62. Springer-Verlag, 1995.

No context found.

J.F. Groote and A. Ponse. The syntax and semantics of CRL. In A. Ponse, C. Verhoef, and S.F.M. van Vlijmen, editors, Algebra of Communicating Processes '94, Workshops in Computing Series, pages 26--62. Springer Verlag, 1995.

No context found.

J.F. Groote and A. Ponse. Syntax and semantics of CRL. In Proc. ACP'94, Workshops in Computing, pp. 26--62. Springer, 1995.

No context found.

J.F. Groote and A. Ponse. Syntax and semantics of CRL. In Proc. ACP'94, Workshops in Computing, pp. 26--62. Springer, 1995.

....algorithm, as several examples suggest, including systems with extremely large but finite state spaces, for which all other available techniques failed to provide answers. The framework we use for describing the behaviour of a system is process algebraic. We use the process algebraic language CRL [14, 16], which is an extension of ACP [3] this language includes a formal treatment of data, as well as an operational and axiomatic semantics of process terms. Compared to CCS or ACP, the language CRL is more expressive. This is due to the presence of data. For our model checking algorithm, we assume ....

....automatically. Moreover, CLU is restricted to the quantifier free fragment of first order logic, whereas the logic we use in our approach employs the full first order logic. 2 Preliminaries Our main focus in this paper is on processes with data. As a framework, we use the process algebra CRL [14]. Its basic constructs are along the lines of ACP [3] and CCS [23] though its syntax is influenced mainly by ACP. In the process algebra CRL, data is an integral part of the language, which makes the language more expressive than CCS or ACP (see discussion in [20] As we enforce no restrictions ....

[Article contains additional citation context not shown here]

J.F. Groote and A. Ponse. The syntax and semantics of CRL. In A. Ponse, C. Verhoef, and S.F.M. van Vlijmen, editors, Algebra of Communicating Processes '94, Workshops in Computing Series, pages 26--62. Springer Verlag, 1995.

.... and is being extended towards the use of differential equations) Typical syntactical languages that were developed with the intention of analysis from the beginning, are process algebras like ACP (Algebra of Communicating Processes) 3] 6] CRL (micro Common Representation Language) 7] [8] and CCS (Calculus of Communicating Systems) 12] Hybrid Theory Syntax Hybrid Theory Semantics Process Theory Syntax System Theory Syntax System Theory Semantics Process Theory Semantics Fig. 2. Developing Hybrid Theory In figure 2, a graphical representation is given of the general aim ....

.... tvuOqw xfK [ M .yBzqw x tv r xfK [ M . Bzqw [ Now, the whole system is connected by coupling the right variables to eachother in one parallel composition, synchronizing the discrete actions through the communication function as is usual in languages like CRL [8]. Off On Thermostat Heater SR BL Sm St BL SN The impact control problem, that is discussed in section IV, will serve as a future case for the hybrid syntax, and after the link between syntax and semantics has been established, we will attempt analysis of the impact control ....

J.F. Groote and A. Ponse. The syntax and semantics of CRL. In A. Ponse, C. Verhoef, and S.F.M. van Vlijmen, editors, ACP: Algebra of Communicating Processes, Workshops in Computing, pages 26--62, Utrecht, 1995. Springer-Verlag.

No context found.

J.F. Groote and A. Ponse. The syntax and semantics of CRL. In A. Ponse, C. Verhoef, and S.F.M. van Vlijmen, editors, Algebra of Communicating Processes, Workshops in Computing, pages 26--62. Springer-Verlag, 1995.

No context found.

J.F. Groote and A. Ponse. The syntax and semantics of CRL. In Algebra of Communicating Processes '94, Workshops in Computing Series, pages 26-62, 1995.

No context found.

J.F. Groote and A. Ponse. The Syntax and Semantics of -CRL. In Proceedings of Algebra of Communicating Processes, Utrecht 1994.

No context found.

J. F. Groote and A. Ponse. The Syntax and Semantics of CRL. In A. Ponse, C. Verhoef, and S. F. M. van Vlijmen, editors, Proceedings of the 1st Workshop on the Algebra of Communicating Processes (ACP'94), pages 26--62. Springer-Verlag, 1995.

No context found.

J.F. Groote and A. Ponse. The syntax and semantics of CRL. In A. Ponse, C. Verhoef, and S.F.M. van Vlijmen, editors, Algebra of Communicating Processes '94, Workshops in Computing Series, pages 26--62. Springer-Verlag, 1995.

No context found.

J.F. Groote and A. Ponse. The Syntax and Semantics of -CRL. In Proceedings of Algebra of Communicating Processes, Utrecht 1994, Workshops in Computing. Springer-Verlag, 1995.

No context found.

Groote, J., Ponse, A.: The syntax and semantics of CRL. In Ponse, A., Verhoef, C., van Vlijmen, S., eds.: Algebra of Communicating Processes 1994, Workshop in Computing Series, Springer-Verlag (1995) 26-62

No context found.

J.F. Groote and A. Ponse. The syntax and semantics of CRL. In Proc. 1st Workshop on the Algebra of Communicating Processes, Workshops in Computing Series, pp. 26--62. Springer, 1995.

First 50 documents  Next 50

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