HELP HELP HELP

[Guest MECX]

hey guys one of my mates has this computer science courseworks to do and is really stuck---i offered to help knowing almost nothing about the subject oops

here is the question:-:----

Concurrency

Produce a FSP (Finite State Process) specification for the following

problem:

A small airport has a single runway. Only one plane may use the runway

at any instance

Planes arrive at the airport and request permission to land. Provided

the runway is not occupied permission will be granted and the plane may

land. When it has landed it leaves the runway. Subsequently it may

request permission to take-off. Permission will be granted provided

that the runway is free and there are no planes to land. Planes waiting

to land will always be given priority over those waiting to take-off.

Assume that each plane continually goes through the land/take-off cycle.

Initially there should be no planes at the airport. Limit the number of

planes in the system to 3.

and here is his answer:-:----

RUNWAY = (request permission -> use runway -> RUNWAY)

LANDING_PLANE = (request permission to land -> land -> leave runway ->

LANDING_PLANE)

DEPARTING_PLANE = (request permission to take-off -> take-off -> leave

runway -> DEPARTING_PLANE)

|| PLANE = (a: LANDING_PLANE || b. DEPARTING_PLANE)

|| RUNWAY_SHARE = (a:PLANE || b.PLANE || c.PLANE || {a,b,c}::RUNWAY

any help on this would be great ---cheerz in advance---any opinions welcome :)

Posted from my SmartPhone while connected to my PC!

[Guest MECX]

come on guys he has just got a E100 as well. if we get some help we will both join modaco plus :) (worth a try hey ;)) Posted from my SmartPhone!

[Guest ashley.flynn]

hey guys, just starting my final year, can you give me a quick run down on FSP? never come across it before is it simply a logic planning method??

Once i know what your looking for i may be able to help