Class DeadlockResolver1

java.lang.Object
  |
  +--DeadlockResolver
        |
        +--DeadlockResolver1

public class DeadlockResolver1

extends DeadlockResolver

This class models the reachability graph of a program. The reachability graph is a directed graph that contains all the states of the fault-span of a program. This class is the root of the abstract class hierarchy in the Bridge design pattern.

Since:

Constructor Summary

DeadlockResolver1(GraphImplementation gr, Program pn, Program po, SafetySpecification sp, Invariant in)
Creates new DeadlockResolver1

Method Summary

void	Resolve()
boolean	scanAndSolve(Program pnew, Program pold, SafetySpecification spec, Invariant inv)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

DeadlockResolver1

public DeadlockResolver1(GraphImplementation gr,
                         Program pn,
                         Program po,
                         SafetySpecification sp,
                         Invariant in)

Creates new DeadlockResolver1

Method Detail

Resolve

public void Resolve()

Overrides:

Resolve in class DeadlockResolver

scanAndSolve

public boolean scanAndSolve(Program pnew,
                            Program pold,
                            SafetySpecification spec,
                            Invariant inv)

Overrides:

scanAndSolve in class DeadlockResolver