--%>
Assignment Help - homework help

State-space Reduction in Promela model

State-space Reduction: Two language statements are used to reduce the number of states in a Promela model: atomic and d-step.

1553_state space.jpg

Atomic is used to group statements of a particular process into one atomic sequence. The statements are executed in a single step and are not interleaved with statements of other processes. The atomicity is broken if any of the statements is blocking. That is, statements of other processes can be interleaved in between.

d-step can also be used to execute a number of statements in one step. The difference is that no intermediate states are generated or stored. If one of the statements blocks, this is considered a runtime error.

   Related Questions in Programming Languages

  • Q : Differentiate overriding and

    Differentiate overriding and overloading method?

    		•
  • Q : Define User Datagram Protocol User

    User Datagram Protocol: The User Datagram Protocol (abbreviated as UDP) is a set of rules which permit communication among two processes across a network. The protocol is unreliable, that means that information is not guaranteed to be

    		•
  • Q : Define Race hazard Race hazard : It is

    Race hazard: It is a situation which occurs between multiple threads sharing a resource. The race hazard occurs whenever one thread's suppositions regarding the state of a resource are invalidated by the actions of the other thread.

    		•
  • Q : Storing the CSS Definitions in external

    Describe the code in order to store CSS Definitions within the external Files.

    		•
  • Q : What is Bounded repetition Bounded

    Bounded repetition: The Repetition where statements within a loop's body are executed a fixed number of times and the number of times is established whenever the loop began. There is no control structure in Java which guarantees the bounded repetition

    		•
  • Q : Define BOOP Toolkit BOOP Toolkit : The

    BOOP Toolkit: The BOOP Toolkit has been developed at the Institute for Software Technology at Graz University of Technology. It is based on the SLAM project and uses the same main concept of verification by abstraction and refinement to determin

    		•
  • Q : What is an Instance variable Instance

    Instance variable: It is a non-static field of a class. Each and every individual object of a class has its own copy of this field. This is in contrary to a class variable that is shared by all instances of class. Instance variables are employed to mo

    		•
  • Q : Reading Algorithms Assignment 1:

    Assignment 1: Algorithms Rules: See the Assignment Rules file on the class Moodle site. 1 Reading Algorithms (20 points) Input: A nonempty string of characters S1S2 . . . Sn, and a positive integer n giving the number of characters in the string. Output: See t

    		•
  • Q : Define Hexadecimal Hexadecimal : Number

    Hexadecimal: Number representation in hexadecimal is base 16. In base 16, the digits 0-9 and the letters A to F are utilized. A symbolizes 10 (base 10), B symbolizes 11 (base 10), and so forth. Digit positions symbolize successive pow

    		•
  • Q : State the term XLL State the term XLL?

    State the term XLL? Answer: The specification of XML Link Language has XPointer or XLink.

    		•