--%>
Assignment Help - homework help

Modeling Language for SPIN-Promela

Modeling Language: The modeling language used for SPIN is called Promela (Process Meta Language). In fact, the name SPIN stands for Simple Promela Interpreter. Promela is a powerful C-like specification language with a variety of synchronization primitives that enables construction of models of distributed systems. Promela is a guarded command language for specifying possibly non-deterministic system behaviors in a distributed system design. It allows for the dynamic creation of concurrent processes which communicate synchronously or asynchronously via message channels.

For example, the following Promela specification describes two processes P and Q that synchronize over a critical region.

2110_promela1.jpg

A Promela model consists of declarations of types, channels, variables, and processes, as well as facilities for initializing the processes. For example,

2359_promela2.jpg

A model consists of a set of concurrent processes, each in turn consisting of a set of atomic guarded actions or transitions. An action whose guard is true is called enabled and can be executed; otherwise, it is disabled and cannot be executed. Actions are not really executed concurrently; rather, they are non-deterministically interleaved, and this is used to model concurrency. Also processes do not have to terminate, which is useful when modeling reactive systems.

   Related Questions in Programming Languages

  • Q : Define Mixed Mode Mixed Mode : Permits

    Mixed Mode: Permits domain controllers executing both Windows 2000 and prior versions of Windows NT to co-exist in the domain. In mixed mode, the domain features from prior versions of Windows NT Server are still allowed, whereas some Windows 2000 fea

    		•
  • Q : Uses of the Utilities.Trim function

    Some tools on the web page I am testing have leading or trailing whitespaces. I am utilizes the Utilities.Trim function to eliminate them, but sometimes this does not work. What is incorrect?

    		•
  • Q : Define Fully evaluating operator Fully

    Fully evaluating operator: An operator which computes all of its arguments to generate an outcome. Standard arithmetic operators, like +, are totally evaluating. In contrary, some Boolean operators, like &&, are short-circuit operators.

    		•
  • Q : What is Catch clause Catch clause : It

    Catch clause: It is a part of a try statement accountable for handling the caught exception.

    		•
  • Q : Chown Explain the chown, chmod and

    Explain the chown, chmod and chgrp?

    		•
  • Q : Use Finite-State Space Abstractions Use

    Use Finite-State Space Abstractions: In order to successfully apply explicit-state model checking, defects must be detectable in a sufficiently small state space. This can be achieved either by means of heuristics that constrain the way the state spac

    		•
  • Q : Define the term XQuery Define the term

    Define the term XQuery?

    		•
  • Q : Define Sign bit Sign bit : In

    Sign bit: In 2s-complement notation, the most important bit in an integer value is employed to determine the sign of the value. A 1-bit point out a negative number and a 0 bit point out a positive number.

    		•
  • Q : What is Leverage Model-Based Design

    Leverage Model-Based Design: Model-based design provides useful hints of how a large system can be reduced so that its state space becomes searchable. If not inherently visible in the design (for example, by means of using a “State” design

    		•
  • Q : CSS and CSS3 State some of the

    State some of the difference between the CSS and the CSS3.

    		•