| R. J. Linn. The features and facilities of Estelle. In M. Diaz, editors, Protocol Specification Testing and Verification V, p 297-315 , North-Holland, 1985. |
....user defined data types. A variable declaration begins with a keyword indicating the data type of the variable followed by a list of identifier names. Below follows an example of declarations of PROMELA variables: short module; bit ip; byte type; bool flag; Array declaration int name[10]; Channel declaration chan connect = 10] of int,bool, A constant is a sequence of digits representing a decimal integer. There are three types of constants, namely: 1. String Constants 2. Enumeration Constants 3. Integer Constants String constants can only be used in printf ....
....begins with a keyword indicating the data type of the variable followed by a list of identifier names. Below follows an example of declarations of PROMELA variables: short module; bit ip; byte type; bool flag; Array declaration int name[10] Channel declaration chan connect = [10] of int,bool, A constant is a sequence of digits representing a decimal integer. There are three types of constants, namely: 1. String Constants 2. Enumeration Constants 3. Integer Constants String constants can only be used in printf statements. Enumeration constants can be used to define ....
R. J. Linn. The features and facilities of Estelle. In M. Diaz, editors, Protocol Specification Testing and Verification V, p 297-315 , North-Holland, 1985.
....purpose description language, which is possibly coupled with automatic tools for property verification. LOTOS (ISO, 1988) is, for example, a formal language for specification of behaviour sequences and can be used for description of general distributed systems, among which protocols. The ESTELLE (Linn, 1986) protocol modeling language can be used to yield state oriented models. Petri nets (Peterson, 1981) are another widely used tool for the design, property verification, and performance evaluation of communication protocols because of their ability to model concurrency, nondeterminism, and ....
R. J. Linn, Jr., "The features and facilities of ESTELLE", in Protocol Specification, Testing, and Verification, V. M. Diaz, ed. New York: Elsevier, 1986, pp. 271-296.
....automatically into an implementation are not capable of identifying and generating separate and concurrently operating processes for these specific functions, unless this information is already contained in the specification. This is because protocol specification languages like Estelle [Linn86] and LOTOS [Bolognesi87] are based on formalisms that have little relationship to the traditional computer architecture (i.e. the von Neumann machine) This makes it difficult to compile formal specifications directly into object code [Chanson93] Map Processes to Processors To achieve optimal ....
Linn, R.J., "The Features and Facilities of ESTELLE", Protocol Specification, Testing and Verification, V.M. Diaz (editor), IFIP, 1986.
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