S. Mauw and G.J. Veltink, editors. Algebraic Specification of Communication Protocols. Cambridge Tracts in Theoretical Computer Science 36, Cambridge University Press, 1993.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... The language CRL has been developed under the assumption that an extensive and mathematically precise study of the basic constructs of specification languages is fundamental to an analytical approach of much richer (and more complicated) specification languages such as SDL [38] LOTOS [26] PSF [28, 29] and CRL [35] Moreover, it is assumed that CRL and its proof theory provide a solid basis for the design and construction of tools for analysis and manipulation of distributed systems. The language CRL o#ers a uniform framework for the specification of data and processes. Data are specified by ....

S. Mauw and G.J. Veltink, editors. Algebraic Specification of Communication Protocols. Cambridge Tracts in TCS 36. Cambridge University Press, 1993.

....statically which leavesuswith open terms. But we want to find out to what extend we can do this and howwehave to adapt the specifications in order to get better results. We t alk about specifications in PSF [MauVel90] Die94] DiePon94] that are compiled into TIL code. The PSF Toolkit 1 [MauVel93] contains a compiler that translates PSF code into TIL code. But every process algebra specification language that can be compiled into TIL code can be used. 2. Generating Animations The animations we use consist of a description of a picture, an action function that defines for each atom or ....

S. Mauw and G.J. Veltink (eds.), Algebraic Specification of Communication Protocols, Cambridge Tracts in Theoretical Computer Science 36, Cambridge University Press, 1993.

....remarks 21 sort Status func satisfiable: ResultSC unsatisfiable: ResultSC restart: Command terminate: Command timeout: Command notokmsg: Nat Status 6. Concluding remarks The specifications provided in this document were found correct by the CRL syntax checker from the PSF toolset [MV93, Vel95]. Data types were analysed with the rewriter and the initial algebra calculator tool. Moreover, some analysis of the behaviour of the various processes was done with the PSF simulator. Our first concern was to give brief and functional specifications of components and tools for proposition ....

S. Mauw and G.J. Veltink, editors. Algebraic Specification of Communication Protocols. Cambridge Tracts in Theoretical Computer Science 36, Cambridge University Press, 1993.

....correctness of the protocol with the highest possible level of confidence. The second objective of this work is to bring to light all technical issues that are involved in obtaining this result. A starting point for the work described here was an algebraic specification of the protocol in 3 PSF [22], a language based on process algebra. This specification was developed and validated using PSF simulation tools. The PSF description was translated into I O automata theory and a suitable correctness criterion was defined. The protocol was verified by proving that it satisfies the correctness ....

S. Mauw and G.J. Veltink, editors. Algebraic Specification of Communication Protocols. Cambridge Tracts in Theoretical Computer Science 36. Cambridge University Press, 1993.

....4. we will give a specification in PSF of the interaction between simulator,animation, and the ToolBus. 2 1.1 PSF PSF (Process Specification Formalism) is a formal description technique developed for the specification of concurrent systems. A description of PSF can be found in [MauVel90] [MauVel93], Die94] and [DiePon94] PSF has been designed as the base for a set of tools to support ACP (Algebra of Communicating Processes) BerKlo86] It is very close to the informal syntax normally used in denoting ACP expressions. The part of PSF that deals with the description of data is based on ASF ....

S. Mauw and G.J. Veltink (eds.), Algebraic Specification of Communication Protocols, Cambridge Tracts in Theoretical Computer Science 36, Cambridge

....of data. 3. The need of the exclusion of premature timeouts. In this section we will analyse the relation between these properties and the TRS as defined above. In appendix B we will investigate to what extend the properties can be derived with the tools from the PSF Toolkit (shortly described in [MV93]) Before we look at the protocol properties we will derive all possible rewrite sequences starting with the term par(s1; r1; t1; k1; l1; 0; 1; 0; 0) This term represents the initial state of the protocol. The numbers above the arrows refer to the numbers of the rewrite rules from the TRS. The ....

S. Mauw and G.J. Veltink, editors. Algebraic specification of communication protocols. Cambridge Tracts in Theoretical Computer Science 36. Cambridge University Press, 1993.

....to mark messages and acknowledgements to the value of the tokens. Thus, the explicit distinction made in the current net is not necessary anymore. In case of infinite data domains, the results of this paper must be adapted to an algebraic formalism which supports data, such as for example PSF [21]. 7 Concluding Remarks and Future Work The first part of this paper gives an algebraic semantics for P T nets which is consistent with their usual interleaving semantics. The second part gives an algebraic semantics for the complete operational behavior of hierarchical P T nets, as well as a ....

S. Mauw and G.J. Veltink, editors. Algebraic Specification of Communication Protocols, Cambridge Tracts in Theoretical Computer Science 36. Cambridge University Press, 1993.

....techniques, formal specification methods have been developed to obtain a deeper understanding of the behaviour of systems, given their implementation. One of these formal specification methods is PSF, a Process Specification Formalism, developed at the University of Amsterdam ( MV90] see also [MV93]) Having process algebra as a building block, PSF makes it possible to give an exact description of how processes behave. Consequently, one of the supporting tools makes it possible to simulate the process that has been specified. In this way one has a method to test potential implementations ....

....Specification Formalism, has been developed at the University of Amsterdam. It is a combination of an algebraic specification formalism for data, and process algebra. Therefore, PSF has an explicit data part and a process part using the data. Some general references to PSF are [MV89] MV90] [MV93] and [Vel93] 3.1 Data in PSF This section contains a brief introduction to the specification of data by algebraic specifications, as is prescribed in PSF. More detailed background information can be found in [BHK89b] and [BHK89c] 3.1 Data in PSF 7 Data are time independent objects with ....

[Article contains additional citation context not shown here]

S. Mauw and G.J. Veltink, editors. Algebraic Specification of Communication Protocols. Cambridge Tracts in Theoretical Computer Science 36. Cambridge University Press, 1993.

....: 22 C A formal specification of the implementation of PSF process definitions 23 2 The Process Specification Formalism (PSF) The Process Specification Formalism (PSF) is an algebraic formalism used for the specification of concurrent systems. The formal definition of PSF can be found in [MV93]. A set of tools (such as compiler, simulator) are available to analyse a specification. PSF is based on a formalism for algebraic specification of data: Algebraic Specification Formalism (ASF) BHK89] and a process algebra: Algebra for Communicating Processes (ACP) BW90] PSF supports the ....

....actions. This means that, in general, the receive atoms are the passive part. In these cases we use function ECexist data to check if data is available at the port. But in some cases send atoms are the prefix of the alternatives. For example, in the Concurrent Alternating Bit Protocol (CABP) [MV93], the process Sender can alternatively send data or receive an acknowledgement. In this case send will be implemented as the passive part of the communication because it occurs in an alternative composition. In the implementation we will use the function ECexist request to check if there is a ....

[Article contains additional citation context not shown here]

S. Mauw and G.J. Veltink, editors. Algebraic Specification of Communication Protocols. Cambridge Tracts in Theoretical Computer Science 36. Cambridge University Press, 1993.

....hardware programable processors, and allows users to customize it. This system has a maximal flexibility, but users are forced to program an unabstracted state machine. Study of languages to describe protocols provides so called protocol formal description languages, such as LOTOS [5] and PSF [22]. The main purpose of these formal languages is to verify protocols, which include structures of distributed systems, all possible states, and all kinds of messages. These protocol formal description languages require full descriptions to verify their completeness, and hence they are unsuitable ....

S. Mauw and G. J. Vetlink, editors. Algebraic Specification of Communication Protocols. Cambridge university press, 1993.

....variant of ACP is made. For timed versions of ACP the reader is referred to e.g. BB91, BB92] The version of the protocol verified in this paper originates from [KM90] An executable version in the specification language PSF (PSF contains a computer readable version of ACP , see e.g. [MV90, MV93]) can be found in [Wam93] In [KM90] the correctness is proved in weak bisimulation semantics. There the protocol is split in two modules and certain properties of the process graphs of the modules are studied. We adopt the idea of modularity as presented in that paper and algebraically verify the ....

S. Mauw and G.J. Veltink, editors. Algebraic Specification of Communication Protocols. Cambridge Tracts in Theoretical Computer Science 36, Cambridge University Press, 1993.

....s 0 , then there is a t with F j= s 2 Phi: P Gamma Gamma Gamma Gamma Gamma t and F j= t 2 Phi: Q Gamma Gamma Gamma Gamma Gamma s 0 . Now use jF; tj jF; sj. This observation illustrates a phenomenon that is not present in the specification languages LOTOS (ISO 1987) PSF (Mauw and Veltink 1990, 1993) and CRL (Groote and Ponse 1991, 1995) where only the Booleans t and f occur in conditional programming constructs. Note that (1) is valid for those values of Phi. In Bergstra et al. 1994, it is argued that backtracking can be modelled in process algebra using propositions as conditions ....

Mauw, S., and G.J. Veltink (ed.). 1993. Algebraic Specification of Communication Protocols.

....into a specification without early reads. This makes it possible to use the simulator from the PSF Toolkit [Vel93] which means that we are able to simulate our specification. The PSF Toolkit, to which the simulator belongs, is a set of tools designed for the specification language PSF [MV90, MV93] Since CRL can be considered a small subset of PSF, an adapter was written so that the PSF Toolkit could be used for CRL specifications as well. By removing the early reads from our specification, we make the specification suited for this adapter. The early reads can be removed, because they ....

S. Mauw and G.J. Veltink, editors. Algebraic Specification of Communication Protocols. Cambridge Tracts in Theoretical Computer Science 36. Cambridge University Press, 1993.

....procedures were implemented in Pascal. ffl Third, using the optimization procedures, a small and rudimentary prototype was developed. 1 CWI is the National Research Institute for Mathematics and Computer Science. ffl Finally, a specification, in PSF (Mauw Veltink 1989, Mauw Veltink 1990, Mauw Veltink 1993, Veltink 1993, Veltink 1995) was written that describes the major datatypes of a decision support system and its main functions. The PSF specification is sufficiently detailed to be used as a means to elicit further functional demands by running it as a prototype. Nevertheless, the specification ....

Mauw, S. & Veltink, G., eds (1993), Algebraic specification of communication protocols, Vol. 36 of Cambridge Tracts in Theoretical Computer Science, Cambridge University Press.

....Specification Formalism, has been developed at the University of Amsterdam. It is a combination of an algebraic specification formalism for data, and process algebra. Therefore, PSF has an explicit data part and a process part using the data. Some general references to PSF are [MV89] MV90] [MV93] and [Vel93] 2.2.1 Data in PSF This section contains a brief introduction to the specification of data by algebraic specifications, as is prescribed in PSF. More detailed background information can be found in [BHK89a] and [BHK89b] Data are time independent objects with mathematical ....

....the analysis of the data in specifications. Examples of PSF specifications can be found in e.g. Bru93] an other source is the report series of the Programming Research Group of the University of Amsterdam. For more detailed information on the syntax of PSF the reader is referred to [MV90] and [MV93]. Finally, it must be remarked that no real time features are captured. Consequently, important features like efficiency (maximal productivity of machines) and tuning (synchronisation of the speed of the machines) cannot be modelled. Currently, the essential realtime features have been added to ....

S. Mauw and G.J. Veltink. Algebraic Specification of Communication Protocols. Cambridge Tracts in Theoretical Computer Science 36. Cambridge University Press, 1993.

....correctness of the protocol with the highest possible level of confidence. The second objective of this work is to bring to light all technical issues that are involved in obtaining this result. A starting point for the work described here was an algebraic specification of the protocol in PSF [22], a language based on process algebra. This specification was developed and validated using PSF simulation tools. The PSF description was translated into I O automata theory and a suitable correctness criterion was defined. The protocol was verified by proving that it satisfies the correctness ....

S. Mauw and G. Veltink, editors. Algebraic Specification of Communication Protocols. Cambridge Tracts in Theoretical Computer Science 36. Cambridge University Press, 1993.

....If so, this would enable the application of the well known algorithms for regular systems to those BPA specifications which are in fact regular. This would help in deciding exactly when to use existing efficient implementations for deciding bisimulation equivalence (for example for the PSF Toolkit [7]) In this paper we prove that it is decidable whether a BPA system is regular, that is, all process variables defined by it are regular. Some results for similar specification languages are known. Weakening BPA by replacing the general multiplication by action prefix multiplication will only ....

S. Mauw & G.J. Veltink, Algebraic specification of communication protocols, Cambridge Tracts in Theoretical Computer Science 36, Cambridge University Press, 1993.

....email: fsjouke,hansmg win.tue.nl Abstract. We present a library of basic data types for the process specification formalism PSF. The specification is written in the algebraic specification formalism ASF, which is a sublanguage of PSF. 1 Introduction PSF (Procees Specification Formalism, [MV93]) is a language for the formal specification of distributed systems. The dynamic part is based on the Algebra of Communicating Processes (ACP [BW90, BK84] and the static part on the Algebraic Specification Formalism (ASF [BHK89] In this paper we will only discuss the static part. The elegance ....

....is to provide a sufficiently flexible error handling mechanism. Even if one comes close to a complete library, the so called Not Invented Here syndrome causes people to write their own basic data type specifications anyway. For PSF two attempts for a general library of basic data types are in [MV93] and [vW93] The first only contains the modules that are shared by the specifications in [MV93] The second is a more serious attempt to make a general library. Both are Proceedings of ASF SDF95. A workshop on Generating Tools from Algebraic Specifications. May 11 12, 1995, CWI, Amsterdam, ....

[Article contains additional citation context not shown here]

S. Mauw and G.J. Veltink, editors. Algebraic specification of communication protocols. Cambridge Tracts in Theoretical Computer Science 36. Cambridge University Press, 1993.

....protocols (like the leader election protocols in this paper) are too large for manual algebraic verification. These protocols can be validated by simulation runs of their behaviour. To this extent a protocol is translated to the executable formalism PSF[MV90] which is strongly related to ACP. See [MV93] for examples of protocol specification using PSF. 3 Design and Complexity Analysis of LE Protocols 3.1 Introduction 3.1.1 Communication Processes communicate with each other by exchanging messages via a broadcast network like Ethernet [MB76] A broadcast message sent by some process p is ....

S. Mauw and G.J. Veltink, editors. Algebraic specification of communication protocols. Cambridge Tracts in Theoretical Computer Science 36. Cambridge University Press, 1993.

No context found.

S. Mauw and G.J. Veltink, editors. Algebraic Specification of Communication Protocols. Cambridge Tracts in Theoretical Computer Science 36, Cambridge University Press, 1993.

No context found.

S. Mauw and G.J. Veltink (eds). Algebraic Specifications of Communication Protocols. Cambridge Tracts in Theoretical Computer Science, Vol. 36. Cambridge Univ. Press, Cambridge, 1993.

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