THEORY EXAMINATION (SEM–VI) 2016-17 CONCURRENT SYSTEMS

CONCURRENT SYSTEMS – NCS065

B.Tech (SEM VI) | Section-wise Solved Answers

SECTION – A

(Explain the following – 2 marks each)

(a) Concurrency and its advantage

Concurrency refers to the execution of multiple tasks during overlapping time periods. Its main advantage is improved system performance and better utilization of resources, especially in multi-tasking environments.

(b) Difference between concurrent and distributed computing

Concurrent computing involves multiple tasks running simultaneously on a single system, whereas distributed computing involves tasks running on different machines connected through a network.

(c) Parallel Random Access Machine (PRAM)

PRAM is a theoretical model used to design and analyze parallel algorithms. It assumes multiple processors accessing a shared memory simultaneously.

(d) Role of processors in concurrent systems

Processors execute concurrent processes independently while coordinating through synchronization mechanisms to ensure correctness and efficiency.

(e) Role of hiding in process calculus

Hiding restricts visibility of certain actions in a process, allowing abstraction and preventing external interference in internal communications.

(f) Formal definition of transition systems

A transition system is defined as a tuple consisting of states, actions, transitions, and an initial state, representing system behavior over time.

(g) Example of π-calculus with syntax

In π-calculus, communication channels can be passed as messages.
Example: P = a(x).b⟨x⟩.P
This shows receiving a value and forwarding it.

(h) Advantages and disadvantages of concurrent systems

Advantages include better performance and responsiveness. Disadvantages include complexity, deadlocks, and difficulty in debugging.

(i) Duck typing

Duck typing is a concept where an object’s suitability is determined by its behavior rather than its type. If it behaves like a required object, it is accepted.

(j) Relation between concurrent and parallel systems

Yes, concurrent systems are related to parallel systems. Concurrency focuses on task structure, while parallelism focuses on execution speed using multiple processors.

SECTION – B

(Attempt any five – explained properly)

(a) Concurrency systems and their need

Concurrency systems allow multiple processes to execute simultaneously, improving responsiveness and throughput. They are essential in modern applications like web servers, operating systems, and real-time systems.

(b) Dining Philosophers Problem

This classic problem illustrates resource sharing and deadlock. Philosophers need two forks to eat, but improper resource allocation can cause deadlock or starvation.

(c) Reduction semantics in CCS

Reduction semantics defines how processes evolve by internal communication. It focuses on silent (τ) actions and simplifies reasoning about concurrent behavior.

(d) Process modeling

Process modeling represents system behavior using formal models such as state machines or process algebra.
Example: modeling a producer-consumer system using shared buffers.

(e) Labeled Transition Systems (LTS)

LTS represents system behavior using states and labeled transitions, helping analyze concurrent executions and communication actions.

(f) Essential features of process calculus

Key features include communication, concurrency, synchronization, mobility, abstraction, and compositionality.

(g) Concurrency Workbench

Concurrency Workbench is a verification tool used to analyze concurrent systems modeled using CCS or π-calculus. It checks properties like deadlock freedom.

(h) Pi calculus vs Asynchronous Pi calculus

Pi calculus supports synchronous communication, whereas asynchronous Pi calculus allows non-blocking message passing.

SECTION – C

(Attempt any two – long answers)

(3) Labeled and Unlabeled Transition Systems & CTMC Tools

Labeled transition systems include action labels on transitions, while unlabeled systems focus only on state changes.
CTMC (Continuous-Time Markov Chains) tools analyze performance and reliability of concurrent systems using probabilistic transitions.

(4) Agents and Mobility Workbench

Agents are autonomous entities that perform actions and interact with other agents.
Mobility Workbench is a tool used to simulate and analyze mobile agents based on π-calculus.

(5)

(a) Strong and Weak Type Systems

Strong type systems strictly enforce type rules, reducing errors. Weak type systems allow more flexibility but can cause runtime errors.

(b) Type Safety and Memory Safety

Type safety ensures operations are performed on correct data types. Memory safety prevents unauthorized memory access, reducing vulnerabilities.